{"$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":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"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":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"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":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Methods::check_methods (cyclomatic 191): Methods::check_methods has cyclomatic complexity 191 (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":"clippy_lints/src/methods/mod.rs"},"region":{"startLine":5437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5af0d725740797b2acdccc1b7671c8be304bcaa765b98940d8ed307f8940ef0"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::doc::check_doc (cyclomatic 72): clippy_lints::doc::check_doc 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":"clippy_lints/src/doc/mod.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2264b01e1e67db4affcf4cca4eb8787968170b7889a7eccfa717411d5422414"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstEvalCtxt::binop (cyclomatic 70): ConstEvalCtxt::binop has cyclomatic complexity 70 (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":"clippy_utils/src/consts.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e57caab74a0f54768c5e061f28825bc5220e4ef1e0de9dc70a491775481669"}},{"ruleId":"D1","level":"warning","message":{"text":"HirEqInterExpr::eq_expr (cyclomatic 69): HirEqInterExpr::eq_expr has cyclomatic complexity 69 (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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efb47c006f835a77e3b6b7b9dc03cb38200c2c005181f2e9042b0b98d685d68"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::ast_utils::eq_expr (cyclomatic 63): clippy_utils::ast_utils::eq_expr has cyclomatic complexity 63 (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":"clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"657fc5b9a92ec1790e3f066a1ef9773fe700c256e242b4220ae1c2053ba42a22"}},{"ruleId":"D1","level":"warning","message":{"text":"Dereferencing::check_expr (cyclomatic 60): Dereferencing::check_expr has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/dereference.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f8ed4d880134b1baa441b393b61eb788eea87224c0852f32417c91c88a518c"}},{"ruleId":"D1","level":"warning","message":{"text":"SpanlessHash::hash_expr (cyclomatic 59): SpanlessHash::hash_expr 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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5a5ba5c36567911a06df48b96581147850219d2a8d5ba04150861e41eeeb11"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::operators::op_ref::check (cyclomatic 47): clippy_lints::operators::op_ref::check has cyclomatic complexity 47 (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":"clippy_lints/src/operators/op_ref.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9368a85c6f0adb772e02cb262b3a5598f62a9ed4c29c6a1077b933e41868b9c6"}},{"ruleId":"D1","level":"warning","message":{"text":"PrintVisitor::expr (cyclomatic 46): PrintVisitor::expr 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":"clippy_lints/src/utils/author.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"c082a27dd5c77fef660a45552de0147e9b55600b761869e6cef0c37802994fda"}},{"ruleId":"D1","level":"warning","message":{"text":"UselessConversion::check_expr (cyclomatic 44): UselessConversion::check_expr 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":"clippy_lints/src/useless_conversion.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"497059fe48725413e93f3f166da8d45c27185f3d621daa9dbfd771bdf06ee080"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::is_never_expr (cyclomatic 42): clippy_utils::is_never_expr 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":"clippy_utils/src/lib.rs"},"region":{"startLine":3021}}}],"partialFingerprints":{"codehealthFindingId/v1":"26141120c044d40f1e12e8f0db7790e6a0135f0649e2349454a7613296342e48"}},{"ruleId":"D1","level":"warning","message":{"text":"Dereferencing::report (cyclomatic 40): Dereferencing::report 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":"clippy_lints/src/dereference.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a077a84e546542606efd8d1090a2936f40d05ef3eebd444b9b5c6587fec0e4"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::manual_inspect::check (cyclomatic 40): clippy_lints::methods::manual_inspect::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":"clippy_lints/src/methods/manual_inspect.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a196ae63c0aebb51fa01badd820933bb107dc5bf940292db647089bcf6f9834"}},{"ruleId":"D1","level":"warning","message":{"text":"NormalizedPat::from_pat (cyclomatic 37): NormalizedPat::from_pat has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc835ea98e35515bd0faab96707bfb8937a48e10fc1c543670f511ee4ee27de"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::casts::unnecessary_cast::check (cyclomatic 36): clippy_lints::casts::unnecessary_cast::check has cyclomatic complexity 36 (threshold 15). Of this number, 35 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":"clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad03ac1144816bdd678982ed8fb371b8a4f1c715b5340836d853fe572bf911e8"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::eta_reduction::check_closure (cyclomatic 35): clippy_lints::eta_reduction::check_closure 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":"clippy_lints/src/eta_reduction.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"72af89db49b72cdf55d92f7859dfc5981d4a4e15e6c20eab9e82c7d0a0372308"}},{"ruleId":"D1","level":"warning","message":{"text":"Matches::check_expr (cyclomatic 33): Matches::check_expr 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":"clippy_lints/src/matches/mod.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"4293af7e4d8f918f9cd9e6055814c3e0889e030ab5495e884c4013e56dbbd0fb"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::loops::never_loop::never_loop_expr (cyclomatic 33): clippy_lints::loops::never_loop::never_loop_expr 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":"clippy_lints/src/loops/never_loop.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eec1e5fdc948e7a0bb69b8fb28fe16cd01940948cc35ceffbb280ad7f67a01d"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::ast_utils::eq_item_kind (cyclomatic 32): clippy_utils::ast_utils::eq_item_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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08ec5deea49ae5b68647276de4374aee1223b57b314094461afe378532e67a5"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::loops::explicit_iter_loop::is_ref_iterable (cyclomatic 31): clippy_lints::loops::explicit_iter_loop::is_ref_iterable 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":"clippy_lints/src/loops/explicit_iter_loop.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5900f699b61c2e8ddfc1e57913ff23ede6558af0e190e4b179088de7f22951"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::matches::manual_utils::check_with (cyclomatic 30): clippy_lints::matches::manual_utils::check_with 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":"clippy_lints/src/matches/manual_utils.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"378b84b4d455776da2690b29b10bfd81d45987baa63029943ffbd45db0c2bb6e"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::transmute::transmute_undefined_repr::check (cyclomatic 29): clippy_lints::transmute::transmute_undefined_repr::check 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":"clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf559c32c691f24c562b3eb321791e29e6acbbd66f4d5f4d517413f3c217dffb"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::write::literal::check (cyclomatic 29): clippy_lints::write::literal::check 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":"clippy_lints/src/write/literal.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6aed40ca405b6221c5fb33eb42c8f05b336f87bbc1a86fbc45496760807e6a"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstEvalCtxt::expr (cyclomatic 29): ConstEvalCtxt::expr 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":"clippy_utils/src/consts.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"249cdbb567ae3655125b5565476573344b07572ae8c82476824e90f09a6663fd"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::loops::needless_range_loop::check (cyclomatic 28): clippy_lints::loops::needless_range_loop::check 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":"clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7918019eb6bf25045b03372793d4a2b5372d7c8443134e88cbb5f3d6ee7463c"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::matches::match_wild_enum::check (cyclomatic 28): clippy_lints::matches::match_wild_enum::check has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/match_wild_enum.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baea05d0caf63723f1275a6a20ae546bf154ead687a901dc5421016a40b7ea2"}},{"ruleId":"D1","level":"warning","message":{"text":"IndexingSlicing::check_expr (cyclomatic 27): IndexingSlicing::check_expr 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":"clippy_lints/src/indexing_slicing.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6071798c4e8a082a8b97f3b5c23b2ea779871ddea52234a9b28dacd95c2be805"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_literal_unwrap::check (cyclomatic 27): clippy_lints::methods::unnecessary_literal_unwrap::check 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":"clippy_lints/src/methods/unnecessary_literal_unwrap.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8178ab8fa12fb418aeff8077a412bdc7bff84e93e8ec266a189a4364b763d2a2"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_dev::main (cyclomatic 26): clippy_dev::main 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":"clippy_dev/src/main.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"411e73ae7d39b0f81874e1aac897dd8c8eb77121f96f14ffcb129622e885c589"}},{"ruleId":"D1","level":"warning","message":{"text":"TupleArrayConversions::check_expr (cyclomatic 26): TupleArrayConversions::check_expr 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":"clippy_lints/src/tuple_array_conversions.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0c7dc4425be1ec9267b37327133fa6dd6a1f1976f7255bc7f6eb457cc3941c"}},{"ruleId":"D1","level":"warning","message":{"text":"Types::check_ty (cyclomatic 26): Types::check_ty 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":"clippy_lints/src/types/mod.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdf86d956ea18419de739eba9d59dec81c7dce87817c190aea0b46da8cdfa9c"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::casts::unnecessary_cast::walk_receiver_path_step (cyclomatic 26): clippy_lints::casts::unnecessary_cast::walk_receiver_path_step 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":"clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"e078309ff78174a4629bf8af36ef4611981a076a845a972e52497793d1bd93ba"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::operators::invalid_upcast_comparisons::upcast_comparison_bounds_err (cyclomatic 26): clippy_lints::operators::invalid_upcast_comparisons::upcast_comparison_bounds_err 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":"clippy_lints/src/operators/invalid_upcast_comparisons.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"40afc2435303c634367123b7c545489d43d26a4debab3865569c314a8e973545"}},{"ruleId":"D1","level":"warning","message":{"text":"IterFunctionVisitor::visit_expr (cyclomatic 25): IterFunctionVisitor::visit_expr 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":"clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41e88c8d82accad18f8ec2cfd305df002ea408fdfaa0f85ffd90066e9deff00"}},{"ruleId":"D1","level":"warning","message":{"text":"PrintVisitor::lit (cyclomatic 25): PrintVisitor::lit 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":"clippy_lints/src/utils/author.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2a77925ada57e0b650750a01140f9ffc4684ff0988e3ba0c5c9827b3eec4f4"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_sort_by::mirrored_exprs (cyclomatic 25): clippy_lints::methods::unnecessary_sort_by::mirrored_exprs 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":"clippy_lints/src/methods/unnecessary_sort_by.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a926da4c58261e41e5cefdf4c6b5e3f3cb52b953ebef0c8baeff9872e844878"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::unwrap_expect_used::check (cyclomatic 25): clippy_lints::methods::unwrap_expect_used::check 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":"clippy_lints/src/methods/unwrap_expect_used.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d103afaf07235c3dabf8597c15aa4383b1eb2a2e219ac2bb463c34d31545b366"}},{"ruleId":"D1","level":"warning","message":{"text":"NonCopyConst::is_non_freeze_init_borrowed (cyclomatic 24): NonCopyConst::is_non_freeze_init_borrowed 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":"clippy_lints/src/non_copy_const.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"0598b36a1e41253fef8cd9d6e2873d55d81312046bd365e1ca1f329994828f68"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::lifetimes::could_use_elision (cyclomatic 24): clippy_lints::lifetimes::could_use_elision 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":"clippy_lints/src/lifetimes.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ccdc88f12f31dd7b28f1a7be15681d42fced5571753c1bfc5c50a96610b242"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::option_if_let_else::try_get_option_occurrence (cyclomatic 24): clippy_lints::option_if_let_else::try_get_option_occurrence 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":"clippy_lints/src/option_if_let_else.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"63810f2f682181d969905f674fa824ef415e7602289e7a16f4af5f89a022e1fd"}},{"ruleId":"D1","level":"warning","message":{"text":"SpanlessHash::hash_pat (cyclomatic 24): SpanlessHash::hash_pat has cyclomatic complexity 24 (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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f038e862862fdc03563f82d13e49449adc1ec670168422ac06ab2c48814fcac"}},{"ruleId":"D1","level":"warning","message":{"text":"DerefDelegate::borrow (cyclomatic 24): DerefDelegate::borrow 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":"clippy_utils/src/sugg.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17723b0489eb06804066c7602872ae95a9c5c2b4f61cc5b10819bada48f5221"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::is_default_equivalent_call (cyclomatic 24): clippy_utils::is_default_equivalent_call 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":"clippy_utils/src/lib.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f25f3e47be4cf217b7fd7f9ef5f3f41a1ae8e0c6f9ee63feb0d28e9471b23b0"}},{"ruleId":"D1","level":"warning","message":{"text":"ArbitrarySourceItemOrdering::check_item (cyclomatic 23): ArbitrarySourceItemOrdering::check_item 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":"clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97040f9070b9d00502bfbd2d68fcebf5431bcea7e018704abc096f237c7fb52"}},{"ruleId":"D1","level":"warning","message":{"text":"VarVisitor::visit_expr (cyclomatic 23): VarVisitor::visit_expr 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":"clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"e782b277f41d48b6ebdeec81ae2251cf41fab10a65a182cbe34e95c7cba1e49f"}},{"ruleId":"D1","level":"warning","message":{"text":"MissingConstForFn::check_fn (cyclomatic 23): MissingConstForFn::check_fn 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":"clippy_lints/src/missing_const_for_fn.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"072bcf703ac962298029c38cccc4b71f1e25540d43c8b01196d1dab4f035e7a2"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::matches::collapsible_match::check_arm (cyclomatic 23): clippy_lints::matches::collapsible_match::check_arm 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":"clippy_lints/src/matches/collapsible_match.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"700705875514b2eb91e2d278e312f1db55bf74fba55ba68356483527177a3b04"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::needless_collect::check (cyclomatic 23): clippy_lints::methods::needless_collect::check 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":"clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc9873fa64162eb28beb03155407984c34f3404acdad69db5a9b420b14f54e2"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::operators::bit_mask::check (cyclomatic 23): clippy_lints::operators::bit_mask::check 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":"clippy_lints/src/operators/bit_mask.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"098a77386555533dfee5ad74100681156975ad2644f397a466e5eb39abd51b6e"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::time_subtraction::const_eval_duration (cyclomatic 23): clippy_lints::time_subtraction::const_eval_duration 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":"clippy_lints/src/time_subtraction.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"4217d61531cdc4d82341d9972e2f48cd0e99b3a828a6749063e45a5f816b9761"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprEagernessVisitor::visit_expr (cyclomatic 23): ExprEagernessVisitor::visit_expr 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":"clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d7a26036c22c18f01d7ed04b091f793523d1fe1746b132c94c1e7549e2680d"}},{"ruleId":"D1","level":"warning","message":{"text":"HirEqInterExpr::eq_block (cyclomatic 23): HirEqInterExpr::eq_block 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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"16300ce9c77102689ebeef8f1c7761579cdf928080d417e16d785723e6ce4269"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_dev::fmt::fmt_conf (cyclomatic 22): clippy_dev::fmt::fmt_conf 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":"clippy_dev/src/fmt.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c9252a9964e59aeb185d7e7f5ed94a8a0817b4200bdf983f223992ffa0efdd"}},{"ruleId":"D1","level":"warning","message":{"text":"PatState::add_pat (cyclomatic 22): PatState::add_pat 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":"clippy_lints/src/matches/single_match.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"7737e153bec26fdf9b3b6557a5f4e19300de3f17dd94c938f76f9daaa1e0ae86"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::functions::misnamed_getters::check_fn (cyclomatic 22): clippy_lints::functions::misnamed_getters::check_fn 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":"clippy_lints/src/functions/misnamed_getters.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c285e5b4c7c1f536313340ff75b7f7a38ee7db81266f4d81d99a7fe6fbf093"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::implicit_saturating_sub::check_with_condition (cyclomatic 22): clippy_lints::implicit_saturating_sub::check_with_condition 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":"clippy_lints/src/implicit_saturating_sub.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"c592e85eda94fd4da8666dcb8757905b62a5b0696caa3ccfd123fcb9663e54e2"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::capture_local_usage (cyclomatic 22): clippy_utils::capture_local_usage has cyclomatic complexity 22 (threshold 15). Of this number, 20 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":"clippy_utils/src/lib.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac9f2cbf328991a53bfb00aaa5932613e64713251824fdc2282f17395868c8c"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::visitors::for_each_unconsumed_temporary::helper (cyclomatic 22): clippy_utils::visitors::for_each_unconsumed_temporary::helper 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":"clippy_utils/src/visitors.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"569461d8bcaf9eecc9c08d59b35058fa6379c6edb96313188102803713cb1bc3"}},{"ruleId":"D1","level":"warning","message":{"text":"Hir2Qmm::run (cyclomatic 21): Hir2Qmm::run has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/booleans.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe49846e50942dc2db5d435e052a4c20e41be36c9f1746c42790f2b1fb7a44a4"}},{"ruleId":"D1","level":"warning","message":{"text":"PeekableVisitor::visit_expr (cyclomatic 21): PeekableVisitor::visit_expr 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":"clippy_lints/src/unused_peekable.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a140b202c7b0da7d80116683a9c463e6f703ad7b46915878bab8dce20cc7189c"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::doc::doc_paragraphs_missing_punctuation::is_missing_punctuation (cyclomatic 21): clippy_lints::doc::doc_paragraphs_missing_punctuation::is_missing_punctuation 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":"clippy_lints/src/doc/doc_paragraphs_missing_punctuation.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb42bc834676adbb58830d8f3b7aaaad8ea9afcb6ea411d3fd3ae1967f47682"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::lifetimes::check_fn_inner (cyclomatic 21): clippy_lints::lifetimes::check_fn_inner 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":"clippy_lints/src/lifetimes.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12e0de94be0847993776c9ab68cd6917013348d6446a49b7cc1ac100ee4102a"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::loops::while_let_on_iterator::needs_mutable_borrow (cyclomatic 21): clippy_lints::loops::while_let_on_iterator::needs_mutable_borrow 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":"clippy_lints/src/loops/while_let_on_iterator.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff8c4b2ad92e61ed1f679c498bec9b8c687e5fd699d5cba6932512ffce3719d"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_map_or::check (cyclomatic 21): clippy_lints::methods::unnecessary_map_or::check 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":"clippy_lints/src/methods/unnecessary_map_or.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0463032120a52fe2240c62c65d51fcc588cd5d56d1fcefd4d9117dcb92ca914"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::operators::assign_op_pattern::check (cyclomatic 21): clippy_lints::operators::assign_op_pattern::check 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":"clippy_lints/src/operators/assign_op_pattern.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe7b68bc27032ef1f4963ef2a983c2418f0e7c5901de092e8fd9be83a659195"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::operators::manual_div_ceil::check (cyclomatic 21): clippy_lints::operators::manual_div_ceil::check 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":"clippy_lints/src/operators/manual_div_ceil.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b837823383d7cb8f53a38eb88ead9111dd701eaddfa8d6265c7663ac97fb15a2"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::ranges::check_possible_range_contains (cyclomatic 21): clippy_lints::ranges::check_possible_range_contains 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":"clippy_lints/src/ranges.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96c998f20edd304380ef87cfc4df1cc5a6de48c821e65c5cdac7d8121626cef"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::paths::local_item_child_by_name (cyclomatic 21): clippy_utils::paths::local_item_child_by_name 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: clippy_utils::paths::find_primitive_impls (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/paths.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"87104eac71ff308119468c04fd9145408910aedf6510763c9f86181a2b2605f6"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy::driver::main (cyclomatic 21): clippy::driver::main has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/driver.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e40363e8a707068b04ed442def94b9d8e59d67281a928027565ecd21a8d73b"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_dev::edit_lints::rename_update_fn (cyclomatic 20): clippy_dev::edit_lints::rename_update_fn 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":"clippy_dev/src/edit_lints.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c69e7e9882e1fdb4ac4cd207dd3c4b4bd49c6c13c7fb4f5d13a6e4445603e8"}},{"ruleId":"D1","level":"warning","message":{"text":"NumericFallbackVisitor::visit_expr (cyclomatic 20): NumericFallbackVisitor::visit_expr 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":"clippy_lints/src/default_numeric_fallback.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0101031b9b5348c4f4683a4912b87712aaa89d3a3df5cd7da9f20618df1fb5f"}},{"ruleId":"D1","level":"warning","message":{"text":"FloatLiteral::check_expr (cyclomatic 20): FloatLiteral::check_expr 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":"clippy_lints/src/float_literal.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3a38f7f3ddda6d592f37408bd62acaa0957b60487b1d8e63d3f18a967304d4"}},{"ruleId":"D1","level":"warning","message":{"text":"OnlyUsedInRecursion::check_expr (cyclomatic 20): OnlyUsedInRecursion::check_expr has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/only_used_in_recursion.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"24de071447a63712fe37c1aaa85524f8b07b1abbdc31c16b1aaaa964676aac8b"}},{"ruleId":"D1","level":"warning","message":{"text":"PassByRefOrValue::check_poly_fn (cyclomatic 20): PassByRefOrValue::check_poly_fn 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":"clippy_lints/src/pass_by_ref_or_value.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f9e92e8aa169c40d0f2e48a9381b46f0472fd773136726590a8925c80a40f9"}},{"ruleId":"D1","level":"warning","message":{"text":"SingleComponentPathImports::track_uses (cyclomatic 20): SingleComponentPathImports::track_uses 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":"clippy_lints/src/single_component_path_imports.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b824ec6391e0eb4814b48ad7f3e7d003647e99f05d30f0705e00bc351518fa4"}},{"ruleId":"D1","level":"warning","message":{"text":"VecPushSearcher::display_err (cyclomatic 20): VecPushSearcher::display_err has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/vec_init_then_push.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21c5d272ba121c9d1e88947feb2d2d8feba0e85af381124c26122f8b3aca8bb"}},{"ruleId":"D1","level":"warning","message":{"text":"WaitFinder::visit_expr (cyclomatic 20): WaitFinder::visit_expr 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":"clippy_lints/src/zombie_processes.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1b2d8c0a140cdb41742b41a948a08c34833c41098c55096ff339838ee013d2"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::literals::decimal_literal_representation::check_text (cyclomatic 20): clippy_lints::literals::decimal_literal_representation::check_text has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/literals/decimal_literal_representation.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc8714cfc6405e6f095f2bc0e62faa486eb00af53b58958ab163de408c947e4"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::matches::match_same_arms::check (cyclomatic 20): clippy_lints::matches::match_same_arms::check 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: NormalizedPat::has_overlapping_values (cyclomatic 21) 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":"clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"057d74056d19618fcda8188d73753388f3bc5ffac4de3fd381bcc67339262e41"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::manual_saturating_arithmetic::is_min_or_max (cyclomatic 20): clippy_lints::methods::manual_saturating_arithmetic::is_min_or_max 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":"clippy_lints/src/methods/manual_saturating_arithmetic.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26871c63209d3a426ae9eecc1c93faf9f0a75142f3c5dee20cbbdca57e3ad31"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::map_clone::check (cyclomatic 20): clippy_lints::methods::map_clone::check 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":"clippy_lints/src/methods/map_clone.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fec97598fef18145801a0b7fc5d2adc46aeb4c594f60b22001a8a6c84d4a5af"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_to_owned::check (cyclomatic 20): clippy_lints::methods::unnecessary_to_owned::check 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":"clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ea377e47d14feac3dc30ca350ad73400a7f8b61b356bef70fd13fb334bd291"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::needless_borrows_for_generic_args::needless_borrow_count (cyclomatic 20): clippy_lints::needless_borrows_for_generic_args::needless_borrow_count 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":"clippy_lints/src/needless_borrows_for_generic_args.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aef9a15fdc588d1f8868652057985fa79844901d803d0f1b6cd8daa347dac79"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::no_effect::reduce_expression (cyclomatic 20): clippy_lints::no_effect::reduce_expression 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":"clippy_lints/src/no_effect.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51809a140bef570b08843201fbf0da1d09391d9fe19ffe5df60c86a16efcff9"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::ptr::ptr_arg::check_ptr_arg_usage (cyclomatic 20): clippy_lints::ptr::ptr_arg::check_ptr_arg_usage 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":"clippy_lints/src/ptr/ptr_arg.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19ce9141cc150409c8bdaf08241423e68b55500efda717d530948a016c433db"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::string_patterns::check_manual_pattern_char_comparison (cyclomatic 20): clippy_lints::string_patterns::check_manual_pattern_char_comparison 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":"clippy_lints/src/string_patterns.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fca5f6e585b0b6a2832927583d37c0b9caf3a76fd1cbd6ea7c3a098aebdc0c8"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::unit_types::let_unit_value::check (cyclomatic 20): clippy_lints::unit_types::let_unit_value::check 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":"clippy_lints/src/unit_types/let_unit_value.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5e07ac5b5ab535c4f3da96b0123d600fde10aed027898c33cefd00d9dde4c4"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprEagernessVisitor::visit_binary (cyclomatic 20): ExprEagernessVisitor::visit_binary has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd029f931838598701b0e61bfd84c786ec6776ba8b8b594cda7ac2c1deb7eb2b"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::ty::type_certainty::expr_type_certainty (cyclomatic 20): clippy_utils::ty::type_certainty::expr_type_certainty 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":"clippy_utils/src/ty/type_certainty/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeaa393227386435aae7a201ba2ce429378c644384049540212437b246257ee3"}},{"ruleId":"D1","level":"warning","message":{"text":"NeedlessPassByRefMut::check_fn (cyclomatic 19): NeedlessPassByRefMut::check_fn 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":"clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1048df2a303346d6849ca453bc45a5b90bbf3ead8bd1f76d24d29cd1669710a"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::floating_point_arithmetic::radians::check (cyclomatic 19): clippy_lints::floating_point_arithmetic::radians::check 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":"clippy_lints/src/floating_point_arithmetic/radians.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b657e405b64a9eae1595f448c6d88fae53589a681b7888b7f1316b501a22142"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::implicit_return::lint_implicit_returns (cyclomatic 19): clippy_lints::implicit_return::lint_implicit_returns 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":"clippy_lints/src/implicit_return.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae49e40f8fc2edfbf8b53bf240267eec822fd48752c10f6bd758562ebc775ef"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::literals::mistyped_literal_suffix::check (cyclomatic 19): clippy_lints::literals::mistyped_literal_suffix::check 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":"clippy_lints/src/literals/mistyped_literal_suffix.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bbd70e6b0bcc4a3f3ab9d6bfa2f018c72865e0a10e1b7a85e7e88f323048a7"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::manual_let_else::replace_in_pattern (cyclomatic 19): clippy_lints::manual_let_else::replace_in_pattern 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":"clippy_lints/src/manual_let_else.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a179383ed61f96b25d38932f488f46f758c41a49c8931f489e29db73e617d9"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::iter_overeager_cloned::check (cyclomatic 19): clippy_lints::methods::iter_overeager_cloned::check 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":"clippy_lints/src/methods/iter_overeager_cloned.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16d70a435505cfbc6aa1787d99b6755bc66d422c7b632f7ba743c2e988b61e7"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::option_as_ref_deref::check (cyclomatic 19): clippy_lints::methods::option_as_ref_deref::check 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":"clippy_lints/src/methods/option_as_ref_deref.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25d391dcb44a185cc5ab2b45b9ec3e1c6934311f21c5e20daa773cf2e24dd6c"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::or_fun_call::check_unwrap_or_default (cyclomatic 19): clippy_lints::methods::or_fun_call::check_unwrap_or_default 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":"clippy_lints/src/methods/or_fun_call.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db35f227630116d9838f3ad9f644fb5efadfa3e176cf7fa913f4e8a3ea0fa49"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_to_owned::can_change_type (cyclomatic 19): clippy_lints::methods::unnecessary_to_owned::can_change_type 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":"clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93f187b3af5a8572ad94569dc8a1c51d1b8cf9a7ca9f5b629644ab8d5c0ea1e"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::returns::needless_return::check_final_expr (cyclomatic 19): clippy_lints::returns::needless_return::check_final_expr 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":"clippy_lints/src/returns/needless_return.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"284bcad6f740e0103d4659c2ececb3c6c13b9f1c2bf590c209eefa64de521219"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::transmute::transmute_undefined_repr::reduce_ty (cyclomatic 19): clippy_lints::transmute::transmute_undefined_repr::reduce_ty 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":"clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"234f2564ddceca4f2c7eb012850f758ca0a8bfa8d66ab4d0be739cf77e047a2e"}},{"ruleId":"D1","level":"warning","message":{"text":"ArbitrarySourceItemOrdering::check_mod (cyclomatic 18): ArbitrarySourceItemOrdering::check_mod 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":"clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b8347572d66f014d52e935b077426c6e32fbd776d1ed58aca34f16baec300d"}},{"ruleId":"D1","level":"warning","message":{"text":"PostExpansionEarlyAttributes::check_attribute (cyclomatic 18): PostExpansionEarlyAttributes::check_attribute 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":"clippy_lints/src/attrs/mod.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0cd9ff0901713596f5d5df111fff66a93308284c2ad0617080c6d484f75173"}},{"ruleId":"D1","level":"warning","message":{"text":"Default::check_block (cyclomatic 18): Default::check_block 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":"clippy_lints/src/default.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1cd8e9414c33c15a4c14d1a28855b6373e7bdee78cdd195fece92ab247990d"}},{"ruleId":"D1","level":"warning","message":{"text":"InsertSearcher::visit_expr (cyclomatic 18): InsertSearcher::visit_expr 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":"clippy_lints/src/entry.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3992167bbdca8b8c79c0832219199222ca3ac8a8b78022036417fb85476554"}},{"ruleId":"D1","level":"warning","message":{"text":"UselessFormat::check_expr (cyclomatic 18): UselessFormat::check_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":"clippy_lints/src/format.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1ba2519dc085c5cc7bdb9013546c281fed6c0449d03f35762b59ed495f8a1e"}},{"ruleId":"D1","level":"warning","message":{"text":"Loops::check_expr (cyclomatic 18): Loops::check_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":"clippy_lints/src/loops/mod.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"46eebb45ac695ca325e8d3f0c4dbc541597cb3824440ab8343b178d7bd6cda8a"}},{"ruleId":"D1","level":"warning","message":{"text":"InitializeVisitor::visit_expr (cyclomatic 18): InitializeVisitor::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":"clippy_lints/src/loops/utils.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dacdd78c3446964e0f28271b1c4a3b9fa59264c6ffc6dd1f386d6dc9d603367"}},{"ruleId":"D1","level":"warning","message":{"text":"ManualOptionAsSlice::check_expr (cyclomatic 18): ManualOptionAsSlice::check_expr 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":"clippy_lints/src/manual_option_as_slice.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcb652896ca1395c28baab8536e4efd9327b08fd80485462e72b3c8b3071c59"}},{"ruleId":"D1","level":"warning","message":{"text":"OffendingFilterExpr::check_map_call (cyclomatic 18): OffendingFilterExpr::check_map_call has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/filter_map.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee600cd237920f9d6b4d769a4d419f0d54275335e2a421c08ea0087952e27c1"}},{"ruleId":"D1","level":"warning","message":{"text":"NewWithoutDefault::check_item (cyclomatic 18): NewWithoutDefault::check_item 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":"clippy_lints/src/new_without_default.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da24ea4e6e805fa8219916d01959b21d7360b855aefbc1133aed77c0180a27a"}},{"ruleId":"D1","level":"warning","message":{"text":"SimilarNamesNameVisitor::check_ident (cyclomatic 18): SimilarNamesNameVisitor::check_ident 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":"clippy_lints/src/non_expressive_names.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db68ec782c3396c02494f510c5ab734ba4994a6ea612ed94110280bff4fcdb2"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::doc::markdown::check_word (cyclomatic 18): clippy_lints::doc::markdown::check_word has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/doc/markdown.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"319194fe17b0286838f9ba72da084ce43cef1c5f8f315ea167c76f9feb9fa449"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::matches::single_match::report_single_pattern (cyclomatic 18): clippy_lints::matches::single_match::report_single_pattern 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":"clippy_lints/src/matches/single_match.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a2290e9e49c4f09747e0caeddd634b98c9603dec85dc70f107d5d7a3d5fd70"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::iter_on_single_or_empty_collections::check (cyclomatic 18): clippy_lints::methods::iter_on_single_or_empty_collections::check 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":"clippy_lints/src/methods/iter_on_single_or_empty_collections.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf03250af04b923f962a89a116a32fc79f60c4544d3794159882480ede0fb89"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::str_splitn::parse_iter_usage (cyclomatic 18): clippy_lints::methods::str_splitn::parse_iter_usage 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":"clippy_lints/src/methods/str_splitn.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3e223021197e810a2702ecec9f4f33c399f1c407553346755edce9724f7ab2"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::useless_asref::check (cyclomatic 18): clippy_lints::methods::useless_asref::check 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":"clippy_lints/src/methods/useless_asref.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fcab512b8f3991ae38edf8a873762a9f535e0ab1c303fb5e5cf64ed820f46f"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::ranges::can_switch_ranges (cyclomatic 18): clippy_lints::ranges::can_switch_ranges 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":"clippy_lints/src/ranges.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"7248403f1a1db886a616f6407b99b54bb26f808a45ff2aeb8740f82d228d0391"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::suspicious_operation_groupings::check_binops (cyclomatic 18): clippy_lints::suspicious_operation_groupings::check_binops 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":"clippy_lints/src/suspicious_operation_groupings.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"990a53f73627e687c1876f2e14724b3d396bcbd8cefef21e996400ce79d32a7f"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::undocumented_unsafe_blocks::text_has_safety_comment (cyclomatic 18): clippy_lints::undocumented_unsafe_blocks::text_has_safety_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":"clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"67123020cec14a6ee3a0aaee9b00a2a4be9d6956db0f506f72afed48bb47ba4e"}},{"ruleId":"D1","level":"warning","message":{"text":"HirEqInterExpr::eq_pat (cyclomatic 18): HirEqInterExpr::eq_pat has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: clippy_utils::hir_utils::has_ambiguous_literal_in_expr (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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"765d85e310d08f2cafdd5b193cb60de97676a845178387d1c012649d3abfcdaf"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::expr_use_sites (cyclomatic 18): clippy_utils::expr_use_sites 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":"clippy_utils/src/lib.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b8fd688643e2715cbd0b40fd2fda01282019aa98cc20780b55fd2feaefa08a"}},{"ruleId":"D1","level":"warning","message":{"text":"Args::parse (cyclomatic 18): Args::parse has cyclomatic complexity 18 (threshold 15). 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, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a714aab9a68a0feddb0cf6030061b4c88ff6d85d768e3f8761d34e4f7574d910"}},{"ruleId":"D1","level":"warning","message":{"text":"NonminimalBoolVisitor::bool_expr (cyclomatic 17): NonminimalBoolVisitor::bool_expr 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":"clippy_lints/src/booleans.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3fe2980908a21d9bc66cee11503add7cad6173f217d25277b67029a5c86c4e"}},{"ruleId":"D1","level":"warning","message":{"text":"Documentation::check_attributes (cyclomatic 17): Documentation::check_attributes 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":"clippy_lints/src/doc/mod.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36fcbf7c9a87bc3695f144ec28118f977b16a59e83eacb5e7200e8047672d52"}},{"ruleId":"D1","level":"warning","message":{"text":"LenZero::check_expr (cyclomatic 17): LenZero::check_expr 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":"clippy_lints/src/len_zero.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc84119064e91a1d9604d1c7c0bfc418f8bebb4fdd8128a5b14ab2b94ffdd4b"}},{"ruleId":"D1","level":"warning","message":{"text":"NeedlessLateInit::check_if_or_match (cyclomatic 17): NeedlessLateInit::check_if_or_match 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":"clippy_lints/src/needless_late_init.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"09674c6e18cff57cf849c7b7dc0cb1fdee5de04b0dac90c3c67c2fcbd49c0b59"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::attrs::useless_attribute::check (cyclomatic 17): clippy_lints::attrs::useless_attribute::check 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":"clippy_lints/src/attrs/useless_attribute.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b059de696f0d6e3dc9564afe24cf5657c0d19bf1609c21ccde489735ff4d3b94"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::casts::cast_possible_truncation::apply_reductions (cyclomatic 17): clippy_lints::casts::cast_possible_truncation::apply_reductions 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":"clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bfca3a77887ccfe22e5c1b6dd8e255e2bbb672a0906f22f153c7f0865da6ee"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::casts::cast_possible_truncation::check (cyclomatic 17): clippy_lints::casts::cast_possible_truncation::check 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":"clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fb3865305eeab87fb712651f21e757c88a86caa33a849e60b34c9f10209159"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::casts::needless_type_cast::has_generic_return_type (cyclomatic 17): clippy_lints::casts::needless_type_cast::has_generic_return_type 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":"clippy_lints/src/casts/needless_type_cast.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd09e2c9dbe2c31b607984042e546c0bcfc48e3cc5f17c5b92849b6e653495c"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::doc::markdown::check (cyclomatic 17): clippy_lints::doc::markdown::check 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":"clippy_lints/src/doc/markdown.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd920d8ed349901f4a1e4f864da27b77e31f7ee685a0ed403c8f6a791cf3fd98"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::doc::too_long_first_doc_paragraph::check (cyclomatic 17): clippy_lints::doc::too_long_first_doc_paragraph::check 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":"clippy_lints/src/doc/too_long_first_doc_paragraph.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5759a931473783a00481d954dc2e800b0e17c4ec3efd95086658688d35c9aa1"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::floating_point_arithmetic::mul_add::check (cyclomatic 17): clippy_lints::floating_point_arithmetic::mul_add::check 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":"clippy_lints/src/floating_point_arithmetic/mul_add.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"24256154b9b162c0f08ef82ddb7526840740f9757a232b3989c5389f97303852"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::ifs::branches_sharing_code::scan_block_for_eq (cyclomatic 17): clippy_lints::ifs::branches_sharing_code::scan_block_for_eq 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":"clippy_lints/src/ifs/branches_sharing_code.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92ae9435fbb3c77c08d45fd6a3e190ee334ad1700383fdf871161841e552730"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::matches::redundant_guards::check (cyclomatic 17): clippy_lints::matches::redundant_guards::check 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":"clippy_lints/src/matches/redundant_guards.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b467edb6f89322d4cc6db04bfc9f1af7555db5677d1ad040c4d3d951366234"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::open_options::get_open_options (cyclomatic 17): clippy_lints::methods::open_options::get_open_options 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":"clippy_lints/src/methods/open_options.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99287078c329d62e953c0390e3edb0530558b8e3e3cb2bc26f9464b6e0ece18"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::or_fun_call::check (cyclomatic 17): clippy_lints::methods::or_fun_call::check 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":"clippy_lints/src/methods/or_fun_call.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c78c0e148533d9127d12cc3c328258a9b4ec1eae74410e060f261dd0eb52689"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::search_is_some::check (cyclomatic 17): clippy_lints::methods::search_is_some::check 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":"clippy_lints/src/methods/search_is_some.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"34838240b7be84309975662df6897571a6737e604f7f273b5c82347da86a9404"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_sort_by::detect_lint (cyclomatic 17): clippy_lints::methods::unnecessary_sort_by::detect_lint 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":"clippy_lints/src/methods/unnecessary_sort_by.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fea9035ffa003c4d9b3e7a83483681cb1d6ac975448237de91d2ea5212929a"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::operators::cmp_owned::check_op (cyclomatic 17): clippy_lints::operators::cmp_owned::check_op 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":"clippy_lints/src/operators/cmp_owned.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6261e67998b244172a166e5ca99f64e05c5dc1732f7611aa7bb10a8b08c64e28"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::operators::float_cmp::check (cyclomatic 17): clippy_lints::operators::float_cmp::check 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":"clippy_lints/src/operators/float_cmp.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c07a4665539e5192567600eba90f890f3138b6dc344b296e3083d37758e020"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::ptr::ptr_arg::check_fn_args (cyclomatic 17): clippy_lints::ptr::ptr_arg::check_fn_args 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":"clippy_lints/src/ptr/ptr_arg.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e35800efec93991d333ef63d6b657305918dc13f67f88cbb181dffd664c041"}},{"ruleId":"D1","level":"warning","message":{"text":"Constant::partial_cmp (cyclomatic 17): Constant::partial_cmp 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":"clippy_utils/src/consts.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ac18ae9671f3f0982e853f42a26a9dbf72d4e0b215a6bc3783d30b3a9169a1"}},{"ruleId":"D1","level":"warning","message":{"text":"HirEqInterExpr::check_ctxt (cyclomatic 17): HirEqInterExpr::check_ctxt 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: clippy_utils::hir_utils::has_ambiguous_literal_in_expr (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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f9bff1fc1a32be1e20b47d597fba6048505856199baeb8bce1950c3ef75f89"}},{"ruleId":"D1","level":"warning","message":{"text":"SpanlessHash::hash_tykind (cyclomatic 17): SpanlessHash::hash_tykind 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. This is NOT this file\u0027s highest cyclomatic complexity: clippy_utils::hir_utils::has_ambiguous_literal_in_expr (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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a65b12d81d4584d6fc3368d04ee92d3cc1aef050a7adea6244d35f9af931729"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::consts::mir_to_const (cyclomatic 17): clippy_utils::consts::mir_to_const 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":"clippy_utils/src/consts.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"b578e9b164989faca4ba7f837647eef0543cdb703bc5393e7fd9bc5e89d02c34"}},{"ruleId":"D1","level":"warning","message":{"text":"LargeUnoptStackFrames::check_fn (cyclomatic 16): LargeUnoptStackFrames::check_fn 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":"clippy_lints/src/large_unopt_stack_frames.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"033d2f669177493ceb0ef031214b599821975ecbcdf896e962d55b20043a19ab"}},{"ruleId":"D1","level":"warning","message":{"text":"VarVisitor::check (cyclomatic 16): VarVisitor::check 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":"clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e4bca687973a2b25e88615cabe40b35c94f89f5953624128df95bb84af9832"}},{"ruleId":"D1","level":"warning","message":{"text":"NoEffect::check_no_effect (cyclomatic 16): NoEffect::check_no_effect 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":"clippy_lints/src/no_effect.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b0d12592ad1b2a6bdd27174dad46786f583170dd0d2e57c6b8f43ae096b4ee"}},{"ruleId":"D1","level":"warning","message":{"text":"PanicUnimplemented::check_expr (cyclomatic 16): PanicUnimplemented::check_expr 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":"clippy_lints/src/panic_unimplemented.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddefb8172b2235b432cc4f575175921984a64c486391fe9849ca25621d81d3e6"}},{"ruleId":"D1","level":"warning","message":{"text":"QuestionMark::check_manual_let_else (cyclomatic 16): QuestionMark::check_manual_let_else 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":"clippy_lints/src/manual_let_else.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bb5771eae1067afc93c1c6501de4a247feaa0b9fa42907c029051bdec10d83"}},{"ruleId":"D1","level":"warning","message":{"text":"UnnecessaryWraps::check_fn (cyclomatic 16): UnnecessaryWraps::check_fn 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":"clippy_lints/src/unnecessary_wraps.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e44275cef6d8fbe57f9523b21624c8db97eb1a11a43a836f1fd13d659809192"}},{"ruleId":"D1","level":"warning","message":{"text":"WildcardImports::check_use_tree (cyclomatic 16): WildcardImports::check_use_tree 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":"clippy_lints/src/wildcard_imports.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bf82d4e0a9dcb94c9ce74b11f8eaf977055b88e87e4318fb6bce0525438c67"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::booleans::simplify_not (cyclomatic 16): clippy_lints::booleans::simplify_not 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":"clippy_lints/src/booleans.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b79afb75416db40a543e5dce505c5e6f11007b1e52f4136e3c795beeebf307a"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::casts::cast_possible_wrap::check (cyclomatic 16): clippy_lints::casts::cast_possible_wrap::check 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":"clippy_lints/src/casts/cast_possible_wrap.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"30666a839e8a083a2b2505847d70f9a33d4e0bc7ce11a295f9720633709607d9"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::functions::too_many_lines::check_fn (cyclomatic 16): clippy_lints::functions::too_many_lines::check_fn 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":"clippy_lints/src/functions/too_many_lines.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5761c53468f89e8efa98f90e32628ffe2bb3dc25beae497f64f5a46efa4c56"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::manual_clamp::is_call_max_min_pattern (cyclomatic 16): clippy_lints::manual_clamp::is_call_max_min_pattern has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (check, segment). 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":"clippy_lints/src/manual_clamp.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bc50d57677df24984d1f6448ba6f159677c2e14e32b31a208629ce592d8a6e"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::methods::map_unwrap_or::check (cyclomatic 16): clippy_lints::methods::map_unwrap_or::check 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":"clippy_lints/src/methods/map_unwrap_or.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9046aee3fb3c7c8e1b4d75258efe4cd0c90e986bb151315197fe95978d7655dd"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_lints::question_mark::check_if_let_some_or_err_and_early_return (cyclomatic 16): clippy_lints::question_mark::check_if_let_some_or_err_and_early_return 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":"clippy_lints/src/question_mark.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"622acebac7d3428b989ffe5617894d6157780e03a238c8124b4fa372ec286eeb"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::qualify_min_const_fn::check_rvalue (cyclomatic 16): clippy_utils::qualify_min_const_fn::check_rvalue 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":"clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f64667d47de07465440757ec5bb4f68099d9049c4e36ee5bd2164159290db23"}},{"ruleId":"D1","level":"warning","message":{"text":"CrateWithSource::download_and_extract (cyclomatic 16): CrateWithSource::download_and_extract has cyclomatic complexity 16 (threshold 15). Of this number, 12 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":"lintcheck/src/input.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0e37d6b55b9eebb6d072a7e940ee6f446d62fd19f28b926183d5614bac8a94"}},{"ruleId":"D1","level":"warning","message":{"text":"Crate::run_clippy_lints (cyclomatic 16): Crate::run_clippy_lints 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":"lintcheck/src/main.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a05197d2542318572fc2e2449e4b06c8db5742de1dc7f48e9f5b2e85b0aaaa"}},{"ruleId":"D2","level":"warning","message":{"text":"Methods::check_methods (cognitive 166): Methods::check_methods has cognitive complexity 166 (threshold 15). Drivers by points: if/else 36 (101 pts), match/switch 19 (59 pts), boolean chains 6 (nesting depth added 105). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/mod.rs"},"region":{"startLine":5437}}}],"partialFingerprints":{"codehealthFindingId/v1":"7411d795490afba55b5a3dcf4e4d3a386aa2e1287a3dd3fbfae9f9cf18821032"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::doc::check_doc (cognitive 127): clippy_lints::doc::check_doc has cognitive complexity 127 (threshold 15). Drivers by points: if/else 33 (85 pts), boolean chains 22, match/switch 4 (14 pts), loops 2 (6 pts) (nesting depth added 66). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/doc/mod.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa0b716f681fd1c25adf2cd69cbf1f75e90f9ded0e7d4d718ab84d62a2956c4"}},{"ruleId":"D2","level":"warning","message":{"text":"Dereferencing::check_expr (cognitive 91): Dereferencing::check_expr has cognitive complexity 91 (threshold 15). Drivers by points: if/else 32 (61 pts), boolean chains 17, match/switch 4 (10 pts), loops 1 (3 pts) (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":"clippy_lints/src/dereference.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36b91335844b7286013d0818c41db780b71489011489eafb04a320c90b5c5dd"}},{"ruleId":"D2","level":"warning","message":{"text":"UselessConversion::check_expr (cognitive 83): UselessConversion::check_expr has cognitive complexity 83 (threshold 15). Drivers by points: if/else 25 (63 pts), boolean chains 15, match/switch 2 (5 pts) (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":"clippy_lints/src/useless_conversion.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1f59eca375509406e14486979cd4558e0972bfacb36cd56d51bb9e0fa94456"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::needless_range_loop::check (cognitive 73): clippy_lints::loops::needless_range_loop::check has cognitive complexity 73 (threshold 15). Drivers by points: if/else 26 (61 pts), boolean chains 7, match/switch 1 (5 pts) (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64d383052d89c2f19e5d9036d80623fe04ade41c9ee33befd1125976b6fed3f"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexingSlicing::check_expr (cognitive 68): IndexingSlicing::check_expr has cognitive complexity 68 (threshold 15). Drivers by points: if/else 18 (58 pts), boolean chains 7, match/switch 1 (3 pts) (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/indexing_slicing.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc8ab14f2c2c96b6f62853044e344f6c6eb82ee293972bb87382336a465322a"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::manual_inspect::check (cognitive 68): clippy_lints::methods::manual_inspect::check has cognitive complexity 68 (threshold 15). Drivers by points: if/else 15 (34 pts), match/switch 5 (19 pts), boolean chains 9, loops 2 (6 pts) (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":"clippy_lints/src/methods/manual_inspect.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56871bfba961100edb3c9a545db90f4b23faf7a2289a2569d1031c9a3392dbc"}},{"ruleId":"D2","level":"warning","message":{"text":"DerefDelegate::borrow (cognitive 67): DerefDelegate::borrow has cognitive complexity 67 (threshold 15). Drivers by points: if/else 15 (47 pts), match/switch 3 (11 pts), loops 1 (5 pts), boolean chains 4 (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/sugg.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"35632b9437b2f4bcc5acc4d295d0869ad01fd98286583f1ad0ee0d89852ab466"}},{"ruleId":"D2","level":"warning","message":{"text":"Dereferencing::report (cognitive 66): Dereferencing::report has cognitive complexity 66 (threshold 15). Drivers by points: if/else 23 (40 pts), boolean chains 13, match/switch 6 (13 pts) (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":"clippy_lints/src/dereference.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d55930e0c2e8261e79d079568e021e5d3e3f9d511ba4ffd8a9b4deb24681b7d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::eta_reduction::check_closure (cognitive 65): clippy_lints::eta_reduction::check_closure has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (38 pts), match/switch 6 (19 pts), boolean chains 8 (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":"clippy_lints/src/eta_reduction.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0737e46ab874ab1696af754bd14a1235cb9bb9b63bd703b82801319fb50e64b2"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::is_never_expr (cognitive 64): clippy_utils::is_never_expr has cognitive complexity 64 (threshold 15). Drivers by points: if/else 25 (44 pts), loops 4 (11 pts), boolean chains 5, match/switch 2 (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":"clippy_utils/src/lib.rs"},"region":{"startLine":3021}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4b0e540f647811acf172b2dba769aa7fc6b6dce56c28831e7b4f3190616f7c"}},{"ruleId":"D2","level":"warning","message":{"text":"Matches::check_expr (cognitive 63): Matches::check_expr has cognitive complexity 63 (threshold 15). Drivers by points: if/else 22 (51 pts), boolean chains 8, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/mod.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"848904205b13b0564a26f0725efadb76fdc3700857013f5da586aa6f65d23e48"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::explicit_iter_loop::is_ref_iterable (cognitive 58): clippy_lints::loops::explicit_iter_loop::is_ref_iterable has cognitive complexity 58 (threshold 15). Drivers by points: if/else 21 (45 pts), boolean chains 11, match/switch 1 (2 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/loops/explicit_iter_loop.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7acc58e917e3c5d581f42cbf5752ea81106d3552f31bf61e81dd6548de37a2"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::write::literal::check (cognitive 54): clippy_lints::write::literal::check has cognitive complexity 54 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 6 (23 pts), loops 3 (4 pts), boolean chains 3 (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":"clippy_lints/src/write/literal.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"237960b24f1d5c60e8d29cad2d208e64c6244c82ffb6a940ce7db94eb2dddac2"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::lifetimes::check_fn_inner (cognitive 52): clippy_lints::lifetimes::check_fn_inner has cognitive complexity 52 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 4 (12 pts), match/switch 1 (6 pts), boolean chains 5 (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":"clippy_lints/src/lifetimes.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f9f12bd2ef46882047548f7fc514dd3cb8076f611027473707827e21cdcfdc"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::operators::op_ref::check (cognitive 51): clippy_lints::operators::op_ref::check has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 19, match/switch 2 (3 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":"clippy_lints/src/operators/op_ref.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"86afd4896ed83ecda24c9859f2c82454b05713a33969347e76cd26e922cfc030"}},{"ruleId":"D2","level":"warning","message":{"text":"SingleComponentPathImports::track_uses (cognitive 49): SingleComponentPathImports::track_uses has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (38 pts), loops 2 (8 pts), boolean chains 2, match/switch 1 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/single_component_path_imports.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af723e057f6dcb4a8e9af4aa8a380d4d5ba178cad60add56bccadf26ea0e708"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::map_clone::check (cognitive 48): clippy_lints::methods::map_clone::check has cognitive complexity 48 (threshold 15). Drivers by points: if/else 8 (34 pts), match/switch 3 (9 pts), boolean chains 5 (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":"clippy_lints/src/methods/map_clone.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87812725d379fcc08a6a7f4d150122953dcbb17f2fb2452c7ad5dcb5455906a"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_to_owned::can_change_type (cognitive 48): clippy_lints::methods::unnecessary_to_owned::can_change_type has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (42 pts), boolean chains 3, match/switch 1 (2 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":"clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51eaa5a05258fcafb64938c98b31769e2b3acea7ca610d157b5d2db6e5f28bc"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unwrap_expect_used::check (cognitive 48): clippy_lints::methods::unwrap_expect_used::check has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (37 pts), boolean chains 6, loops 2 (4 pts), match/switch 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":"clippy_lints/src/methods/unwrap_expect_used.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1a80ea07a6ac10ffaf0fcc34d410a5f67f7d199264a370e0ce41c4f57cdf47"}},{"ruleId":"D2","level":"warning","message":{"text":"NewWithoutDefault::check_item (cognitive 47): NewWithoutDefault::check_item has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 4 (12 pts), boolean chains 3 (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":"clippy_lints/src/new_without_default.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9535ee4820ac56e33e69bb3da5cc72c06de55dd754fc28908c6fee7fd81ba738"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::operators::assign_op_pattern::check (cognitive 47): clippy_lints::operators::assign_op_pattern::check has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (37 pts), boolean chains 6, match/switch 1 (4 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":"clippy_lints/src/operators/assign_op_pattern.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3628e4cd973a7ce6ee064f972c173f36faca6e2d5c2d9dffbc0afce72b7a7170"}},{"ruleId":"D2","level":"warning","message":{"text":"SpanlessHash::hash_expr (cognitive 47): SpanlessHash::hash_expr has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 5 (10 pts), match/switch 3 (7 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"089ad0d74f6fcf02123fc5dfb341199f7352b237cd3815a68d4499b378d2c4a1"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::ranges::check_possible_range_contains (cognitive 45): clippy_lints::ranges::check_possible_range_contains has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 4, 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":"clippy_lints/src/ranges.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79b075d94a256e856b08e1da853b13a955fb4675f6e12910cad442a698ab24c"}},{"ruleId":"D2","level":"warning","message":{"text":"Default::check_block (cognitive 44): Default::check_block has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (35 pts), boolean chains 5, loops 2 (3 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":"clippy_lints/src/default.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dc463f121650ca31fc8406882a7544d67cf51a276c68018258bada75968839"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::unnecessary_cast::check (cognitive 44): clippy_lints::casts::unnecessary_cast::check has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 15, match/switch 3 (6 pts) (nesting depth added 11). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7764d0b33d4b759c3f27ef21de9b6774d21478033246a920b1a140f2b87be0"}},{"ruleId":"D2","level":"warning","message":{"text":"IterFunctionVisitor::visit_expr (cognitive 43): IterFunctionVisitor::visit_expr has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (29 pts), match/switch 2 (9 pts), boolean chains 5 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7429e077aa3b8cfa5b17f24327f11c90e190dfeb98e41060d105ccd5ae7442"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::attrs::useless_attribute::check (cognitive 43): clippy_lints::attrs::useless_attribute::check has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (30 pts), boolean chains 5, loops 2 (4 pts), match/switch 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":"clippy_lints/src/attrs/useless_attribute.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7a14795dfe0bfa8aeebff4389b64de621aafab5d22a189dded5a59a335f8f6"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::iter_overeager_cloned::check (cognitive 43): clippy_lints::methods::iter_overeager_cloned::check has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (34 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/iter_overeager_cloned.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"92acabfc7326ee949466e9108628185b948bbacf4b7803bdcbf859f0658424b7"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::needless_collect::check (cognitive 43): clippy_lints::methods::needless_collect::check has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 6, match/switch 2 (4 pts), loops 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":"clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"223199bf7bf8d30da656c6582b10b9ae95ceb5ddf637b5f8ac1c88a7361da691"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::implicit_saturating_sub::check_with_condition (cognitive 40): clippy_lints::implicit_saturating_sub::check_with_condition has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/implicit_saturating_sub.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b754752917d3d51de62485833f512885ab4b15011e716934f97c1b44453bb87"}},{"ruleId":"D2","level":"warning","message":{"text":"InitializeVisitor::visit_expr (cognitive 39): InitializeVisitor::visit_expr has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (30 pts), match/switch 2 (8 pts), boolean chains 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/loops/utils.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8b8a48ed4b503ca8f35da607c6c80ae07dc80bcc6c0dd7342a43b90dee406c"}},{"ruleId":"D2","level":"warning","message":{"text":"Types::check_ty (cognitive 39): Types::check_ty has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (12 pts), match/switch 5 (9 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/types/mod.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcda7ed06c033a6ee2571064a6d5832d880d17835424046887b418212644f822"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::search_is_some::check (cognitive 39): clippy_lints::methods::search_is_some::check has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (34 pts), match/switch 1 (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":"clippy_lints/src/methods/search_is_some.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6f3a60a61f53e7d06525507d2be82250fc9ab44def35246116d2fbfe4e0e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::transmute::transmute_undefined_repr::check (cognitive 39): clippy_lints::transmute::transmute_undefined_repr::check has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (32 pts), boolean chains 4, 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":"clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a92a39f4cf17f865f4ca0fa23a5bfd4f11e6e6bcd2597cb068b4453694fd34"}},{"ruleId":"D2","level":"warning","message":{"text":"StmtsChecker::visit_expr (cognitive 38): StmtsChecker::visit_expr has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (33 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/significant_drop_tightening.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a4a6ea4f68748a81662437b3e725459ea255b269423c23aa80b5397a7ef6ff"}},{"ruleId":"D2","level":"warning","message":{"text":"PeekableVisitor::visit_expr (cognitive 38): PeekableVisitor::visit_expr has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (22 pts), match/switch 3 (11 pts), boolean chains 3, loops 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":"clippy_lints/src/unused_peekable.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df0af8e3e40e0667d941afb9f6b4aeaff51c86017c3661f90edb252d418d68e"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::manual_utils::check_with (cognitive 38): clippy_lints::matches::manual_utils::check_with has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 7, match/switch 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":"clippy_lints/src/matches/manual_utils.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7687fdad72f3b987f9e9157ff146271f865967011bff3421e78e0a225fda79"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_to_owned::check (cognitive 38): clippy_lints::methods::unnecessary_to_owned::check has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 4, 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":"clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a0d26c6d6f9811fc5891b92dc6c74728dee8ba3b81f419676155d8239cd36e"}},{"ruleId":"D2","level":"warning","message":{"text":"ArbitrarySourceItemOrdering::check_item (cognitive 37): ArbitrarySourceItemOrdering::check_item has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 3 (6 pts), boolean chains 4, match/switch 2 (3 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":"clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a106b885ec6544604b1ea10cf83479c72141c43a250df3aa7a62b0a508a2c8"}},{"ruleId":"D2","level":"warning","message":{"text":"PassByRefOrValue::check_poly_fn (cognitive 37): PassByRefOrValue::check_poly_fn has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 4 (11 pts), boolean chains 6, 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":"clippy_lints/src/pass_by_ref_or_value.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d27774d8b8a265ffa500ee0179a5f2e97ddb5867f27728773562dc8e9f1d9a7"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::while_let_on_iterator::needs_mutable_borrow (cognitive 37): clippy_lints::loops::while_let_on_iterator::needs_mutable_borrow has cognitive complexity 37 (threshold 15). Drivers by points: if/else 26 (36 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":"clippy_lints/src/loops/while_let_on_iterator.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb97cc95a07d6ab2bf7674b1250df7a01b8357dc3e7bfd3a53495aa41fc5e198"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::unit_types::let_unit_value::check (cognitive 37): clippy_lints::unit_types::let_unit_value::check has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 7, match/switch 1 (4 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/unit_types/let_unit_value.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f3b2655a0223fac1fbcf0f11ef9b57268ed5d6ddeecefe794a7e6a03e218aa"}},{"ruleId":"D2","level":"warning","message":{"text":"HirEqInterExpr::eq_expr (cognitive 37): HirEqInterExpr::eq_expr has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 29, if/else 2 (4 pts), match/switch 3 (4 pts) (nesting depth added 3). 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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"543a5a705d94bb82375d8d2a1f2869688cd655b98590200a00d8f63f794e1119"}},{"ruleId":"D2","level":"warning","message":{"text":"NonminimalBoolVisitor::bool_expr (cognitive 36): NonminimalBoolVisitor::bool_expr has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (7 pts), boolean chains 4, match/switch 1 (3 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":"clippy_lints/src/booleans.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"d019bbc241b4aca7c0982039caa1dbad61f52e65d5ee91699b2a28eee3624ca3"}},{"ruleId":"D2","level":"warning","message":{"text":"NumericFallbackVisitor::visit_expr (cognitive 36): NumericFallbackVisitor::visit_expr has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (12 pts), boolean chains 2, match/switch 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/default_numeric_fallback.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b8d20fa25518ca646315e419b0b2938321165533bb9024d017a149062f4e90"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::match_wild_err_arm::check (cognitive 36): clippy_lints::matches::match_wild_err_arm::check has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 2 (8 pts), boolean chains 2 (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/match_wild_err_arm.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1c1603b72ee89661acf75d909fa35c468cf24074f49b0c774aaf6192faeab2"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::option_if_let_else::try_get_option_occurrence (cognitive 36): clippy_lints::option_if_let_else::try_get_option_occurrence has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 5 (12 pts), boolean chains 6 (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":"clippy_lints/src/option_if_let_else.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b85164e9fb1bfabeb94d0adc2f943ad928af81ade61a9f74f8393165bb77e0"}},{"ruleId":"D2","level":"warning","message":{"text":"UselessFormat::check_expr (cognitive 35): UselessFormat::check_expr has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 3 (9 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":"clippy_lints/src/format.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d49d99d7d913b25f33fc9e805fb0b6a280b6d18297541de8c2d08c84cb72ca"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::match_wild_enum::check (cognitive 35): clippy_lints::matches::match_wild_enum::check has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 7 (12 pts), boolean chains 7, loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/match_wild_enum.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6afc172e41b08f75e2ca10a49236b32ca6d1ebd9d0715a77fe9b75bcc84ac07d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::suspicious_operation_groupings::check_binops (cognitive 35): clippy_lints::suspicious_operation_groupings::check_binops has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/suspicious_operation_groupings.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f347cd6c35db49c088e8f203eb4959a96f19c5ad220ad04d88572088c6ba498a"}},{"ruleId":"D2","level":"warning","message":{"text":"NormalizedPat::from_pat (cognitive 34): NormalizedPat::from_pat has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 13 (29 pts), if/else 3 (5 pts) (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b79d77c23b7183e2a5dbce4ec10cb9fd88f76e161fb186c14773dddc63aec3"}},{"ruleId":"D2","level":"warning","message":{"text":"NonCopyConst::is_non_freeze_val_borrowed (cognitive 34): NonCopyConst::is_non_freeze_val_borrowed has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 2 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/non_copy_const.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"b544aef347d8d0b7c6e85a6976fc728bc3848fb20faff1bf34885de89fefa60b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::collapsible_match::check_arm (cognitive 34): clippy_lints::matches::collapsible_match::check_arm has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 4, match/switch 4 (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":"clippy_lints/src/matches/collapsible_match.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"332e9d9f7355b20a695b34692092ecb9e0c446e47b8699cba3d4e5658302bdab"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_sort_by::detect_lint (cognitive 34): clippy_lints::methods::unnecessary_sort_by::detect_lint has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 5 (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":"clippy_lints/src/methods/unnecessary_sort_by.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce86f248fedd26f586d09fa5aaedad2cbe28f7e90e4e003bbfe794f702e315cb"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::returns::needless_return::check_final_expr (cognitive 34): clippy_lints::returns::needless_return::check_final_expr has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 4 (10 pts), boolean chains 3, loops 1 (2 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":"clippy_lints/src/returns/needless_return.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3420b319cc3dff54503c099cdae554ad69323d2525f632abc3e8be600d2a9f7"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::string_patterns::check_manual_pattern_char_comparison (cognitive 34): clippy_lints::string_patterns::check_manual_pattern_char_comparison has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 5, match/switch 2 (5 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":"clippy_lints/src/string_patterns.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"166e315301f85a1491090408d8428a924eff85d4d839b2e6fe48863ab0a52d57"}},{"ruleId":"D2","level":"warning","message":{"text":"NoEffect::check_no_effect (cognitive 33): NoEffect::check_no_effect has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (26 pts), boolean chains 4, 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":"clippy_lints/src/no_effect.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3240f5fb659bb1b09d93c9945121381f256ccb10f2497b0d894da5c7192fdf13"}},{"ruleId":"D2","level":"warning","message":{"text":"NonCopyConst::is_non_freeze_init_borrowed (cognitive 33): NonCopyConst::is_non_freeze_init_borrowed has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 5 (11 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/non_copy_const.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1972134b4871a672827a464df82d2a95c90d55290e4e520f2ccd6f7653a7cb"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::assigning_clones::build_sugg (cognitive 33): clippy_lints::assigning_clones::build_sugg has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 3 (5 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":"clippy_lints/src/assigning_clones.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec48c29b05a7563fe302f397a8addcc9b44826f96305a8f38283c6fe204e2df"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::floating_point_arithmetic::radians::check (cognitive 33): clippy_lints::floating_point_arithmetic::radians::check has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 10 (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":"clippy_lints/src/floating_point_arithmetic/radians.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d5d511eddf2ff620f2325e737003ed54ab063ba4a8002aa83f79e31b838b6a"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::functions::misnamed_getters::check_fn (cognitive 33): clippy_lints::functions::misnamed_getters::check_fn has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/functions/misnamed_getters.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4006d81b67f6d4a9d208be54649d41208e89450f3ae3c8ae04655c86072335"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::lifetimes::could_use_elision (cognitive 33): clippy_lints::lifetimes::could_use_elision has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 5 (7 pts), boolean chains 6 (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":"clippy_lints/src/lifetimes.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"a392eb19eac0f21fd9a4c21e795cef49db1c615f8927a0348a0e77283e634548"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::capture_local_usage (cognitive 33): clippy_utils::capture_local_usage has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 6 (18 pts), if/else 4 (8 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 19). Of this number, 32 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. 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":"clippy_utils/src/lib.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"85978aea44a1c01efc30c52a3a420997807e2ffca808dd3b0e0f9e15e370efa3"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_config::de::create_value_list_msg (cognitive 32): clippy_config::de::create_value_list_msg has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (9 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_config/src/de.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba74ba3e17cb8db6e7319cb06999319510d5018d3e99e9acda85fb0ad7929140"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_dev::edit_lints::rename_update_fn (cognitive 32): clippy_dev::edit_lints::rename_update_fn has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (21 pts), boolean chains 5, match/switch 2 (5 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_dev/src/edit_lints.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2163769390241e6711297baa32d068742348eafe9606a5ae539c414684e14d"}},{"ruleId":"D2","level":"warning","message":{"text":"ArbitrarySourceItemOrdering::check_mod (cognitive 32): ArbitrarySourceItemOrdering::check_mod has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 3, 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":"clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"5978244287e59429679a608f6a12a860951c33f0fb9bd952e8e6f02de7959e81"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::implicit_return::lint_implicit_returns (cognitive 32): clippy_lints::implicit_return::lint_implicit_returns has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 2, 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":"clippy_lints/src/implicit_return.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfab74a5699859045092b1c9f8311adfea98ff7f7f95906f95e1ab47d40a1ec1"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::single_match::report_single_pattern (cognitive 32): clippy_lints::matches::single_match::report_single_pattern has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 6, match/switch 2 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/single_match.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2466e6ccf3a46f71e5b794604118e3752536df278edc230fafc021d2361ce79c"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::useless_asref::check (cognitive 32): clippy_lints::methods::useless_asref::check has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 6, match/switch 1 (4 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":"clippy_lints/src/methods/useless_asref.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdcf0282726bc316660fb874e28ef7d4350f00dd1936c4268f7dd1242bec1c3"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::operators::invalid_upcast_comparisons::upcast_comparison_bounds_err (cognitive 32): clippy_lints::operators::invalid_upcast_comparisons::upcast_comparison_bounds_err has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 15, if/else 7 (15 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/operators/invalid_upcast_comparisons.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"946ef8f7d4f5a7689ebcde68c81403dd7682fbf1f3d0388b3a73afb03d23d151"}},{"ruleId":"D2","level":"warning","message":{"text":"WildcardImports::check_use_tree (cognitive 31): WildcardImports::check_use_tree has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/wildcard_imports.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a7a9cdfa773265b53c33f506485782486078cb4489cd5913294b0a8e5a5d36"}},{"ruleId":"D2","level":"warning","message":{"text":"MultipleInherentImpl::check_crate_post (cognitive 30): MultipleInherentImpl::check_crate_post has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 3 (11 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/inherent_impl.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f1d7f0ad72806cdefb39c0ac7ae3b3ec6bcca08c6ba81360d616b2b8514947"}},{"ruleId":"D2","level":"warning","message":{"text":"NeedlessLateInit::check_if_or_match (cognitive 30): NeedlessLateInit::check_if_or_match has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 2 (3 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":"clippy_lints/src/needless_late_init.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb78cf5336431209ad79dc91778c01ef338887433d1c8a0cf90cb3d5e6a26d9f"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::doc::doc_suspicious_footnotes::check (cognitive 30): clippy_lints::doc::doc_suspicious_footnotes::check has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (8 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":"clippy_lints/src/doc/doc_suspicious_footnotes.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fab66d519585dd01ae9652f475679cdc0473c7d7505bcefda42df70e8f28d0"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::str_splitn::parse_iter_usage (cognitive 30): clippy_lints::methods::str_splitn::parse_iter_usage has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/str_splitn.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf0945aeeb8328060baed96347ba19b73e2987e09ebd887a4c0860300e56fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::functions::too_many_lines::check_fn (cognitive 29): clippy_lints::functions::too_many_lines::check_fn has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 4, 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":"clippy_lints/src/functions/too_many_lines.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c2693ff185390a07b44777bd58928f4552aa031a5878d21f460dc06a6fb1dc"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::manual_let_else::replace_in_pattern (cognitive 29): clippy_lints::manual_let_else::replace_in_pattern has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 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":"clippy_lints/src/manual_let_else.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f595cbe2e032f7540551cecd42d966a0903d3b991d51adf2c4026763888fd46"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::match_same_arms::check (cognitive 29): clippy_lints::matches::match_same_arms::check has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 8, 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":"clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dfdd3710fcbd21f51cebeb6b5e4eda87f92dd56fb614fb516371177ba5901b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::operators::bit_mask::check (cognitive 29): clippy_lints::operators::bit_mask::check has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 4 (15 pts), if/else 8 (10 pts), boolean chains 4 (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":"clippy_lints/src/operators/bit_mask.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de483f87c5e6202b0da1f3410db27e8edf4acda792d12d6c2a1d5d6ce0b3dcc"}},{"ruleId":"D2","level":"warning","message":{"text":"HirEqInterExpr::check_ctxt (cognitive 29): HirEqInterExpr::check_ctxt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 7, 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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5c74aefcdff07b72d0d30c7b13c735f972bfe5870366a40c1e1c6f0c54114e"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::mir::reachable_while_storage_live (cognitive 29): clippy_utils::mir::reachable_while_storage_live has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (7 pts), boolean chains 3 (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":"clippy_utils/src/mir/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"976d6c02f5166aa11c0c423a06f45d91eae8607b4b287a861deab213a84d03a7"}},{"ruleId":"D2","level":"warning","message":{"text":"FloatLiteral::check_expr (cognitive 28): FloatLiteral::check_expr has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/float_literal.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8496b205eb9c3ecb973ef2d996b5569dae2edf26bc85be6288f1b3bc58fa7c96"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatArgsExpr::check_templates (cognitive 28): FormatArgsExpr::check_templates has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (19 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/format_args.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"83761bbd768de92e7909c3c02a161f62c8600b27bd11ac90d75f913f664939fc"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroUseImports::check_crate_post (cognitive 28): MacroUseImports::check_crate_post has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (3 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":"clippy_lints/src/macro_use.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9f6b22b570c8b15669ae1dd04167a145b34fb8a14e473f45bb8221dc6407c2"}},{"ruleId":"D2","level":"warning","message":{"text":"TupleArrayConversions::check_expr (cognitive 28): TupleArrayConversions::check_expr has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 10, 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":"clippy_lints/src/tuple_array_conversions.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb9347c092fce5c9d9a733ec7c30a249dff7e9c0dde6417c7b749f4cb9b4776"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_map_or::check (cognitive 28): clippy_lints::methods::unnecessary_map_or::check has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 6, match/switch 2 (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":"clippy_lints/src/methods/unnecessary_map_or.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"831ff8080b030a8d553f5ad265aa16029486cf5f1b7593191032d6c3f262b2bd"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::misc_early::unneeded_field_pattern::check (cognitive 28): clippy_lints::misc_early::unneeded_field_pattern::check has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (5 pts), boolean chains 2 (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":"clippy_lints/src/misc_early/unneeded_field_pattern.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7241b1daa942c31f7e650827b5b0cd0a5085fd13b4864e0d8f4e02f5a06954"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::undocumented_unsafe_blocks::text_has_safety_comment (cognitive 28): clippy_lints::undocumented_unsafe_blocks::text_has_safety_comment has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1003558a11c04c14cfe250f9bb7a8a6abf450d72982ebd97910aff3044b6b3"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprEagernessVisitor::visit_binary (cognitive 28): ExprEagernessVisitor::visit_binary has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 5 (8 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c336ae4df2028aedbdb8fe5648a0faf02953e64dc8a2b6a39a8141357cb0e96"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::paths::local_item_child_by_name (cognitive 28): clippy_utils::paths::local_item_child_by_name has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 3 (6 pts), boolean chains 2 (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":"clippy_utils/src/paths.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76c9ced134d89ccf1a4339f7c4a49fa731c998f027a9f6d9689c6be6287ade1"}},{"ruleId":"D2","level":"warning","message":{"text":"VarVisitor::visit_expr (cognitive 27): VarVisitor::visit_expr has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 8, loops 2 (4 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbda1e3ea73b30d2885746c8ad73ac4aa8d5cd6c9d77d3ebca100c9bde2ef1cd"}},{"ruleId":"D2","level":"warning","message":{"text":"OffendingFilterExpr::check_map_call (cognitive 27): OffendingFilterExpr::check_map_call has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (8 pts), boolean chains 7 (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":"clippy_lints/src/methods/filter_map.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bc3dd4f16ee4f1bf7c4ae887aa6ba321cc0e488a07c7ce349e49193a7e7382"}},{"ruleId":"D2","level":"warning","message":{"text":"WaitFinder::visit_expr (cognitive 27): WaitFinder::visit_expr has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 3 (7 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":"clippy_lints/src/zombie_processes.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9681e39a5fedcc643473012829b3006c99fe55fc1bb249b1df2c02e99e96eab7"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::unnecessary_cast::walk_receiver_path_step (cognitive 27): clippy_lints::casts::unnecessary_cast::walk_receiver_path_step has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 7, match/switch 2 (3 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":"clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3e6b1fa5def12c91b8681e5dae67009fae0b24821c10c9c1ce93bd33c86438"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::doc::doc_paragraphs_missing_punctuation::is_missing_punctuation (cognitive 27): clippy_lints::doc::doc_paragraphs_missing_punctuation::is_missing_punctuation has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, 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":"clippy_lints/src/doc/doc_paragraphs_missing_punctuation.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"88088ab68f531dca460499f9ba28460c8802e398afe29b9a480e03e0c095bb5d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::ifs::branches_sharing_code::scan_block_for_eq (cognitive 27): clippy_lints::ifs::branches_sharing_code::scan_block_for_eq has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3 (5 pts), match/switch 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":"clippy_lints/src/ifs/branches_sharing_code.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"d602b1cc439a7278f8fb506ea88a2d3a0c3cb0d05b4551c2c6ffe7ee8793c3e7"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::same_item_push::check (cognitive 27): clippy_lints::loops::same_item_push::check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (10 pts), boolean chains 3 (nesting depth added 15). Of this number, 24 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/loops/same_item_push.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f87e0b9158e909401a3c57d916ca989579924569657fc28b4999c93024ba52d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::option_as_ref_deref::check (cognitive 27): clippy_lints::methods::option_as_ref_deref::check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 8, 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":"clippy_lints/src/methods/option_as_ref_deref.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d048745eea689fa6d5d93137de7207f8b3df406eab46de678c39c2c176b4e54e"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_iter_cloned::check_for_loop_iter (cognitive 27): clippy_lints::methods::unnecessary_iter_cloned::check_for_loop_iter has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 1 (3 pts), match/switch 1 (3 pts) (nesting depth added 11). Of this number, 18 points are the body\u0027s own statements and 9 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":"clippy_lints/src/methods/unnecessary_iter_cloned.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc92f593681f649b4adcf69d8d5bec460b946ce3d75a38019d0b32927689030a"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_lazy_eval::check (cognitive 27): clippy_lints::methods::unnecessary_lazy_eval::check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (21 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":"clippy_lints/src/methods/unnecessary_lazy_eval.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44465d7081b079c5bcfffe37f0e341b3a776de0ad4987a2b30bef0210cbbf63"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::operators::manual_div_ceil::check (cognitive 27): clippy_lints::operators::manual_div_ceil::check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 9, 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":"clippy_lints/src/operators/manual_div_ceil.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21c8d0089a393066992fcc32d00d126d7dd779feb6cbc267659915e46af0b77"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::ptr::ptr_arg::check_ptr_arg_usage (cognitive 27): clippy_lints::ptr::ptr_arg::check_ptr_arg_usage has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 5, match/switch 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":"clippy_lints/src/ptr/ptr_arg.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da902749258f7fbbe4ca510cdf162c16024a4d779a66bc1a3995b89bbd918a4"}},{"ruleId":"D2","level":"warning","message":{"text":"HirEqInterExpr::eq_block (cognitive 27): HirEqInterExpr::eq_block has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 5, match/switch 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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b81f5f6958c698e3b79b58245e4a3245f60ef96384af196539a6a122788490"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::ast_utils::eq_expr (cognitive 27): clippy_utils::ast_utils::eq_expr has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 25, if/else 1, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f73e4deb8f0e6ef72fd413cdf4632e92c741725553270a7d0a5d2f84ac0c4ca"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_config::conf::load_conf_file (cognitive 26): clippy_config::conf::load_conf_file has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_config/src/conf.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a76975f3a1f11680246fe14f12549808b96796a7b81b2a7d3e6734fd3d61770"}},{"ruleId":"D2","level":"warning","message":{"text":"NeedlessLateInit::check_block_post (cognitive 26): NeedlessLateInit::check_block_post has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/needless_late_init.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"91dde2fbc07258fb86ca4df5eacb90ee92e0c91d9d003a77cbf6ee80cb5adb06"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestionMark::check_manual_let_else (cognitive 26): QuestionMark::check_manual_let_else has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, 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":"clippy_lints/src/manual_let_else.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6e5271277634bf295408c1706b7d442e8d0227b9498de24f6f3b242e3ab91a"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::match_bool::check (cognitive 26): clippy_lints::matches::match_bool::check has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (7 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":"clippy_lints/src/matches/match_bool.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc0c40e4f551f3a09defe3fbeb1ebf9be9efa6b86eb27a7db0d92428d4e9f35"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::map_identity::check (cognitive 26): clippy_lints::methods::map_identity::check has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 5 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/map_identity.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8d80461577e68dac784e18a8f95de922d03d3c3c99bd857bce269f48284048"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::ptr::ptr_arg::check_fn_args (cognitive 26): clippy_lints::ptr::ptr_arg::check_fn_args has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (10 pts), boolean chains 4 (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":"clippy_lints/src/ptr/ptr_arg.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"87966f1cc8d1cb3a542a415b698f2e4cc1df6fdf80502975855a71abd281f157"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::time_subtraction::const_eval_duration (cognitive 26): clippy_lints::time_subtraction::const_eval_duration has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/time_subtraction.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d66b3f12b0110559e67b8e6e94760a02f1460457f4b667432d8125e312b8a5"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::is_default_equivalent_call (cognitive 26): clippy_utils::is_default_equivalent_call has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 8, match/switch 1 (3 pts), loops 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":"clippy_utils/src/lib.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b615fd4a25a5d2a22b0e753c864caed10a339cf7d52e63f9d11b5801f73f440"}},{"ruleId":"D2","level":"warning","message":{"text":"SuggestContext::recurse (cognitive 25): SuggestContext::recurse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/booleans.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"629652e95e7a48eccf8020ef3630ea773513e4a00cbf4cc663e67ebb54b480fd"}},{"ruleId":"D2","level":"warning","message":{"text":"LargeUnoptStackFrames::check_fn (cognitive 25): LargeUnoptStackFrames::check_fn has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/large_unopt_stack_frames.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cba65f80e04fcf8aa4f08ee7fa002d779db3fbee6a441cb5be978b4e0ec40a5"}},{"ruleId":"D2","level":"warning","message":{"text":"VarVisitor::check (cognitive 25): VarVisitor::check has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 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":"clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafa819dc387b5287e3a2eb120de1006355109d4f59ec18af99285b3fa1e917e"}},{"ruleId":"D2","level":"warning","message":{"text":"OnlyUsedInRecursion::check_expr (cognitive 25): OnlyUsedInRecursion::check_expr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 2 (7 pts), boolean chains 5, 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":"clippy_lints/src/only_used_in_recursion.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8f5a0e332737e3ebc3336cd9d3fcc347b981eec25b8a7c1c90c87c8ec35004"}},{"ruleId":"D2","level":"warning","message":{"text":"UnnecessaryWraps::check_fn (cognitive 25): UnnecessaryWraps::check_fn has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/unnecessary_wraps.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"48613af78bf5da2d5f30652873bde0ec06a174bc328d17e23f4e41ac6c177a63"}},{"ruleId":"D2","level":"warning","message":{"text":"UselessVec::check_expr (cognitive 25): UselessVec::check_expr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/useless_vec.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e88236615bae4612e9d6f615eb15ad1d481a8596162a3c97421b486236e1dd9"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::never_loop::never_loop_expr (cognitive 25): clippy_lints::loops::never_loop::never_loop_expr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 4 (8 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":"clippy_lints/src/loops/never_loop.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06fc03c1525a390c75262ddf6242674d5d68cd11e87b539c0e0925a02867130"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::single_match::check (cognitive 25): clippy_lints::matches::single_match::check has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 5 (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":"clippy_lints/src/matches/single_match.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e90697a16e270fa612827a943f7a5de05745fd36f424fd8774e8e6e6e79af4"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::manual_saturating_arithmetic::is_min_or_max (cognitive 25): clippy_lints::methods::manual_saturating_arithmetic::is_min_or_max has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/manual_saturating_arithmetic.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8762d5a974978c291d300a51b4cd47baef7d074e1ed95c8207c112a41b023d6a"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::open_options::get_open_options (cognitive 25): clippy_lints::methods::open_options::get_open_options has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (6 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/open_options.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"70840594714b8a9f11e448ba0e4c586919493ee93bc555f71506618878205120"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::or_fun_call::check (cognitive 25): clippy_lints::methods::or_fun_call::check has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/or_fun_call.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0619d71217d8d18588e3eedc8a938ee4c86c8b116ceaada69fb9b3699ce6364e"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::no_effect::reduce_expression (cognitive 25): clippy_lints::no_effect::reduce_expression has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 4 (10 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/no_effect.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee75df1aa4c416fcec9566d77f1de4e17323db02d8ff684d642a937886a1a52f"}},{"ruleId":"D2","level":"warning","message":{"text":"AlmostStandardFormulation::check_item (cognitive 25): AlmostStandardFormulation::check_item has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 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":"clippy_lints_internal/src/almost_standard_lint_formulation.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5838c4ce852997afc1118a7789e6dcf91e4f9db8100e3eb53bfd95123205e35"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::ty::type_certainty::path_segment_certainty (cognitive 25): clippy_utils::ty::type_certainty::path_segment_certainty has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (3 pts), boolean chains 2 (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":"clippy_utils/src/ty/type_certainty/mod.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2259445bae2b359c25604744f55e9baad2b514693009a316553839071b61f3"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_dev::main (cognitive 24): clippy_dev::main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 6 (11 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":"clippy_dev/src/main.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b84c923516083b5a42861d80c1c934c806e5812a71e8940862a68fef5ccbf52"}},{"ruleId":"D2","level":"warning","message":{"text":"Loops::check_expr (cognitive 24): Loops::check_expr has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3, 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":"clippy_lints/src/loops/mod.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"4055bb75accf470469a15feeed1ebda8beced1b9567f98c75163fd142f026bb6"}},{"ruleId":"D2","level":"warning","message":{"text":"MissingConstForFn::check_fn (cognitive 24): MissingConstForFn::check_fn has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 7, 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":"clippy_lints/src/missing_const_for_fn.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"123662e9503690e2ad8289ec8588dee666364656468e50fca15f0d9d92e744f7"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_filter_map::check (cognitive 24): clippy_lints::methods::unnecessary_filter_map::check has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/unnecessary_filter_map.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c87db1d4f55cd690a3557caee7117f449218e6c4eaab216ee33bb0cf520bf9"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_literal_unwrap::check (cognitive 24): clippy_lints::methods::unnecessary_literal_unwrap::check has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 3 (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":"clippy_lints/src/methods/unnecessary_literal_unwrap.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d45a99f5f01c378faa39b46defb79b7e7a24bc4479713f073e080174158e0d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::unit_return_expecting_ord::get_args_to_check (cognitive 24): clippy_lints::unit_return_expecting_ord::get_args_to_check has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 1 (2 pts), boolean chains 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":"clippy_lints/src/unit_return_expecting_ord.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ef66278c1fb0d3e327d43d2b9e3f90db4aae98baecbffc2ef3a6432add6257"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::unit_types::unit_cmp::check (cognitive 24): clippy_lints::unit_types::unit_cmp::check has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/unit_types/unit_cmp.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0d545068bb26f08b7003e5b862f86f8d245fc091c07ba2cdac20caf82dec0c"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyNumericConstants::check_use_tree (cognitive 23): LegacyNumericConstants::check_use_tree has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, 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":"clippy_lints/src/legacy_numeric_constants.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e33e89440ac2871e9ba54bb690cad3b9781abe834598a9f6b05d48095540a9"}},{"ruleId":"D2","level":"warning","message":{"text":"NonCanonicalImpls::check_item (cognitive 23): NonCanonicalImpls::check_item has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 1 (4 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":"clippy_lints/src/non_canonical_impls.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"762cf6963499d68ec978ee6169603215840f7f1d3d797a0e979a71aa0ce84edd"}},{"ruleId":"D2","level":"warning","message":{"text":"NonSendFieldInSendTy::check_item (cognitive 23): NonSendFieldInSendTy::check_item has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (8 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/non_send_fields_in_send_ty.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d66984f81013f3edcc13b3a2a4fe9132b4727dcd821e2e5a858139c52cf28e"}},{"ruleId":"D2","level":"warning","message":{"text":"UnwrappableVariablesVisitor::visit_expr (cognitive 23): UnwrappableVariablesVisitor::visit_expr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (22 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":"clippy_lints/src/unwrap.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57fbc66e248bf6c87b4dcda0474e3a023d4ac56e93f8cb51ce9cef56c161e5d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::doc::too_long_first_doc_paragraph::check (cognitive 23): clippy_lints::doc::too_long_first_doc_paragraph::check has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/doc/too_long_first_doc_paragraph.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae05b4746a4d8380cd12f54a40d7dfa9ae26f69b04233883cffd4a27cd739b5e"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::infinite_iter::complete_infinite_iter (cognitive 23): clippy_lints::infinite_iter::complete_infinite_iter has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), boolean chains 3, 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":"clippy_lints/src/infinite_iter.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d8ff4374b1a751ed296965a43a4cfd705bacede26e3a3a127bf6d7c83d4a4a"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::literals::decimal_literal_representation::check_text (cognitive 23): clippy_lints::literals::decimal_literal_representation::check_text has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 14, if/else 6 (9 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/literals/decimal_literal_representation.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bc0da8f59c5a7de1eb4a68d896f5ef1f368e2e9e86be11f5c62e5ce1ad669a"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::redundant_pattern_match::find_method_and_type (cognitive 23): clippy_lints::matches::redundant_pattern_match::find_method_and_type has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 2, 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":"clippy_lints/src/matches/redundant_pattern_match.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b645e6beb593bd08265c7a1aea222c4d9f732ff963ff5b9934f8fe3b43d423"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::chunks_exact_to_as_chunks::check (cognitive 23): clippy_lints::methods::chunks_exact_to_as_chunks::check has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, 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":"clippy_lints/src/methods/chunks_exact_to_as_chunks.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc06a676f753277d835b98015540c03f22cc8060ed934d059aad89556030e111"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::transmute::transmute_ptr_to_ref::check (cognitive 23): clippy_lints::transmute::transmute_ptr_to_ref::check has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/transmute/transmute_ptr_to_ref.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93e2e10060dbf764b4254699423fd696da870b99357ada7d54b8fac3a66021b"}},{"ruleId":"D2","level":"warning","message":{"text":"SpanlessHash::hash_pat (cognitive 23): SpanlessHash::hash_pat has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 5 (10 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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"588fa9a650a8e2986809cff87f1564ca296ac63085267debd4cd841c68466b50"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::ty::contains_ty_adt_constructor_opaque::contains_ty_adt_constructor_opaque_inner (cognitive 23): clippy_utils::ty::contains_ty_adt_constructor_opaque::contains_ty_adt_constructor_opaque_inner has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (5 pts), loops 1 (3 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":"clippy_utils/src/ty/mod.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2c1f532784ef70e163d4ba1012a23d96ae9e3fe20bc70afee3aae3e908310c"}},{"ruleId":"D2","level":"warning","message":{"text":"DisallowedItems::check_pat (cognitive 22): DisallowedItems::check_pat has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 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":"clippy_lints/src/disallowed_items.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46201d92b97e11ab1240555d902ad31d0a37a5e056127e9c8d4817d9d27ce29"}},{"ruleId":"D2","level":"warning","message":{"text":"LargeEnumVariant::check_item (cognitive 22): LargeEnumVariant::check_item has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 2 (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":"clippy_lints/src/large_enum_variant.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd78e9a2cac9cba8203c27c800d9d3c8294a67b51f1782e5a56601c8017c9855"}},{"ruleId":"D2","level":"warning","message":{"text":"NeedlessPassByRefMut::check_fn (cognitive 22): NeedlessPassByRefMut::check_fn has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1268b83ae904a6ec743525335f55940411217d8c5e062adbc68010573525a8e7"}},{"ruleId":"D2","level":"warning","message":{"text":"SimilarNamesNameVisitor::check_ident (cognitive 22): SimilarNamesNameVisitor::check_ident has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 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":"clippy_lints/src/non_expressive_names.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c4dbd6c4c3654fb30e6b9218f8e875af53a3cdc0acfaa295928d4449a6a3e5"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::needless_type_cast::is_cast_in_generic_context (cognitive 22): clippy_lints::casts::needless_type_cast::is_cast_in_generic_context has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (15 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":"clippy_lints/src/casts/needless_type_cast.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"85678f20d828b142fa21b9ddd7640c4ce8dd43fee68391fffd583e808d4a9146"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::doc::markdown::check (cognitive 22): clippy_lints::doc::markdown::check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/doc/markdown.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f0a00f5370bb391974d12023444f370e9a95d13b74567cc7600a40f41ac2f7"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::let_if_seq::check_block_inner (cognitive 22): clippy_lints::let_if_seq::check_block_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 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":"clippy_lints/src/let_if_seq.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bf60a38d17f0917acde4a340b7e797a2c25a7647d30e1ca4082f38b3973f49"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::read_line_without_trim::check (cognitive 22): clippy_lints::methods::read_line_without_trim::check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5 (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":"clippy_lints/src/methods/read_line_without_trim.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadd5b3aa44b314d7501bc975f172eb34e309a293f9da66fd6c334fb6a6e188a"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::needless_borrows_for_generic_args::needless_borrow_count (cognitive 22): clippy_lints::needless_borrows_for_generic_args::needless_borrow_count has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 8, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/needless_borrows_for_generic_args.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c99f167c6a4aa39cc52ca485a2269b9a5db2a112a040441f58e6dfb3e57f0e"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::operators::float_cmp::check (cognitive 22): clippy_lints::operators::float_cmp::check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/operators/float_cmp.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dddb339dd5d0cc1ad54ba45a5260adff05c9482e7e564c305ad4bb8e6172fb"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::ranges::can_switch_ranges (cognitive 22): clippy_lints::ranges::can_switch_ranges has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7, 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":"clippy_lints/src/ranges.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd46b321264ed711441c9adefbc1dcf064155cd40ecfeb83ac17ce5f284a7e9d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::shadow::find_init (cognitive 22): clippy_lints::shadow::find_init has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (16 pts), if/else 2 (5 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/shadow.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"7634dbadaba6087c8641b79a98d24bb535cca31ba2410c382e07ade683e9291c"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::undocumented_unsafe_blocks::check_has_safety_comment (cognitive 22): clippy_lints::undocumented_unsafe_blocks::check_has_safety_comment has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0babca3e6abc495e69102b0b618071f1ab1800c8817237c20d15721bc220963"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::unit_types::unit_arg::lint_unit_args (cognitive 22): clippy_lints::unit_types::unit_arg::lint_unit_args has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 6 (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":"clippy_lints/src/unit_types/unit_arg.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"681b2ff098016846a7544701bc35f59c969c73b658579e65598d523cf95de169"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::is_body_identity_function (cognitive 22): clippy_utils::is_body_identity_function has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/lib.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb8bb6088720baf4301a4372aaba56dbe875bec46ec1609d722b92b9d5c64be"}},{"ruleId":"D2","level":"warning","message":{"text":"CrateWithSource::download_and_extract (cognitive 22): CrateWithSource::download_and_extract has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lintcheck/src/input.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabd1d41a64662205bb3058ef6289d7b96e16d44a3ba2ae910bc28886a1d265e"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy::driver::main (cognitive 22): clippy::driver::main has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 9, match/switch 2 (3 pts) (nesting depth added 1). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/driver.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98671432adc00e5dfb4a52273c81c7ac4e6700456fe732533ee27a5ec21b04e"}},{"ruleId":"D2","level":"warning","message":{"text":"PostExpansionEarlyAttributes::check_attribute (cognitive 21): PostExpansionEarlyAttributes::check_attribute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, loops 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":"clippy_lints/src/attrs/mod.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27963fe02897bb4756eb69e2f42aa1f045e22c7550e36b699b2e4334e964a95"}},{"ruleId":"D2","level":"warning","message":{"text":"Casts::check_expr (cognitive 21): Casts::check_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/casts/mod.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95810556be52121c755e8f3f66d6486c3f4b7ec05c5e0df38cf1caa403b8ddd"}},{"ruleId":"D2","level":"warning","message":{"text":"InsertSearcher::visit_expr (cognitive 21): InsertSearcher::visit_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (3 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/entry.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a1f6ba3e11973530d34c403f87a8a5e22c1d1dc8c6d3740cb1e51c182a2003"}},{"ruleId":"D2","level":"warning","message":{"text":"ToDigitIsSome::check_expr (cognitive 21): ToDigitIsSome::check_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 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":"clippy_lints/src/to_digit_is_some.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4020dabcf1f06dfdc84b583518e589695bfe2653766cea8e593ade8d7d256130"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::attrs::non_minimal_cfg::check_nested_cfg (cognitive 21): clippy_lints::attrs::non_minimal_cfg::check_nested_cfg has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/attrs/non_minimal_cfg.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b5c0e3d0386d41b44507e4f74b238753e5e06f309eeb9072d15fb1b45fa520"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::booleans::check_inverted_bool_in_condition (cognitive 21): clippy_lints::booleans::check_inverted_bool_in_condition has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 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":"clippy_lints/src/booleans.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"375367e405fbca8513ee565894032e6af9580998e259d1b318262c250d243a1c"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::literals::mistyped_literal_suffix::check (cognitive 21): clippy_lints::literals::mistyped_literal_suffix::check has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2 (7 pts), 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":"clippy_lints/src/literals/mistyped_literal_suffix.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"616d1499582a23f00c14214cd5a2a54d5582acae8c39751fa209e8877eef999f"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::redundant_guards::check (cognitive 21): clippy_lints::matches::redundant_guards::check has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 5 (7 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/redundant_guards.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e154eb63a27a343aecd5eda4e05d5a7526a82682364f67d93957c732ce23a5d2"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::or_fun_call::check_unwrap_or_default (cognitive 21): clippy_lints::methods::or_fun_call::check_unwrap_or_default has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, boolean chains 5, 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":"clippy_lints/src/methods/or_fun_call.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ddbde9e2e7934007c3f3a949188e6135f10987d64cea141c94d4fb3127c2d7"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::missing_asserts_for_indexing::report_indexes (cognitive 21): clippy_lints::missing_asserts_for_indexing::report_indexes has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 3 (12 pts), if/else 1 (4 pts), loops 2 (3 pts), boolean chains 2 (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":"clippy_lints/src/missing_asserts_for_indexing.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e75b5a54fbc49f70f90dad2760bb74cbdee6352425441764d7b2305d0e7e805"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::needless_borrows_for_generic_args::replace_types (cognitive 21): clippy_lints::needless_borrows_for_generic_args::replace_types has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 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":"clippy_lints/src/needless_borrows_for_generic_args.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc2e443a785934b260d34aca69df0113563641121f390021e697bf7d894f0ce"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::operators::cmp_owned::check_op (cognitive 21): clippy_lints::operators::cmp_owned::check_op has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/operators/cmp_owned.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10483d6c78a2be9b0cb1510858e21d0666418411148abf27074c86180a36f44"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::question_mark::check_if_let_some_or_err_and_early_return (cognitive 21): clippy_lints::question_mark::check_if_let_some_or_err_and_early_return has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 8, 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":"clippy_lints/src/question_mark.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"073a27772abec69fb8f2cadc3968bbb52261e4b90f657b93dae00ffbd0d74a45"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::transmute::transmute_undefined_repr::reduce_ty (cognitive 21): clippy_lints::transmute::transmute_undefined_repr::reduce_ty has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fc10f7648b1497aa2bc3751850d5fafacb56e9d5f5a86e87b7d2f037bd40ed"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::useless_conversion::into_iter_bound (cognitive 21): clippy_lints::useless_conversion::into_iter_bound has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/useless_conversion.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c71007abc74336d1a1271318d266baeea87d2c119c75e0afd45cf112e3c04e"}},{"ruleId":"D2","level":"warning","message":{"text":"PossibleBorrowerVisitor::visit_terminator (cognitive 21): PossibleBorrowerVisitor::visit_terminator has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (8 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":"clippy_utils/src/mir/possible_borrower.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"87df670cd47a38eb68580e699a9e3157f6d8d695139c2d716da04c06dc50f870"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::can_move_expr_to_closure (cognitive 21): clippy_utils::can_move_expr_to_closure has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 3 (6 pts), loops 1 (2 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":"clippy_utils/src/lib.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6d3c79f0a2b6443897508475d06214b155c05d7d9de322b2fd9baf7d846dec"}},{"ruleId":"D2","level":"warning","message":{"text":"ItemNameRepetitions::check_name_repetition (cognitive 20): ItemNameRepetitions::check_name_repetition has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5 (nesting depth added 8). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/item_name_repetitions.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb39093b32ea458375390d68b51af6fccd766c318c588b55cb741705eb69c3cb"}},{"ruleId":"D2","level":"warning","message":{"text":"ManualStrip::check_expr (cognitive 20): ManualStrip::check_expr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/manual_strip.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ed3bdc90ffe89a3ebc344ef7ce16b5c654ae584d753e5c66faa0c4efd55f51"}},{"ruleId":"D2","level":"warning","message":{"text":"TraitBounds::check_trait_item (cognitive 20): TraitBounds::check_trait_item has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (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":"clippy_lints/src/trait_bounds.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"34659a7ecd3ecd6bc6906ba8ac4f261222f75f878acd8e3b37ff6bd2e0636a12"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::attrs::deprecated_attributes_without_fields::check_fields (cognitive 20): clippy_lints::attrs::deprecated_attributes_without_fields::check_fields has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 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":"clippy_lints/src/attrs/deprecated_attributes_without_fields.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec080cfcb40675959793ff9ca0fb776a22d975e6bbb6c4bcddb8a2fa62750e9"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::cargo::lint_groups_priority::check (cognitive 20): clippy_lints::cargo::lint_groups_priority::check has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/cargo/lint_groups_priority.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"73185bf064558d0a0d00c306260d5162634d76fcf883f41b5d8a7e6bce626dfd"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::unnecessary_cast::is_cast_from_ty_alias (cognitive 20): clippy_lints::casts::unnecessary_cast::is_cast_from_ty_alias has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 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":"clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"228a5ba4cb3ec25d1dd8c1de1d3b0a9cb14494e4aa3e3d78bc581d7170dad3fb"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::doc::markdown::check_word (cognitive 20): clippy_lints::doc::markdown::check_word has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 9 (nesting depth added 2). Of this number, 11 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/doc/markdown.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d9390443da317df02a3fc31dd230b81add71c575303952ac9c7b166d222fbc"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::functions::not_unsafe_ptr_arg_deref::check_raw_ptr (cognitive 20): clippy_lints::functions::not_unsafe_ptr_arg_deref::check_raw_ptr has cognitive complexity 20 (threshold 15). Drivers by points: loops 2 (9 pts), if/else 3 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/functions/not_unsafe_ptr_arg_deref.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a588099a796765faf729ddaf4420fdf3330a97dec6a3396a761da7dfd4f02395"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::lifetimes::has_where_lifetimes (cognitive 20): clippy_lints::lifetimes::has_where_lifetimes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 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":"clippy_lints/src/lifetimes.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d01b0273627d4de8edb02ea3bc57312f073d819293f853ba0e85006bb921eb1"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::while_let_on_iterator::is_expr_same_child_or_parent_field (cognitive 20): clippy_lints::loops::while_let_on_iterator::is_expr_same_child_or_parent_field has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (5 pts), match/switch 2 (4 pts), boolean chains 2 (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":"clippy_lints/src/loops/while_let_on_iterator.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e16064b2e9d381b4a657977fd40f6107e66b42ac5ff7cbdaabfd692ec75f27"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::match_like_matches::check_match (cognitive 20): clippy_lints::matches::match_like_matches::check_match has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/match_like_matches.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6478dc9bf4b45ee01e7d67dca2812fe5276e4b53b4972e2b8f0d36207460af5"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::map_with_unused_argument_over_ranges::extract_count_with_applicability (cognitive 20): clippy_lints::methods::map_with_unused_argument_over_ranges::extract_count_with_applicability has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/map_with_unused_argument_over_ranges.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98bf11c97a183900381bbe9864dfdb1a80f510bb5e12e5094366f606c42f97c"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::ranges::check_reversed_empty_range (cognitive 20): clippy_lints::ranges::check_reversed_empty_range has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (nesting depth added 9). Of this number, 16 points are the body\u0027s own statements and 4 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":"clippy_lints/src/ranges.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1069a75a35370e7d120e7d7150d0851d4bf65a92a96989044309dd5a03b05c7"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::regex::check_regex (cognitive 20): clippy_lints::regex::check_regex has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (5 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":"clippy_lints/src/regex.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"90462fc8a58790a1488ffc208e2ea56a0029503cc52579fa79ef3e0fe4ba75d7"}},{"ruleId":"D2","level":"warning","message":{"text":"LintWithoutLintPass::check_item (cognitive 20): LintWithoutLintPass::check_item 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":"clippy_lints_internal/src/lint_without_lint_pass.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fb1412c4c0c3bdb73c1eb2483714a3fd9a4d1323e974d84a364d7797a0c5a9"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstEvalCtxt::binop (cognitive 20): ConstEvalCtxt::binop has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 7 (14 pts), boolean chains 3, 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":"clippy_utils/src/consts.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef6359cc46d3a1ec4ec583c71b1aabc143714f8e9905cc475c9acb2fe95dd2b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::expr_use_sites (cognitive 20): clippy_utils::expr_use_sites has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (3 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":"clippy_utils/src/lib.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06ad505d6fa1d14c64b88a9ebd65ba028b2eeae84c418785310f77f243e9425"}},{"ruleId":"D2","level":"warning","message":{"text":"Crate::run_clippy_lints (cognitive 20): Crate::run_clippy_lints has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (16 pts), loops 1 (2 pts), boolean chains 1, match/switch 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":"lintcheck/src/main.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"749a7565e4a60f22ed133273077c6fa8b2bc468f22c4ff4333127793da65c0c3"}},{"ruleId":"D2","level":"warning","message":{"text":"lintcheck::lintcheck (cognitive 20): lintcheck::lintcheck has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 2 (4 pts), 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":"lintcheck/src/main.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd2531c114ac9aeda0ed8203adadc5425b3dd619e7c60f69888a47708873ac5"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseCxImpl::parse_lint_src_file (cognitive 19): ParseCxImpl::parse_lint_src_file has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_dev/src/parse.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5c6296448d63f8dbc6a1987e3268125b3e6b78bf06b6d30ee77b05a89a7ba1"}},{"ruleId":"D2","level":"warning","message":{"text":"Hir2Qmm::run (cognitive 19): Hir2Qmm::run has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 6 (8 pts), boolean chains 1, loops 1 (nesting depth added 7). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"clippy_lints/src/booleans.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38ff309bd8e253b3da99be7adaa2fa9f67ee926cfd84166dc230dd09df18ad5"}},{"ruleId":"D2","level":"warning","message":{"text":"IfThenSomeElseNone::check_expr (cognitive 19): IfThenSomeElseNone::check_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/if_then_some_else_none.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e541c70262e5712c696d5e0555bfe0a4d9b65d815fd4ed9914cff3a549bd6ac5"}},{"ruleId":"D2","level":"warning","message":{"text":"IncrementVisitor::visit_expr (cognitive 19): IncrementVisitor::visit_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 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":"clippy_lints/src/loops/utils.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a6b00fd76e05465f01c3df936273ca0680f4f52aa1c0b551c965b169ceb9d0"}},{"ruleId":"D2","level":"warning","message":{"text":"ModStyle::check_item (cognitive 19): ModStyle::check_item 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":"clippy_lints/src/module_style.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd85d9ad18cbf442ba546259f0a467afec03fc2b08ef3ea8e0fb32f36b1264d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::cargo::feature_name::check (cognitive 19): clippy_lints::cargo::feature_name::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/cargo/feature_name.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd754e9a6e4ce4d3ccc85b87486c4fddd856e183bd7e7d5351824e61a24d134b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::cast_possible_truncation::check (cognitive 19): clippy_lints::casts::cast_possible_truncation::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"935f3362b8563de9feaa4f7c0e67c57e9fe2aeb1f9a135e25fe05244e47017e0"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::cast_possible_wrap::check (cognitive 19): clippy_lints::casts::cast_possible_wrap::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/casts/cast_possible_wrap.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c567b6fa23e897e9c8a51be0ea3db4b3fc99c4a35c525d8f4239f966653519"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::floating_point_arithmetic::mul_add::check (cognitive 19): clippy_lints::floating_point_arithmetic::mul_add::check 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":"clippy_lints/src/floating_point_arithmetic/mul_add.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"883fb296b154c91db1515d55326c5b773ebb270ec53766503fb5bbe540674fdd"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::functions::ref_option::check_fn (cognitive 19): clippy_lints::functions::ref_option::check_fn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 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":"clippy_lints/src/functions/ref_option.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4051e61b8c9f494dad549182ec809635d56e77ce4ea2c421462792afd2e56d94"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::functions::result::check_result_large_err (cognitive 19): clippy_lints::functions::result::check_result_large_err has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/functions/result.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"186c931f5dc2ef48e9211aae829a50c969dd1a9f9269add53cbb7e502c666965"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::implicit_saturating_sub::check_subtraction (cognitive 19): clippy_lints::implicit_saturating_sub::check_subtraction has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 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":"clippy_lints/src/implicit_saturating_sub.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a299ccc9cfcc3654ce325c8a6543d8af2d46163a2881adecd566dcfb23ffd81"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::explicit_counter_loop::check (cognitive 19): clippy_lints::loops::explicit_counter_loop::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, 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":"clippy_lints/src/loops/explicit_counter_loop.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf176dcdf85c52175c2aa3f74f0d24ec140c34c918a566c60133e9071f15a57"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::manual_memcpy::build_manual_memcpy_suggestion (cognitive 19): clippy_lints::loops::manual_memcpy::build_manual_memcpy_suggestion has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"clippy_lints/src/loops/manual_memcpy.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dcb9a8624564f0b6e953c7323ec037ffe5dea73e27610b69576621d74f866f"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_fold::check_option_fold (cognitive 19): clippy_lints::methods::unnecessary_fold::check_option_fold has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/unnecessary_fold.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a69318c09eca08de1cc235c9d94b5aef13e491e3e25b2254ab0fb4c5af846d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::needless_continue::check_and_warn (cognitive 19): clippy_lints::needless_continue::check_and_warn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 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":"clippy_lints/src/needless_continue.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"e230a1d505d1899a760c13acf7e072f281b9fbfb5b32deb55e2b72c707272e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::unit_types::let_unit_value::expr_needs_inferred_result (cognitive 19): clippy_lints::unit_types::let_unit_value::expr_needs_inferred_result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 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":"clippy_lints/src/unit_types/let_unit_value.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"9005a2fe342c4a8efd7e27df0cf01984b24b55723437032ff6a8bfdef9003773"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::eager_or_lazy::fn_eagerness (cognitive 19): clippy_utils::eager_or_lazy::fn_eagerness has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 3 (6 pts), boolean chains 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":"clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eff5b0e84ce33af230992763ad023011bf7262c5f978c600510034e32dc3c10"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_config::types::create_disallowed_map (cognitive 18): clippy_config::types::create_disallowed_map has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_config/src/types.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ccef0a97f070437eaa8aa563b4e0ab75f54bf0e45bd758e1b2a0f440d1da2f"}},{"ruleId":"D2","level":"warning","message":{"text":"EmptyLineAfter::check_gaps (cognitive 18): EmptyLineAfter::check_gaps has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 3 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/empty_line_after.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8428588a96675260729fa9012b4200debf5674cf28e7e81af0df8022ae4660"}},{"ruleId":"D2","level":"warning","message":{"text":"NeedlessPassByRefMut::check_crate_post (cognitive 18): NeedlessPassByRefMut::check_crate_post has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (15 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":"clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf1da97c19a0a792a3f3a236f47cb98a108432fe5a65f58f33a4168b4695427"}},{"ruleId":"D2","level":"warning","message":{"text":"PanicUnimplemented::check_expr (cognitive 18): PanicUnimplemented::check_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7, 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":"clippy_lints/src/panic_unimplemented.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"611548b05b57b2678aeb769a799f9c331eb2f68edbdd10f5d5a0c764c5f768ad"}},{"ruleId":"D2","level":"warning","message":{"text":"VecPushSearcher::display_err (cognitive 18): VecPushSearcher::display_err has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, loops 1 (2 pts), match/switch 2 (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":"clippy_lints/src/vec_init_then_push.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee40e3f4ccbe2f5cf0c9110e2f2d24ce5999168a1239f0085fca4679c0eab12"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::cast_possible_truncation::apply_reductions (cognitive 18): clippy_lints::casts::cast_possible_truncation::apply_reductions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 pts), boolean chains 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":"clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcf592c742eae6056d3379b21ad37a56d41786497b1a5644dcc73cc3d11ebd7"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::needless_type_cast::has_generic_return_type (cognitive 18): clippy_lints::casts::needless_type_cast::has_generic_return_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 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":"clippy_lints/src/casts/needless_type_cast.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1aaa97aede50565430b521ec6367f8cde375197972ab685ecf247a1bec4aef"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::ptr_as_ptr::check (cognitive 18): clippy_lints::casts::ptr_as_ptr::check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/casts/ptr_as_ptr.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"16313b8e06b8a6ef11b286bd8a6aa7b933009445143898b29168eceb13b23a47"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::doc::lazy_continuation::check (cognitive 18): clippy_lints::doc::lazy_continuation::check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 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":"clippy_lints/src/doc/lazy_continuation.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"360a55ab7041e21543315adf11fabe1859033e1ef38fadde176badf4396f6837"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::implied_bounds_in_impls::emit_lint (cognitive 18): clippy_lints::implied_bounds_in_impls::emit_lint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, loops 1 (2 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":"clippy_lints/src/implied_bounds_in_impls.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"39026719a23ce1868e49bb2471e37bbcc12dd89b41d6112e4cd2933a105f7c3b"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::manual_unwrap_or::handle (cognitive 18): clippy_lints::matches::manual_unwrap_or::handle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/manual_unwrap_or.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef61d2cb08b12806e2acd92209c60132b80cb428661e1953ea25ec4f22e2a59"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::match_str_case_mismatch::verify_case (cognitive 18): clippy_lints::matches::match_str_case_mismatch::verify_case has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 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":"clippy_lints/src/matches/match_str_case_mismatch.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e3da10b9a3d9888b7ece59381d698ce2a603a3e8d7066503566b5c808a5999"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::double_ended_iterator_last::check (cognitive 18): clippy_lints::methods::double_ended_iterator_last::check 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":"clippy_lints/src/methods/double_ended_iterator_last.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ade19d76b48073062d60d62b45ae88fa7d73fd662a5f1b8472fc010bc50ff7"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::unnecessary_to_owned::check_addr_of_expr (cognitive 18): clippy_lints::methods::unnecessary_to_owned::check_addr_of_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1596ac14b109acb12e1df10ea5a7a27d803c935352f970d742da246f7f2f9de"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstEvalCtxt::expr (cognitive 18): ConstEvalCtxt::expr has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 4 (7 pts), boolean chains 2 (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":"clippy_utils/src/consts.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc47a51e19778aaf702a6e7ca02bac20574642b362d734e49d36972cd0b12a7"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprEagernessVisitor::visit_expr (cognitive 18): ExprEagernessVisitor::visit_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"691ffd3e7d9f69d5edcf6f2d83de5d2449b4a23c8ded6b6996ca40327e035328"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::qualify_min_const_fn::check_terminator (cognitive 18): clippy_utils::qualify_min_const_fn::check_terminator has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), loops 1 (3 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":"clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e47f9d82c01d3d46af6640abde93240233446c37d8e45d007d5f6534485155f"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::ty::type_certainty::expr_type_certainty (cognitive 18): clippy_utils::ty::type_certainty::expr_type_certainty has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (3 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":"clippy_utils/src/ty/type_certainty/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c16046f358ed1d9ffc7d3bb6d687fe54e0e898604334229e414d2d7a0513c1"}},{"ruleId":"D2","level":"warning","message":{"text":"lintcheck::json::diff (cognitive 18): lintcheck::json::diff has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (4 pts), match/switch 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":"lintcheck/src/json.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6814835b25e40085834131bc35e42727a0841c46477279b7e9c0b26263b9f8"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceItemOrderingModuleItemGroupings::deserialize (cognitive 17): SourceItemOrderingModuleItemGroupings::deserialize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, 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":"clippy_config/src/types.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"524184efde8a5dce487cfb370da9fa64e0989559e7f2f21028c8cd71331ab24c"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_dev::deprecate_lint::remove_lint_declaration (cognitive 17): clippy_dev::deprecate_lint::remove_lint_declaration has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (remove_impl_lint_pass, remove_test_assets). 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":"clippy_dev/src/deprecate_lint.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f797e0d7c664f64d20bd8eab9a6147a1250c771274abebd66d028aab5d14b9e"}},{"ruleId":"D2","level":"warning","message":{"text":"PatState::add_struct_pats (cognitive 17): PatState::add_struct_pats has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, 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":"clippy_lints/src/matches/single_match.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e262a4f8b8f3b217dbde0c9fd5f70f1a2c7b07793faee1588423220703e2cb"}},{"ruleId":"D2","level":"warning","message":{"text":"MinIdentChars::check_impl_item (cognitive 17): MinIdentChars::check_impl_item has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/min_ident_chars.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc0c8b0cbc46cbbebefb171921dd987e0d4dec17bf9aae3f7cb92e212f89a96"}},{"ruleId":"D2","level":"warning","message":{"text":"SimilarNamesNameVisitor::equal_length_strs_not_similar (cognitive 17): SimilarNamesNameVisitor::equal_length_strs_not_similar has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/non_expressive_names.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"079cd108a75702058ce68415f4da0df9c681c208c53aa3437486d23516cd9873"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintVisitor::expr (cognitive 17): PrintVisitor::expr has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 4 (5 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/utils/author.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"345eeb4fa2551c45b9bbf0787b32aeabe6699bf9d7fa86a0ba71a8c8489ba433"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::doc::check_attrs (cognitive 17): clippy_lints::doc::check_attrs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2, 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":"clippy_lints/src/doc/mod.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7146a2eda8ebb1918b84ebb1d6ab5495dbe0225e82b841d86a000e755ed4169"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::infinite_iter::is_infinite (cognitive 17): clippy_lints::infinite_iter::is_infinite has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/infinite_iter.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f9228dbae8ab26a86209953ed1c29b9e36f96e7cde465f59c3f0fb49d95eba"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::manual_flatten::check (cognitive 17): clippy_lints::loops::manual_flatten::check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/loops/manual_flatten.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1149b12f4f8d1918c2678d60be5081410121868b568f6689f9bd424df8c8a085"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::filter_map::check (cognitive 17): clippy_lints::methods::filter_map::check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/filter_map.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"1674eca575160174426989ab6816d02bc3d4cfede05fca00ca8ab4d93384f56f"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::manual_contains::try_get_eligible_arg (cognitive 17): clippy_lints::methods::manual_contains::try_get_eligible_arg 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":"clippy_lints/src/methods/manual_contains.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"57eed7af22912c5349c33196b130d8295ff159ed2e795d1778c05d78f9bd32ae"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::no_effect::check_unnecessary_operation (cognitive 17): clippy_lints::no_effect::check_unnecessary_operation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 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":"clippy_lints/src/no_effect.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a62e452f88eb9008040d9b6a678f69be3b45b9122e9c83c1cc92359c8e5e104"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::reference::is_manually_drop_through_union (cognitive 17): clippy_lints::reference::is_manually_drop_through_union has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (2 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":"clippy_lints/src/reference.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d09033434bd53d2e2d0396f87fa38b4ec11d3b23d5d0ff21be6b55a7d396f44"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::maybe_get_relative_path (cognitive 17): clippy_utils::maybe_get_relative_path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/lib.rs"},"region":{"startLine":3322}}}],"partialFingerprints":{"codehealthFindingId/v1":"c995eaa95b3ace46b8fe92105769c29ada015628369b88641c816a59774ae62d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::ast_utils::eq_item_kind (cognitive 17): clippy_utils::ast_utils::eq_item_kind has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 14, match/switch 2 (3 pts) (nesting depth added 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":"clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb07e0941757af916042be6ef1c50ddcf7d6d7d87f56698086e04a80c4bc0f0"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::qualify_min_const_fn::check_ty (cognitive 17): clippy_utils::qualify_min_const_fn::check_ty has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 1 (5 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":"clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2532d08de859645ee48131188741f56c9a8f348b1486beb1877dd43b55463ca"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::visitors::for_each_unconsumed_temporary::helper (cognitive 17): clippy_utils::visitors::for_each_unconsumed_temporary::helper has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (5 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/visitors.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ae19af1e68566f358dfb42ec3042e4e61ba694b7d2e3bb930efd1b262b0af0"}},{"ruleId":"D2","level":"warning","message":{"text":"Documentation::check_attributes (cognitive 16): Documentation::check_attributes has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 3 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"clippy_lints/src/doc/mod.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d199c850c34c01db685e2cddb6e75764785f2d1e875d6b18870a32188104702"}},{"ruleId":"D2","level":"warning","message":{"text":"FromStrRadix10::check_expr (cognitive 16): FromStrRadix10::check_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/from_str_radix_10.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefa83af2aca696fc6a66ffe5385c702679234db91fc9bbd065da19cda77ad8f"}},{"ruleId":"D2","level":"warning","message":{"text":"InconsistentStructConstructor::check_expr (cognitive 16): InconsistentStructConstructor::check_expr 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":"clippy_lints/src/inconsistent_struct_constructor.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5145b443f296a3614e8dc2cdf17047f405de298973eb03db10355356caf5dd39"}},{"ruleId":"D2","level":"warning","message":{"text":"ItemNameRepetitions::check_struct_name_repetition (cognitive 16): ItemNameRepetitions::check_struct_name_repetition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 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":"clippy_lints/src/item_name_repetitions.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"452201f7758e9d19c03ce040fb7005d0429b39e38ef55e9971d7148caa2155b8"}},{"ruleId":"D2","level":"warning","message":{"text":"LoopVisitor::visit_expr (cognitive 16): LoopVisitor::visit_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 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":"clippy_lints/src/loops/infinite_loop.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0d5e0fa90b6c0d1645589a8522a500440d163ac6bdccc6997966dc8bbd7d50"}},{"ruleId":"D2","level":"warning","message":{"text":"MutMut::check_expr (cognitive 16): MutMut::check_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/mut_mut.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"214d0ff372e207dacc6848666178fa10615756e29339098b659646c0f33ddc69"}},{"ruleId":"D2","level":"warning","message":{"text":"RawStrings::check_raw_string (cognitive 16): RawStrings::check_raw_string has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/raw_strings.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9760e8eda4f623cd18ad1cb9ac704c956044f203880c3fc26fdb982d3175856b"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadVecVisitor::visit_expr (cognitive 16): ReadVecVisitor::visit_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 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":"clippy_lints/src/read_zero_byte_vec.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1262a84108c5a61fadc060ff767e5110a7932d1af0e0ccbc878bc89692acbc61"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::attrs::unnecessary_clippy_cfg::check (cognitive 16): clippy_lints::attrs::unnecessary_clippy_cfg::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/attrs/unnecessary_clippy_cfg.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faa597c4054cae64dbfcecf62e05160326e9d56e20fb4564b23723d74b0c3c2"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::casts::utils::enum_ty_to_nbits (cognitive 16): clippy_lints::casts::utils::enum_ty_to_nbits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 4 (8 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":"clippy_lints/src/casts/utils.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"997b1fd304fc8d797c00ba0a269ea4d97063b7e76c0e7cae3930adc26fd81811"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::checked_conversions::get_types_from_cast (cognitive 16): clippy_lints::checked_conversions::get_types_from_cast has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, 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":"clippy_lints/src/checked_conversions.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20a490ee1a286efd2b6fb9bc26b6de7e89255872b7f06b47c855c53dcfaf9db"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::collection_is_never_read::has_no_read_access (cognitive 16): clippy_lints::collection_is_never_read::has_no_read_access has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 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":"clippy_lints/src/collection_is_never_read.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddf6578ce3bd0e88df5fdda860e23ff9f3191556dbe7d3525aee7956597d713"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::floating_point_arithmetic::powi::check (cognitive 16): clippy_lints::floating_point_arithmetic::powi::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 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":"clippy_lints/src/floating_point_arithmetic/powi.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf65ff729350c03e2d73a0ca3efd8c519b6e8a1c756fda09e998514ea5aa5134"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::ifs::branches_sharing_code::check_match (cognitive 16): clippy_lints::ifs::branches_sharing_code::check_match has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 1, loops 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":"clippy_lints/src/ifs/branches_sharing_code.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7086d451c91458004e8c09555871d7609b4a5cf47139cee0e4d6715b6a1eac"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::loops::never_loop::check (cognitive 16): clippy_lints::loops::never_loop::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (5 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":"clippy_lints/src/loops/never_loop.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"14707df2b5de7185f6cfc00aede047eb93e09dab54a06b28dcef0431daa2b506"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::manual_pop_if::check_if_let_pattern (cognitive 16): clippy_lints::manual_pop_if::check_if_let_pattern has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (7 pts), if/else 3 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/manual_pop_if.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe16a7c007f02d458762152b4ab9edbc9f547dc25fb7b6c5640b552ac71f490"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::overlapping_arms::all_ranges (cognitive 16): clippy_lints::matches::overlapping_arms::all_ranges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 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":"clippy_lints/src/matches/overlapping_arms.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7361be4e2e5149fa346e11d372d06bee5fb04fafcea5efcb02594b4b128f8d8"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::matches::overlapping_arms::overlapping (cognitive 16): clippy_lints::matches::overlapping_arms::overlapping has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (5 pts), match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/overlapping_arms.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"005b1991ddfbc586c100f739a2740a3293f53d47ff9d6a1c8d8bc3f2a9c7372e"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::clone_on_copy::check_function (cognitive 16): clippy_lints::methods::clone_on_copy::check_function has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 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":"clippy_lints/src/methods/clone_on_copy.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c59176e90c01424d6017bafff05cc2e4a7350a607c1a66a4104ca1276cedaf"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::needless_collect::check_collect_into_intoiterator (cognitive 16): clippy_lints::methods::needless_collect::check_collect_into_intoiterator has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), 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":"clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d96268c7e30f30577aa30bd3085c93d8af93821f17eea579fc91199011e231c"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::obfuscated_if_else::check (cognitive 16): clippy_lints::methods::obfuscated_if_else::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 3 (7 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":"clippy_lints/src/methods/obfuscated_if_else.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1d17c3d7b613c66fe8fe70ebf14a492d5baa46388e6df27dba35ed7ff72031"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::methods::or_fun_call::check_or_fn_call (cognitive 16): clippy_lints::methods::or_fun_call::check_or_fn_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/or_fun_call.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c3b84cbe54c6d4faf7eee5a1d5a2649140f22647b76ab3267963ec90fe288a"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::missing_asserts_for_indexing::check_index (cognitive 16): clippy_lints::missing_asserts_for_indexing::check_index has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/missing_asserts_for_indexing.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49fec25dfc5edecec02904caba2536e33c94334776ac2a29cdfb94fe3254a62"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::set_contains_or_insert::try_parse_op_call (cognitive 16): clippy_lints::set_contains_or_insert::try_parse_op_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/set_contains_or_insert.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e860c6791d41c2e6f95be73d474793763e9e03411d16aac5620964540cc2a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_lints::unicode::check_str (cognitive 16): clippy_lints::unicode::check_str has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 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":"clippy_lints/src/unicode.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f6ac3eca2d78dfa2506841113b665ffa255ef898e5e341b77aea56f0cb425b"}},{"ruleId":"D2","level":"warning","message":{"text":"NumericLiteral::split_digit_parts (cognitive 16): NumericLiteral::split_digit_parts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/numeric_literal.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad6de1b3e8cf2a7543fa6dcc7c4c410ddc49ff603abfbd293b37f902a2e01ba"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::str_utils::camel_case_start_from_idx (cognitive 16): clippy_utils::str_utils::camel_case_start_from_idx has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/str_utils.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81b25dd7828e04b7000a91c5725689435f7c74b0ec2d84eb1c4a0abb22e3e34"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Methods.check_methods: MethodTooLong \u2014 check_methods 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":"clippy_lints/src/methods/mod.rs"},"region":{"startLine":5437}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2fbbb4cf85062c461ce7ad8bde5c319bdf78ad19289a5a15e8348908d8672b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2153 significant 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 149 free functions. The bar is 500 significant lines; this is 1653 over it, 4.31\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":"clippy_utils/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2843cf89da9cd1d5748c269f133d443511939136a0b946134c7d463c7a14b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: methods/mod.rs: FileTooLong \u2014 1866 significant 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 1366 over it, 3.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"320e1f56310246c4554ad1e61b94929fb998f494c17e5a44896be1f301d282a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Dereferencing.check_expr: MethodTooLong \u2014 check_expr runs 251 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 151 over it, 2.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/dereference.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f733b58b0603f38bfcbd373246f66f012fa600b9619ea9382bf744b7f461c7c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hir_utils.rs: FileTooLong \u2014 1196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 696 over it, 2.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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa448230c7143a0cb4b2da50b2d834e9d84c39a59e2635be23982d8265e9e74f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PrintVisitor.expr: MethodTooLong \u2014 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":"clippy_lints/src/utils/author.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"9659bcda33d630ccdce0dafcd6fddf007f7482344d8e59a0d4a72fd63e14b352"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UselessConversion.check_expr: MethodTooLong \u2014 check_expr 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":"clippy_lints/src/useless_conversion.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96bc9566074641e91e7195271ef2f3a9fae9558cc84cdc13952352ef26304f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ty/mod.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), declaring 55 free functions. 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":"clippy_utils/src/ty/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b8490464b4dcec395ffbe03b69a90dddb234429098503c54d793632a560062"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::doc::check_doc: FunctionTooLong \u2014 clippy_lints::doc::check_doc 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":"clippy_lints/src/doc/mod.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5713245aabbb34ade55c3443c0a22275a17599d8a7ef512ca3d215f4ea5f859"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_utils::ast_utils::eq_item_kind: FunctionTooLong \u2014 clippy_utils::ast_utils::eq_item_kind 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":"clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f35dedca2d79991ab6dd1f8fb000b0073b1d426ab0c9c2a8dee0ab0bb3fba6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 829 significant 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 329 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":"clippy_lints/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2489e67b8006c15b24215ecd35f683f0f0f8f33eaabdcbfe4a3b7fd17564f8d2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Methods: ClassTooLong \u2014 663 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 2 methods, 4 blocks, lines 5250-6181. The bar is 400 significant lines; this is 263 over it, 1.66\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/mod.rs"},"region":{"startLine":5250}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e31e88256f2ab827c1b66b886471a3ca715dd9c1fb9531597d65b579353c74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/consts.rs: FileTooLong \u2014 827 significant 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 327 over it, 1.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":"clippy_utils/src/consts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8304b03bb27c271f474003c3dbc307d1a0fdb43c6c100a1e2e9fdd11087d49fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SpanlessHash.hash_expr: MethodTooLong \u2014 hash_expr 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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c24265464a393e02ebf0f5dcb8ec59ed37f81ee0ac8b0cfaea2816d9d642423"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dereference.rs: FileTooLong \u2014 780 significant 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: Dereferencing (3 blocks, 154-1303). The bar is 500 significant lines; this is 280 over it, 1.56\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/dereference.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e093462c835c71de1e702695deee9c1a24338b391937b2024cc25492ae3de3ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_utils::is_never_expr: FunctionTooLong \u2014 clippy_utils::is_never_expr 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":"clippy_utils/src/lib.rs"},"region":{"startLine":3021}}}],"partialFingerprints":{"codehealthFindingId/v1":"592ff5ed5930757db2202a0882e2bf0433614aa8e187f0c06155a55de10a583c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast_utils/mod.rs: FileTooLong \u2014 754 significant 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 61 free functions. The bar is 500 significant lines; this is 254 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d73c0509ad76f5667492c4240bfec1443095787b6c9ba973d040a6eb3753dcf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HirEqInterExpr: ClassTooLong \u2014 592 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 32 methods, 2 blocks, lines 153-1028. The bar is 400 significant lines; this is 192 over it, 1.48\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6aa0712299fe87f02b3c58b4d06cabadcb6027c97d093cb9255c2236691f082"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Dereferencing.report: MethodTooLong \u2014 report 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":"clippy_lints/src/dereference.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd86f897699ed577b5b00a836918e0b086c3e0657738c514645c62a357d80330"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HirEqInterExpr.eq_expr: MethodTooLong \u2014 eq_expr 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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"502e2c91260b5c9d6b38129105d1b7601ae57ce35d14710cf2d8a2156f7667d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::eta_reduction::check_closure: FunctionTooLong \u2014 clippy_lints::eta_reduction::check_closure 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":"clippy_lints/src/eta_reduction.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5650d669d5d5155ddb55f718ee0ffbc23f3fcaf37fe174c73f6ee03c6be8107"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::loops::never_loop::never_loop_expr: FunctionTooLong \u2014 clippy_lints::loops::never_loop::never_loop_expr 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":"clippy_lints/src/loops/never_loop.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"36dcc8f5fdfe76d647de7af7c5e64b60852e914fe4240c8657ec1e8a751c17c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::methods::manual_inspect::check: FunctionTooLong \u2014 clippy_lints::methods::manual_inspect::check 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":"clippy_lints/src/methods/manual_inspect.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8bbe53a3c5af4d9e6ed75bdee010a012638d85be783a0be63d0882f3fe7e2f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_dev::fmt::fmt_conf: FunctionTooLong \u2014 clippy_dev::fmt::fmt_conf 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":"clippy_dev/src/fmt.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd18e81dafc97d1d8fb35894912474e10d05e375302d53f372140f39d0e05528"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TupleArrayConversions.check_expr: MethodTooLong \u2014 check_expr 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":"clippy_lints/src/tuple_array_conversions.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e287a6760bf7073647556ae8f6ee168a83addb6ae9de8e38214366188a84e5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Matches.check_expr: MethodTooLong \u2014 check_expr 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":"clippy_lints/src/matches/mod.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"406ea28931d4a5f22b4f4896e1ed54abe9e97290dcea069dde205dc7662ad440"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sugg.rs: FileTooLong \u2014 623 significant 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 123 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":"clippy_utils/src/sugg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3be677c321ed26f0d1e1342505f21b01c1163277404fa510b6a5fe439c415c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Dereferencing: 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), 3 methods, 3 blocks, lines 154-1303. 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":"clippy_lints/src/dereference.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa056fe5f5e39530f06c3fa7afd34aef64f6d3bc7984c3de99591c87c31a0c2f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/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":"clippy_config/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"109aef13d01ce80022dd8f19c78653b6899b8c9b5174b7647c03e84c18828143"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PrintVisitor: ClassTooLong \u2014 491 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 2 blocks, lines 215-874. The bar is 400 significant lines; this is 91 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":"clippy_lints/src/utils/author.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7044c279abf417b176d4f895b27eb10a1875a97277a6a14c4b8bff5329959450"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::casts::unnecessary_cast::check: FunctionTooLong \u2014 clippy_lints::casts::unnecessary_cast::check 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":"clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b790ce7c9f3024c9d0f975de926c763cfadccce64340a5dd85cd368ff664b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: doc/mod.rs: FileTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 106 over it, 1.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":"clippy_lints/src/doc/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19301f0642b05b90b1a0c4843ad71f2e9715afd14a7d36c70247e3680c1e227c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/author.rs: FileTooLong \u2014 599 significant 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 82% of them inside a single declaration: PrintVisitor (2 blocks, 215-874). The bar is 500 significant lines; this is 99 over it, 1.20\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/utils/author.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c402841ac676deb07d08d894e7977b9dd6b9305f926353a18b40b0a7db4229b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/utils.rs: FileTooLong \u2014 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). The bar is 500 significant lines; this is 87 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":"clippy_dev/src/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8a505635f69ade7734a510caa399ffce2577c3c927f23ef311857c1d0dcbb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::loops::needless_range_loop::check: FunctionTooLong \u2014 clippy_lints::loops::needless_range_loop::check 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":"clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"230650251a135d063f3378013425717cccb474a611236f60a30b894f002349b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::operators::op_ref::check: FunctionTooLong \u2014 clippy_lints::operators::op_ref::check 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":"clippy_lints/src/operators/op_ref.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd84686777bb9524c93b21f595b7e182b51f127c7b96b563b4211d4ad307d64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/undocumented_unsafe_blocks.rs: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 81 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":"clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c546e67346cf1aacf3e51e9435a607ede771135380cb6db4788cad83cc4a3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lifetimes.rs: FileTooLong \u2014 575 significant 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 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/lifetimes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dd27d610898189a3385ccd040c7990376a0740f816e9e0bd4b57048f404fc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: methods/needless_collect.rs: FileTooLong \u2014 575 significant 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 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"548856624bc41529bf1afb7f6619b59d785b475d07a6bf0805f70b8b370470b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/visitors.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":"clippy_utils/src/visitors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdfb2948321888c570946b0cba64e3812efacde829e5e43c5ddafccabb7abb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::matches::collapsible_match::check_arm: FunctionTooLong \u2014 clippy_lints::matches::collapsible_match::check_arm 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":"clippy_lints/src/matches/collapsible_match.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54b29242f5db52580506766cfa0c3562a9bad5fdf9fe2556dea5a2a790fd585"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::matches::match_wild_enum::check: FunctionTooLong \u2014 clippy_lints::matches::match_wild_enum::check 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":"clippy_lints/src/matches/match_wild_enum.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6bbb15abf402001a139e6f21dd5668b4f223cc2ce210c6e93073596104ce90"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/conf.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":"clippy_config/src/conf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb39fca1f7069abb77ac93f931bad04a285f28cb79b213345cd55e2f3ca4ad1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::loops::explicit_iter_loop::is_ref_iterable: FunctionTooLong \u2014 clippy_lints::loops::explicit_iter_loop::is_ref_iterable 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":"clippy_lints/src/loops/explicit_iter_loop.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"292e6b0205d69553f7fe81f4f0615296b342ee68c90405b847c3827ad97f580e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/non_copy_const.rs: FileTooLong \u2014 559 significant 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 75% of them inside a single declaration: NonCopyConst (3 blocks, 256-891). The bar is 500 significant lines; this is 59 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":"clippy_lints/src/non_copy_const.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9e18152250cc528cbad5d2ad8bfdfe4cf9e33c63624a933989b14bacd31aab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::transmute::transmute_undefined_repr::check: FunctionTooLong \u2014 clippy_lints::transmute::transmute_undefined_repr::check 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":"clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd96f5d84c77bab5b4ebc0c84ff4bfa76cdd0dcd99ddbe8adce00df2a4fdb5ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: methods/unnecessary_to_owned.rs: FileTooLong \u2014 552 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 52 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"704d7213526b7a075bffadf5c0d85bb4907db9837949a5a72e4772265ef177fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Crate.run_clippy_lints: MethodTooLong \u2014 run_clippy_lints 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":"lintcheck/src/main.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e096f5b28dfbd31cf2000763d7dc40857d51dd2b5d305dbff0afa74e92807ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConstEvalCtxt.fetch_path: MethodTooLong \u2014 fetch_path 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":"clippy_utils/src/consts.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0fcd8785e0bafd1172021262139673e2f15e344fd9d24ceef0cb8025d2fb6a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HirEqInterExpr: 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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d8095b06e21c677a73d01d4e65d34c59e7c908d949c13f5502f27af2b97399"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::matches::match_same_arms::check: FunctionTooLong \u2014 clippy_lints::matches::match_same_arms::check 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":"clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"814927e116eb78718749a13d111bd2b54c9898e5c87721eb85071f94fcd8785c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::ifs::branches_sharing_code::scan_block_for_eq: FunctionTooLong \u2014 clippy_lints::ifs::branches_sharing_code::scan_block_for_eq 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":"clippy_lints/src/ifs/branches_sharing_code.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce42b2d455cf88b19e9e948a73f093cbf622794f5b0560cd3efff2852c8ecd79"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NonCopyConst: ClassTooLong \u2014 419 significant 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 256-891. The bar is 400 significant lines; this is 19 over it, 1.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/non_copy_const.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcaee5b8e331b6af407c4311c06863cd635420fca78a244072f9ac1b099c8ea8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::methods::needless_collect::check: FunctionTooLong \u2014 clippy_lints::methods::needless_collect::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":"clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bdb1975874ebdedfba2e62e9ffc4b8718981a40a05e64d9020874b74d4d632"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: clippy_utils::source: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/source.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d2a92dd196f8fa3c5303ab32bad57dc4599aefe76187dc339e3969a08b6aa7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::matches::match_single_binding::check: FunctionTooLong \u2014 clippy_lints::matches::match_single_binding::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":"clippy_lints/src/matches/match_single_binding.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1174166d9b12ac7729c9b7230e207527bd54a98df26286a5f064cdb66fdaf6c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: clippy_lints::needless_borrows_for_generic_args::needless_borrow_count: FunctionTooLong \u2014 clippy_lints::needless_borrows_for_generic_args::needless_borrow_count 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":"clippy_lints/src/needless_borrows_for_generic_args.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdba77cd4887f27523ae7135d53c54b5e0bdcc0794041decfdf197c66a3395c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConstEvalCtxt: ClassTooLong \u2014 408 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 2 blocks, lines 559-1144. The bar is 400 significant lines; this is 8 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/consts.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1208a6d3cab0a0d907dab9dd9b32ea9d89353e2bbce92025f46513c3bc5508"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/manual_clamp.rs: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 8 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":"clippy_lints/src/manual_clamp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1090f288b1b3f94d44d9492b9a59ac6ad0d666ba58fca4728dcc419eafbeb37"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): clippy_lints/src/arbitrary_source_item_ordering.rs:281-305 | clippy_lints/src/arbitrary_source_item_ordering.rs:311-339 | clippy_lints/src/arbitrary_source_item_ordering.rs:345-392 | clippy_lints/src/arbitrary_source_item_ordering.rs:396-487 \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":"clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"595af40c93358f02df4b8ca88eb6669e3bda3edcc965effabcc4a72b1fa8c40e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): clippy_lints_internal/src/repeated_is_diagnostic_item.rs:266-330 | clippy_lints_internal/src/repeated_is_diagnostic_item.rs:332-396 \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":"clippy_lints_internal/src/repeated_is_diagnostic_item.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59f61913a25a9b5da85b0f256894432f38de73abb20b686bd1d20e1b6161386"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (81 corresponding lines): clippy_utils/src/ast_utils/mod.rs:514-594 | clippy_utils/src/ast_utils/mod.rs:596-680 \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":"clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff2481ee4cf185439493de15098c529bcaf99edc2a44fa8e0ffca4dee632c1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): clippy_lints/src/manual_retain.rs:123-173 | clippy_lints/src/manual_retain.rs:181-214 \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":"clippy_lints/src/manual_retain.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2b5581f225f01bd2b7ad33c1ec94578d809555dd7e62b137af4dd4f6b9cf63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): clippy_utils/src/visitors.rs:111-143 | clippy_utils/src/visitors.rs:151-193 \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":"clippy_utils/src/visitors.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd505eee26a6c66767ffdbfaa4869502f1cb17910128f21cdf01b508db9c7aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): clippy_dev/src/deprecate_lint.rs:17-62 | clippy_dev/src/deprecate_lint.rs:64-114 \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":"clippy_dev/src/deprecate_lint.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee90a2269daf88847826ed9da36bbc4353c0b991886a80c6c59dabb5a16e43f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): clippy_lints/src/operators/assign_op_pattern.rs:130-154 | clippy_lints/src/operators/assign_op_pattern.rs:156-180 \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":"clippy_lints/src/operators/assign_op_pattern.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cab836814538c66d5bb5e3f03cb8b11fea98134d8b64a461365106a53879929"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): clippy_utils/src/consts.rs:333-359 | clippy_utils/src/consts.rs:386-415 \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":"clippy_utils/src/consts.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd10288d80d9768c6b1c7c23edab488d6ef1832b3575bc52aedc456088b59f1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): clippy_utils/src/visitors.rs:618-667 | clippy_utils/src/visitors.rs:807-845 \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":"clippy_utils/src/visitors.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9df1c43037549be180556cd4638ed19b5bc1ac70ff3f75b6f8518b633b76296"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): clippy_lints/src/manual_pop_if.rs:203-231 | clippy_lints/src/manual_pop_if.rs:359-391 \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":"clippy_lints/src/manual_pop_if.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4dd1bd293af9ec070afdaf0d837d891189273ac600334753b3942c735b598c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): clippy_utils/src/ty/mod.rs:837-872 | clippy_utils/src/ty/mod.rs:874-913 \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":"clippy_utils/src/ty/mod.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09eade631eb30f1717f760a1f3f9a32b1310caa63605f384e29deda8f246508"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): clippy_lints/src/functions/must_use.rs:64-98 | clippy_lints/src/functions/must_use.rs:100-138 \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":"clippy_lints/src/functions/must_use.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"360ef7bee567730bc2518acfc8537835b0956b7ac5c373e083a5d94ecb690e43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): clippy_lints/src/non_copy_const.rs:715-755 | clippy_lints/src/non_copy_const.rs:757-790 \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":"clippy_lints/src/non_copy_const.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"56dd45df41f42eb9d96693b0c03c84456a2119effe0c06d114c90b6b2466de65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): clippy_lints/src/doc/include_in_doc_without_cfg.rs:9-44 | clippy_lints/src/large_include_file.rs:87-125 \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":"clippy_lints/src/doc/include_in_doc_without_cfg.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb8243b858a0c53b28d7f1dd971175e074550e8f20925d9a9b80e69b4c9e7a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): clippy_config/src/types.rs:161-192 | clippy_config/src/types.rs:196-228 \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":"clippy_config/src/types.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32033c19971b0230d35805d5ac546f4f89765b449c7127acdf999da700e9649"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): clippy_utils/src/ty/mod.rs:1233-1262 | clippy_utils/src/ty/mod.rs:1396-1427 \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":"clippy_utils/src/ty/mod.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56e93fbe177bd9a556b18087f72a9de0df0b496b2477de0a285ce5f3c6a82b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): clippy_lints/src/empty_with_brackets.rs:292-314 | clippy_lints/src/empty_with_brackets.rs:316-335 \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":"clippy_lints/src/empty_with_brackets.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"996b650b1b42817fdb21c4aa1d527b5eac987bf99c35cf489e50df5755ec0e99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): clippy_dev/src/utils.rs:469-492 | clippy_dev/src/utils.rs:495-522 \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":"clippy_dev/src/utils.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"a984b8aab7735bca8fb59ccbb78dfa7a5474ce138809eacec649d3788da84da0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): clippy_dev/src/utils.rs:657-677 | clippy_dev/src/utils.rs:682-703 \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":"clippy_dev/src/utils.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7bb91f1e8571a74df380ea6ca09494dc9d802f5132bfaac0df34397a0803ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): clippy_lints/src/derive/derive_ord_xor_partial_ord.rs:18-54 | clippy_lints/src/derive/derived_hash_with_manual_eq.rs:17-51 \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":"clippy_lints/src/derive/derive_ord_xor_partial_ord.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e578c40bf1db98a0c16ad7daff7acea06e5a49ad8f33df455a8cc6449b040a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): clippy_utils/src/consts.rs:310-329 | clippy_utils/src/consts.rs:363-382 \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":"clippy_utils/src/consts.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"473f1a4e1f667498277a555b3a166868e7401035a0cbbf73747c82cdceb721a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): clippy_utils/src/res.rs:129-152 | clippy_utils/src/res.rs:180-206 | clippy_utils/src/res.rs:214-248 \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":"clippy_utils/src/res.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c874a65a0ed7a81dd2ee4c16ce99a07d04b2df4191a6795b1d64eba0398ea0b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): clippy_lints/src/manual_clamp.rs:264-298 | clippy_lints/src/manual_clamp.rs:564-601 \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":"clippy_lints/src/manual_clamp.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"818e2ff5e9deedc675dd6cdaa71ad0045e9c62cf21424602afdd5c0b9772f86f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): clippy_lints/src/reserve_after_initialization.rs:72-97 | clippy_lints/src/reserve_after_initialization.rs:99-123 \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":"clippy_lints/src/reserve_after_initialization.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"20616d3373bf3e66c01a812fdd66602d6e7f087fde81b35b092c4eb6a556514a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): clippy_lints/src/undocumented_unsafe_blocks.rs:699-728 | clippy_lints/src/undocumented_unsafe_blocks.rs:763-795 \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":"clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd266dd004f43ebe2f47f219bb68b37243b287c6b19f51da3d9b2ff12fc9b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): clippy_lints/src/pathbuf_init_then_push.rs:153-172 | clippy_lints/src/vec_init_then_push.rs:177-198 \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":"clippy_lints/src/pathbuf_init_then_push.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e876a376ccd111bfaa7fff2e27a5ebf1a12a0ae4d367baf796cf7d50a3ae28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): clippy_utils/src/ty/mod.rs:698-710 | clippy_utils/src/ty/mod.rs:715-733 \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":"clippy_utils/src/ty/mod.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"e859bb7992834c984ce88a079ad3e1ca7e2f2431501b93f154e18dc751d82fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): clippy_lints/src/casts/needless_type_cast.rs:60-84 | clippy_lints/src/casts/needless_type_cast.rs:90-115 \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":"clippy_lints/src/casts/needless_type_cast.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ced7c024aab68c9a6aec2b685596d55e2c11bf1b59e343a836b7fe09c6c5e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): clippy_config/src/types.rs:103-122 | clippy_config/src/types.rs:336-362 \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":"clippy_config/src/types.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d117470e76453b24b1d87d6eee7693c7e7a24a1ade5a28fc97dd05cd554071"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): clippy_utils/src/mir/possible_borrower.rs:43-63 | clippy_utils/src/mir/possible_origin.rs:25-39 \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":"clippy_utils/src/mir/possible_borrower.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfeb33a2b4ba39441587895af3af8c66f7bd4c0fcbc76616462c019bfb11acf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): clippy_lints/src/functions/result.rs:54-64 | clippy_lints/src/functions/result.rs:72-84 \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":"clippy_lints/src/functions/result.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8418aa259e825db68999618d4dd95e2178c63be46923ffa0a2aa6f7391faf0fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): clippy_lints/src/pathbuf_init_then_push.rs:134-151 | clippy_lints/src/vec_init_then_push.rs:157-175 \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":"clippy_lints/src/pathbuf_init_then_push.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b010ce913e09baff7045be971439dd938b4e806b7b91393801352545b1b6943"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): clippy_utils/src/str_utils.rs:213-227 | clippy_utils/src/str_utils.rs:239-258 \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":"clippy_utils/src/str_utils.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"827339be741dc315d10a78bc179c424b245fce27b12785a33383993da2482ecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): clippy_lints/src/casts/cast_sign_loss.rs:290-329 | clippy_lints/src/casts/cast_sign_loss.rs:339-363 \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":"clippy_lints/src/casts/cast_sign_loss.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"3634c3f14b00f01be3c23e7c84acd56db0d0cf779dc5ed55327347e3010de59b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): clippy_lints/src/extra_unused_type_parameters.rs:258-274 | clippy_lints/src/extra_unused_type_parameters.rs:276-290 \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":"clippy_lints/src/extra_unused_type_parameters.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a762e37884cb0783d73b6dbabcb6272021d96d7ce9f41882ae92de627131150b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): clippy_dev/src/edit_lints.rs:226-240 | clippy_dev/src/edit_lints.rs:242-255 \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":"clippy_dev/src/edit_lints.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5039332a3858a3c62e67d6f647a90e08b572eeaff9c41f847ca11934fbfa8f42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): clippy_lints/src/missing_doc.rs:196-212 | clippy_lints/src/missing_doc.rs:214-233 \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":"clippy_lints/src/missing_doc.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ca3cce5d78fd584f354b57d154848479e0a7b5312f27ab4bf7c4f4781abfc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): clippy_lints/src/pathbuf_init_then_push.rs:174-185 | clippy_lints/src/reserve_after_initialization.rs:125-142 | clippy_lints/src/vec_init_then_push.rs:200-218 \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":"clippy_lints/src/pathbuf_init_then_push.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"426a042563fd9ed10db38b6d13dcb6f35a6ff999dd39cee561d58e032593cad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): clippy_lints/src/methods/map_unwrap_or.rs:186-201 | clippy_lints/src/option_if_let_else.rs:295-306 \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":"clippy_lints/src/methods/map_unwrap_or.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de4662d4fad0544aa6bc94fd7b91400a72921c5a4b0f9450bbb96d1b2cdddb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): clippy_lints/src/loops/mut_range_bound.rs:85-96 | clippy_lints/src/loops/mut_range_bound.rs:98-107 \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":"clippy_lints/src/loops/mut_range_bound.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e4dc67c8579ca7c2be44a297313b377ec5384498cc9efcbaf1697482981dbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): clippy_lints/src/non_std_lazy_statics.rs:261-286 | clippy_utils/src/lib.rs:2124-2151 \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":"clippy_lints/src/non_std_lazy_statics.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a48053bfa5f2940edea04011c04d338f06cb35ac49e7f212a467464ff17f0a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): clippy_lints/src/operators/arithmetic_side_effects.rs:295-309 | clippy_lints/src/operators/numeric_arithmetic.rs:70-87 \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":"clippy_lints/src/operators/arithmetic_side_effects.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6b0f98e668f8ad09862d57d1c1a63e75454e65a6948f28693e575624a3f4be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): clippy_lints/src/lifetimes.rs:720-742 | clippy_lints/src/lifetimes.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":"clippy_lints/src/lifetimes.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec6a76d9df8ce1cf1205a13cf4158e8d70eca884156d39577a1aab860fe3ec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): clippy_utils/src/ty/type_certainty/certainty.rs:46-53 | clippy_utils/src/ty/type_certainty/certainty.rs:60-77 \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":"clippy_utils/src/ty/type_certainty/certainty.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d3dbef4925c0f62615c7d6bfcd15911f7267e9e855a1b0b2d326be120ca707"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): clippy_utils/src/lib.rs:271-283 | clippy_utils/src/lib.rs:286-298 \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":"clippy_utils/src/lib.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed008cbfc1df3d9fea72166c54b47be67edb4d3cc5b978528d6273b612803128"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): clippy_lints/src/semicolon_block.rs:83-117 | clippy_lints/src/semicolon_block.rs:119-152 \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":"clippy_lints/src/semicolon_block.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f503e5b51029373ee2ecf5bc163829db544b123533ddef9bd4025c5a48cbcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): clippy_lints/src/casts/fn_to_numeric_cast.rs:10-32 | clippy_lints/src/casts/fn_to_numeric_cast_with_truncation.rs:10-31 \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":"clippy_lints/src/casts/fn_to_numeric_cast.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c353cc43aeb354cf15037d261d3e4d0bb55d5a8be8333bda1a846f017a20409e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): clippy_lints/src/bit_width.rs:146-160 | clippy_lints/src/bit_width.rs:162-184 \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":"clippy_lints/src/bit_width.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15ec9034a80647d98d45672ff681bf29513403ad258ebc537d2b45aa228ffab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): clippy_dev/src/utils.rs:623-633 | clippy_dev/src/utils.rs:636-646 \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":"clippy_dev/src/utils.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"488e7e981ca6f713ee70e03d47131839a29c510238a7ce495aa03fb8f9bdb6dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): clippy_lints/src/matches/manual_filter.rs:204-233 | clippy_lints/src/matches/manual_map.rs:44-75 \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":"clippy_lints/src/matches/manual_filter.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf3ec6153b928e99d839bb00634d329dce34d5834e903f7f1da4a25369c05c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): clippy_lints/src/returns/let_and_return.rs:70-89 | clippy_utils/src/lib.rs:3433-3446 \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":"clippy_lints/src/returns/let_and_return.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1e06c534df8baacd3f2fd1e39fb2636a42f8377606b19e3a61c2e96e16182c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): clippy_lints/src/matches/needless_match.rs:17-30 | clippy_lints/src/matches/needless_match.rs:51-67 \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":"clippy_lints/src/matches/needless_match.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"54199015a3fe87069ca6774add93bd4d0c4801f774db4a4e2a58274f045fbb3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): clippy_lints/src/loops/manual_memcpy.rs:262-272 | clippy_lints/src/loops/manual_memcpy.rs:288-298 \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":"clippy_lints/src/loops/manual_memcpy.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3682e004602451dcaa4fd727b2cdf7281589057a4ff83bf2c214270c5006b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): clippy_lints/src/casts/cast_sign_loss.rs:112-121 | clippy_lints/src/casts/cast_sign_loss.rs:127-136 \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":"clippy_lints/src/casts/cast_sign_loss.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4341980cf077bd4f539185f6750bb39ead931ce0ce050703a011b4a801b66cfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): clippy_lints/src/missing_doc.rs:247-264 | clippy_lints/src/missing_doc.rs:266-281 \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":"clippy_lints/src/missing_doc.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2af247214c4628b3edaee2b60c1d1190365fafe81cd54b5bd4a48792c01f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): clippy_lints/src/non_expressive_names.rs:401-414 | clippy_lints/src/non_expressive_names.rs:416-429 \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":"clippy_lints/src/non_expressive_names.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"082b4badc922f5d2bfd6174f56b84a77d501a7c71f69a1a78fbb22af578cccc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): clippy_lints/src/operators/manual_isolate_lowest_one.rs:149-157 | clippy_lints/src/operators/manual_isolate_lowest_one.rs:159-167 \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":"clippy_lints/src/operators/manual_isolate_lowest_one.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbeb822e6e7cb7f19e39c7ddcf181222ccfed7cc5f807affb39d5043c244ae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): clippy_utils/src/sugg.rs:47-53 | clippy_utils/src/sugg.rs:395-401 \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":"clippy_utils/src/sugg.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d5523cd998adf8dedfa0edcbb91c429394cf3307509eb44ba371929839240b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): clippy_lints_internal/src/repeated_is_diagnostic_item.rs:507-518 | clippy_lints_internal/src/repeated_is_diagnostic_item.rs:523-537 \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":"clippy_lints_internal/src/repeated_is_diagnostic_item.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d474fad27e22ba86ee0136ee829fc7bf87f6c03872f86aa4cf3efd5b8ce9aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): clippy_lints/src/casts/cast_sign_loss.rs:218-243 | clippy_lints/src/casts/cast_sign_loss.rs:249-278 \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":"clippy_lints/src/casts/cast_sign_loss.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5f97711e32899d5d577d5db6bffa7a949f2b5ebb60fa12eccd25e2a4d92c8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): clippy_lints/src/min_ident_chars.rs:97-106 | clippy_lints/src/min_ident_chars.rs:108-114 \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":"clippy_lints/src/min_ident_chars.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bdf3d78345d8a1332484c39204227c709dd8777ef12b60e5d3cdad88277c82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): clippy_lints/src/methods/map_unwrap_or.rs:162-170 | clippy_lints/src/option_if_let_else.rs:270-278 \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":"clippy_lints/src/methods/map_unwrap_or.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f14198ed3baf25e0e0f42c59b281e5a278803ed02aa6da393da045a39a8dd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): clippy_lints_internal/src/collapsible_span_lint_calls.rs:216-235 | clippy_lints_internal/src/collapsible_span_lint_calls.rs:244-263 \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":"clippy_lints_internal/src/collapsible_span_lint_calls.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"91550c32d9e023dcfb9d20460c2ac45138f85b3cb89209666cb9a48d345ea13e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): clippy_lints/src/methods/bind_instead_of_map.rs:63-72 | clippy_lints/src/methods/bind_instead_of_map.rs:74-84 \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":"clippy_lints/src/methods/bind_instead_of_map.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1138aa5547eb06852022caab88d56cdc5c71b1ea924bbef2ab2d1a1d59441dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): clippy_utils/src/ty/mod.rs:510-519 | clippy_utils/src/ty/mod.rs:523-534 \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":"clippy_utils/src/ty/mod.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"076bfabbdfdfad74c4a74f02791c7cd266dc7db382fc9e520597f1f1a3302003"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): clippy_lints/src/matches/try_err.rs:93-102 | clippy_lints/src/matches/try_err.rs:105-115 \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":"clippy_lints/src/matches/try_err.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8a9e0f7bdf9078e8abefafef358d2fe9f8463a809c1cd264b89c24bad2d506"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): clippy_lints/src/arbitrary_source_item_ordering.rs:202-214 | clippy_lints/src/arbitrary_source_item_ordering.rs:265-277 \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":"clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67f30ef8eff15957c6fd27bc3d2aae582a3702317436c7833c3442f74e29436"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): clippy_lints/src/await_holding_invalid.rs:294-299 | clippy_lints/src/entry.rs:762-767 \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":"clippy_lints/src/await_holding_invalid.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"31650721541dfbe6b639e96645c0dfa1c64048b169b682135fb2d5ab6764a4ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): clippy_lints/src/implicit_return.rs:45-58 | clippy_lints/src/implicit_return.rs:60-78 \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":"clippy_lints/src/implicit_return.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"af41f30c1406d712c181a00dd05e238d26fc00d93c6b974c7519f06ce53c1604"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): clippy_lints/src/needless_pass_by_ref_mut.rs:454-470 | clippy_lints/src/needless_pass_by_ref_mut.rs:472-487 | clippy_lints/src/needless_pass_by_ref_mut.rs:514-529 \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":"clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd9fb22512bbb3c6403d83890aa9296d4530aa828023123a1e549a8f55c4474"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): clippy_lints/src/single_component_path_imports.rs:104-112 | clippy_lints/src/single_component_path_imports.rs:114-121 \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":"clippy_lints/src/single_component_path_imports.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ed3a75c2cb9b67cd786fbf8585b6d24bfe4849dae689bb1566321803065f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): clippy_dev/src/parse/cursor.rs:293-308 | clippy_dev/src/parse/cursor.rs:313-328 \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":"clippy_dev/src/parse/cursor.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca1ac86bbcdbaa61ef80d97f148d3abcdf2e553dc8da93d34828ff6c73fb9ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): clippy_lints/src/empty_line_after.rs:544-548 | clippy_lints/src/empty_line_after.rs:550-554 \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":"clippy_lints/src/empty_line_after.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"60359c5486bf3ce39b196fa0de1cb2ac411e09cae30fca1a49c974c7976f103e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): clippy_lints/src/methods/manual_saturating_arithmetic.rs:21-36 | clippy_lints/src/methods/manual_saturating_arithmetic.rs:43-58 \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":"clippy_lints/src/methods/manual_saturating_arithmetic.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ba6feb7eb851de03609c33c2c27bc224b3f200caa7b99a4a94a4ec153afe3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): clippy_utils/src/higher.rs:306-320 | clippy_utils/src/higher.rs:324-341 \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":"clippy_utils/src/higher.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c11b51d3a7b70c98bfeca00389f90d1ffffeadf2875bb4713715a9e93de700b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): clippy_utils/src/lib.rs:2258-2268 | clippy_utils/src/lib.rs:2284-2294 \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":"clippy_utils/src/lib.rs"},"region":{"startLine":2258}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c73aeb1a911cd3489809cb07a87941c604ec0459f79f065e17bd1b4d49d5e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): clippy_lints/src/manual_strip.rs:155-164 | clippy_lints_internal/src/symbols.rs:196-205 \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":"clippy_lints/src/manual_strip.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d861dae5c3407d2245d026eba19b6fd67ddb1fe29615121df921fcdde26594"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): clippy_lints/src/methods/is_empty.rs:49-59 | clippy_utils/src/lib.rs:169-178 \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":"clippy_lints/src/methods/is_empty.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12ec04da5d94bbe3f1736ec0c179ba75ae62b53c051ffacbb61a99eaf69ee2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): clippy_config/src/metadata.rs:45-57 | clippy_dev/src/utils.rs:175-183 | clippy_dev/src/utils.rs:187-195 \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":"clippy_config/src/metadata.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e9f6737eb7ad809a889f871bdfadb26448c33aaa45df6ea95855e6f8ae52a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): clippy_lints/src/methods/unnecessary_to_owned.rs:723-735 | clippy_utils/src/ty/mod.rs:1509-1514 \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":"clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"553fb5be3538f9cbf78db215af34c05853cd9fca994f25d418fc34f73a128b63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): clippy_lints/src/methods/range_zip_with_len.rs:69-80 | clippy_utils/src/lib.rs:1198-1208 \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":"clippy_lints/src/methods/range_zip_with_len.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"292d97029460651922d9f25012196b69dc0ef5f58212b7774eb1085cb3948800"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): clippy_lints/src/question_mark.rs:608-618 | clippy_lints/src/unused_io_amount.rs:275-284 \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":"clippy_lints/src/question_mark.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77e0ce87eec22d2f179bf2023ea461487cb0ff64856bced69112351b1c7604e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): clippy_lints/src/question_mark.rs:348-359 | clippy_utils/src/lib.rs:357-368 \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":"clippy_lints/src/question_mark.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"69131ab21a63f3afc675fde437fea16d8459150455f0040456730d3863130822"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): clippy_utils/src/lib.rs:1145-1154 | clippy_utils/src/visitors.rs:850-859 \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":"clippy_utils/src/lib.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d350be108f6f7c0acccb091f1641d9aeec719ab10abcab1f314f8ee95e80265e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): clippy_lints/src/methods/err_expect.rs:39-44 | clippy_lints/src/methods/ok_expect.rs:38-43 \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":"clippy_lints/src/methods/err_expect.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c8ffd4496121b3a185b5871cb47f7db636c551bd71f1000a67272790da812c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): clippy_lints/src/methods/or_then_unwrap.rs:64-72 | clippy_utils/src/lib.rs:306-314 \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":"clippy_lints/src/methods/or_then_unwrap.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8cd73ed2e944d7ce065aa6032b593ae75b1050acdb5789f0c48ad7bbd2625b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): clippy_utils/src/lib.rs:3450-3459 | clippy_utils/src/visitors.rs:790-799 \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":"clippy_utils/src/lib.rs"},"region":{"startLine":3450}}}],"partialFingerprints":{"codehealthFindingId/v1":"2567875982ddb6f63389cd9f9fcc9e9f781b6b0a321a5da590b543998bab0ea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): clippy_lints/src/derivable_impls.rs:71-77 | clippy_utils/src/hir_utils.rs:1729-1735 \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":"clippy_lints/src/derivable_impls.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02e16865fd66f1e3b0ad8da06110a2cefa3572d1802612f889086f91738c11e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): clippy_lints/src/loops/explicit_into_iter_loop.rs:34-42 | clippy_lints/src/loops/explicit_iter_loop.rs:92-101 \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":"clippy_lints/src/loops/explicit_into_iter_loop.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"84878a538c6464390270102ca15d4692d666ee92516e0946f5eb741147404049"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): clippy_lints/src/methods/single_char_add_str.rs:74-76 | clippy_lints/src/useless_vec.rs:306-308 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/single_char_add_str.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f774981c67372d8a5aaa659ab2688ee5150e5fa809448e983b72cbb741f6e85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): clippy_lints/src/casts/cast_possible_truncation.rs:17-23 | clippy_utils/src/consts.rs:1226-1232 \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":"clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5818dfc7b4f3ddac00baaf76a938424e848ce28966770b479b53d2b27340f5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): clippy_lints/src/incompatible_msrv.rs:270-274 | clippy_lints/src/methods/is_empty.rs:41-45 \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":"clippy_lints/src/incompatible_msrv.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a306a3ccc5dd4edd73fabe0cc7a849d88056071fe3bc2513945469c7f70f11b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): clippy_lints/src/manual_checked_ops.rs:169-171 | clippy_lints/src/operators/float_cmp.rs:181-183 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/manual_checked_ops.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f5a9659540d364bd451b9f3b2941f85df4a24fcc90c8352842f8ce3214890a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): clippy_lints/src/eta_reduction.rs:384-387 | clippy_lints/src/methods/unnecessary_to_owned.rs:670-672 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/eta_reduction.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"0586a4687a3e0319d4d87c010f04d052aaed301edb52cb2e4623dfb45bafff0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201339 lines \u00D7 2): clippy_utils/src/ast_utils/mod.rs:333-371 | clippy_utils/src/ast_utils/mod.rs:599-636 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_utils/src/ast_utils/mod.rs:333\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"786b353e2fa87e05ec54115e52f9961de621aa12e8ca685e1e3555ec8a8faf80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 3): clippy_utils/src/ast_utils/mod.rs:358-386 | clippy_utils/src/ast_utils/mod.rs:537-566 | clippy_utils/src/ast_utils/mod.rs:623-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_utils/src/ast_utils/mod.rs:537\u0060 it does not close everything it opens, so those exact 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":"clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"0266f0ee67697f5902faa0dccd13aff186cd284bc0304a2f5abf5e6e11801762"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): clippy_lints/src/legacy_numeric_constants.rs:212-238 | clippy_utils/src/consts.rs:830-857 \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":"clippy_lints/src/legacy_numeric_constants.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff74eca2774a7ecdebfeec903994d82d2c5bd407d2a74afd0b2162589c27a26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): clippy_lints_internal/src/repeated_is_diagnostic_item.rs:295-318 | clippy_lints_internal/src/repeated_is_diagnostic_item.rs:361-384 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints_internal/src/repeated_is_diagnostic_item.rs:295\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":"clippy_lints_internal/src/repeated_is_diagnostic_item.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc14c6848f1a9fd4596378a48c462753de9d120f7a5472668679a19e2cb887af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): clippy_lints/src/reserve_after_initialization.rs:75-97 | clippy_lints/src/reserve_after_initialization.rs:104-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/reserve_after_initialization.rs:75\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":"clippy_lints/src/reserve_after_initialization.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5b959d7c7bb1014ac2243e361028f910a988d35222521687b3be17e628c26c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): clippy_lints_internal/src/repeated_is_diagnostic_item.rs:267-288 | clippy_lints_internal/src/repeated_is_diagnostic_item.rs:333-354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints_internal/src/repeated_is_diagnostic_item.rs:267\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints_internal/src/repeated_is_diagnostic_item.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"febf27c193fdb3f6434011397e1f09f989a70b3aed17c7a125917b360eb90cad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): clippy_dev/src/deprecate_lint.rs:38-56 | clippy_dev/src/deprecate_lint.rs:90-108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_dev/src/deprecate_lint.rs:38\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":"clippy_dev/src/deprecate_lint.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ddf0c1a5f291187646629cfdc50d1164fb1e31cf3635e191cf7ed9d61637a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): clippy_lints/src/methods/clone_on_copy.rs:100-117 | clippy_lints/src/methods/clone_on_copy.rs:156-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/methods/clone_on_copy.rs:100\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/clone_on_copy.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1333cf92c0d9bb7f40b81e3a09d5d33eddefe87bbee07340b3fc9fd1024702a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): clippy_utils/src/ast_utils/mod.rs:313-331 | clippy_utils/src/ast_utils/mod.rs:517-535 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_utils/src/ast_utils/mod.rs:313\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060clippy_utils/src/ast_utils/mod.rs:311\u0060 calls \u0060ExternCrate\u0060, \u0060eq_id\u0060, \u0060Use\u0060 and \u0060clippy_utils/src/ast_utils/mod.rs:516\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":"clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55ff7361c1944308c4fe084bdea1309f8ad4b9d38a440413cd7e8e82bb281ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): clippy_utils/src/ast_utils/mod.rs:576-594 | clippy_utils/src/ast_utils/mod.rs:662-680 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_utils/src/ast_utils/mod.rs:576\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":"clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4da510f636413099a26b10581537cca0046a54823322dfce1932ca1ac54ed1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): clippy_lints/src/loops/while_let_on_iterator.rs:213-230 | clippy_lints/src/loops/while_let_on_iterator.rs:254-270 \u2014 both copies are in the same file, so extract the block 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":"clippy_lints/src/loops/while_let_on_iterator.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"7632874c87c6d351b51d278175ba4d2a43a8005be4d15546cd8710893b9be247"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): clippy_lints/src/undocumented_unsafe_blocks.rs:257-274 | clippy_lints/src/undocumented_unsafe_blocks.rs:280-296 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/undocumented_unsafe_blocks.rs:257\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb94da4166810c7479104a9f3f1612d1d89adc49a954d4e05df93dde277f4d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): clippy_lints/src/casts/cast_possible_wrap.rs:99-115 | clippy_lints/src/casts/cast_sign_loss.rs:57-73 \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":"clippy_lints/src/casts/cast_possible_wrap.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"25221e661b738c668df1db10b9df84df9f043a26124279240f715457bd3fb908"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): clippy_lints/src/disallowed_items.rs:318-334 | clippy_lints/src/disallowed_items.rs:341-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 \u0060clippy_lints/src/disallowed_items.rs:318\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":"clippy_lints/src/disallowed_items.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"2defe347a87f68f8d90b2bb60f338277252ce417e385b132307114740035870d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): clippy_lints/src/manual_pop_if.rs:214-231 | clippy_lints/src/manual_pop_if.rs:374-391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/manual_pop_if.rs:214\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, \u0060clippy_lints/src/manual_pop_if.rs:373\u0060 calls \u0060typeck_results\u0060, \u0060expr_ty\u0060, \u0060is_bool\u0060 and \u0060clippy_lints/src/manual_pop_if.rs:213\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":"clippy_lints/src/manual_pop_if.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff45a34365c00a2ca20e800f5362b91c31307dbfcc50b28c3dba03f506a411d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): clippy_lints/src/needless_continue.rs:493-509 | clippy_lints/src/needless_continue.rs:527-543 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/needless_continue.rs:493\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":"clippy_lints/src/needless_continue.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d3a4bc6a640f65d2d213af50ae358f6e93b7d3c535399a98b3fbe45be05210"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): clippy_lints/src/casts/ptr_as_ptr.rs:47-61 | clippy_lints/src/casts/ref_as_ptr.rs:42-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":"clippy_lints/src/casts/ptr_as_ptr.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4994c1bcff917398633d792e11c409bcb6ea277a7294cc49dcbe38c464a152ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): clippy_lints_internal/src/repeated_is_diagnostic_item.rs:422-436 | clippy_lints_internal/src/repeated_is_diagnostic_item.rs:475-489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints_internal/src/repeated_is_diagnostic_item.rs:422\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints_internal/src/repeated_is_diagnostic_item.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b342a06c3be78d642044f49610afcd75c86bf5b449a004de4aa39da9d3578e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): clippy_utils/src/ty/mod.rs:1234-1249 | clippy_utils/src/ty/mod.rs:1397-1412 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_utils/src/ty/mod.rs:1234\u0060 it does not close everything it opens, so those exact 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 \u0060ty\u0060 to \u0060Ty\u003C\u0027_\u003E\u0060 in one and \u0060Ty\u003C\u0027tcx\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":"clippy_utils/src/ty/mod.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"492907fe846fabce723dc5083d3ae526331dfdf51d787bec080ec9ce7530faa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): clippy_lints/src/functions/must_use.rs:36-49 | clippy_lints/src/functions/must_use.rs:72-85 | clippy_lints/src/functions/must_use.rs:109-122 \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 \u0060clippy_lints/src/functions/must_use.rs:36\u0060 it does not close everything it opens, so those exact 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\u0026\u0027tcx hir::Item\u003C\u0027_\u003E\u0060 in one and \u0060\u0026\u0027tcx hir::ImplItem\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060clippy_lints/src/functions/must_use.rs:70\u0060 calls \u0060hir_attrs\u0060, \u0060hir_id\u0060 and \u0060clippy_lints/src/functions/must_use.rs:35\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":"clippy_lints/src/functions/must_use.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04c9b4973ec009fc0959af60b871bdf9e9e51b9ce88c861a37babf64d9b3de0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201314 lines \u00D7 2): clippy_lints/src/assigning_clones.rs:225-238 | clippy_lints/src/assigning_clones.rs:260-266 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/assigning_clones.rs:225\u0060 it does not close everything it opens, so those exact 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":"clippy_lints/src/assigning_clones.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"e383bc6f8fc527e6fc0025a62aabc1f215a324715a739c677bf0d8c98b425cb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): clippy_lints/src/doc/include_in_doc_without_cfg.rs:14-27 | clippy_lints/src/large_include_file.rs:94-107 \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":"clippy_lints/src/doc/include_in_doc_without_cfg.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f516523fbf81bf6d02cfd60f4d6bf3325e64abcabc489b0df4f0e0a7d3c059be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): clippy_lints/src/methods/ptr_offset_by_literal.rs:20-33 | clippy_lints/src/methods/ptr_offset_with_cast.rs:21-34 \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 \u0060clippy_lints/src/methods/ptr_offset_by_literal.rs:20\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":"clippy_lints/src/methods/ptr_offset_by_literal.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f2fa532bebfab0b638b487d48c5147c729c2b5a117e40faa0f012358b93848"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): clippy_lints/src/operators/op_ref.rs:76-85 | clippy_lints/src/operators/op_ref.rs:124-137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/operators/op_ref.rs:76\u0060 it does not close everything it opens, so those exact 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":"clippy_lints/src/operators/op_ref.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c1f1e8869117f0717f042f66c20f77520243a54f47447953195412e7c2106e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): clippy_lints/src/undocumented_unsafe_blocks.rs:127-140 | clippy_lints/src/undocumented_unsafe_blocks.rs:361-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 \u0060clippy_lints/src/undocumented_unsafe_blocks.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060cx\u0060 to \u0060\u0026LateContext\u003C\u0027tcx\u003E\u0060 in one and \u0060\u0026LateContext\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":"clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"609c88d23303b3bbe60bbb85e9e4f999d1d638b982eb1dfc11497241ba1c88a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): clippy_lints/src/arbitrary_source_item_ordering.rs:410-422 | clippy_lints/src/arbitrary_source_item_ordering.rs:426-438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/arbitrary_source_item_ordering.rs:410\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":"clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"348553d3c02d8298228db5e0a59a184018383ce651d36f1b9f9e2c01dc9b5684"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): clippy_lints/src/casts/needless_type_cast.rs:66-78 | clippy_lints/src/casts/needless_type_cast.rs:97-109 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/casts/needless_type_cast.rs:66\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/casts/needless_type_cast.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6922a10606fe8cee40ee3fc39f44e8eb037b4ca08cbc399b2d7cec09a6639a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): clippy_lints/src/equatable_if_let.rs:78-90 | clippy_lints/src/pattern_type_mismatch.rs:176-185 \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 \u0060clippy_lints/src/equatable_if_let.rs:78\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/equatable_if_let.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4b3e7c6755ab600f871fb31a93b74a5c7563ab58f34349fd576fbd50866f45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): clippy_lints/src/floating_point_arithmetic/custom_abs.rs:19-32 | clippy_lints/src/floating_point_arithmetic/custom_abs.rs:36-49 \u2014 both copies are in the same file, so extract the block 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":"clippy_lints/src/floating_point_arithmetic/custom_abs.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"946a99d5a1a6b3604f6f50e4fc06a804c19483145f80fa61184516a69f7c1d83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): clippy_lints/src/methods/option_zip_none.rs:61-70 | clippy_lints/src/methods/option_zip_none.rs:75-87 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/methods/option_zip_none.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":"clippy_lints/src/methods/option_zip_none.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5042ba56d06f04d7a97bc34be252b0e5ee93c25cc45ae98ae19b559adb2c6b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): clippy_lints/src/missing_doc.rs:200-212 | clippy_lints/src/missing_doc.rs:221-233 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/missing_doc.rs:200\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\u0026\u0027tcx TraitItem\u003C\u0027_\u003E\u0060 in one and \u0060\u0026\u0027tcx ImplItem\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":"clippy_lints/src/missing_doc.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c848f03805962b306baf9a86feb74cb9bebb6dac998ac46f820ba8846bf6316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): clippy_lints/src/needless_pass_by_ref_mut.rs:473-485 | clippy_lints/src/needless_pass_by_ref_mut.rs:516-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"d970dc0015c6d1ccadc48960d990da63e28b8bed59761daef7eeca031d3b5d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): clippy_utils/src/res.rs:140-152 | clippy_utils/src/res.rs:236-248 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_utils/src/res.rs:140\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":"clippy_utils/src/res.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"414c14cacdc642aa45eecf8546db1e944cb054a0eea6ace4bd71fa5d07e185e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): clippy_lints/src/arbitrary_source_item_ordering.rs:312-322 | clippy_lints/src/arbitrary_source_item_ordering.rs:346-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 \u0060clippy_lints/src/arbitrary_source_item_ordering.rs:312\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab362ad2a0416ba2ee48a91000b8e8136bed1ca4059aa46379efd8aaa095825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): clippy_lints/src/implicit_saturating_sub.rs:363-374 | clippy_lints/src/implicit_saturating_sub.rs:378-389 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/implicit_saturating_sub.rs:363\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":"clippy_lints/src/implicit_saturating_sub.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"182aae96bab882263681849c6cb7c10183b934f4896f619e5d6e9cd5d61524be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): clippy_lints/src/manual_pop_if.rs:275-286 | clippy_lints/src/manual_pop_if.rs:328-337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/manual_pop_if.rs:275\u0060 it does not close everything it opens, so those exact 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":"clippy_lints/src/manual_pop_if.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"237b806a07d081ffc84136680316cf30123464ca6f02f2be9d72a16d9b882b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): clippy_lints/src/matches/match_like_matches.rs:41-52 | clippy_lints/src/matches/match_like_matches.rs:173-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/matches/match_like_matches.rs:41\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/match_like_matches.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe530141814e638d38d747820bfabef927a1c80e0a06d71b85479308491e6df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): clippy_lints/src/types/mod.rs:619-630 | clippy_lints/src/types/mod.rs:633-644 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/types/mod.rs:619\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":"clippy_lints/src/types/mod.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8ed5560f16ce5f1dd96365ad646cfd020b6b2eb6358e18d1410245c4f64c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): clippy_config/src/types.rs:162-172 | clippy_config/src/types.rs:197-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_config/src/types.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":"clippy_config/src/types.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1e8bfe7c01c976dfa54c579bea9dd4980af7420fc37952ce1f0b4562f4e464"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): clippy_lints/src/methods/mod.rs:5616-5626 | clippy_lints/src/methods/mod.rs:5634-5644 \u2014 both copies are in the same file, so extract the block 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":"clippy_lints/src/methods/mod.rs"},"region":{"startLine":5616}}}],"partialFingerprints":{"codehealthFindingId/v1":"681e946832a2d601950925502081ca168b9739d4ebb3c0e78873bdcf1938e6d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): clippy_lints/src/mut_mut.rs:59-69 | clippy_lints/src/mut_mut.rs:115-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 \u0060clippy_lints/src/mut_mut.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/mut_mut.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fddafae01135b4fb10d5ce546117007b97fbc6668a383ec3d87b92a1510df2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): clippy_lints/src/unconditional_recursion.rs:133-143 | clippy_lints/src/unconditional_recursion.rs:238-248 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/unconditional_recursion.rs:133\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/unconditional_recursion.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3445b0660d8ec0dd203142ef1dc8f01099aea565499cbb62a62cd834306ed398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): clippy_lints_internal/src/repeated_is_diagnostic_item.rs:283-292 | clippy_lints_internal/src/repeated_is_diagnostic_item.rs:313-322 | clippy_lints_internal/src/repeated_is_diagnostic_item.rs:349-358 | clippy_lints_internal/src/repeated_is_diagnostic_item.rs:379-388 \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 \u0060clippy_lints_internal/src/repeated_is_diagnostic_item.rs:283\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints_internal/src/repeated_is_diagnostic_item.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59f8966fc0511c69b9cf59fb3b6e18ca5875feedbd6ce9ef785181c573e54ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): clippy_dev/src/utils.rs:483-492 | clippy_dev/src/utils.rs:513-522 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_dev/src/utils.rs:483\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":"clippy_dev/src/utils.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb24c123c84011f87f0de811fd8a655592a690cada2d76e2980fb5d77d477fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): clippy_lints/src/doc/markdown.rs:133-141 | clippy_lints/src/doc/markdown.rs:163-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/doc/markdown.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd915b9b2d5c0fee48c9aaafbe6e886b7af06fadbe8990fc522db61ee01866e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): clippy_lints/src/functions/must_use.rs:334-343 | clippy_lints/src/functions/must_use.rs:347-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/functions/must_use.rs:334\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":"clippy_lints/src/functions/must_use.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0129247f1d7c52523caec976ed69cb6ff3a0f606d2ad63e3c359017e756fb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): clippy_lints/src/matches/redundant_guards.rs:30-42 | clippy_lints/src/matches/redundant_guards.rs:49-61 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/matches/redundant_guards.rs:30\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/redundant_guards.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aae7d2a931b4566a0a545bfa86d686b2f2fdfeeea25b7f529a6662bb505cf4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): clippy_lints/src/non_copy_const.rs:768-777 | clippy_lints/src/non_copy_const.rs:829-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 \u0060clippy_lints/src/non_copy_const.rs:768\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060\u0026\u0027tcx TraitItem\u003C\u0027_\u003E\u0060 in one and \u0060\u0026\u0027tcx ImplItem\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":"clippy_lints/src/non_copy_const.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"424505af24978df71b3f04b356a48afba9fb2ab3406532e1774054fd20b38f64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): clippy_lints/src/operators/assign_op_pattern.rs:135-154 | clippy_lints/src/operators/assign_op_pattern.rs:161-180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/operators/assign_op_pattern.rs:135\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":"clippy_lints/src/operators/assign_op_pattern.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d26151c8ded8bb4df959d108bb8aa53089ec93a7bc41e42f0811a9a0c4d4aef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): clippy_lints/src/operators/manual_div_ceil.rs:30-39 | clippy_lints/src/operators/manual_div_ceil.rs:41-50 \u2014 both copies are in the same file, so extract the block 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":"clippy_lints/src/operators/manual_div_ceil.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b15abcbd219ed0a8acd315416917a0662a037981d4f064bc6471a155328052"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): clippy_lints/src/ranges.rs:244-253 | clippy_lints/src/ranges.rs:279-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/ranges.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":"clippy_lints/src/ranges.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"51754998049eb9207ce3a064d8eb256681580045076d8c6a3c700481d451695e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): clippy_utils/src/mir/mod.rs:125-134 | clippy_utils/src/mir/mod.rs:140-149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/mir/mod.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"11020ce40537cd975dd80ac074dd839e3d3bf481fe8c64f2cc289a9f4ba24fb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): clippy_utils/src/ty/mod.rs:642-651 | clippy_utils/src/ty/mod.rs:656-666 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_utils/src/ty/mod.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":"clippy_utils/src/ty/mod.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"7695b926f868e290b6b6f7a0a57c4a578bdeaac74932f401236705460f2b4d36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): clippy_dev/src/edit_lints.rs:25-33 | clippy_dev/src/edit_lints.rs:59-67 | clippy_dev/src/edit_lints.rs:110-118 \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 \u0060clippy_dev/src/edit_lints.rs:25\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_dev/src/edit_lints.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d71bb2a4fd44d848c6dc6be5a811e17dfefdafc99784c4f34c8efb8424eb624"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): clippy_lints/src/arbitrary_source_item_ordering.rs:286-295 | clippy_lints/src/arbitrary_source_item_ordering.rs:357-366 | clippy_lints/src/arbitrary_source_item_ordering.rs:453-462 \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 \u0060clippy_lints/src/arbitrary_source_item_ordering.rs:286\u0060 it does not close everything it opens, so those exact 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 \u0060cx\u0060 to \u0060\u0026LateContext\u003C\u0027_\u003E\u0060 in one and \u0060\u0026LateContext\u003C\u0027tcx\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":"clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbc316b03f91f81f1856fd949c0b333ebfbe9fccee670a9332718c27dbe3b74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): clippy_dev/src/edit_lints.rs:36-44 | clippy_dev/src/edit_lints.rs:70-78 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_dev/src/edit_lints.rs:36\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_dev/src/edit_lints.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b64bb0928570442c9f62f072c5326b4018bb3b31ba8f3838e62fad841bb488"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): clippy_lints/src/booleans.rs:170-178 | clippy_lints/src/booleans.rs:180-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. 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":"clippy_lints/src/booleans.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"991f29ec3cd25f4b63fbc507f0fb418d41736f4e8388979a4d30f7c74131e0e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): clippy_lints/src/empty_with_brackets.rs:306-314 | clippy_lints/src/empty_with_brackets.rs:327-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/empty_with_brackets.rs:306\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":"clippy_lints/src/empty_with_brackets.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc274263db0419d031c30724798221dbeb3c4f6293affb0fd7bd0363a1455e47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): clippy_lints/src/lifetimes.rs:729-737 | clippy_lints/src/lifetimes.rs:750-758 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/lifetimes.rs:729\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/lifetimes.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"958a36fe4d8e38c85779a70eba98e90e82e29b9ce3d918b2f75ff7388ab2a5d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): clippy_lints/src/macro_use.rs:176-184 | clippy_lints/src/macro_use.rs:188-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/macro_use.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1fbc890ed1b48b7e095b4c254b299a0f629a7dd9ed4b330791a5b0e33b3184"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): clippy_lints/src/matches/match_same_arms.rs:289-297 | clippy_lints/src/matches/match_same_arms.rs:313-321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/matches/match_same_arms.rs:289\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"9732d5dacf6efdd58b9ef725b709720eb32671be3f09b805760df0caa6df514b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): clippy_lints/src/methods/map_unwrap_or.rs:192-201 | clippy_lints/src/option_if_let_else.rs:297-306 \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 \u0060clippy_lints/src/methods/map_unwrap_or.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060expr\u0060 to \u0060\u0026\u0027tcx rustc_hir::Expr\u003C\u0027_\u003E\u0060 in one and \u0060\u0026\u0027tcx Expr\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":"clippy_lints/src/methods/map_unwrap_or.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15b86a18044c39ed8daa0ecea343a34921f206cb1493f33e5ba4cab483338aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): clippy_lints/src/misc.rs:185-193 | clippy_lints/src/misc.rs:196-204 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"clippy_lints/src/misc.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"883f5ff542eea7443e1bf337d5dc78646bc443e109d2cbd21e4e828e5dcdb66a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): clippy_lints/src/missing_asserts_for_indexing.rs:242-250 | clippy_lints/src/missing_asserts_for_indexing.rs:305-313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/missing_asserts_for_indexing.rs:242\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/missing_asserts_for_indexing.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c411fe15ba684bd3ba065a585466825522c9a2d7f73f8e2e59a53183261517"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): clippy_lints/src/operators/op_ref.rs:113-123 | clippy_lints/src/operators/op_ref.rs:146-156 \u2014 both copies are in the same file, so extract the block 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":"clippy_lints/src/operators/op_ref.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeff9b3328cd47ca088bd1561a3985b7c6484af1faa4895fbbd0c41a4f543ecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): clippy_utils/src/ty/mod.rs:850-858 | clippy_utils/src/ty/mod.rs:891-899 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_utils/src/ty/mod.rs:850\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":"clippy_utils/src/ty/mod.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"052276fdcefb722f3241f445cf129968a4c340c8ccf7e0d530ca116d757608ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): clippy_lints/src/arbitrary_source_item_ordering.rs:282-289 | clippy_lints/src/arbitrary_source_item_ordering.rs:318-325 | clippy_lints/src/arbitrary_source_item_ordering.rs:353-360 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/arbitrary_source_item_ordering.rs:282\u0060 it does not close everything it opens, so those exact 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":"clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c028d1368ac9103696fdab12b98ac0ac8a648792f0d21af0ad74601037de517d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): clippy_dev/src/fmt.rs:144-151 | clippy_dev/src/fmt.rs:156-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_dev/src/fmt.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a00b0d08220707ad7546511f9cbdff72a118a329af6d5687d6ef299186ebf28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): clippy_lints/src/manual_let_else.rs:311-318 | clippy_lints/src/manual_let_else.rs:323-330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060clippy_lints/src/manual_let_else.rs:319\u0060 calls \u0060sess\u0060, \u0060source_map\u0060, \u0060span_to_snippet\u0060 and \u0060clippy_lints/src/manual_let_else.rs:331\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":"clippy_lints/src/manual_let_else.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c82c9f2aa9dc3af932bd705176daa36175e77280cda365ae8226a8d785f0b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): clippy_lints/src/methods/iter_filter.rs:65-72 | clippy_lints/src/methods/iter_filter.rs:80-87 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/methods/iter_filter.rs:65\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/iter_filter.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7133ad34b7dc9c83ee2cf3e0af8b7b550cc5b6fd284d324cda05656af2a329f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): clippy_lints/src/methods/map_unwrap_or.rs:163-170 | clippy_lints/src/option_if_let_else.rs:271-278 \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":"clippy_lints/src/methods/map_unwrap_or.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44a1516ac2eef57f60c174d388a301047c37ed536c073e57d8783d765ccd86f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): clippy_lints/src/methods/mod.rs:6016-6023 | clippy_lints/src/methods/mod.rs:6039-6046 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/methods/mod.rs:6016\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/mod.rs"},"region":{"startLine":6016}}}],"partialFingerprints":{"codehealthFindingId/v1":"794e249d50172430d68d8cc38e0ec213cf93f1cc7792771fab5f6f160886f5cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): clippy_lints/src/operators/op_ref.rs:98-106 | clippy_lints/src/operators/op_ref.rs:160-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/operators/op_ref.rs:98\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/operators/op_ref.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1dc84a0d989c91a4de2ad427e43100d201961885e9b8553119e6b33a25e89bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): clippy_lints/src/tuple_array_conversions.rs:91-103 | clippy_lints/src/tuple_array_conversions.rs:137-149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/tuple_array_conversions.rs:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/tuple_array_conversions.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"071448fb55ac1950914db468e2fea45308a0ce5d3abde89dc11cbfd362cda7c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): clippy_lints/src/undocumented_may_panic_call.rs:174-181 | clippy_lints/src/undocumented_unsafe_blocks.rs:807-814 \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 \u0060clippy_lints/src/undocumented_may_panic_call.rs:174\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/undocumented_may_panic_call.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b07ab74e9599fb48c6abe029d514b40eeb6d2e25219bf504f18a631955a576"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): clippy_lints/src/undocumented_unsafe_blocks.rs:150-158 | clippy_lints/src/undocumented_unsafe_blocks.rs:178-186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/undocumented_unsafe_blocks.rs:150\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d272b1abdf5113e7a22448814a4806300e6e8c82234c27bb7a3c38d4780233f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): clippy_utils/src/eager_or_lazy.rs:169-176 | clippy_utils/src/eager_or_lazy.rs:178-185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fa9547b47e05e48b8156fd5b50d512e42e69546807509e3bd2de8f5101778b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): clippy_utils/src/lib.rs:272-280 | clippy_utils/src/lib.rs:287-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/lib.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ea2c1c8e47655b111a647e6cda1c2c6919259c112dcbc5b6d683b19a02bea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): clippy_lints/src/arbitrary_source_item_ordering.rs:285-291 | clippy_lints/src/arbitrary_source_item_ordering.rs:321-327 | clippy_lints/src/arbitrary_source_item_ordering.rs:356-362 | clippy_lints/src/arbitrary_source_item_ordering.rs:452-458 \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 \u0060clippy_lints/src/arbitrary_source_item_ordering.rs:285\u0060 it does not close everything it opens, so those exact 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 \u0060cx\u0060 to \u0060\u0026LateContext\u003C\u0027_\u003E\u0060 in one and \u0060\u0026LateContext\u003C\u0027tcx\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":"clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"3895331f95e0c5e9ef945aebf7ed6a04ce7c01ecb7c897ad93e96ab9a6ef1fed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): clippy_lints/src/missing_doc.rs:167-173 | clippy_lints/src/missing_doc.rs:201-207 | clippy_lints/src/missing_doc.rs:222-228 \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 \u0060clippy_lints/src/missing_doc.rs:167\u0060 it does not close everything it opens, so those exact 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\u0026\u0027tcx Item\u003C\u0027_\u003E\u0060 in one and \u0060\u0026\u0027tcx TraitItem\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":"clippy_lints/src/missing_doc.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"47277d7b12690a6685523ffbdd90e29958039591b47feb9b88d0e59d30bf0c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): clippy_dev/src/edit_lints.rs:84-90 | clippy_dev/src/edit_lints.rs:156-162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_dev/src/edit_lints.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2c1b8d672e1f01cc77acc7451affc75520c97f96c862191404efbf09453cfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): clippy_dev/src/parse.rs:362-370 | clippy_dev/src/parse.rs:389-397 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_dev/src/parse.rs:362\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_dev/src/parse.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c709eb6d534d8f2dd55391c59021ad37bfb5dedc01f19d1c4b14d8993ee341"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): clippy_lints/src/floating_point_arithmetic/mul_add.rs:67-73 | clippy_lints/src/floating_point_arithmetic/powi.rs:19-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. 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":"clippy_lints/src/floating_point_arithmetic/mul_add.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca07f3dc94bbef9732729722d5ec5d8726fc3cbb9aa6eedd1fcf1a37273f68e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): clippy_lints/src/loops/manual_slice_fill.rs:75-81 | clippy_lints/src/loops/manual_slice_fill.rs:92-97 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/loops/manual_slice_fill.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"009180576fd53e8d97bb9848915c7729e7bf71c228905958240cf95c67972fee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): clippy_lints/src/loops/mut_range_bound.rs:89-96 | clippy_lints/src/loops/mut_range_bound.rs:100-107 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/loops/mut_range_bound.rs:89\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":"clippy_lints/src/loops/mut_range_bound.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"463fa3481d2012b4c53f70d238ec4a5eea4941e4404cb5eff732d0b50610ad41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): clippy_lints/src/manual_pop_if.rs:252-261 | clippy_lints/src/manual_pop_if.rs:318-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/manual_pop_if.rs:252\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/manual_pop_if.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a63e5dbf27a04c8ce8884969c9ac8fc7a919b636ca2ef04a07f9edd660d9a23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): clippy_lints/src/matches/redundant_pattern_match.rs:516-529 | clippy_lints/src/matches/redundant_pattern_match.rs:542-555 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/matches/redundant_pattern_match.rs:516\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":"clippy_lints/src/matches/redundant_pattern_match.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0232f5adf7dd6104ab1787e0bebe9d78305cd96a28f6e3470cfbe2288bf3408"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): clippy_lints/src/vec_init_then_push.rs:160-166 | clippy_lints/src/vec_init_then_push.rs:183-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/vec_init_then_push.rs:160\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/vec_init_then_push.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7c94f05b38b84181b1114f484eb3344352382294851568a094b9c6efea493c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): clippy_utils/src/ty/mod.rs:1080-1086 | clippy_utils/src/ty/mod.rs:1090-1096 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_utils/src/ty/mod.rs:1080\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/ty/mod.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6b33fb6ee7bf3f60eb9d19f0c15f6fa4d972e2a426ae1c034811b90a9f22c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): clippy_lints/src/booleans.rs:160-165 | clippy_lints/src/booleans.rs:180-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. 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":"clippy_lints/src/booleans.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb999b79be35a8034f671c19ef5144965bc4eaf88e9b1ffb00fe339492387cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): clippy_lints/src/floating_point_arithmetic/radians.rs:49-56 | clippy_lints/src/floating_point_arithmetic/radians.rs:75-82 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/floating_point_arithmetic/radians.rs:49\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/floating_point_arithmetic/radians.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c939a7296a14f83e579f1f76312417758de9f5652adcaf8681c349d477b9ebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): clippy_lints/src/functions/result.rs:58-64 | clippy_lints/src/functions/result.rs:78-84 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/functions/result.rs:58\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":"clippy_lints/src/functions/result.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d851f8c54747de7725d9574e6b61936c78fd8519fb8583a3bff6bbcc572f74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): clippy_lints/src/methods/unnecessary_first_then_check.rs:28-34 | clippy_lints/src/methods/unnecessary_get_then_check.rs:39-44 \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 \u0060clippy_lints/src/methods/unnecessary_first_then_check.rs:28\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":"clippy_lints/src/methods/unnecessary_first_then_check.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa713bf3d65c77864a2997b9d42509ab736f4752ad681c286e10ba78847f63e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): clippy_lints/src/operators/identity_op.rs:47-54 | clippy_lints/src/operators/identity_op.rs:60-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. 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":"clippy_lints/src/operators/identity_op.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"920e159c08d6b29281c61bc01f2d7e0f3de19e68ccf2481361562218aa74b2c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): clippy_utils/src/consts.rs:1066-1071 | clippy_utils/src/consts.rs:1094-1099 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_utils/src/consts.rs:1066\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":"clippy_utils/src/consts.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c41f679a6d53be5bd3ca307a780f20ffa7f82cd203c99e8a0a8c648d4fdf79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): clippy_utils/src/visitors.rs:119-124 | clippy_utils/src/visitors.rs:165-170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060clippy_utils/src/visitors.rs:173\u0060 calls \u0060visit_anon_const\u0060, \u0060Continue\u0060 and \u0060clippy_utils/src/visitors.rs:127\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":"clippy_utils/src/visitors.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6b41e6f6eceb1c5853b6668e8da1750cf3718319a8c541fe2fb6e7c3afd91c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): clippy_utils/src/visitors.rs:450-456 | clippy_utils/src/visitors.rs:465-471 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_utils/src/visitors.rs:450\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":"clippy_utils/src/visitors.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"56619e0ea11e3442ed3c7d657e768cd4dc1ea087814336b01ffcd13efbfa3469"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): clippy_utils/src/visitors.rs:624-633 | clippy_utils/src/visitors.rs:811-820 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_utils/src/visitors.rs:624\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":"clippy_utils/src/visitors.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e97c662f495074ef260c4a923a6facbc67561df8b7dbf351c813eb4a4e87a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): clippy_lints/src/await_holding_invalid.rs:295-299 | clippy_lints/src/entry.rs:763-767 \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":"clippy_lints/src/await_holding_invalid.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"8419aa227d3df7df4a3c25ccf34621cd22d67e79459d2a9d608229cd9b2af5cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): clippy_lints/src/casts/cast_slice_from_raw_parts.rs:46-51 | clippy_lints/src/casts/cast_slice_from_raw_parts.rs:84-89 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/casts/cast_slice_from_raw_parts.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/casts/cast_slice_from_raw_parts.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0c5b09c043fb0f00aba63b4d159fc3bd321aa66c5e88dea0235015fc58c807"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): clippy_lints/src/extra_unused_type_parameters.rs:265-269 | clippy_lints/src/extra_unused_type_parameters.rs:281-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/extra_unused_type_parameters.rs:265\u0060 it does not close everything it opens, so those exact 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\u0026\u0027tcx Item\u003C\u0027tcx\u003E\u0060 in one and \u0060\u0026\u0027tcx ImplItem\u003C\u0027tcx\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":"clippy_lints/src/extra_unused_type_parameters.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48a35587744dd9f2aacbc470816d439e99a80944ff0ff5a0a4d4aa83cb31688"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): clippy_lints/src/manual_retain.rs:89-93 | clippy_lints/src/manual_retain.rs:136-140 | clippy_lints/src/manual_retain.rs:193-195 \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 \u0060clippy_lints/src/manual_retain.rs:89\u0060 it does not close everything it opens, so those exact 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":"clippy_lints/src/manual_retain.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"781c8104c0be6c744c588d1de0574e85448b3bf1284d77a9a7d5aea2a49faac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): clippy_lints/src/methods/unnecessary_sort_by.rs:178-182 | clippy_lints/src/methods/unnecessary_sort_by.rs:206-210 \u2014 both copies are in the same file, so extract the block 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":"clippy_lints/src/methods/unnecessary_sort_by.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7932e0f2c822aae6f20bb1f5b0bd792e1fc7b32e2fa178c30c17d30819709997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): clippy_lints/src/min_ident_chars.rs:147-151 | clippy_lints/src/missing_doc.rs:158-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060clippy_lints/src/min_ident_chars.rs:146\u0060 calls \u0060Mod\u0060 and \u0060clippy_lints/src/missing_doc.rs:157\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":"clippy_lints/src/min_ident_chars.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"05757266d5cad29d8d5e7dccc18e05f494274b0e65743e5960e8501e8783c16c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): clippy_lints/src/ranges.rs:231-235 | clippy_lints/src/ranges.rs:267-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060clippy_lints/src/ranges.rs:228\u0060 calls \u0060partial_cmp\u0060, \u0060typeck_results\u0060, \u0060expr_ty\u0060 and \u0060clippy_lints/src/ranges.rs:264\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":"clippy_lints/src/ranges.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39d2d4be606736278adb567ef459c6f9f6f66e7a6a1c639b0aa2ca7f4323dad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): clippy_lints_internal/src/repeated_is_diagnostic_item.rs:439-443 | clippy_lints_internal/src/repeated_is_diagnostic_item.rs:492-496 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints_internal/src/repeated_is_diagnostic_item.rs:439\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints_internal/src/repeated_is_diagnostic_item.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f985eda25e2cc66241568dac34105276d13681bb3a6ae6313c257d30f8bc9d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): clippy_utils/src/consts.rs:314-319 | clippy_utils/src/consts.rs:367-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 \u0060clippy_utils/src/consts.rs:314\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/consts.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6032853b9576bf43f3fa2cc71c493625562b5ebd8d3232fb00e0b79fe36213"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): clippy_utils/src/consts.rs:336-340 | clippy_utils/src/consts.rs:390-394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/consts.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f65a01f1c39107bdd9724f4baf80c90ae55ab310c656d37a00a0580d22a813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): clippy_utils/src/consts.rs:344-349 | clippy_utils/src/consts.rs:400-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_utils/src/consts.rs:344\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/consts.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"411048daa78e27620d50736f103d884a945cc72c2e4a576aa91ed0ec7d5386bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): clippy_utils/src/consts.rs:1112-1116 | clippy_utils/src/consts.rs:1126-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 \u0060clippy_utils/src/consts.rs:1112\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":"clippy_utils/src/consts.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1131f3990841259565e59c7ef6c2ccf785f268d9550dad7c4322f8f8ecd0da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): clippy_utils/src/mir/possible_borrower.rs:44-48 | clippy_utils/src/mir/possible_origin.rs:26-30 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_utils/src/mir/possible_borrower.rs:44\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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 \u0060cx\u0060 to \u0060\u0026\u0027a LateContext\u003C\u0027tcx\u003E\u0060 in one and \u0060\u0026LateContext\u003C\u0027tcx\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":"clippy_utils/src/mir/possible_borrower.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a89b716f29d79c228c9a76b5d864b499d47378f265ad0a36711bd6e9fbd4e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): clippy_lints/src/assertions_on_constants.rs:86-94 | clippy_lints/src/manual_take.rs:108-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/assertions_on_constants.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d376dfab441a282ae0ab5541fbf33c5d7823bf7239350bb3c8953ab18a84b17a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): clippy_lints/src/bool_comparison.rs:170-177 | clippy_lints/src/needless_bool.rs:347-354 \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":"clippy_lints/src/bool_comparison.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f58ca1e00e633453b6d34558cae1843b8f83f7777711c3c97f50938566b24e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): clippy_lints/src/methods/ptr_offset_by_literal.rs:132-137 | clippy_lints/src/methods/ptr_offset_with_cast.rs:76-81 \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":"clippy_lints/src/methods/ptr_offset_by_literal.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c44a2e995c01ed401f29c5094ad160f87c18a7e45e255a816150312a310a84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): clippy_utils/src/usage.rs:208-217 | clippy_utils/src/visitors.rs:317-326 \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":"clippy_utils/src/usage.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07a1418f059bfc6d128b9ce1657963f0e9f589915dd3593c877f5a5ef364a1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): clippy_lints/src/operators/arithmetic_side_effects.rs:311-320 | clippy_lints/src/operators/numeric_arithmetic.rs:89-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/operators/arithmetic_side_effects.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c4c7de4d44df46f734da017fa69ec007e82c85f946690d29a934ac114ad350"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): clippy_lints/src/doc/mod.rs:1186-1200 | clippy_lints/src/doc/mod.rs:1230-1244 \u2014 both copies are in the same file, so extract the block 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":"clippy_lints/src/doc/mod.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff840665789dceababf4c07858dd495318c0eb9903970279fcafe6bc232d13b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): clippy_lints_internal/src/collapsible_span_lint_calls.rs:217-231 | clippy_lints_internal/src/collapsible_span_lint_calls.rs:245-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 \u0060clippy_lints_internal/src/collapsible_span_lint_calls.rs:217\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"clippy_lints_internal/src/collapsible_span_lint_calls.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90d508f2b2086b7e1861425884c8fefe0a1b84422d664104ec9783a25592198"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): clippy_lints/src/mem_replace.rs:199-211 | clippy_lints/src/mem_replace.rs:222-234 \u2014 both copies are in the same file, so extract the block 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":"clippy_lints/src/mem_replace.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"54914ed661816698135c5cdf2bd10cfbba413b58ae7fdc28144c258c7877a5d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): clippy_lints/src/arbitrary_source_item_ordering.rs:204-214 | clippy_lints/src/arbitrary_source_item_ordering.rs:267-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/arbitrary_source_item_ordering.rs:204\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 \u0060before_item\u0060 to \u0060ImplItemId\u0060 in one and \u0060TraitItemId\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":"clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe17ba2a38603f07a62fea541f8f111a136a6da985bd0250b1d33d365a481d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): clippy_lints/src/methods/unnecessary_fold.rs:264-271 | clippy_lints/src/methods/unnecessary_fold.rs:274-281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/methods/unnecessary_fold.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060clippy_lints/src/methods/unnecessary_fold.rs:273\u0060 calls \u0060check_fold_with_method\u0060 and \u0060clippy_lints/src/methods/unnecessary_fold.rs:263\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":"clippy_lints/src/methods/unnecessary_fold.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df02e5673583e92b50412ca3f9be06cdbb6544dc683611ada284e71617f5656"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): clippy_dev/src/utils.rs:176-183 | clippy_dev/src/utils.rs:188-195 \u2014 both copies are in the same file, so extract the block 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":"clippy_dev/src/utils.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ccf1ba394a845e38a92a3d605f1d296b56ecfd5290a38b0d810a91f3d3ec34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): clippy_dev/src/deprecate_lint.rs:22-29 | clippy_dev/src/deprecate_lint.rs:69-76 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_dev/src/deprecate_lint.rs:22\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":"clippy_dev/src/deprecate_lint.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a789db1cdd55b0f52e99e986f8ab860a16add4b05490a16a02e147ecf7b26094"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): clippy_lints/src/floating_point_arithmetic/expm1.rs:39-46 | clippy_lints/src/floating_point_arithmetic/log_base.rs:37-44 \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 \u0060clippy_lints/src/floating_point_arithmetic/expm1.rs:39\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":"clippy_lints/src/floating_point_arithmetic/expm1.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d538807d5fc618dbe3feef4be25d973200da95aabb50633a087e3202ed68ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): clippy_config/src/metadata.rs:24-30 | clippy_config/src/metadata.rs:46-51 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_config/src/metadata.rs:24\u0060 it does not close everything it opens, so those exact 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":"clippy_config/src/metadata.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"31343d02cd45ac8cc35f89ece820324651a2dfd4283fb28d36e2e54a61759c8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): clippy_lints/src/methods/bind_instead_of_map.rs:64-70 | clippy_lints/src/methods/bind_instead_of_map.rs:75-81 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060clippy_lints/src/methods/bind_instead_of_map.rs:64\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/bind_instead_of_map.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f4d23fda90fa63b8e0784b78c7943a18a97b799df0df77aff551c81b7a8665"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): clippy_dev/src/edit_lints.rs:228-232 | clippy_dev/src/edit_lints.rs:244-248 \u2014 both copies are in the same file, so extract the block 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":"clippy_dev/src/edit_lints.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b335d4ea214577b6765d34a91b22d62c9f11957cabeee6870626862901fbb7fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): clippy_lints/src/manual_pop_if.rs:209-213 | clippy_lints/src/manual_pop_if.rs:368-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060clippy_lints/src/manual_pop_if.rs:373\u0060 calls \u0060typeck_results\u0060, \u0060expr_ty\u0060, \u0060is_bool\u0060 and \u0060clippy_lints/src/manual_pop_if.rs:214\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":"clippy_lints/src/manual_pop_if.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd2bba3f8183e8dea83c480ef43929c1fa989b490c25e22e6a562e1158f9fcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): clippy_lints/src/needless_nonzero_get.rs:88-92 | clippy_lints/src/needless_nonzero_get.rs:99-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/needless_nonzero_get.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e7e926e48687ecb7d0a4df11045bc160c38357dd56de7b9ea12683ed053302"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: declare_clippy_lint: declare_clippy_lint: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"756d8a587b4715c6bd8bc0efcd6c947f2ca3e8210c1203a128641ece8300ca44"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rustc_tools_util: rustc_tools_util: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"819fce2e86f5c44874efb72db45c0f4c802c0adaf97f19a1eac29265e72c7a4f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: clippy_utils: clippy_utils: abstractness 0.27, instability 0.00, distance 0.73 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"08a1f019897adb65f32cbb16969197657c2a2992c29f731105ef7d984cc7a6b2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TraitBounds (LCOM4 4): TraitBounds\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":"clippy_lints/src/trait_bounds.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9b8b0515e7982469168d5f353caf96acc41fb90720309737c25f459f3ada2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/mod.rs: clippy_lints/src/methods/mod.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 191 in Methods::check_methods at line 5437. 4 of those changes were fix/bug commits, and the other 20 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/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":"clippy_lints/src/methods/mod.rs"},"region":{"startLine":5437}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2831c6fb77718a6c1a1dacac51cbbfb2337a81f733be317ff07f025ce77185"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_utils/src/hir_utils.rs: clippy_utils/src/hir_utils.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in SpanlessHash::hash_expr at line 1181. 3 of those changes were fix/bug commits, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_utils/src/hir_utils.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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f841d6548bfd9b36a3143a72ed936d1c7f1d846e2996a7b96ef356dd850292"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_utils/src/ast_utils/mod.rs: clippy_utils/src/ast_utils/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in clippy_utils::ast_utils::eq_expr at line 145. 1 of those changes was a fix/bug commit, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_utils/src/ast_utils/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":"clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ab1d8df00da66382bc3f1ec18bb70f4e62eb5968c29b5e41d6512f896247ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_utils/src/lib.rs: clippy_utils/src/lib.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in clippy_utils::expr_use_sites at line 2698. 4 of those changes were fix/bug commits, and the other 19 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_utils/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":"clippy_utils/src/lib.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea245a7cd12e2f972f2c261dcbcf2a69cc1e934c6f2a62826611647e1e97400a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/useless_conversion.rs: clippy_lints/src/useless_conversion.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in UselessConversion::check_expr at line 160. 3 of those changes were fix/bug commits, and the other 6 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/useless_conversion.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/useless_conversion.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7473d296da437d7a04826150969df9bf8dcea69a153f93b679c951379a7fe214"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/lifetimes.rs: clippy_lints/src/lifetimes.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in clippy_lints::lifetimes::could_use_elision at line 293. 5 of those changes were fix/bug commits, and the other 6 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/lifetimes.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":"clippy_lints/src/lifetimes.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"051315f55128a8a2ae628929667fb7758750e82883cb3a94245fb4130ce1023b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/eta_reduction.rs: clippy_lints/src/eta_reduction.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in clippy_lints::eta_reduction::check_closure at line 90. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/eta_reduction.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":"clippy_lints/src/eta_reduction.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd937676e851a8a5de6a84c4e92f7d8088d469efefbe221d39cb92c9479394b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/attrs/mod.rs: clippy_lints/src/attrs/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in PostExpansionEarlyAttributes::check_attribute at line 663. 2 of those changes were fix/bug commits, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/attrs/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":"clippy_lints/src/attrs/mod.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"8921d8e736f75c102b38b147039041512e147fcbeb2546086d11e6bf2510dde4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/returns/needless_return.rs: clippy_lints/src/returns/needless_return.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in clippy_lints::returns::needless_return::check_final_expr at line 119. 3 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/returns/needless_return.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":"clippy_lints/src/returns/needless_return.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c87126702c1479fcf0f209f89e429a1ce78e9d887ff89b94859ae5d2dad62d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_utils/src/eager_or_lazy.rs: clippy_utils/src/eager_or_lazy.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ExprEagernessVisitor::visit_expr at line 261. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_utils/src/eager_or_lazy.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":"clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bde1183ea603ed5387b2cb09a3681fd4be2c44df8b3388587ccde6c0e12f80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/arbitrary_source_item_ordering.rs: clippy_lints/src/arbitrary_source_item_ordering.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ArbitrarySourceItemOrdering::check_mod at line 489. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/arbitrary_source_item_ordering.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":"clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5271b675f1e01e467f87bb2ef8344d3e9d48b4d072f88063c4db0b9685ddc90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/matches/mod.rs: clippy_lints/src/matches/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Matches::check_expr at line 1055. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/matches/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":"clippy_lints/src/matches/mod.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb73dccb5396abce19a552641325974ec234613d8d8adf1fadc078a8f6b210f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/non_copy_const.rs: clippy_lints/src/non_copy_const.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in NonCopyConst::is_non_freeze_init_borrowed at line 568. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/non_copy_const.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":"clippy_lints/src/non_copy_const.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ee85712499023c377d0f3473dea45c6adde0434dc141a8804859b849600af7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/needless_borrows_for_generic_args.rs: clippy_lints/src/needless_borrows_for_generic_args.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in clippy_lints::needless_borrows_for_generic_args::needless_borrow_count at line 167. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/needless_borrows_for_generic_args.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/needless_borrows_for_generic_args.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda010235f937d306d8d794c46d7e852148c4f7f86414ce79c8adf7268f1f540"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/manual_inspect.rs: clippy_lints/src/methods/manual_inspect.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in clippy_lints::methods::manual_inspect::check at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/manual_inspect.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":"clippy_lints/src/methods/manual_inspect.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0de143c875d0a36db65972c353a1d59aff39192d5a0914f699395232797ed4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_dev/src/edit_lints.rs: clippy_dev/src/edit_lints.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in clippy_dev::edit_lints::rename_update_fn at line 375. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_dev/src/edit_lints.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":"clippy_dev/src/edit_lints.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17ceb0b995f7dd458a2c5325cbde056f6b63e9632bbdcc967fb1ce54b824d16"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/matches/collapsible_match.rs: clippy_lints/src/matches/collapsible_match.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in clippy_lints::matches::collapsible_match::check_arm at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/matches/collapsible_match.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":"clippy_lints/src/matches/collapsible_match.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"26640a930409488a14b89eafe84df1aa0da23a8adbe62ccfbcf8521f2a143b57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_dev/src/main.rs: clippy_dev/src/main.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in clippy_dev::main at line 11. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_dev/src/main.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":"clippy_dev/src/main.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f61cf1fb5ad950b2bc98547490c460c41421bfe44cacb5359b7bfdf7349ba1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/large_unopt_stack_frames.rs: clippy_lints/src/large_unopt_stack_frames.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LargeUnoptStackFrames::check_fn at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/large_unopt_stack_frames.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":"clippy_lints/src/large_unopt_stack_frames.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb2305fa70c6c79740b734c78c4187ecbbaa9fbdbe22a4a2a8f8e3a2e2d5f4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/ranges.rs: clippy_lints/src/ranges.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in clippy_lints::ranges::can_switch_ranges at line 368. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/ranges.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":"clippy_lints/src/ranges.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78b12e8db11bb603efebe3306510c0e2bdc42db778af8431fbca2c551b23cc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/matches/single_match.rs: clippy_lints/src/matches/single_match.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in clippy_lints::matches::single_match::report_single_pattern at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/matches/single_match.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":"clippy_lints/src/matches/single_match.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de98754fbff9f961fd62011ed305e0398c3ee5b67171c426e43ce9655b5c784"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/unnecessary_map_or.rs: clippy_lints/src/methods/unnecessary_map_or.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in clippy_lints::methods::unnecessary_map_or::check at line 124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/unnecessary_map_or.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":"clippy_lints/src/methods/unnecessary_map_or.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb16a39e2ab34762e503ffd6562e41ec3eeb1ee3c6f560a9d99a38d1c1cee5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/ptr/ptr_arg.rs: clippy_lints/src/ptr/ptr_arg.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in clippy_lints::ptr::ptr_arg::check_fn_args at line 199. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/ptr/ptr_arg.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":"clippy_lints/src/ptr/ptr_arg.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0fe07a95c6e8c5bed6fe18fa9cc44a28129d1584907fb25b85fd8fdf070ad5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/map_clone.rs: clippy_lints/src/methods/map_clone.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in clippy_lints::methods::map_clone::check 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/map_clone.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":"clippy_lints/src/methods/map_clone.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4544d5c6f355f3efb5667efd720a60114bed0415e1a42a7281a0914979f10b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/format.rs: clippy_lints/src/format.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in UselessFormat::check_expr 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/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":"clippy_lints/src/format.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"358a523ccc9de15a66079c3e75eee70c9d5122f3c121a36393a01247de434d76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/wildcard_imports.rs: clippy_lints/src/wildcard_imports.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in WildcardImports::check_use_tree at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/wildcard_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":"clippy_lints/src/wildcard_imports.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b8499ea43a162adcbd62ced2a7b02e51488e6397112602cb764168e6a4609e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/loops/needless_range_loop.rs: clippy_lints/src/loops/needless_range_loop.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in VarVisitor::check at line 260. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/loops/needless_range_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":"clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75f0178567d389f844efd936c28c213c6e6f8db81988d22aa96afbefed7f764"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/casts/unnecessary_cast.rs: clippy_lints/src/casts/unnecessary_cast.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in clippy_lints::casts::unnecessary_cast::check 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/casts/unnecessary_cast.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":"clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a56a5555dc46329617067918d6c16f8ec1dbc3931b65b0023fa662b2066c023"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/driver.rs: src/driver.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in clippy::driver::main at line 196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- src/driver.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":"src/driver.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f777f5860c8ad9b071e934269b93447ccdba8e0abb604fb3c2d259dd695c25b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/operators/cmp_owned.rs: clippy_lints/src/operators/cmp_owned.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in clippy_lints::operators::cmp_owned::check_op at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/operators/cmp_owned.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":"clippy_lints/src/operators/cmp_owned.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1e43a9f5b9a2946c5e47388127d58eb45917e475b42fce830834dabcbb0af4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/unconditional_recursion.rs: clippy_lints/src/unconditional_recursion.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is clippy_lints::unconditional_recursion::check_partial_eq at line 177), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201Cfix \u0060default_impl_for_type\u0060 not caching in the no \u0060Default\u0060 case\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/unconditional_recursion.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":"clippy_lints/src/unconditional_recursion.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa462c23c0a09013913b406bbe7cf18843b2f174d5213ef7e4973c7a3b990e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/non_canonical_impls.rs: clippy_lints/src/non_canonical_impls.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is NonCanonicalImpls::check_item at line 150), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201Cfix deprecated rustc_hir::attrs imports\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/non_canonical_impls.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":"clippy_lints/src/non_canonical_impls.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0152375953ac37041ff0dd7bc922862bef504e51a92a0b0beca7c9513b5da08a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/macro_metavars_in_unsafe.rs: clippy_lints/src/macro_metavars_in_unsafe.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is BodyVisitor::visit_expr at line 165), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201Cfix deprecated rustc_hir::attrs imports\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/macro_metavars_in_unsafe.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":"clippy_lints/src/macro_metavars_in_unsafe.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"63939d04cfa1707c5aea2cbe4540158e8b544d885f2fd84760bd1e930543d672"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/multiple_unsafe_ops_per_block.rs: clippy_lints/src/multiple_unsafe_ops_per_block.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is UnsafeExprCollector::visit_raw_addr_of 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201Cfix: false positive in multiple_unsafe_ops_per_block with write to union field\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/multiple_unsafe_ops_per_block.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":"clippy_lints/src/multiple_unsafe_ops_per_block.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c621b6369e4b2e67b1feeeefc5f077e8e73c12925b19c4a52beb766420c1b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/collection_is_never_read.rs: clippy_lints/src/collection_is_never_read.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is clippy_lints::collection_is_never_read::has_no_read_access at line 77), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201Cfix deprecated rustc_hir::attrs imports\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/collection_is_never_read.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":"clippy_lints/src/collection_is_never_read.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1123d57bf1e56f4775ba3bca2d893ac71cd9ec85c130c27631a31ad6f1b68a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/manual_pop_if.rs: clippy_lints/src/manual_pop_if.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is clippy_lints::manual_pop_if::check_if_let_pattern at line 241), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201Cfix deprecated rustc_hir::attrs imports\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/manual_pop_if.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":"clippy_lints/src/manual_pop_if.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed5a65de9a6795887c82adced3d6fafc84d98fcd2959cc691617a96860d800a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/significant_drop_tightening.rs: clippy_lints/src/significant_drop_tightening.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 15 (its worst body is StmtsChecker::visit_expr at line 265), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/significant_drop_tightening.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":"clippy_lints/src/significant_drop_tightening.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"d195db4ce5f93ace3a37d4788bb772217145bc42ebd6dd8c72380e78f2fb7c3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/redundant_closure_call.rs: clippy_lints/src/redundant_closure_call.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 7 (its worst body is clippy_lints::redundant_closure_call::find_innermost_closure at line 82), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/redundant_closure_call.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/redundant_closure_call.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"341a62f0855eb70a77344ec5ac89084b533239f5861eb4fd3d8779ce4c2ba1b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/suspicious_trait_impl.rs: clippy_lints/src/suspicious_trait_impl.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 3 (its worst body is clippy_lints::suspicious_trait_impl::check_expr_inner at line 74), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/suspicious_trait_impl.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":"clippy_lints/src/suspicious_trait_impl.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99df7a203bcf2240457dcefe474e197fe49d883c2c33a4fc292b43f3b8d39b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/missing_inline.rs: clippy_lints/src/missing_inline.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 3 (its worst body is clippy_lints::missing_inline::check at line 67), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix deprecated rustc_hir::attrs imports\u201D; \u201CFix tools\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/missing_inline.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":"clippy_lints/src/missing_inline.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"becd6007403f886d4c8b732b533fc2aa7e1bf220bd047dd31132587fa2d276ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/attrs/inline_always.rs: clippy_lints/src/attrs/inline_always.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is clippy_lints::attrs::inline_always::check at line 10), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201Cfix deprecated rustc_hir::attrs imports\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/attrs/inline_always.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":"clippy_lints/src/attrs/inline_always.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f607bc00201dd1ba6ce7821329c4009a4816d23569a64f71c53ad7f9907945c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/matches/manual_filter.rs: clippy_lints/src/matches/manual_filter.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is clippy_lints::matches::manual_filter::get_cond_expr at line 21), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201C  fix: [\u0060manual_filter\u0060] don\u0027t lint when the condition needs \u0060\u0026mut\u0060 access\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/matches/manual_filter.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":"clippy_lints/src/matches/manual_filter.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c9bdc28815a3322eb9ec372400690dd3c21457239a4d50ea0e609e815aabd0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/methods/bind_instead_of_map.rs: clippy_lints/src/methods/bind_instead_of_map.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is BindInsteadOfMap::check at line 157), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201Cfix deprecated rustc_hir::attrs imports\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/bind_instead_of_map.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":"clippy_lints/src/methods/bind_instead_of_map.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d08a99f1a70ffaa43266919212eed2a5072c3bbd0517507f7e28a3122119ee3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/methods/format_collect.rs: clippy_lints/src/methods/format_collect.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is clippy_lints::methods::format_collect::check at line 20), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201Cfix deprecated rustc_hir::attrs imports\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/format_collect.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/format_collect.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fc0856fcea7c507e636acf81b22985b7ad20b3633aceefc511eae9fafe1efd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/methods/option_map_or_none.rs: clippy_lints/src/methods/option_map_or_none.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is clippy_lints::methods::option_map_or_none::check at line 33), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201Cfix deprecated rustc_hir::attrs imports\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/option_map_or_none.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":"clippy_lints/src/methods/option_map_or_none.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3577b57ded6db81f0c5c6a9d112dd9c27db85900e420549c216af14ba4f68681"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/methods/result_map_or_else_none.rs: clippy_lints/src/methods/result_map_or_else_none.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is clippy_lints::methods::result_map_or_else_none::check at line 14), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201Cfix deprecated rustc_hir::attrs imports\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/methods/result_map_or_else_none.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":"clippy_lints/src/methods/result_map_or_else_none.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6766a761818d94e321317f28227ae7daf44c2f5ee5e2d220124a32788d4d3543"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/missing_asserts_for_indexing.rs: clippy_lints/src/missing_asserts_for_indexing.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is clippy_lints::missing_asserts_for_indexing::report_indexes at line 348), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/missing_asserts_for_indexing.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":"clippy_lints/src/missing_asserts_for_indexing.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"a790555444d409c8f143f7f97097471de4fa80a335031b4745f55c3a813847c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/returns/needless_return_with_question_mark.rs: clippy_lints/src/returns/needless_return_with_question_mark.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is clippy_lints::returns::needless_return_with_question_mark::check_stmt at line 12), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201Cfix deprecated rustc_hir::attrs imports\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/returns/needless_return_with_question_mark.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":"clippy_lints/src/returns/needless_return_with_question_mark.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fa5a9c3376dc7f07afe532d2311b157274b3136653e4e23dfcedd8deaeb6d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/unnecessary_literal_bound.rs: clippy_lints/src/unnecessary_literal_bound.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is clippy_lints::unnecessary_literal_bound::extract_anonymous_ref at line 57), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/unnecessary_literal_bound.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":"clippy_lints/src/unnecessary_literal_bound.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"827016560ef2f1b4656e14763df285cc0279ba4204b292bd8d41b3528bc1d688"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/incompatible_msrv.rs: clippy_lints/src/incompatible_msrv.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is IncompatibleMsrv::emit_lint_if_under_msrv at line 168), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix clippy imports\u201D; \u201Cfix deprecated rustc_hir::attrs imports\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/incompatible_msrv.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":"clippy_lints/src/incompatible_msrv.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0704e9ac81bdfce9a6038348af25bf3ed34c9296417c9eee7e71a6129fdb666b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/casts/mod.rs: clippy_lints/src/casts/mod.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is Casts::check_expr at line 890), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/casts/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":"clippy_lints/src/casts/mod.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb19c59f0be27dc42667eba04edc5e53d4290fc7f9d556e84558a141f539197"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/from_over_into.rs: clippy_lints/src/from_over_into.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is clippy_lints::from_over_into::convert_to_from at line 180), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/from_over_into.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":"clippy_lints/src/from_over_into.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dc70ddd868364d19af022e549f9202350e8a31e4bce69199da84d72fcaffee"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/infinite_iter.rs: clippy_lints/src/infinite_iter.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is clippy_lints::infinite_iter::is_infinite at line 145), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/infinite_iter.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":"clippy_lints/src/infinite_iter.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f57c32c899b02874e6f83929819b8081440633a756f742a167ca564226dd854"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/manual_noop_waker.rs: clippy_lints/src/manual_noop_waker.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is ManualNoopWaker::check_item at line 52), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/manual_noop_waker.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":"clippy_lints/src/manual_noop_waker.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb346d51fb1fe58c11fb5c6c8b5568f0ed008a3e576e4e7b468abb2846f0f684"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/panic_in_result_fn.rs: clippy_lints/src/panic_in_result_fn.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is clippy_lints::panic_in_result_fn::lint_impl_body at line 64), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/panic_in_result_fn.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":"clippy_lints/src/panic_in_result_fn.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"088a3cc8145f748397a341db8d48071724280a437e6e44008217813067474400"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: clippy_lints/src/unused_self.rs: clippy_lints/src/unused_self.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is UnusedSelf::check_impl_item at line 53), 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: \u201CRevert \u0022Remove indirection for \u0060Expr\u0060 in \u0060Body\u0060\u0022\u201D; \u201CFix clippy\u201D; \u201CFix clippy/rustdoc\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 14:34:03 \u002B00:00\u0027 --until=\u00272026-11-14 14:34:03 \u002B00:00\u0027 --full-history --no-merges -- clippy_lints/src/unused_self.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":"clippy_lints/src/unused_self.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"842698e3fb55d3efdd4774cef0bf2551606dcad5397d709bd42d758d7d3a1e3f"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 4 significant file(s) lose their only recent owner: clippy_dev/src/parse.rs, clippy_dev/src/edit_lints.rs, clippy_dev/src/parse/cursor.rs, clippy_lints/src/disallowed_items.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d33416478ad75e86d2fec28705073bcdaf5745c84c2045a4fdf70ae7fa270f51"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (5 single-owned of 599 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; 599 of the 820 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: clippy_lints/src/methods/filter_next.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#160895): While the new solver is enabled by default on nightly,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/compile-test.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"30afa201329000fd660cdf8df352181a2656fc83db25283e6347a8a233323e14"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(#160895): While the new solver is enabled by default on nightly,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/compile-test.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7fa80f72d8719336f5be8d9826f6c06857ee64171cf49e5f31e96cacf951c2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: for some reason the modules are linted in a different order for this 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":"tests/compile-test.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fe01e84037d014a9e794b43a63ddbfe8c4aa42bb609a0598513d8ddbb6eff5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add a clamp test once the function is 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":"tests/ui-toml/toml_disallowed_methods/conf_disallowed_methods.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6773005518d01e659cbc68ae4e32c5f419724289aa5911f0b59375e6b47cae9f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: macro calls should be checked. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui-toml/absolute_paths/absolute_paths.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c140656ad6b40a4ffc863452016be1927771f57d2662a2944ec5f703b4b0b49"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: derive macro paths should be checked. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui-toml/absolute_paths/absolute_paths.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a436b377708dfee2d7d780b0729c6640d813b38dbcca34b65cbf8cf594bd89d0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: find a way to add rustflags to ui-cargo tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui-cargo/module_style/fail_mod_remap/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e04660c3fb31d65691e1ea1dee354b84a1ad8c232198f194f8015992c8e37a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should produce a warning, because the attribute says 1.58 and the cargo.toml file \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui-cargo/cargo_rust_version/fail_file_attr/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38dce1f39337dc42c406c365310da9ec587bd1342fe85e9dcf106d216195059c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: turn into an MSRV aware lint after const traits are stable and \u0060PartialEq\u0060 is const 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":"tests/ui/assert_is_empty.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"283546081f438643abc4195a7c0f2b52b4ff51bf172dc4b41ee2ca6298774dea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: FP, because the \u0060MutexGuard\u0060 is dropped before crossing the await point. This 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":"tests/ui/await_holding_lock.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"43725e147cb459ec9ee47d83fe33a92fb587ed4f1be1c60442d11ce1ebea72ce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add tests once const casting is available for these 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":"tests/ui/cast.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"19452cbe85da1352bc93cd9be3f1e9a1bfe46627c0003ff86c1cfd7b5ca40c06"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add tests for these types once const casting is 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":"tests/ui/cast_lossless_float.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6518c5ae1d4a63d7331e8412c203a5b90749d86ee2989e06546467ded61b8a57"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add tests when constants are 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":"tests/ui/cast_nan_to_int.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"500398e2461c645f02dae4aea4191e431e6335483efb55f7e6bc80613f7515e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): enable f16 and f128 conversions once const eval supports 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":"tests/ui/cast_size.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb4b9d2d01c4217215d0f685e460473193be50e125d4ca33209f6f7d681a1f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Expand \u0060collection_is_never_read\u0060 beyond collections? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/collection_is_never_read.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"020c04316cf9a30407287f3b8e3cb680c883d1f536f2b36ff2bb6b23e4e9c336"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Warn here, but this requires more extensive data flow analysis. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/collection_is_never_read.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c254b54ea084bb7841d758a39a8929874b8ef4145d32cb6ea85d16f9c7471be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Warn here, but this requires more extensive data flow analysis. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/collection_is_never_read.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef20b74e7f3c16eeefe268ba67413408b30ce77b7f3b43c6bbfc8f6827118c2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: suggestions on \u0060move\u0060 closures will change the behavior of the iterator (rust-lang/rust-clippy#17646)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/double_ended_iterator_last.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7717f6b1a3775714afc0e6c34110578d275235e2536596a8718a5aa071f05d36"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this problem is documented in \u0022Known issues\u0022 section (rust-lang/rust-clippy#17829)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/double_ended_iterator_last.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e60343f30a1aa53d8b0389b404c7a5318588585372a635f4a58112aea467aae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: detect this and suggest \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":"tests/ui/equatable_if_let_const_cmp.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6c4975d1a4ccb44cfb8779823329aa3a3ee1b8abfe0608251aaf5b8a09b54f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // // TODO add inferred type tests for f32 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/excessive_precision.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"91def005556bed6c24404f01db1fc9c27188b5d5b2bc6a0a5ee2a0c1afb0fc7c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): const casting is not yet supported for these types. Add 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":"tests/ui/float_cmp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"135ef0e97972f4de3d743df93c5f1951830eeb5635ab3cfdb819eb9b76490a57"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add tests when exp is 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":"tests/ui/floating_point_exp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be348457d5253f02f332d9061d52d11bbfe19cb3f1aacbc2f281affb1a96ad05"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add tests for these types once math functions are 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":"tests/ui/floating_point_log.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"93de80670d98f8538beb8ab053213d3ab0210d0136be76e57ed312ea79d1e466"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add tests for these types when \u0060powf\u0060 is 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":"tests/ui/floating_point_powf.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a1fbeff142d7279cd4c1f9198ecc596e7b6127a9d110ac2e688ee0ce4e6f49"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: recognize the already imported \u0060fmt::Write\u0060, and don\u0027t add a note suggesting to import it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/format_push_string.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f18107c996f048b68d89ab38b6908245c42d952fd464d4202a4a85d27ef73c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: recognize the already imported \u0060fmt::Write\u0060, and don\u0027t suggest importing it again \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/format_push_string_no_std.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e359715df838a590bb0b111b85fef55b563fbeba2ca0bf023a8b6086402c1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest importing \u0060std::fmt::Write\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":"tests/ui/format_push_string_unfixable.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f86e0af0b38f9487fd6162b44d90daef54d18012d52c7e2edb4f7376e5a4c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest importing \u0060std::fmt::Write\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":"tests/ui/format_push_string_unfixable.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f89df316de7574697ff45c1b676d112a6d223e280cbbc404c70515735caf511"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest importing the first time, but not again \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/format_push_string_unfixable.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc558cbc3fd516e937c6a2c1778d8641fbe614c8ae463daff7e16beb23608269"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest importing the first time, but not again \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/format_push_string_unfixable.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51aa78c51c59b5dfb048baf43d74f5d23ccc4b8248981508c5759865c90d460"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest importing the first time, but not again \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/format_push_string_unfixable.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a34ad032d84fa6d5574be8ac071fafb8460d0cebfc147c7816b7d0e340914cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest importing the first time, but not again \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/format_push_string_unfixable.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37ef432172122d6048a1976f227cf4bebbafb411a5aa51b7989ab09887302fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest importing, but only for \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":"tests/ui/format_push_string_unfixable.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"074f009c87c668a958e371556b4cdf6cf810592305a515f4c5b9a591ef7584ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest importing, but only for \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":"tests/ui/format_push_string_unfixable.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9362fbd1371c55b027aa30861db72e3fc2cc37a2b609eb020d859075e744cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: stuff \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/let_and_return.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"6652297681694819e777f74100ad6bbc4e77603a49d7609ea4c294b889efbe52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fill \u0060stuff\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":"tests/ui/let_and_return.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c132ed69f5d7dde1d07aea1423836fae516bc5193ed57bda20d16454116458"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we could extend the lint to include such 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":"tests/ui/let_if_seq.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e03fd4a1f5b1dc97e4c9634e7c10f8a71474a6cad378eaad9e3271b518cadd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: bunch of patterns that should be linted \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/manual_abs_diff.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8680d054e50f47a49af93d385db793fefcdc9cd3642b82bc77aa2d75aca5d58"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME suggestion may have redundant closure \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/manual_filter_map.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa1cfaa2044e10e84ad52313761fbd769a2223ae8974970d7679c1828243919"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME suggestion may have redundant closure \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/manual_find_map.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d04d988fbba69476a72d9e02e99ae2b2b03effbbd269492d9058147264599bf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add tests for these types once constants are 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":"tests/ui/manual_float_methods.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3722ef059057a8f5d14e63b5cb7630d8b8267b70765d2c17bfc51ff6b1e78a33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:: these are rare, and might not be worth supporting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/manual_ignore_case_cmp.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"346a991e882e3ef3399245b02fc98440950ec7d25c86f1358316dae91fe4e437"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO also support unused bindings aka _v \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/manual_let_else_match.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d546771958dc766499c235be962dd15ef864006827b953bce59f283b2bc2140f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO patterns not covered 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":"tests/ui/manual_ok_or.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41269cef73e8776f66d30d2d215bb6f2cd0978e6e3f160b4f57521655e91251"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Reduce to \u0027A\u0027..=\u0027Z\u0027 | \u0027[\u0027 | \u0027\\\\\u0027 | \u0027]\u0027 | \u0027^\u0027 | \u0027_\u0027 | \u0027\u0060\u0027 | \u0027a\u0027..=\u0027z\u0027 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/manual_range_patterns.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f827877d62c0a7375c1f13aafdc34ca7c686fe17c56172ba6879385bed4a69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@Jarcho): Check why this doesn\u0027t trigger after rustfix \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/manual_rotate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9c2e303f358070d3cba72ccb60b980da84b49d2890b48c13c1e684252ec985"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: macro args are fine \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/manual_str_repeat.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"800832ab9f8b1c67b774195d1bf94c2208c60ab03d76e7cc317623a0e2a60341"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also match on loop\u002Bmatch or while let \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/missing_spin_loop.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"57804a99d4c1d1a1d66463c77f4d4113c17dc4eb6c8bc99326435c085183122e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should also warn because it creates the public path \u0060foo::FooIter\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":"tests/ui/module_name_repetitions.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad742e70a8b5c9638721cc086de123c1ff7e15fd3029884f76243bbebc40d82c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/mut_from_ref.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7731c303f960c6c6be31f447ccad07aa56d56937a548f256d9a7dbda11cbd68"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: warning because it is not immediately followed by break \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/mut_range_bound.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a34a01bb855db336265fa8b4b7deb89ac6ffa43c2a309e0d4213ae85f5c6f2d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060bool_comparison\u0060 will propose to use \u0060S == true\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":"tests/ui/nonminimal_bool.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c20df4cb0be15381d3f7d7be8447eec8df37152c70428462b79e5b47890484"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/nonnull_unchecked_on_box_ptr.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb326c646fba655d509e5f8961a3c9b2933dd3db4c00a30b5d464e9c06900f3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //~^ todo \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/panicking_macros.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc00f21a43cb9384296cc4389ee07fb6cae564168153c93d2dd4f9583aea5518"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //~^ todo \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/panicking_macros.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"115f38c1059634739d69bfa8a5b83f7c40361b3b164fd2d6e5a1c39000f14340"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //~^ todo \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/panicking_macros.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"171a9d9cfc2b0865d44751a2ca1bd176d137286f3b1b056e7252230e59af02d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //~^ todo \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/panicking_macros.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bc79838e54e03c60a018ec6ef90a3b80b5cb9fff306c9f1f1197c8c8449e91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //~ todo \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/panicking_macros.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4deb74732a14bc95a36518d5c790a6a4fcdeb4c82a85a07d6a0982014881320"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060is_from_proc_macro\u0060 incorrectly stops the lint from firing 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":"tests/ui/ptr_as_ptr.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1c753b296d2c42b7a92da4ece1de28cfa8b5d001d2a39ad7e158c27aec5c0f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(static_mut_refs): use raw pointers instead of 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":"tests/ui/redundant_static_lifetimes.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5213edcd7b93e815cae53dce69bfc524d1682f0b05807c0e9bd9359227d0b41d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(static_mut_refs): use raw pointers instead of 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":"tests/ui/useless_conversion.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc965c16e692d05faee1134523bd87ec18ee9d2c2a7d690d9659a54767e888a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally these suggestions would be fixed via rustfix. Blocked by rust-lang/rust#53934"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/significant_drop_in_scrutinee.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af7923c4fc2c84d936b4836973baf6ed19e963168215a1e420c40e8039c42d2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The lifetime is too complex to analyze. In order to avoid false positives, we do not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/significant_drop_in_scrutinee.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b040522ca64071c33551cbb79b5a93e13e889264f684e0e35836651b9f7e37a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Process the error properly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/single_match.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e077b20796304a8ff1357b6516bc91e0887f0b773adc7f1f02ffce129a5f0c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: [0..200; 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":"tests/ui/single_range_in_vec_init.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb98a30d3bc66157b301c8f9cb5d2fe4ab2edb503941e5de2314d0ec5dfaef1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: [vec!0..200; 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":"tests/ui/single_range_in_vec_init.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd6583f3caf91ede0cd4f9b5eacc592e4ee5b2f11b7870530519ec4647d9f2c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: should lint \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/transmute.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a90d351714104288420524eef9cf1333238035996e334f92621b7ee54a8ad2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We could try testing vtable casts here too, but maybe \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/transmutes_expressible_as_ptr_casts.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cd96820a8ca03742e7c17dc4fb8abf5619c599ecfafb029e9d8918a2539166"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is not caught \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/unnecessary_safety_comment.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3db53ab3703500fec6bb03cb495d3c829bfd4d0a7b5dd8e86450de63a72aa62"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add tests when math functions are 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":"tests/ui/unused_rounding.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"327c89c6c2945b0f2533059ba530a0bcc9d9dfba110eed1b275e0b23ee3c5b6f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Suggested fix results in infinite recursion. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/use_self.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"743f68b83b28b2e410ed38132cdb6d0ea511cf3d8c2cf19a2e6f842b32ebaa2f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ^Broken by PR #15611"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/use_self.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87c122462a6525eaae8a06e948289a0772f1647eb37f36f73b271f51e004412"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME this is a false negative \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/useless_conversion_try.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3971bb4281018d9e84634f0b994c40dd4390b61f6979b27bd7789923b848e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: When the \u0060break\u0060 statement/expr in the \u0060let\u0060/\u0060else\u0060 is 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":"tests/ui/while_let_loop.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c916322c70d503d6c32736ac41cc873cc3a157ea22e46ac8850d7a7c7d7e05"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consider moving the defintion\u002Bimpl inside \u0060issue_14681\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":"tests/ui/zero_repeat_side_effects.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"373127579d5fb669165c7de3e758a30668192d3fd593a10071287a5bb4acec40"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/missing_const_for_fn/could_be_const.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3a248aad40750a565e54c2c3e4a83da3b6e105899cb77d48862462199cb1a2"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Syn uses \u0060Span\u0060 from the proc_macro2 crate, and does not seem to reexport it. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ui/auxiliary/proc_macro_attr.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fedabed155d145fb47172b4599d947ef09bb61d723276eb67399ff8aae8d002"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: switch to something more ergonomic here, once 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":"src/driver.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffec5aca2b256b91a4a9a4cf1414f6511c3a2cbcb43256c589ede59cc6f5adbb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: switch to something more ergonomic here, once 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":"clippy_utils/src/lib.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"93965521acafcf942e599fe0c4f24110f55451ebb110cad0c7257188fe92c372"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: #4825; This is required, because Clippy lints that are based on MIR have to be"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/driver.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0474e58bf725a32c0823a34cf8d11e80d96d2af05cc4a4798bb9d29a1d2bef60"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this macro calls unwrap internally but is called in a panicking context!  It\u0027s not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/driver.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"734d29e98cdecac1f509786d4691bec5161546c2a8fc45bf33d54b440805142b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Jarcho): Handle all arguments here without breaking too many existing callers. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6dfed9e8412b5a6aaed0ad278f9aea4360b396cc6c6f5485802acb10836e35"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME(mejrs): this should really be checked during validation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/attrs.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d64a06076689ecda59f85ea46d82ade3e758b87772ac6d6ec7dae7566e45d06"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): use \u0060f16\u0060 once builtins are available on all host tools platforms. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/consts.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"969c370d86cf5504e1368bf358d4adf1f10b338c4158abb536aec88033d893d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): use \u0060f128\u0060 once builtins are available on all host tools platforms. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/consts.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5c9e22147f5d6bdf0f4912d89ac01cca7425e0fc1eebdb0b7635210b5f7e93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: are there inter-type equalities? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/consts.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdff219ed2159679692ace400b5643c0d833ecbf53608eda3a33001b2f5b15c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): once conversions to/from \u0060f128\u0060 are available on all platforms, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/consts.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20c09341d2a46d2d922607be6584c4ea3f478b7b198f76180bb7a24c3c94f42"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: are there any useful inter-type orderings? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/consts.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26cffdc21a7daca986c6e84bd5b6f2ed46b76efcf18a41eb8048ea765157387"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add f16 and f128 when constants are 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":"clippy_utils/src/consts.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cc6353a3f557d09fd620e1df0dd3861c701dc6a1f738237243ef8c97cf369f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add f16 and f128 when constants are 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":"clippy_utils/src/consts.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f54135bb4701228b0f56db18b9ccf310eda2ce4f5d25920b2ad3c23dc47b9a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): just use \u0060parse()\u0060 directly when available for \u0060f16\u0060/\u0060f128\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":"clippy_utils/src/consts.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"732015f8f687ae13096bafd2ee742399934a8501dd3b0e6c1c370b659762aa39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: revisit when feature \u0060gca_min_const_items\u0060 is stabilized. In the meantime, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/consts.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9d60bf5bc2156ddd4fce6d00f7a15058a253b841aadbe340fc4ce398f4cbfb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: f32/f64 currently consider \u00600.0\u0060 and \u0060-0.0\u0060 as different. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/consts.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8373f88fad253f466a66d1d97143e2dc068c60ff5f0b0f69c3159b0894cd7b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add these types when binary operations are available on all platforms \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/consts.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fc1b2b8b7fd0b767ed6c943d22b4726684e8f2f22209a16ed50d145cba70cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@Jarcho): Allow eager evaluation starting with 1.102. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cb7f52baeba5bcd5105576278d439e76b7c7f9574e4e7bf0e4c9078cf999ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@Jarcho): Allow eager evaluation starting with 1.102. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d108013b604443ab50d39df739b9aeff88cb535f7fc4ef425fdccbfaaf5d8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(@Jarcho): Allow eager evaluation starting with 1.102. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8f5f3c51113ee871d3167a10c3f6018d04787c718194084af9f4275140d417"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Actually check if either of these are true 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":"clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7997e2237749350824f075c4620f03c10320b1387ca777f16682eb9fe268af0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(flip1995): may not work \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe02a6f53467c8097feda960bd08730b5138074a2c3be827a9823f59592b691b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this could be extended to check for identical associated item bound 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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"045d1d60f3bb545e98bbe913234f644503faf0e3b5fa09ee7fd236270a9eda02"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(scrabsha): probably hash the fields 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":"clippy_utils/src/hir_utils.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a57aefe7a5e0045873cca981be1710870cd0e4922a7ae60a010d88b1ee58c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check if the local has been partially moved. Assume it has 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":"clippy_utils/src/lib.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c95c8a15f84930753e338eda5195cdd41d08862cc201cf724d5c6ca52b1851"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should be implemented using rustc/mir_build/thir machinery \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/lib.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b82722f782892becccc0d475cbdea2cb48d9e45b5130b89c2e8f084f9bbba53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should be the honest check, that pats is exhaustive 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":"clippy_utils/src/lib.rs"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ada857d430cb3644ff7b99aa08750d89ece43609aee50a8f66c4ffc6215c138"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO these types need to be recursively resolved 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":"clippy_utils/src/lib.rs"},"region":{"startLine":3283}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67ee104cde954a50abf7e01462e07a932226e38070c0db85ad0ed6c7de2f1de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO make use of \u0060use\u0060 items. Maybe we should have something more sophisticated 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":"clippy_utils/src/lib.rs"},"region":{"startLine":3320}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfa5f67b89c735b72e31c120512f6eb775c4ee6a4fd08720314453a4ca8625c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consider deleting FORMAT_MACRO_DIAG_ITEMS and using just this method \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/macros.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc1451902f309b23ebde0c7bf1ce5966b4c172cbe23f0372aa35aa313e1e3ef"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: can we check that the feature is enabled? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/msrvs.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cea3eb42caa40e0b3841654fc7dddd06e1520ce5c81c59ede1fff7ff67a849"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rustdoc documents these two using just \u0060pointer\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":"clippy_utils/src/paths.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c38ce2714134e06c9c212bd1248b8d6565a427f0c0798fbbd7d1f65d31861cd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: when analyzing a function with generic parameters, we may not have enough information 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":"clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"428aad1bf049c83612771391ae310f7ef15073f170dd285e406cdaad01dd4269"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: This is to \u0022unstabilize\u0022 the \u0060transmute\u0060 intrinsic \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":"clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fffc0e47afe210a3ef1d204af102d964414ba18bcc01b5e72eac01b95a6472"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl, fee1-dead) revert to const destruct once it works again \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"132b26e84d44dec1d60533632bf3ad764a9443eac79122d51d88234e442792b2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(const_trait_impl) constness \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e76c7f37ab6e857322088e14969a21708cf94752e77b07bb0160ddf44f2b27"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: add extra indent for the unsafe blocks: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/source.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f2277040b06a2737baae6970f1caf11888cbf324aefd54b3e457d9ded96498"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: get the argument span. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/source.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f0db1c4c38f5e1811adb5f3704a557b16711f1fb81b3295a6a530193c71a2b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME(chenyukang), remove this after type ascription is removed from 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":"clippy_utils/src/sugg.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8c37d24f6338919fe96fed204f90b17085c20d580a61cee17332dfd5743192"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME(chenyukang), remove this after type ascription is removed from 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":"clippy_utils/src/sugg.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"57260129cd7065cbf8df711e03f555885603d230a991aa9d64feae85921df6ba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME: This causes false negatives. We can\u0027t get the \u0060NodeId\u0060 from \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/usage.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c877aff2bc863340426dfbb79e0fe3f7ca734356ab31970ebb20e94db0748b07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: Handle partially consumed 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":"clippy_utils/src/visitors.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca1239711f34d9b09a1d19ae2b4618128ea78427624f0dcf3bfafc103fb3bbf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: instead of this hard-coded list, we should check if \u0060\u003Cadt\u003E::iter\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":"clippy_utils/src/ty/mod.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4ddd82a2e56c6232b10394c8856007569986cd4ba73f7562b4dc2fda8a510b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add doc \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/mir/possible_borrower.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6cca7634a92ea74df194283f03c8761490b375786f8c84353971522a9a2daf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add \u0060f16\u0060 and \u0060f128\u0060 when these types become 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":"clippy_lints/src/approx_const.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4620bc560f2860d693effa9817f2988db1754127d88a372b6c0207519ea4f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This check currently bails if the local variable has no initializer. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/assigning_clones.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce256aeba0f36e5b48007299a8fe3c82f1b905e8f71353615d791b43d9fba54b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: check for case signed -\u003E larger unsigned == only x \u003E= 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":"clippy_lints/src/checked_conversions.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"615c00c1d7999003456375dde682dbb91f85e7dd9f8a3f22e6592962b0296790"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(scrabsha): what are the semantics of view types 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":"clippy_lints/src/dereference.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"376857c0b1febd84deb84d46bf5e03746f44140254f498576d8625e818f6ebab"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle \u0060struct $name {}\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":"clippy_lints/src/empty_with_brackets.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aec153ca25d89870bfadcc9576212b16effb4ab7592085da0d5548c2ade86a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest using \u0060if let Some(v) = map.get_mut(k) { .. }\u0060 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":"clippy_lints/src/entry.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bee10f96ab55c00b14b98cd075322b5ae63bf65e1121d5caf214d0fc1890cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: suggest using \u0060if let Some(v) = map.get_mut(k) { .. }\u0060 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":"clippy_lints/src/entry.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"338349ceca49bd4bfd1a9d31fbc9abf3ac3bf5661c69e11d5668293bf2268c94"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust/#120456) - is \u0060swap_remove\u0060 correct?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/escape.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"152469710656af7de3e6f68f26e17a62737dc01d6011bfcd982bab5ddaaa3e91"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust/#120456) - is \u0060swap_remove\u0060 correct?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/escape.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f205958e0d72c78a9727c656ab50115a655ed818cbf9d15d6dc109229d12c6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust/#120456) - is \u0060swap_remove\u0060 correct?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/index_refutable_slice.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"351cc0122e78e3657150e0ee95a9310371d6fe7d56a7034beb828ca9578180c7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust/#120456) - is \u0060swap_remove\u0060 correct?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/index_refutable_slice.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ec889985b843b048cbdf6418e1a10c11048631a81eed6d525dc057ee697daa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust/#120456) - is \u0060swap_remove\u0060 correct?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e403d9743ee769e52e4057a6dae289b3497af751ff0238e5f492f9f958d20ef6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust/#120456) - is \u0060swap_remove\u0060 correct?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/only_used_in_recursion.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e9e2a3297d3d95bccc1c7f69305a9a8f8de5d7eeec8c6079fbcc3581a9c007"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust/#120456) - is \u0060swap_remove\u0060 correct?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb2bfd740e3aff632a5354ce0acb94fe3c636be3b7544adbfa793a645cb0d6e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(rust/#120456) - is \u0060swap_remove\u0060 correct?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/ifs/branches_sharing_code.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b69e42e09ef86f2636e913fa37d2fa9fd6f876c54f7421008df85b3a38aff6"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Given a closure in \u0060T.method(|| f())\u0060, where \u0060fn f() -\u003E U where U: \u0027static\u0060, \u0060T.method(f)\u0060 \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":"clippy_lints/src/eta_reduction.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"813bd7ed019d02668703c3533a6a2efb3230545f2dd8bbab4eb697ce14d099d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Do we really need this \u0060local_used_in\u0060 check? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/eta_reduction.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabfc19ff31d494ac690035a5b48c448d2a853eb0122c2e8f6fd071f0a3b2938"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should be rewritten using \u0060LateLintPass\u0060 so we can use \u0060is_from_proc_macro\u0060 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":"clippy_lints/src/excessive_nesting.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd8369194706245f6e23fcb103d213c176a851e50549a6c68585f4885e18ddf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): do a check like the others when parsing is 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":"clippy_lints/src/float_literal.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"601fb5970aa804594452d921be303aae59e80aae096dc621d913d219d59abd7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: omit the note if the \u0060Write\u0060 trait is imported at point \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/format_push_string.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce488da6d3e66a4dc484af229c27ae5923c48355194ad9e3b5d13ade10a09c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: omit the note if the \u0060Write\u0060 trait is imported at point \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/format_push_string.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e9c1dd37901fccefd0244166db30f618a71c7cbf4a925cfb5d81f3207c866b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could potentially replace \u0022clippy_utils::return_ty\u0022 with 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":"clippy_lints/src/future_not_send.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"36189e8cad1a95dc051c45d0e4a7de1af0dba7e5244084abec36cf494ab53ee1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Jarcho): We should have an internal lint to detect when this list is out of date. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/incompatible_msrv.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5fcae65ea1b7baa56eea213fb775bf1e6d3a918ab484c40910b2ea97cc5bd0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Jarcho): Check that the actual desugaring or std macro is supported by 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":"clippy_lints/src/incompatible_msrv.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"220799ae0d0b9dd035eff020cbab10ea5cf4246d80f42fb7c697f8eb89c4f1de"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Jarcho): What should we do about version dependant macros from external crates? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/incompatible_msrv.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f284cf47b56d1718d716b9e9dcfa122c460c54c61178b8f67532ef3e87b83ad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ideally this would handle type params and projections properly, for now just assume it\u0027s the same 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":"clippy_lints/src/indexing_slicing.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec8c22c20dd8dafa9374c4e7117fcb8fc8823aa34d72449be6993b10a177e80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ExprKind::Loop \u002B Match \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/infinite_iter.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2043dbb15814f6c2acf70af50990e5ff88b24372e313c56549cfa6cd1f0d511"}},{"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":"clippy_lints/src/iter_not_returning_iterator.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecc363de6aa490ad85edc43814fb693a23bd266652d65c815a61ce46642e6a9"}},{"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":"clippy_lints/src/iter_not_returning_iterator.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0468d92bc4c625808fba53887edecc227df167bf524da210e9a6a4ad5b3d56c1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(generic_const_items): I don\u0027t think checking \u0060generics.hwcp\u0060 suffices as 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":"clippy_lints/src/large_const_arrays.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1f8c9c1ce41912761318bda108e46e447004c4b7cb991af3c8239a394461a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is there a cleaner, robust way to ask this question? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/large_unopt_stack_frames.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"48339a5a7353adb202a98efbb5e1a869a04fbef045df662a3dbb621844f70930"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: we might want to relax this to allow \u0060\u0026self\u0060 and \u0060\u0026mut self\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":"clippy_lints/src/len_without_is_empty.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ddea57fea379e33cd959bf2fdea2e2cc9cae8ff1d8a0099d747c1f6818a69f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should not suggest \u0060mut\u0060 if we can detect that the variable is not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/let_if_seq.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dd506eedc4354ad7e1dc36df4760df42565b3813820a77b1f6b39640648285"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: There\u0027s probably some better way to do this, i.e., create \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/manual_float_methods.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebdb2881824b5ebde2b09cab73c4a162f6f20e29a975901187a3b944f15d9a3e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Support more complex patterns. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/manual_let_else.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"37aed2b33bdf5dcf5fc436500078ecbbced0014a16d69212128eeda447f9b271"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is a bit of a hack, but it does its job. Ideally, we\u0027d check if pat_to_put 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":"clippy_lints/src/manual_let_else.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3521a62a1296202e3c1054657526a2a5b2d0ed36daba82967238a3e641fc584"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: only look for *used* 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":"clippy_lints/src/manual_let_else.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9632ad7eba66475fcf261b1982dd5aededec116378b9b8d76c4b24aa8bd9c92"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally this would be a suggestion, but the span for that is annoying to get. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/manual_non_exhaustive.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7020ddae890a468c8b4adbb3695739d779cc2647ab3500186512166dd0120969"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally this would be a suggestion, but the span for that is annoying to get. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/manual_non_exhaustive.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6539275213c0acebb222d7ef6a102dcff0f52bbdd0e132fa5b85acce7fd75668"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: Ideally, we can rewrite the lambda by stripping one level of reference \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/manual_retain.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b0809c250d4df4f6a21905b3fb8f786147ca3fca0f75b5bebd026ca992ece4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ideally, we can rewrite the lambda by stripping one level of reference \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/manual_retain.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce486bebd2c5df0bbccd1981f7ef2a8e29df1fe89ca12bbdb7446fe8a22cd39"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Jarcho): Capture a span from the config and point to it 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":"clippy_lints/src/min_ident_chars.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4125ab40154c28fc558840af8249b733c7dc461058961e885b874414a68e4df7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: 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":"clippy_lints/src/mixed_read_write_in_expression.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"730722464e1c5fd88e2e7f69c6a3924343238dc012893ad9f33da86eab4b888a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove filter once https://github.com/rust-lang/rust/issues/160895 is in stable"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/needless_borrows_for_generic_args.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"313af192be4e448b3e99cfaa8e6aa8366eefcbfaca6a8a0ca5b358688e16a21c"}},{"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":"clippy_lints/src/non_canonical_impls.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03b1e72b704a55952ca98cf5d9738b9e80d51a9b0926ca6e3986e5e6e20a0ef"}},{"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":"clippy_lints/src/non_canonical_impls.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"402ecd03fbe333d9e9258774590526f649e920fbf03835faedbfd92204b21e2d"}},{"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":"clippy_lints/src/non_canonical_impls.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f38082746d7a0dea5d3bdd59efd90101a69a9477a063d86466475f68bc8417"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: this should probably be using the trait 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":"clippy_lints/src/non_copy_const.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e4b6ab0b9fb6bcc10aa4f292d60ba00a3750a6f23cafb877a682d9ff4009ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check 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":"clippy_lints/src/non_copy_const.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea6e39c1921f81bdc87ff1d43c0195f5a7cec78f171597af5c9f292a1773576"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we just assume mgca rhs\u0027s are freeze \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/non_copy_const.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d72f60954dd99ba90afcc19166513ea583d89e4e37ed081fef6d5c37bc8944"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we just assume mgca rhs\u0027s are freeze \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/non_copy_const.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"10805e03a1d0f925b3a882a14c132b7ba88f5ee2fdc2e385bb2c3ae543f77ba4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we just assume mgca rhs\u0027s are freeze \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/non_copy_const.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"259a2e54b31a78132d84482ce9f345f8dbf3f5041c1c6ebe4bd35aedb9d78b98"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: find a way to cache the result. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/non_std_lazy_statics.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b821aa91a1bc8dfee0ebe70e6ede69ac5a62e7e8e5e22ac3c1bed7887e0b4c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Before moving this lint out of nursery, the lint name needs to be updated. It now 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":"clippy_lints/src/option_if_let_else.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2d86aa326b45dfa29380ba342d748e5c6027a775fe20ca04ecb75e2eaa7301"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check all the references made in the scrutinee expression. This will require interacting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/option_if_let_else.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cc12482e6439b0310b1e5ead23e64a1cc3ebb7bdfaf2d9154d19a8fff94104"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check all the references made in the scrutinee expression. This will require interacting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/manual_utils.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb51da5af7b7f47a4071d7805a087de14fdb2ce35311879e5790958ec76bbbe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cover more match 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":"clippy_lints/src/option_if_let_else.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dee776dea560eaee9ea61c16e0410df66f770cde84495a72157adab4c33ff5"}},{"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":"clippy_lints/src/panic_unimplemented.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd120bd7bedd1bc83b2fb9a4d9f88d04a2521a2c0c195b88e0377ebdc0c54941"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Limit the check only to raw pointers to the argument (or part of the 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":"clippy_lints/src/pass_by_ref_or_value.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f5e0be51571daf11f65176842ae81c0a202b004f6e8080e352ee46238f1951"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Note that the current implementation may still return false positives. A proper fix would \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/ranges.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0384785f2e1aa732d10f55e8bd6bb657c33fa19fd4186cea810db6b5af708c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Actually check for mutation of non-temporaries. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/redundant_clone.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bab677a1ad23d8d5f6a6535db10625e1945213984e00baa7ef9d8a360dc1a12"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(@Jarcho): \u0060indent_of\u0060 walks to the root context before getting the indent \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/redundant_else.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"5099fb1f6a1a6684431f5cfba807bd58b83a9c82057158285a6739d529b309df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check for non primty \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/redundant_type_annotations.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b40385d04af6c6846043d19e3e9cab906efd6e121fbe800f02a09e9e2f8efe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: 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":"clippy_lints/src/same_name_method.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d9404ef29eb1e9b7b715da854f45a0d286f149e42f0b2f1bd7bc591c3da694"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO should we \u0060span_note\u0060 on every trait? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/same_name_method.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"783f6b3a4338e6c446ee0c82dfd069cf8acb818363b5d653c55057e4cd4a55eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add \u0060ReadBuf\u0060 (RFC 2930) in \u0022How to fix\u0022 once it is available in std \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/uninit_vec.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9a9cbdaeb31da64767176557900e554e49decdbf482ebd8fe5b57620741369"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: update to a visitor-based implementation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/uninit_vec.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"44370ef2d61aec9923531ee37b4e8b5e8e908a0408026aba440423b7d69c4bf6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Improve this to the same complexity as the Visitor to catch more implicit return 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":"clippy_lints/src/unnecessary_literal_bound.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"da10e18992352a4bfd17ec9bbe05e6856e8b9c143adfa5d48c62e52f6b8dc663"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: rewrite as a generator returning \u0060SelfImport\u0060s, if those ever get 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":"clippy_lints/src/unnecessary_self_imports.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"690cc0e8c2ba63ee08d53de16581cab67016e1939611b6997a5855e2012058d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do not propose to replace *XX if XX is not Copy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/unnecessary_struct_initialization.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f692a88577a19380e2e5dc36fb2b94777a2bf204a3efeb095806dc1a148d10e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we should instead get the span including the \u0060-\u003E\u0060 and suggest an \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/unnecessary_wraps.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5066cc3f51ef068629f6f11a92abc665d97166282218ce4b9cfcfd9627456ea9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(pin_ergonomics): handle pinned patterns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/unnested_or_patterns.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1772f35e007fed3be944f96a647456f26953cf96d6fa7d77162b03b56e48a0c"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: \u0060ident.span\u0060 points at either the final segment of the import path, \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":"clippy_lints/src/unused_trait_names.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ac8f947a9a503e853143e3827932b23f4790ab9286a4337853bae9696838c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle inferred lifetimes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/use_self.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0ec8e04dda7803ca6daa6d23efd3e8770bdf038df13ba042080244c750d28c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - constant_simple does not fold many operations involving floats. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/zero_div_zero.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"61588df5d1c7bfe05413999f082aed58249eb9393f05d0126a7784116c758eca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add these types when eq is available on all platforms \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/zero_div_zero.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0deb52af2aa170797723d00f747af230e32401efa83f801bddb7dd9dd7329ad"}},{"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":"clippy_lints/src/zero_sized_map_values.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"805056cb1adc3e918049103c080418a5d58f0dd02dcdd7e4d9c999fac29d9c0a"}},{"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":"clippy_lints/src/zero_sized_map_values.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cc70d237b8c7a38f1b90979ee285f42b341862ee44f3eb3f5951a73faf3dda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a less awkward way to do 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":"clippy_lints/src/unit_types/let_unit_value.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"671359209a19e77f03cd6e477e848f0c93f24c9700750410641a42d8257f2cc0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: ideally we would like to warn *if the complicated type can be simplified*, but it\u0027s hard \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/types/mod.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"5095cc725d262acecaf9a05752b078e28bb4487a78d9937bb44db1e68d3d699b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Merge this lint with USELESS_TRANSMUTE once that is out of the nursery. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/transmute/mod.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a589a63d3df9fd5c4140fe8eeb6375deb6b238d6202892a6a05dd1da4914980"}},{"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":"clippy_lints/src/transmute/transmute_null_to_fn.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"be422ac92eea40b555b21a65f8b5b358a06e283193d26dacdf1efd186e25a58c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check if the conversion to or from at least one of a union\u0027s fields is valid. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"26813aa269512053972794c76e10ec006a6a0a32541310161e0e5856c4cc6ce0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: check const parameters better as well. Currently this will consider \u0060Array\u003C5\u003E\u0060 the same 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":"clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f744eb3d1a0e5370cd5053019558136b2bc40c455b05aa36bc253ecf46f3dde"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This will have false negatives as it doesn\u0027t check if the borrows are \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/operators/assign_op_pattern.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c3aeaa0989ea968650c46bc4fd34f2c8838d93e45dd59000b1cf227dfa7249"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add when equality check is available on all platforms \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/operators/float_cmp.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8347888ce2321714ac380b3d87b3dcd51e6a9060dad85c5567c7e613c1c9ba8e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add when casting is available on all platforms \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/operators/modulo_arithmetic.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3037d9db6650b5fcdedc79d1cec94b5a9ca7ec1be4571af52c55416671e976d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Find a better way to detect those 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":"clippy_lints/src/misc_early/mod.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c95144724db29017119e4d2a183c3880a82cf8c699dfd2efce4f39ad7659758"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Change this to lint only when the referred iterator is not used later. If it is used later, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/double_ended_iterator_last.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74eb808aed2fedb50af86f423d158b91a50664c954bf51a31cbc7f476413a53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This doesn\u0027t handle if either the start or end are negative literals, or if the start 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":"clippy_lints/src/methods/map_with_unused_argument_over_ranges.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3aeabca3b635b68920dc27ce23b48e0411bd29da28e57c9568b1be1a1007136"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: try to fix \u0060can_change_type\u0060 to make it work in this case. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ff5bc908408314f77b6057c81c366407b4dc7fb6aacbb78e5bc892a01a18da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this \u0060MachineApplicable\u0060 when the function comes from std/alloc/core \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/unnecessary_unwrap_unchecked.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb11f1775af60baa83a27d4e3242884070ee79c48309898b253de9f7e284882"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Allow more complex 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":"clippy_lints/src/matches/manual_map.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8273fe633745f324e90c1f308253135c5286bd0e8776a9fa90f95969a3efa867"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle explicit reference 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":"clippy_lints/src/matches/manual_utils.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfddeea49e5be5abce7f6e829c713de8e1370066951ede8a63e569c85d16ee00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle negative integers. They\u0027re currently treated as a wild match. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5632ab3da04d5b3bf7f7b10471fb09e91a50eba6cf2ea47effa1c27c69a29ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle negative integers. They\u0027re currently treated as a wild match. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36547f7cbeeb39db20fa07698cd33a547bc61bdda1cb267a9893883e189933d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check fields 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":"clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa2e24ae68ee26cf03dd6fbb76311ea9e07bac61a1a16310aba42ffb2ca4b0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Lit* with Path, Range with Path, LitBytes with 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":"clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c46273ea9478feb337c7bf60e2aa3eb02c348e87ba83f16ec91ed3faff9ce60"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(clippy): don\u0027t you want to use the hir id of the peeled pat? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/matches/match_wild_enum.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d13198c519f54a0a36cf09d9a2541687bbbb72fde0337fa448010bae21706b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///     _ =\u003E 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":"clippy_lints/src/matches/mod.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6034dab3c6600eee43a212bd469545c303187aed6c85c1f13d58c0e26e3595b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ///     _ =\u003E 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":"clippy_lints/src/matches/mod.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"a059216788a2906bcefc4b8c0fbbf9a1c1f1f5ddbee275cca8d4c47f9ba2be4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use \u0060slice::as_array\u0060 once 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":"clippy_lints/src/matches/redundant_pattern_match.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d3b2a9d08eec44ed5e05d9a502023cf3084552e3061f8570997851c35997dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The lifetime is still there but it\u0027s for a inner type. For instance, 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":"clippy_lints/src/matches/significant_drop_in_scrutinee.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4ddabc0d8a48eb6d70fe64d6aeedce57351633ba54ceaf70e7feab34c478d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // passed by reference. TODO: If the struct can be partially moved from and the struct isn\u0027t used \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/loops/while_let_on_iterator.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"259b328b2d850c3bd5587cd0a069df83b084566a47d72c4047c1a052d0ed55a6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This can be a false positive if the correct field is reachable through deeper \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/functions/misnamed_getters.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ca2ac84f6de3f5666f582e8463e3a20cb5bb77dbbead64014f491cb35d6dd3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: needs to be an EARLY LINT. all attribute lints 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":"clippy_lints/src/functions/must_use.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df6933abfbfe49b14c3ed705c221fd78b9dd2bed543188faf6d9841479f30fd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann): this used to give a machine-applicable fix. However, it was super fragile, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/functions/must_use.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb832f00776fdaa3d0ec89b2d36e62aaabc7a2a05c918897c39cd27033df424"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(jdonszelmann): this used to give a machine-applicable fix. However, it was super fragile, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/functions/must_use.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b266b52e78aab7ffc904a55fc9ce35abcf3b88dad0fe482d5e9e5684f311a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Lint expressions of the form \u0060x.exp() - y\u0060 where y \u003E 1 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/floating_point_arithmetic/expm1.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f784242e127ef0881b8c3dbd8e1ca3f94ae67a99a711e6244f45cf7f4adcc89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Lint expressions of the form \u0060(x \u002B y).ln()\u0060 where y \u003E 1 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":"clippy_lints/src/floating_point_arithmetic/ln1p.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b72fd508bca78655ea87ebcd3edf26b1f50889179906b712de1b6920c0245e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: also check for constant values near PI/180 or 180/PI \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/floating_point_arithmetic/radians.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"12215f31c6f5d17c0866d8a3777e66205f60d1639a90f56cb614bdbadf60c941"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle \u0060f16\u0060 and \u0060f128\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":"clippy_lints/src/casts/cast_lossless.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e80f0d68fd87faf19b1b0389cae2b61332aed8fac5355a8a467e791a05c433"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: handle \u0060f16\u0060 and \u0060f128\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":"clippy_lints/src/casts/cast_precision_loss.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a05292b4bb4f3ff64a003505a4e5351921100ccfe664110dc1e1bb61a703c4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(f16_f128): add these types when nan checks are available on all platforms \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/casts/cast_nan_to_int.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04add6d23c38bbda3b67291b850af3fd601ecc3ac7f754d3d8d319e6217fa12"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //FIXME: make this a diagnostic item \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"876ae2a2f0be34a4a2a2a316e80bd0a7b151787fe720d962e97d72fe213f27f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove the condition for const contexts when \u0060try_from\u0060 and other commonly used 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":"clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4bcd5aaf1164670e3e44c3cca1bf7244523e5fa3e8ccad96ae00463261955f"}},{"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":"clippy_lints/src/casts/mod.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f696bce572cbbd2d552402fa98d4d36dbf67065b6fc0e9119921dfb2a969c29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: set xx to the version one below the MSRV used by the lint, and yy 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":"clippy_dev/src/new_lint.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"7416dfb5be83dad26d45da1135f078c2c772b855d113b603f330defa96226e6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add MSRV level to \u0060clippy_utils/src/msrvs.rs\u0060 if needed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_dev/src/new_lint.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf6e2fe0c300b97d8a2c2d0a0708296560d65b8ce32191d63717982e4c698f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Update msrv config comment in \u0060clippy_config/src/conf.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":"clippy_dev/src/new_lint.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e172810338d1db44cc28b8a15b6162c108af18c6225d23d0f7e66b0861917fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Adjust the parameters as necessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_dev/src/new_lint.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"6573269d207a2281eabd13c44a53b2d2e2e4dd6ef273f62c1f1e37e0e57cdef1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Adjust the parameters as necessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_dev/src/new_lint.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7aa7bbebd28ad8166c9c59b772ccbe6a89670f32e475257b260ae3eeae66cc6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: emit 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":"clippy_config/src/conf.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c43e0ee1d2e6c0d2727bd540351d78b3143ad4b98fe7092c1f0bc8ab7aba18a"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. The recognised ADR directories in this tree were read \u2014 \u0060book/src/development/proposals\u0060 \u2014 and none of their files is a decision record (a README, index or template page does not count). 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 \u0060Cargo.toml\u0060 makes this repository a deployable product (line 13)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Cargo.toml"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a1f320edebd162aecb630322055fab9fa4bd5274ac8a03cd339206970700a5"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 10 project(s) overshoot their size bounds, lowering Project Cohesion to 8.0/10. The most over is \u0060clippy_lints\u0060 (125281 LoC, 787 module-visible types across 22 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":"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":"c3467675ee3bd68f7415a6c2868f728da1eef2e9dc202dac3efc71544d0ddd6a"},"properties":{"dependency":{"package":"glob","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e85f741c8cea9d17458f45e3d23caf0113cc4117df35ca17b1728af6d22b75d"},"properties":{"dependency":{"package":"minimatch","version":"9.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 4 of 599 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; 599 of the 820 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: clippy_utils/src/numeric_literal.rs, clippy_lints/src/rc_clone_in_vec_init.rs, clippy_lints/src/reserve_after_initialization.rs, clippy_lints/src/unit_types/mod.rs. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_utils/src/numeric_literal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8220c83f0bb311e0a111be6873abb85cb0f39b545b9da26f90189dec4a5e6c27"}},{"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":"clippy_lints/src/rc_clone_in_vec_init.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbe7d63680825a62d2535295595617898fb5ca5c67a94af392bd8ad64e0ed5b"}},{"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":"clippy_lints/src/reserve_after_initialization.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60524e2ff5220cf140e2ce75f9eacc5005610b484516f5462e3ae0bd4d57eab"}},{"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":"clippy_lints/src/unit_types/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bba6f416120ba4f71a58fa55c507085eb2df5417bbd381855066df71a643df9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: collapsible_if.rs \u2194 needless_return.rs: \u0060clippy_lints/src/collapsible_if.rs\u0060 and \u0060clippy_lints/src/returns/needless_return.rs\u0060 change together 64% of the time (9 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00600a9ad277\u0060 use Lintname in lint machinery; \u00606a262ff0\u0060 factor out lint name; \u006091bf9e8e\u0060 Remove \u0060rest\u0060 in \u0060LintCheck\u0060 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/collapsible_if.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5fd1fc1777fd1e3e03cbe62e12c263b7f16b0e8d730d46d0cd3208e4fcfe48"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de8921af94eafb47ca6e8641ec9815eb4d850114727aea738e163981ae524d51"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging call was found in the 835 Python, JavaScript/TypeScript, Rust production file(s) this check read across 13 module(s). Each was searched for its ecosystem\u0027s logging libraries (Python: logging, structlog, loguru; JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger; Rust: the log and tracing crates (info!/warn!/error!, #[instrument]), slog, env_logger) and for a call on a receiver named \u0060log\u0060/\u0060logger\u0060 (or ending in \u0060Logger\u0060/\u0060_logger\u0060) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read \u2014 this is \u0027no logging found by this walk\u0027, not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060.github/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":".github/package.json"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4939445fbf9d824f46577b49497738324a7769a7beb169da2092ae606b16ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060F32(f32_consts::E) == value || F64(f64_consts::E) == value\u0060 appears character-identically in 2 files \u2014 clippy_lints/src/floating_point_arithmetic/log_base.rs, clippy_lints/src/floating_point_arithmetic/powf.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":"clippy_lints/src/floating_point_arithmetic/log_base.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0633ba1060d8b9e020552b9bd2a86e77cae9751d4819c6f7a99be0e9e7b5a900"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arms \u0026\u0026 first_arm.guard.is_none() \u0026\u0026 second_arm.guard.is_none()\u0060 appears character-identically in 2 files \u2014 clippy_lints/src/matches/manual_filter.rs, clippy_lints/src/option_if_let_else.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":"clippy_lints/src/matches/manual_filter.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"843c5ec499ddb652bd0dd759242a51f6318e115d1b47b30391e19f9772a09a91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060explicit_params.get(idx \u002B 1) \u0026\u0026 end != Some(next.def_id)\u0060 appears character-identically in 2 files \u2014 clippy_lints/src/extra_unused_type_parameters.rs, clippy_lints/src/lifetimes.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":"clippy_lints/src/extra_unused_type_parameters.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c5faff109d5ff600b67a9b763b17e081d8c5328a7977c08e3c0c080316b0dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expr.kind \u0026\u0026 !expr.span.from_expansion()\u0060 appears character-identically in 2 files \u2014 clippy_lints/src/len_zero.rs, clippy_lints/src/single_range_in_vec_init.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":"clippy_lints/src/len_zero.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44a8e76ce09de724f8cdc94cbf4ba6500913fb3ca1fcfce7e3d9f164117d499"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expr.kind \u0026\u0026 self_arg.res_local_id() == Some(searcher.local_id) \u0026\u0026 name.ident.name == sym::push\u0060 appears character-identically in 2 files \u2014 clippy_lints/src/pathbuf_init_then_push.rs, clippy_lints/src/vec_init_then_push.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":"clippy_lints/src/pathbuf_init_then_push.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcacfae08d60878fa73a4dae56740240cf526627ea916365ad8714ef53e971df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060header.abi != ExternAbi::Rust || requires_exact_signature(attrs)\u0060 appears character-identically in 2 files \u2014 clippy_lints/src/needless_pass_by_ref_mut.rs, clippy_lints/src/needless_pass_by_value.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":"clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4ab577034c7d99f6c2daad9e83ce8baab344a3d64664dbf697f850e67601d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.avoid_breaking_exported_api \u0026\u0026 cx.effective_visibilities.is_exported(def_id)\u0060 appears character-identically in 3 files \u2014 clippy_lints/src/pass_by_ref_or_value.rs, clippy_lints/src/unnecessary_box_returns.rs, clippy_lints/src/unnecessary_wraps.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":"clippy_lints/src/pass_by_ref_or_value.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"8724cde8c36d478eeba28945dcfded2f51cbed6346a4ec1d585970b44059a247"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.avoid_breaking_exported_api \u0026\u0026 cx.effective_visibilities.is_exported(fn_def_id)\u0060 appears character-identically in 2 files \u2014 clippy_lints/src/needless_pass_by_ref_mut.rs, clippy_lints/src/single_call_fn.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":"clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"062a6b125fbe15e91ad2cea014d1a313a2d3b148574aba8488c4d71b9fa0cf71"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.const_span \u0026\u0026 span.contains(body_span)\u0060 appears character-identically in 2 files \u2014 clippy_lints/src/operators/arithmetic_side_effects.rs, clippy_lints/src/operators/numeric_arithmetic.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":"clippy_lints/src/operators/arithmetic_side_effects.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cef82b7d2885a3503082cd2acfbda3129350c31efce3d9f8088cf0ce4f92144"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ty.is_str() || ty.is_lang_item(cx, LangItem::String)\u0060 appears character-identically in 3 files \u2014 clippy_lints/src/assert_is_empty.rs, clippy_lints/src/methods/manual_str_repeat.rs, clippy_lints/src/methods/no_effect_replace.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":"clippy_lints/src/assert_is_empty.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"4028cfbdf6ef29f12fb158441f03b945a77561adcad8089eea1542803116cdb5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ty.ty_adt_def() \u0026\u0026 get_clippy_attr(self.cx.tcx, adt.did(), sym::has_significant_drop).is_some()\u0060 appears character-identically in 2 files \u2014 clippy_lints/src/matches/significant_drop_in_scrutinee.rs, clippy_lints/src/significant_drop_tightening.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":"clippy_lints/src/matches/significant_drop_in_scrutinee.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33395ba69f5961cbe56f546517592656b746b369d88b1e80d8ed51fea00fd06"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060utils::is_signedness_cast(cast_from, cast_to) \u0026\u0026 msrv.meets(cx, msrvs::INTEGER_SIGN_CAST)\u0060 appears character-identically in 2 files \u2014 clippy_lints/src/casts/cast_possible_wrap.rs, clippy_lints/src/casts/cast_sign_loss.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":"clippy_lints/src/casts/cast_possible_wrap.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"41358470a6fe7ec9b1b4b10cb2a373b94f069d71177a2ed07d5bcbde055f7393"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060target_dir\u0060 turns every \u0060Err\u0060 into \u0060\u0022target\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lintcheck/src/main.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"5280475d74c74845c7aa3d4affee6b1fa82e3e1d56e7e8cc60ce32b95b4eb96d"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-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":7,"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."]}]}