{"$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":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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":"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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"id":"D33","name":"JS/npm Dependency Vulnerabilities","shortDescription":{"text":"JS/npm Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D33","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"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D38","name":"OSV Dependency Vulnerabilities","shortDescription":{"text":"OSV Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D38","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"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"old_archs::old_archs (cyclomatic 1358): old_archs::old_archs has cyclomatic complexity 1358 (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":"compiler/rustc_codegen_gcc/src/intrinsic/old_archs.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bd1664accbdc0dcb593beeb0f6d290709d51bef1c831bab85c76b31d8a974c"}},{"ruleId":"D1","level":"warning","message":{"text":"simd::codegen_simd_intrinsic_call (cyclomatic 200): simd::codegen_simd_intrinsic_call has cyclomatic complexity 200 (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":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4f445dd138ab86044c71bcdad34f0bfbfbdc70a68e20017ba82489e0006677"}},{"ruleId":"D1","level":"warning","message":{"text":"stdarch_gen_loongarch::gen_test_body (cyclomatic 198): stdarch_gen_loongarch::gen_test_body has cyclomatic complexity 198 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7f5a68d8feabf7488e9c45cb75589576dfb07b37b01e33e11cd4d84c1660c7"}},{"ruleId":"D1","level":"warning","message":{"text":"Methods::check_methods (cyclomatic 188): Methods::check_methods has cyclomatic complexity 188 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/mod.rs"},"region":{"startLine":5268}}}],"partialFingerprints":{"codehealthFindingId/v1":"819f82b60280082487ba62c8791f6c9868dc77f43e188fbab5a64d5084a35fc9"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cyclomatic 156): EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 156 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b7a3f9623bd14c8958c6e0a1288970046c3614e68ae566376953c0035430fe"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis::classify_name_ref (cyclomatic 152): analysis::classify_name_ref has cyclomatic complexity 152 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2dcafdbd49496ae64324a819248191387d074d4bfa37bcc4078856012f910e"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::eval_simd_intrinsic (cyclomatic 138): InterpCx::eval_simd_intrinsic has cyclomatic complexity 138 (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":"compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab21fe91547bcab79c1965053caff002e3b8139fdbecdc586932fef04653b18"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::exec_intrinsic (cyclomatic 134): Evaluator::exec_intrinsic has cyclomatic complexity 134 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93c130fa81b3e0abc68ffc3075b287aa2bd9c19e93fc45a9d3ec19841f606f4"}},{"ruleId":"D1","level":"warning","message":{"text":"stdarch_gen_loongarch::gen_bind_body (cyclomatic 129): stdarch_gen_loongarch::gen_bind_body has cyclomatic complexity 129 (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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfedb8dbe1011f9e78c832199fef7d997dd405e7bf0e3641245af6a5fc803130"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::cargo (cyclomatic 120): Builder::cargo has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7e074cff1e9bab938797fa6227e75e14b70a184efe41f40bb19741b78b9396"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::parse_inner (cyclomatic 120): Config::parse_inner has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/config.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cb5cab7ba8e9d94befbe1ebe7774e97a2ff9d6c178dd96da43ced50448bc47"}},{"ruleId":"D1","level":"warning","message":{"text":"Ty::hir_fmt (cyclomatic 117): Ty::hir_fmt has cyclomatic complexity 117 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/display.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c006478c0b973569c8c88eee3501c48311219fda631be2554781f6a4d6bf25"}},{"ruleId":"D1","level":"warning","message":{"text":"intrinsics::codegen_regular_intrinsic_call (cyclomatic 111): intrinsics::codegen_regular_intrinsic_call has cyclomatic complexity 111 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a87a25c7663d9241c82478941d94d7dff4e251f28992f9310a543d035f68db"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::eval_intrinsic (cyclomatic 111): InterpCx::eval_intrinsic has cyclomatic complexity 111 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/intrinsics.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"903dc1bb2ec97bc502565746b33a934e5383f6bec3b6bdeff33c64764b30f74a"}},{"ruleId":"D1","level":"warning","message":{"text":"MirLowerCtx::lower_expr_to_place_without_adjust (cyclomatic 108): MirLowerCtx::lower_expr_to_place_without_adjust has cyclomatic complexity 108 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04aca49ca28943b701939ffd4fbbe9d28a7ef2d541e42fc7cd12e5a1ede48bf"}},{"ruleId":"D1","level":"warning","message":{"text":"intrinsic::generic_simd_intrinsic (cyclomatic 107): intrinsic::generic_simd_intrinsic has cyclomatic complexity 107 (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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8ada113c4e6905cbafb3c13a093bad776a42e4747e8a42ced1b096d5f6ae17"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cyclomatic 107): EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 107 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ada42fe3849a76e9d38024bffa3e51fa515ab8f9093dfc8cbcaabd1cab6879"}},{"ruleId":"D1","level":"warning","message":{"text":"ThirBuildCx::make_mirror_unadjusted (cyclomatic 101): ThirBuildCx::make_mirror_unadjusted has cyclomatic complexity 101 (threshold 15). Of this number, 99 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc950d83237d5ffac0b32d82a91af0c2952aa2e9eec5eca6775f5368ccb23f8"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_expr_inner (cyclomatic 98): InferenceContext::infer_expr_inner has cyclomatic complexity 98 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"342c181bace430d01b683d7680bf2db3c7540e2b2904c2079f429b4197beccc7"}},{"ruleId":"D1","level":"warning","message":{"text":"llvm_x86::codegen_x86_llvm_intrinsic_call (cyclomatic 97): llvm_x86::codegen_x86_llvm_intrinsic_call has cyclomatic complexity 97 (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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"09852e885a6308b63a7771c6c865d0a093f171bc4393a29c269fd2a12eab6a3c"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::semantic_diagnostics (cyclomatic 97): ide_diagnostics::semantic_diagnostics has cyclomatic complexity 97 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2d4ba5a8716fa434e99d31b122d1e1f68abbd4b3e5baffa13f4feef14299e0"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::eval_rvalue (cyclomatic 96): Evaluator::eval_rvalue has cyclomatic complexity 96 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0ec77838feb0f2b30dee252ae778d020903ccda17fa54ac2c27e50a753db03"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::codegen_intrinsic_call (cyclomatic 95): Builder::codegen_intrinsic_call has cyclomatic complexity 95 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63150a6d780bb712fcfd799553afba6f5952601d687ff6baeb673493fde7e38"}},{"ruleId":"D1","level":"warning","message":{"text":"miri::main (cyclomatic 93): miri::main has cyclomatic complexity 93 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/bin/miri.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91a19339ab00f9cb689803a80d06f45e9615516f180b7d7f7b4858d261d0039"}},{"ruleId":"D1","level":"warning","message":{"text":"Options::from_matches (cyclomatic 92): Options::from_matches has cyclomatic complexity 92 (threshold 15). Of this number, 89 points are the body\u0027s own statements and 3 belong to one function item declared inside it. 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/librustdoc/config.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"6676eb76ce14fcb2b5b4e8fbdaf83c902984caf7e8fe528dd639507618892784"}},{"ruleId":"D1","level":"warning","message":{"text":"intrinsics::codegen_float_intrinsic_call (cyclomatic 91): intrinsics::codegen_float_intrinsic_call has cyclomatic complexity 91 (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":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08b2a7a67e2df8a65be4de864b1c1b0cac3dccb74306295bd879ad96f54c6e0"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChecker::visit_rvalue (cyclomatic 87): TypeChecker::visit_rvalue has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"96eb91214cbd04c6f4b7bfd852a80da78aafed7025c690ffcc36e2e801529e31"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::report_selection_error (cyclomatic 87): TypeErrCtxt::report_selection_error has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f52fc6059a8e314f816fcf0ee8a88d72f3689e91424f4c39ed902698dc6ec6a"}},{"ruleId":"D1","level":"warning","message":{"text":"style::check_file_style (cyclomatic 87): style::check_file_style has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/style.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7c7b14c59095bc3906c7cc751a6e184f5395632b4d21250ae0a5e671eb2606"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_expr_outer_attr_style (cyclomatic 86): State::print_expr_outer_attr_style has cyclomatic complexity 86 (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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"1caff2d877f6a0da585d6e83d36660ca6974af8a17130da1bffe9fed885d66a2"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprCollector::maybe_collect_expr (cyclomatic 86): ExprCollector::maybe_collect_expr has cyclomatic complexity 86 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d6c41e71367e461d309b929e3f5ef4b1518163f00d6d28291cb66293ea79b7"}},{"ruleId":"D1","level":"warning","message":{"text":"simd::generic_simd_intrinsic (cyclomatic 85): simd::generic_simd_intrinsic has cyclomatic complexity 85 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"48222e49045e4ecfb13d8a2982984c66d14c8bf76256f986e1ad19fdcfea40a4"}},{"ruleId":"D1","level":"warning","message":{"text":"asm::reg_to_llvm (cyclomatic 85): asm::reg_to_llvm has cyclomatic complexity 85 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"48eb348bdfd5040c02d7af3c1861a31845e9c7e2e2b814d470e601d2f71a5ef2"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer::print_expr_in (cyclomatic 84): Printer::print_expr_in has cyclomatic complexity 84 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74a8e8ffc2ef69404c7c996a055dcc638ca20a64e2a31558cb685094a657f0c"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_intrinsic_call (cyclomatic 83): FunctionCx::codegen_intrinsic_call has cyclomatic complexity 83 (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":"compiler/rustc_codegen_ssa/src/mir/intrinsic.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d82e7de7a17ec4f474ddd93f5c3f0425e7889e8bb6d86cf4c26b150c60088c1"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::note_type_err (cyclomatic 83): TypeErrCtxt::note_type_err has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"726df3e4b07565257a4966c9f32b7103c5b48f92c501c8d517a5d61ab261513d"}},{"ruleId":"D1","level":"warning","message":{"text":"llvm_aarch64::codegen_aarch64_llvm_intrinsic_call (cyclomatic 82): llvm_aarch64::codegen_aarch64_llvm_intrinsic_call has cyclomatic complexity 82 (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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f10374526b702ac4276999fcf45d9bbbc0f2e25efa2cc72f5df276cac60e9e4"}},{"ruleId":"D1","level":"warning","message":{"text":"to_proto::semantic_token_type_and_modifiers (cyclomatic 82): to_proto::semantic_token_type_and_modifiers has cyclomatic complexity 82 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"86286f9eb8be09bb20890874a16eb486fbd7bee7a33860e9cbf21fc1766b8d39"}},{"ruleId":"D1","level":"warning","message":{"text":"session::validate_commandline_args_with_session_available (cyclomatic 81): session::validate_commandline_args_with_session_available has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/session.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0918d3ad848bade001064f31aaef153ab4dcfbe0ebeaf77a6b2f6e03815690"}},{"ruleId":"D1","level":"warning","message":{"text":"search_index::build_index (cyclomatic 80): search_index::build_index has cyclomatic complexity 80 (threshold 15). Of this number, 54 points are the body\u0027s own statements and 26 belong to 3 function items declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3470b1bbf1d0207e04139cc463187ed9bb13c5da08343e3077f0ef40c7cecf7f"}},{"ruleId":"D1","level":"warning","message":{"text":"format::make_format_args (cyclomatic 79): format::make_format_args has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c3cd3a9d7e4e585e6857cdcd6d572d79040ed2a635447d4e4282c9c732c2bc"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_traits_to_import (cyclomatic 79): FnCtxt::suggest_traits_to_import has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":4147}}}],"partialFingerprints":{"codehealthFindingId/v1":"770230553b05bba659871063517d380a835b3d2260c77d4d4c2769469acd1e13"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::note_and_explain_type_err (cyclomatic 78): TypeErrCtxt::note_and_explain_type_err has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"190ef6a3b38130bcc12a5e6e4e24a430a5674a7c1a5e29ec06948c0dc05ad368"}},{"ruleId":"D1","level":"warning","message":{"text":"type_names::push_debuginfo_type_name (cyclomatic 74): type_names::push_debuginfo_type_name has cyclomatic complexity 74 (threshold 15). Of this number, 72 points are the body\u0027s own statements and 2 belong to 2 function items declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/debuginfo/type_names.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2515f43ffd4d4ed60e13e1c3645f59e0fd32b2fda277c2d73ffca874ce027e"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalState::handle_event (cyclomatic 74): GlobalState::handle_event has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"1440762f69422747efe4ca922d11ca8f9379db59ea37c8a0f6f263bde3928398"}},{"ruleId":"D1","level":"warning","message":{"text":"expr::complete_expr_path (cyclomatic 73): expr::complete_expr_path has cyclomatic complexity 73 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"968380585b4e3134d4afd59ee8e3766c6a88893206d6cea662e52446024c81d9"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::into_struct_error (cyclomatic 72): Resolver::into_struct_error has cyclomatic complexity 72 (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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e52e5debacf139f414c4a5c7aab39e63797fbc4fdc0fb5472209d824a11a36"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::handle_unsatisfied_predicates (cyclomatic 70): FnCtxt::handle_unsatisfied_predicates has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1e38552727cd1d1c5bfd2a7b0977000723eaf5bef3e9cafecf6968f7bfffac"}},{"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":"src/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f42238848fe29577b9f2ab68e6c01bb54eceec0542d5de299f9bbbdcc930bd8"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExtPriv::emulate_foreign_item_inner (cyclomatic 70): EvalContextExtPriv::emulate_foreign_item_inner has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/foreign_items.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48495b32c80fbbb8012c597ad0c21d1fe6321924b9778ae6037022382f4965a"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::codegen_inline_asm (cyclomatic 69): Builder::codegen_inline_asm has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d786a32a853dd960fb26e6fcd07c51cbbfbd48aedf44e84fe35d058cfa4fb46"}},{"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":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec676940ab3ded4176c6b521d5d48cb7df3728798289ab40cf7599d8ae79468"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectionContext::evaluate_predicate_recursively (cyclomatic 68): SelectionContext::evaluate_predicate_recursively has cyclomatic complexity 68 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dce708ab2140f1d0877278081a03c1f707faddd5949990db33aa73476c24919"}},{"ruleId":"D1","level":"warning","message":{"text":"layout::layout_of_uncached (cyclomatic 68): layout::layout_of_uncached has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a499828414472d3e6d5af3e5c40de5878ca2b237c214efdd6e1f8594bae86cb"}},{"ruleId":"D1","level":"warning","message":{"text":"doc::check_doc (cyclomatic 67): doc::check_doc has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/doc/mod.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26b58de566a16a2429a65ef2e7c9911ab1f9459f4ef92edcb0bf3c119275e81"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::add_missing_lifetime_specifiers_label (cyclomatic 66): LateResolutionVisitor::add_missing_lifetime_specifiers_label has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":4077}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54f10880189bd7f1eef63639d59ea70f0d0ccbeac0ec553a6d0156a0ba73433"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCx::make_compile_args (cyclomatic 66): TestCx::make_compile_args has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fe28cc458667209b0a4059ec1d1cc18e0f799fb4996a0327e9e210422e6466"}},{"ruleId":"D1","level":"warning","message":{"text":"attrs::match_attr_flags (cyclomatic 66): attrs::match_attr_flags has cyclomatic complexity 66 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26054669905bb9667a151c7bea488a04cc3c9895e8b3aba1273930281aa6327"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::report_mutability_error (cyclomatic 65): MirBorrowckCtxt::report_mutability_error has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee4b1211110a257e7e3fd7b244e40b9828ae3f3d4e8c57e8b5406ac68e253cb"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_expr_mut (cyclomatic 64): LoweringContext::lower_expr_mut has cyclomatic complexity 64 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f97b3c811c7e7acf3503f7f84e77a963ed729c8768844e5c456442fab7af734"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::codegen_inline_asm (cyclomatic 64): Builder::codegen_inline_asm has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e49ed3ff9780657ced7925384ad7a9419ddaf6df34ffad4c68d7b6924dc0b1a"}},{"ruleId":"D1","level":"warning","message":{"text":"sanity::check (cyclomatic 64): sanity::check has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/sanity.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e38ee80c01c60a963aa91f80848b098f79499122e02626babf55e877422913"}},{"ruleId":"D1","level":"warning","message":{"text":"render::definition (cyclomatic 64): render::definition has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1859f298f5f2245f1f473b5c32d20873ba8733c8eb5cb8456a164b97c5ca092"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::resolve_path_with_ribs (cyclomatic 63): Resolver::resolve_path_with_ribs has cyclomatic complexity 63 (threshold 15). Of this number, 61 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"129a5a38d4ceb9499c224d09ea708e42cc2df795d2ae5038ac4bb8fe1df81347"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::expr_into_dest (cyclomatic 63): Builder::expr_into_dest has cyclomatic complexity 63 (threshold 15). Of this number, 60 points are the body\u0027s own statements and 3 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"compiler/rustc_mir_build/src/builder/expr/into.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc69dd26a5334cdccf0a1df71e517421605396b2d68170c7e688aa5c34887be0"}},{"ruleId":"D1","level":"warning","message":{"text":"FulfillProcessor::process_obligation (cyclomatic 63): FulfillProcessor::process_obligation 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":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0ecec70c697b40d0f9400526657e3e36547b3769db929ee31b0970a0da1c75"}},{"ruleId":"D1","level":"warning","message":{"text":"ast_utils::eq_expr (cyclomatic 63): 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":"src/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c904f4abb3a246b8a20a6c5c5e16822116addc8d1d4d5f2425ac66918e2727a"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_inline_asm (cyclomatic 62): LoweringContext::lower_inline_asm has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/asm.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88aa9512b6dd0156d37a6bee39b60deaa85ba6fb75b82b16e57653ba5aad005"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::next_token_from_cursor (cyclomatic 62): Lexer::next_token_from_cursor has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05c8349052507151d2ae7621a1fb1123437512f178cc438a759b03f054604ed"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChecker::visit_rvalue (cyclomatic 61): TypeChecker::visit_rvalue has cyclomatic complexity 61 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"a042189aeb543305eca23b03ec1540f63a8baae65f1d7b93321eb81e2605d499"}},{"ruleId":"D1","level":"warning","message":{"text":"highlight::highlight_def (cyclomatic 61): highlight::highlight_def has cyclomatic complexity 61 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"164773d7fc6d1d2e9557298f816e1cea56b19d32b9b6ea9c9af4e8a5caf07932"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::binary_int_op (cyclomatic 60): InterpCx::binary_int_op 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":"compiler/rustc_const_eval/src/interpret/operator.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0db8329253a2d532a303096f126b75d33615e890d9600abd020dd225503fe7"}},{"ruleId":"D1","level":"warning","message":{"text":"ThirPrinter::print_expr_kind (cyclomatic 60): ThirPrinter::print_expr_kind has cyclomatic complexity 60 (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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cebd75a6d1d8f3098a9705bdc28a5326378dd1868850f1f0d574fdd63cf2e2"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::smart_resolve_context_dependent_help (cyclomatic 60): LateResolutionVisitor::smart_resolve_context_dependent_help 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abc324639babf1d9fc3a0c29df8b9bc1cd54f72f6c5782ad9a0c639ba76f59e"}},{"ruleId":"D1","level":"warning","message":{"text":"print_item::item_trait (cyclomatic 60): print_item::item_trait has cyclomatic complexity 60 (threshold 15). Of this number, 56 points are the body\u0027s own statements and 4 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc8fa714ae5bfa53dbbb8029525151cf077f47a33187552b37ceb9fd41ebe8b"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_deref_or_ref (cyclomatic 59): FnCtxt::suggest_deref_or_ref has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2943}}}],"partialFingerprints":{"codehealthFindingId/v1":"56983e0e59120253f8f91142f76c017471b7df88a276ccd2c66d3f81583a57b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::expected_one_of_not_found (cyclomatic 59): Parser::expected_one_of_not_found has cyclomatic complexity 59 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 4 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c1e73bbe027b7adaddffcd4c358e8ced1cc716cec2c221ec514b5ff7627de9"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::report_similar_impl_candidates (cyclomatic 59): TypeErrCtxt::report_similar_impl_candidates has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d9353f3717855ab4772f3fde5d3f97bc48036e78a10ec9f89ca1d16f2a079f"}},{"ruleId":"D1","level":"warning","message":{"text":"Dereferencing::check_expr (cyclomatic 59): Dereferencing::check_expr has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/dereference.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e82e484acabf5e74b8844e23b006a1c5ddcc98e798efec324fc0e0f8a7a9f6e"}},{"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":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7393f12254c84f7494b7c8d950d4023dd2fe403cc3a4f4fa39e748461db216db"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenStream::from_str (cyclomatic 59): TokenStream::from_str 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":"src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea5271f8ba106f5f0cd1f3e84253d73c9e863923b885523eec669ff2d405c54"}},{"ruleId":"D1","level":"warning","message":{"text":"makeSearchTreeFromBase64 (cyclomatic 59): makeSearchTreeFromBase64 has cyclomatic complexity 59 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"a420aef983af6aa092ec8e3cdf91bd1452bbfe78ba618f2b1196dbeb3910de99"}},{"ruleId":"D1","level":"warning","message":{"text":"codegen_attrs::process_builtin_attrs (cyclomatic 58): codegen_attrs::process_builtin_attrs has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/codegen_attrs.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0661d35a80b6673523f2b104f791fb4b450eb7328425b1edd99367762c036e"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::maybe_report_ambiguity (cyclomatic 58): TypeErrCtxt::maybe_report_ambiguity has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f1101d8994150044b53f6a8fc9121b5641bc11ff4b612c117c74796a8326cf"}},{"ruleId":"D1","level":"warning","message":{"text":"pow::pow (cyclomatic 58): pow::pow has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/pow.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba81fe94b9c5cb0275ae9de5b69e5d0a9b803e3bf2ad78b68e6bb8ff05cc4ec"}},{"ruleId":"D1","level":"warning","message":{"text":"layout::layout_of_ty_query (cyclomatic 58): layout::layout_of_ty_query has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/layout.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"6193aa19730592c0d3e542750f01623f9f7e868b4bb03c896faf951c2d0f1d58"}},{"ruleId":"D1","level":"warning","message":{"text":"lists::write_list (cyclomatic 58): lists::write_list has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/lists.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bf0b7cfa00095b6370c87154e432f721bdba8149470268df39c45cadb0f265"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutCalculator::layout_of_enum (cyclomatic 57): LayoutCalculator::layout_of_enum has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75736109bc8f95f26579c9dab75474ae5aeeea56362c4793d177aac02ff7adc"}},{"ruleId":"D1","level":"warning","message":{"text":"link::link_natively (cyclomatic 57): link::link_natively has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"c100672b3290a208f8c02d07d6088ecddacbfb80244347b1f4e1944deda5982d"}},{"ruleId":"D1","level":"warning","message":{"text":"UndefinedBehaviorInfo::fmt (cyclomatic 57): UndefinedBehaviorInfo::fmt has cyclomatic complexity 57 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 4 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"compiler/rustc_middle/src/mir/interpret/error.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cfac8919f03b367bb1c5bcd71e3dc36481e52e6fd796affa54f51b87e47f94"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyPrinter::pretty_print_type (cyclomatic 57): PrettyPrinter::pretty_print_type has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f7ad526f5d836af2d8d310744e547a067957df099a80d32c868bb20d24da8b"}},{"ruleId":"D1","level":"warning","message":{"text":"Llvm::run (cyclomatic 57): Llvm::run has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68fc08b92bfe85477a0720704733bc9ae2c0441e36d6077da34bf00b327b495"}},{"ruleId":"D1","level":"warning","message":{"text":"edit_algo::apply_edits (cyclomatic 57): edit_algo::apply_edits has cyclomatic complexity 57 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edit_algo.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"349e5020c36287e733af351050c6e400fd23ea41dea755397070a827550f2859"}},{"ruleId":"D1","level":"warning","message":{"text":"expr::format_expr (cyclomatic 57): expr::format_expr has cyclomatic complexity 57 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/expr.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59a32e7a23ba5ea010bf27df71de2b5cd3e8140e1b561a9e00cef64234659d8"}},{"ruleId":"D1","level":"warning","message":{"text":"asm::modifier_to_gcc (cyclomatic 56): asm::modifier_to_gcc has cyclomatic complexity 56 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc1ba6ab7c8b802a49ed6671e4f2975702ae5545b51a5824b346ee3c3826c19"}},{"ruleId":"D1","level":"warning","message":{"text":"asm::modifier_to_llvm (cyclomatic 56): asm::modifier_to_llvm has cyclomatic complexity 56 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"865a79df288c14723a0007dac0862678d66dba8f2e23baf51bf3141938862372"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_call_terminator (cyclomatic 56): FunctionCx::codegen_call_terminator has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc94fca52c08aa2dcf93f6e55d1dfdbc3366fd7a1b57b1ee72796efe2a1b2c9"}},{"ruleId":"D1","level":"warning","message":{"text":"EncodeContext::encode_def_ids (cyclomatic 56): EncodeContext::encode_def_ids has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a156bbbea14ba6c27a47874f3cee715c82c7c44a83a160976982aa29e23674"}},{"ruleId":"D1","level":"warning","message":{"text":"visit::walk_expr (cyclomatic 56): visit::walk_expr has cyclomatic complexity 56 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/thir/visit.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e49b5d659e8d0a612e5bcf39e7ff68ec276377b7fa334df896b0d6ef021dbc"}},{"ruleId":"D1","level":"warning","message":{"text":"DeepRejectCtxt::types_may_unify_inner (cyclomatic 56): DeepRejectCtxt::types_may_unify_inner has cyclomatic complexity 56 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/fast_reject.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c654b69454e51f8d8bc714366bb38b34e60c17365e92718dc2ee4bcedde298"}},{"ruleId":"D1","level":"warning","message":{"text":"Extended::run (cyclomatic 56): Extended::run has cyclomatic complexity 56 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 4 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bd49b1fbeac00dae43a678f9a03382c6d1ee85dba95b9845f325cdd905367f"}},{"ruleId":"D1","level":"warning","message":{"text":"check::check_item_type (cyclomatic 55): check::check_item_type has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e943b68ba8ddc1ba3257fc47982c0bf6817423087167b0c08e7f0051ec4d89"}},{"ruleId":"D1","level":"warning","message":{"text":"CastCheck::report_cast_error (cyclomatic 55): CastCheck::report_cast_error has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e374caceb0ecc4263026fe69f3f39195a657e10c0b5d9cc73a094e97c450575d"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_cast (cyclomatic 55): FnCtxt::suggest_cast has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":3365}}}],"partialFingerprints":{"codehealthFindingId/v1":"8420b1d14063745090e491390a538fa078df6d8a1dc7b2cbadbb1e31bd0fdd2a"}},{"ruleId":"D1","level":"warning","message":{"text":"V0SymbolMangler::print_type (cyclomatic 55): V0SymbolMangler::print_type has cyclomatic complexity 55 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"b012c5fa02ce20130bb46fef31e4842eb6ffa04785779410fdbd2490c0f79fbe"}},{"ruleId":"D1","level":"warning","message":{"text":"BorrowExplanation::add_explanation_to_diagnostic (cyclomatic 54): BorrowExplanation::add_explanation_to_diagnostic has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f8dbcfb09b4499c416f6580dd2c9c99b65eb6252eca88f5591e54c371999db"}},{"ruleId":"D1","level":"warning","message":{"text":"Cursor::advance_token (cyclomatic 54): Cursor::advance_token has cyclomatic complexity 54 (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":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82c62b1c2c24f90f6ee136437e586a01bf32736155204895e928411f9155327"}},{"ruleId":"D1","level":"warning","message":{"text":"context::create_module (cyclomatic 52): context::create_module has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/context.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"817533232ee652670ccfcedf2a1c8b94e95253fc2cf4457dbae84360e8f38607"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::visit_scopes (cyclomatic 52): Resolver::visit_scopes has cyclomatic complexity 52 (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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0a3dd011397a9706919a547d466e31bdb1feb1f0f4d0becc1055722784bc1d"}},{"ruleId":"D1","level":"warning","message":{"text":"Module::diagnostics (cyclomatic 52): Module::diagnostics has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ae617659f8df2a6d77e29deea0f514db0d183a99780f4b5e07930b87833ee8"}},{"ruleId":"D1","level":"warning","message":{"text":"adjustment::hints (cyclomatic 52): adjustment::hints has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/adjustment.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"128023bc7be2dbbfb2cc5b57cd82fe2073eadd9c5c74b0a164c520f04ec1085c"}},{"ruleId":"D1","level":"warning","message":{"text":"Definition::search_scope (cyclomatic 52): Definition::search_scope has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c278310cd9eb1e91abb0c127b88547b4c01af7130b5353c5ba1cff008ab2109e"}},{"ruleId":"D1","level":"warning","message":{"text":"unescape_error_reporting::emit_unescape_error (cyclomatic 51): unescape_error_reporting::emit_unescape_error has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/unescape_error_reporting.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ad48b54760a866f95903f95bfe1be67ef7baab0b900f1b0e3c3125c7070b47"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::codegen_intrinsic_call (cyclomatic 50): Builder::codegen_intrinsic_call has cyclomatic complexity 50 (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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7f0e2d32f359ff3d9f11570ec15828dc0c5d3391850e0aa3db92a4cdad8625"}},{"ruleId":"D1","level":"warning","message":{"text":"raw_dylib::create_elf_raw_dylib_stub (cyclomatic 50): raw_dylib::create_elf_raw_dylib_stub has cyclomatic complexity 50 (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":"compiler/rustc_codegen_ssa/src/back/link/raw_dylib.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffe07c99760b0d57ec5c2734c8029528217711cd6eeab9eeb86e5d79a90d710"}},{"ruleId":"D1","level":"warning","message":{"text":"llvm::configure_cmake (cyclomatic 50): llvm::configure_cmake has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f64f0bd9cc7f96ec22e1f5c263fa1b983e0bd65179f9721de96d1eb5ab6cce"}},{"ruleId":"D1","level":"warning","message":{"text":"SymbolCollector::collect_from_module (cyclomatic 50): SymbolCollector::collect_from_module has cyclomatic complexity 50 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/symbols.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"857caf7e1c815cbacce76c10d84d4475f2673dd8d37799a0e5bd079015f95ee3"}},{"ruleId":"D1","level":"warning","message":{"text":"derive_macro::coerce_pointee_expand (cyclomatic 50): derive_macro::coerce_pointee_expand has cyclomatic complexity 50 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 22 belong to 4 function items declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"f590e2107439f987693e0fb0f4e8e609c81909953451ccf2894ce64df7a94bb0"}},{"ruleId":"D1","level":"warning","message":{"text":"Converter::extend_token (cyclomatic 50): Converter::extend_token has cyclomatic complexity 50 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/lexed_str.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"59282e71e7e62f2fddfa6a7b2c9496011c397ef7c6ce43a6a8390249f1fd44b9"}},{"ruleId":"D1","level":"warning","message":{"text":"base::codegen_stmt (cyclomatic 49): base::codegen_stmt has cyclomatic complexity 49 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/base.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a97517315dce0965b3708ad71b47081b3a1eee9ca7925c5f4cf6e0d833a09f"}},{"ruleId":"D1","level":"warning","message":{"text":"markdown::markdown_links (cyclomatic 49): markdown::markdown_links has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5d6dbb34c6494ae49d36f559cb69784c5c86ec624a1c92e637d3eea8c91dd5"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc::main (cyclomatic 48): rustc::main has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/bin/rustc.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed18d49054d0cfe207bf3d33a0f5e108d9c8e5ab6fa6338e039c2e80a5d7ecb"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis::expected_type_and_name (cyclomatic 48): analysis::expected_type_and_name has cyclomatic complexity 48 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1bd32ee311770effde1d24bef969c8655f9dafa49fa19de50a5e0d9982ea3b"}},{"ruleId":"D1","level":"warning","message":{"text":"AnalysisStats::run_inference (cyclomatic 48): AnalysisStats::run_inference has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00086ea3b9ea051b712d182b380f4c3e1d861598a2f4d17f72f2c03a489a31c"}},{"ruleId":"D1","level":"warning","message":{"text":"AstValidator::visit_item (cyclomatic 47): AstValidator::visit_item has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a13a6da00f752320855662ad48f7c8cd2340d2f17192ca11dfb3686a21d82ee"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::explain_captures (cyclomatic 47): MirBorrowckCtxt::explain_captures has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5725dd3b05808a9b5756a788f62e2e186b2692b42a58584246c71193e89b619e"}},{"ruleId":"D1","level":"warning","message":{"text":"write::start_executing_work (cyclomatic 47): write::start_executing_work has cyclomatic complexity 47 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77189db996b060c9abe76bf247e97fe438680f7083b71fe11e3ff08012d0a65"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_pat (cyclomatic 47): State::print_pat has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13d1b96a6b3ce46ba134afb6317c0092b698d4fdf1a2ca22a4d9363f0e20c3f"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::label_fn_like (cyclomatic 47): FnCtxt::label_fn_like has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68ab5a1b1c5004a7933f617d0c7e987430dbda18e203eb8a3a06571fd04f420"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstInt::fmt (cyclomatic 47): ConstInt::fmt has cyclomatic complexity 47 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/consts/int.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"236726e344d22856f2cc0879814a7a88277fc43eae7cf4c8337cb8505b870dcf"}},{"ruleId":"D1","level":"warning","message":{"text":"encode::encode_ty (cyclomatic 47): encode::encode_ty has cyclomatic complexity 47 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91d84dfdf5bca493ac8b366024e35c89866c8ab0e1749d3b544854de328303d"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectionContext::winnow_candidates (cyclomatic 47): SelectionContext::winnow_candidates has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7f9c5fa7b64426eb10fdeeed7355615c0e7b6048c244abf5705a2614ec7105"}},{"ruleId":"D1","level":"warning","message":{"text":"op_ref::check (cyclomatic 47): 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":"src/tools/clippy/clippy_lints/src/operators/op_ref.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e38e5222be2b9203109d2e399c28578e8014499804305cd7aad36897782aa0"}},{"ruleId":"D1","level":"warning","message":{"text":"diagnostics::report_result (cyclomatic 47): diagnostics::report_result 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":"src/tools/miri/src/diagnostics.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba39520927bffa2869e7357357f43baab1b71a93305b8154f52c66b5f069ff49"}},{"ruleId":"D1","level":"warning","message":{"text":"syntax_highlighting::traverse (cyclomatic 47): syntax_highlighting::traverse has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"218f7f11f04682b303d861a95782400bea17e1eba3165e4a133368bed38ad1b4"}},{"ruleId":"D1","level":"warning","message":{"text":"inline_call::inline (cyclomatic 47): inline_call::inline has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_call.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"551af42221235792cf284b53e02393d3039ac129ac0484de53ce2f3c3dd7d0bf"}},{"ruleId":"D1","level":"warning","message":{"text":"AnalysisStats::run (cyclomatic 47): AnalysisStats::run 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":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ee789e1b8643265f7d224700227bb4218de96ffa00c97a9e6547411c895fd6"}},{"ruleId":"D1","level":"warning","message":{"text":"items::rewrite_fn_base (cyclomatic 47): items::rewrite_fn_base has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2be320cdfd280e528722139d1a455fbd36e4f4042a1aec16dd0d69d3a1bae6"}},{"ruleId":"D1","level":"warning","message":{"text":"unifyFunctionTypes (cyclomatic 47): unifyFunctionTypes 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":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2979}}}],"partialFingerprints":{"codehealthFindingId/v1":"712485de603f3680e503fb3ae1af5b0ca163ce6f7b2fb6a37d180d883b0737b0"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_expr (cyclomatic 46): State::print_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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca31ace12e23b5fb504b03207b0118b1e87b369703ed87cc0637ac5ffbce9a34"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCallDiagCtxt::labels_and_suggestion_text (cyclomatic 46): FnCallDiagCtxt::labels_and_suggestion_text has cyclomatic complexity 46 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":2527}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ba8abf1a9a1f70893af852c1d224437ef9311c7fc302a60ba9b7f34dfaabd9"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::report_privacy_error (cyclomatic 46): Resolver::report_privacy_error has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7ba46811ab728e1055db80872fa32898c3ebf801502adba8c77b6965228c12"}},{"ruleId":"D1","level":"warning","message":{"text":"doctest::run_test (cyclomatic 46): doctest::run_test has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6f54248851d1a2b8926e9626804f51d6440ccff61c3e10624d2d1d56f3d6a2"}},{"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":"src/tools/clippy/clippy_lints/src/utils/author.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e717f4adecfb01b3fc4b1e2936a0122504d8f0409e9d9faf306db5fa0bcfa82"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_pat (cyclomatic 45): State::print_pat has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1912}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67a114c221b985a74babd4c308c06b06edb6517887bf0564d60dedb33c3d2eb"}},{"ruleId":"D1","level":"warning","message":{"text":"base::codegen_fn_body (cyclomatic 45): base::codegen_fn_body has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/base.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e518bd9a2e26493dc5ac9f416684a1c0a0d46beb06b289bbe5df9ff2911f13"}},{"ruleId":"D1","level":"warning","message":{"text":"naked_asm::prefix_and_suffix (cyclomatic 45): naked_asm::prefix_and_suffix has cyclomatic complexity 45 (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":"compiler/rustc_codegen_ssa/src/mir/naked_asm.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8c66d5db17ed4e9f73045e006eaf825839c9cfc1fc01e25f402cc7a01a31a7"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_driver_impl::print_crate_info (cyclomatic 45): rustc_driver_impl::print_crate_info has cyclomatic complexity 45 (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":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3776eca4888dfacbf99aed2173421492e910827457b775bf80771f6b75698ea"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::instantiate_value_path (cyclomatic 45): FnCtxt::instantiate_value_path has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b5b11155fa86a8450c935005ea6cee2339b0005209849be828dd9db1e70c78"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::validate_res_from_ribs (cyclomatic 45): Resolver::validate_res_from_ribs has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd613c86b9ed41b56f31a1c8340c4314f299f53f35ac2d9f43ead5dbc28cd95"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_expr_bottom (cyclomatic 45): Parser::parse_expr_bottom has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a715135d577ce6944b18432354578293e43781835b5ce664998bc3ff046633"}},{"ruleId":"D1","level":"warning","message":{"text":"powf::powf (cyclomatic 45): powf::powf has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/powf.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b76085767039674e900fe8f9b4148653d282cd7ce0be76531c9a5152dadefa"}},{"ruleId":"D1","level":"warning","message":{"text":"AtHwcap::cache (cyclomatic 45): AtHwcap::cache has cyclomatic complexity 45 (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":"library/std_detect/src/detect/os/linux/aarch64.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c52581309d6e0b735b53fb925f8d3a1b0d6f3d02e31c419a0502b9dd3dcff17"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceAnalyzer::resolve_path (cyclomatic 45): SourceAnalyzer::resolve_path has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"41649099047393f14dd95cb458b1abf3d4f4ce86229f9641890299d32e1dd342"}},{"ruleId":"D1","level":"warning","message":{"text":"postfix::complete_postfix (cyclomatic 45): postfix::complete_postfix has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/postfix.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"77227d526b7094c1365249e963e400dd82267fb1e56077f03ff48dcf946869c4"}},{"ruleId":"D1","level":"warning","message":{"text":"Ty::rewrite_result (cyclomatic 44): Ty::rewrite_result has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/types.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"60352ee6674f7f17c8c7ddd0625352407dbacf00aaf9c60a87ada87ef2b56d51"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::suggest_make_local_mut (cyclomatic 44): MirBorrowckCtxt::suggest_make_local_mut 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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ec59a69fd85c8b53fa35a315975a9b3f3c25d28e60a261ad293736d17ed2d4"}},{"ruleId":"D1","level":"warning","message":{"text":"AnnotateSnippetEmitter::emit_messages_default (cyclomatic 44): AnnotateSnippetEmitter::emit_messages_default 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":"compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea09495b4d09fe110a27c585f4eb96cb51373e8e67f4425606ff7d81d8758bf"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::resolve_ident_in_scope (cyclomatic 44): Resolver::resolve_ident_in_scope has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"741c7b6670196695927dc9449562e2a459a20169f89b3bc5b4084b190375f53c"}},{"ruleId":"D1","level":"warning","message":{"text":"UnsafetyVisitor::visit_expr (cyclomatic 44): UnsafetyVisitor::visit_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":"compiler/rustc_mir_build/src/check_unsafety.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28d37fb584da5af4ed85c58b136f6bbdf79ab67b1cf393c7eb245900506fb84"}},{"ruleId":"D1","level":"warning","message":{"text":"LowerIntrinsics::run_pass (cyclomatic 44): LowerIntrinsics::run_pass has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/lower_intrinsics.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b418aa8c1654f435d312bb5bd1fe442e22ae115972174e951bb5eaa6d8e33798"}},{"ruleId":"D1","level":"warning","message":{"text":"rem_pio2_large::rem_pio2_large (cyclomatic 44): rem_pio2_large::rem_pio2_large has cyclomatic complexity 44 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/rem_pio2_large.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9970f882add8a0aeb8bb8806ff008779234d04b21af395b8f7a6c64e2bbf3f0"}},{"ruleId":"D1","level":"warning","message":{"text":"clean::clean_middle_ty (cyclomatic 44): clean::clean_middle_ty has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a1b6b0e0ae3ac36d74a205c30f604da3255a7af73b794e28e174f376e7f3a4"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCx::check_expected_errors (cyclomatic 44): TestCx::check_expected_errors has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9e23c461e835cc443ba1446bd092130f5648c04d89ba771b06e4a5c556dc2a"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cyclomatic 44): EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/math.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d62e18674bf210a66576834dcea29f0c7fd82de5e3f3d034deed32be6956735"}},{"ruleId":"D1","level":"warning","message":{"text":"DefWithBody::diagnostics (cyclomatic 44): DefWithBody::diagnostics has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":2023}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c82d849f24c5e569d4748f7699b57c92e25ce9af4854f18df866d0a831a1672"}},{"ruleId":"D1","level":"warning","message":{"text":"asm::validate_asm_args (cyclomatic 43): asm::validate_asm_args has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/asm.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e53144ee4acd931b9de8f0defa875bc7c50443a55601f0127bedce455f96d34"}},{"ruleId":"D1","level":"warning","message":{"text":"llvm::adjust_intrinsic_arguments (cyclomatic 43): llvm::adjust_intrinsic_arguments has cyclomatic complexity 43 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31549e42c17b701d0b0725b66758be2ff853ba9725f02a68df39698d2578792"}},{"ruleId":"D1","level":"warning","message":{"text":"interface::parse_check_cfg (cyclomatic 43): interface::parse_check_cfg has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_interface/src/interface.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"118f1646a14a487cb8536d04c0c20528c1c23a5262bafeaccead9aa87b055632"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyPrinter::pretty_print_opaque_impl_type (cyclomatic 43): PrettyPrinter::pretty_print_opaque_impl_type has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5754d90477301522b13b8e50f82e878a4f9dec1d4ef30ff2e6d31a46110e421"}},{"ruleId":"D1","level":"warning","message":{"text":"InterPat::lower_thir_pat (cyclomatic 43): InterPat::lower_thir_pat has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/matches/match_pair.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f26e2f285146a0fbeef8cc2f531ab5a2cf21310c81297e249f4ed499994ce6"}},{"ruleId":"D1","level":"warning","message":{"text":"instance::resolve_associated_item (cyclomatic 43): instance::resolve_associated_item has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/instance.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14e68d91d1688307382b27df94c029b25ce5c0c67e5440a8a965a528f98749f"}},{"ruleId":"D1","level":"warning","message":{"text":"make::parse_source (cyclomatic 43): make::parse_source has cyclomatic complexity 43 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 13 belong to 3 function items declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest/make.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f468f6349ff46c5427e9d278120108f9fc73c142de11d26d8770291446c0d751"}},{"ruleId":"D1","level":"warning","message":{"text":"UselessConversion::check_expr (cyclomatic 43): UselessConversion::check_expr has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/useless_conversion.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"30568d8ef719f0e27ece013e089f2451e712c97a34cd14c291f02663e4eb8aae"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprUseVisitor::walk_expr (cyclomatic 43): ExprUseVisitor::walk_expr has cyclomatic complexity 43 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3b5b7d96d94dea96f3d09b5695cdb727dc126be1c8004db632b8fa5287cde0"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::resolve_variant (cyclomatic 43): InferenceContext::resolve_variant has cyclomatic complexity 43 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"999dfb3a0328cab53d5ab02f02eadc17ca81e07679914cb71e39f006e0f3feb9"}},{"ruleId":"D1","level":"warning","message":{"text":"MirLowerCtx::pattern_match_inner (cyclomatic 43): MirLowerCtx::pattern_match_inner has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower/pattern_matching.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7149230611d79822eec0aba95642e42b51e4f9ab1aedc087890bd647bc1414ea"}},{"ruleId":"D1","level":"warning","message":{"text":"CharClasses::next (cyclomatic 43): CharClasses::next has cyclomatic complexity 43 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fef8f7e8045230318809a1dacf149c1875e8a9a95a739826c8608d843472fa6"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_expr_struct_fields (cyclomatic 42): FnCtxt::check_expr_struct_fields 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c09030e9d2ab975a24ec2763919c4091cb1fe4966d4a981d6fd06ef85d2f02c"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeLimits::check_expr (cyclomatic 42): TypeLimits::check_expr has cyclomatic complexity 42 (threshold 15). Most of this is not in the body itself: 9 of the 42 points are its own statements and the rest belongs to 4 function items declared inside it (is_valid, diag_item_cmpop, check_limits, \u2026). 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":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0b36c23bca29a6e988f4302b823e261d40a9140ca7cd9aa41f2a18da79659b"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::note_error_origin (cyclomatic 42): TypeErrCtxt::note_error_origin 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54cf5c3ac380f8610e4ddbfa38f9e4598595f54f76e0c6b84ea87da051ce3ad"}},{"ruleId":"D1","level":"warning","message":{"text":"print_item::item_module (cyclomatic 42): print_item::item_module has cyclomatic complexity 42 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 18 belong to 3 function items declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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/librustdoc/html/render/print_item.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0664abd9d4693ba51de45f643bdbfdef8b8ca7c914d09a3e13636f666c6e4d88"}},{"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":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":3000}}}],"partialFingerprints":{"codehealthFindingId/v1":"a295c61b1ed6ac249c3ef50a80da7cc6b3680d9bb30d90f3558671a413fddb2f"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprCollector::lower_inline_asm (cyclomatic 42): ExprCollector::lower_inline_asm has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/asm.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b610ec9613adf27c1d9c7986bbd084a6fcdc28cf70e39b98299a592e52dba28f"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutCalculator::univariant_biased (cyclomatic 41): LayoutCalculator::univariant_biased has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cc6cae840156dc5c159b0105d755ca8f0909629b776f98ed81df4b56812bfa"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_rvalue_operand (cyclomatic 41): FunctionCx::codegen_rvalue_operand has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfba27a13ab5a7ed8cd45da4de67e2f79feadb70a0c18e714d1a6e744d3d24ce"}},{"ruleId":"D1","level":"warning","message":{"text":"metadata::elf_e_flags (cyclomatic 41): metadata::elf_e_flags has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/metadata.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a3112332d14a97e22f8f544b49eb7b5a2da07f1769242b24390a3bd6a15a59"}},{"ruleId":"D1","level":"warning","message":{"text":"MacroExpander::expand_invoc (cyclomatic 41): MacroExpander::expand_invoc has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5f9e746e6bd9cb32f14ec9fb11907a67170110fad9c1d87b379341099d42db"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprUseVisitor::walk_expr (cyclomatic 41): ExprUseVisitor::walk_expr has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fac2b825fc477ff0086ae5fe4ea4d093b587aeea66ed620924e0ced25571f9b"}},{"ruleId":"D1","level":"warning","message":{"text":"dependency_format::calculate_type (cyclomatic 41): dependency_format::calculate_type has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/dependency_format.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d49df120f3312f38eace2bd1a3ed4aff5f72763978a6aa092c1c75808dd706"}},{"ruleId":"D1","level":"warning","message":{"text":"invariant::layout_sanity_check (cyclomatic 41): invariant::layout_sanity_check has cyclomatic complexity 41 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 17 belong to 2 function items declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/layout/invariant.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e297e478ac96075ca264e7e34baefa32d3f477aaa76b2eca4af66be937496ca"}},{"ruleId":"D1","level":"warning","message":{"text":"print_item::print_item (cyclomatic 41): print_item::print_item has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a596491bcba24fab4c851aa143aa33279681d81c0113c5bf6fd97e70b760bf"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer::print_pat (cyclomatic 41): Printer::print_pat has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"9980f8297eb22159ebb1b91fd038ee722d543c76f133492067e2cf34ee8a6362"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::resolve_path_in_value_ns_with_prefix_info (cyclomatic 41): Resolver::resolve_path_in_value_ns_with_prefix_info has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40217a123e3418154ba22e455d03bd3819cbcd4a5a2c50ebfae84908299abd1"}},{"ruleId":"D1","level":"warning","message":{"text":"format_args::parse (cyclomatic 41): format_args::parse has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac9fe3e3c755c295eac17ea9976e05d56fed9666efbf1b5d8a75badce42f81e"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_mut_expr_without_adjust (cyclomatic 41): InferenceContext::infer_mut_expr_without_adjust has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/mutability.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a2c94fdb4ed18f9d067ce703e431a7a8858802ec96424e50c9552f2f752971"}},{"ruleId":"D1","level":"warning","message":{"text":"display::render_const_scalar_inner (cyclomatic 41): display::render_const_scalar_inner has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/display.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d64de010b6097a449600852c9c46b795a9227e573b0f73606a6ffebda41e0ea"}},{"ruleId":"D1","level":"warning","message":{"text":"type::complete_type_path (cyclomatic 41): type::complete_type_path has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f24088bf0f5a3fd79e56a7817a3ab5c59c4134f2dc9f537f0a05095e4799f96"}},{"ruleId":"D1","level":"warning","message":{"text":"va_arg::emit_va_arg (cyclomatic 40): va_arg::emit_va_arg has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e387a95130502c9102324aa7e07301c70ca25d78ab406e6977bb0a75fe3422"}},{"ruleId":"D1","level":"warning","message":{"text":"llvm_util::to_llvm_features (cyclomatic 40): llvm_util::to_llvm_features has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/llvm_util.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d5e7b44eca99e3768f7d6dc2d5745f81c2bc815f93cbf362337f478a96b783"}},{"ruleId":"D1","level":"warning","message":{"text":"type_of::type_of (cyclomatic 40): type_of::type_of has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/type_of.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc3527ed9bcf0979449ad3b6b458bddb786bf86a5e43d6c09c18e920064939d"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::lookup_import_candidates_from_module (cyclomatic 40): Resolver::lookup_import_candidates_from_module 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67e57a386e7ed19c07c635149b4f877c69f51556d0fe01297ed8ea649f26e26"}},{"ruleId":"D1","level":"warning","message":{"text":"CfgChecker::visit_terminator (cyclomatic 40): CfgChecker::visit_terminator 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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b539451157f732ce5739918d9de05b65a9d3de1fa2884742faf3278c82a1e43"}},{"ruleId":"D1","level":"warning","message":{"text":"consts::recurse_build (cyclomatic 40): consts::recurse_build has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/consts.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3114d0546362cafa67c3331948699d5f0751b4db90b0459e2205258c6ad4eb6"}},{"ruleId":"D1","level":"warning","message":{"text":"collect_intra_doc_links::resolution_failure (cyclomatic 40): collect_intra_doc_links::resolution_failure has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38e66c5fbdb27da24e5f7ca02614bf8e031a639611bd91fb9bd2382d2ede31a"}},{"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":"src/tools/clippy/clippy_lints/src/dereference.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d882cc66d6cb23f718b4bbc80e567664e9b606b0c51bfc2a782d6aadc7012da"}},{"ruleId":"D1","level":"warning","message":{"text":"fixup::fixup_syntax (cyclomatic 40): fixup::fixup_syntax has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/fixup.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a702a549d1562f6925578d808ac5b36b9f44e119d8c29d794c5d97ae476bbf"}},{"ruleId":"D1","level":"warning","message":{"text":"highlight::punctuation (cyclomatic 40): highlight::punctuation has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d200f8b6423da06f6b18e35fac0b3ad39142da6afcf90998fdc3b58de81d6735"}},{"ruleId":"D1","level":"warning","message":{"text":"format_string::lex_format_specifiers (cyclomatic 40): format_string::lex_format_specifiers has cyclomatic complexity 40 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 5 belong to 2 function items declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38d28405080268f07ba10ba90542d219df48f090cd0fcfcbe0c6c02e88a5332"}},{"ruleId":"D1","level":"warning","message":{"text":"CommentRewrite::handle_line (cyclomatic 40): CommentRewrite::handle_line has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffb8aa19eb3fd7847587ec526e6453e9528f1bb537a7a468737dee0bde7332b"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_item (cyclomatic 39): State::print_item has cyclomatic complexity 39 (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":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d58702397d0d98a1d267b5adfb899bde085ccf683904bae977b682a079384ef"}},{"ruleId":"D1","level":"warning","message":{"text":"llvm_enzyme::gen_enzyme_decl (cyclomatic 39): llvm_enzyme::gen_enzyme_decl has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fffa75781ed11f99fca99214a1516e1c2729810629df851769faead93569a3c"}},{"ruleId":"D1","level":"warning","message":{"text":"asm::expand_preparsed_asm (cyclomatic 39): asm::expand_preparsed_asm has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/asm.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"010c51f08f0099f749c6d46cc3a17acb411c213faa68bbcc14c8a108089507da"}},{"ruleId":"D1","level":"warning","message":{"text":"generics_of::generics_of (cyclomatic 39): generics_of::generics_of has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/generics_of.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8296ed6ce1d77883dcb202d32f7fb7b6cf0a517ca59900e6427fb223856dc18f"}},{"ruleId":"D1","level":"warning","message":{"text":"Rvalue::fmt (cyclomatic 39): Rvalue::fmt has cyclomatic complexity 39 (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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b218ccb1a8d61dfb1b36b9dc739c12debf68563c2f3008ed45a9801a38621c9"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChecker::visit_projection_elem (cyclomatic 39): TypeChecker::visit_projection_elem has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"7072ca19dfb831f038b62785024984505b0b283f45dddd4e797acec8fd8ace92"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_pat_with_range_pat (cyclomatic 39): Parser::parse_pat_with_range_pat has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa8867d42645c1a3ee517e4c5a16a5cf341ed5f3e135b18621b109ab5e4376c"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_ty_common (cyclomatic 39): Parser::parse_ty_common has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbb45b2e1a633be53f29af11994fde6781a5f9bc39bac45017689e71b00d481"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstructorSet::split (cyclomatic 39): ConstructorSet::split has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/constructor.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"0306564fce57aa6aa90ccb695769ff2d236e4c9a29479c9da38dd7f68b2e5841"}},{"ruleId":"D1","level":"warning","message":{"text":"Assemble::run (cyclomatic 39): Assemble::run has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"5720ea31e1e7d46bd86b9f2aec9493efde6700ac6d85adca6f90577fc7dfd96d"}},{"ruleId":"D1","level":"warning","message":{"text":"manual_inspect::check (cyclomatic 39): manual_inspect::check has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/manual_inspect.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d10d3e842c4413fbab8d609af63aaefa4de046503501e963fa40381bafbff08"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCx::run_ui_test (cyclomatic 39): TestCx::run_ui_test has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/ui.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9146d4a8da26b6cb5bafd9f525648696acb282b203eb0e402f265cb2e5a56b82"}},{"ruleId":"D1","level":"warning","message":{"text":"FindUsages::search (cyclomatic 39): FindUsages::search has cyclomatic complexity 39 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dbd4f9d7f89bc2727d38ba7b5e9749d7dd58a4bacbce79b0e4546cd3d0765e"}},{"ruleId":"D1","level":"warning","message":{"text":"Pat::rewrite_result (cyclomatic 38): Pat::rewrite_result has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/patterns.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"62df52bd9a94e4aa508caef64baf71657b76532a86c9495c88e5b53c067045a9"}},{"ruleId":"D1","level":"warning","message":{"text":"Format::translate (cyclomatic 38): Format::translate has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format_foreign.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd3e3ad52ab789c00c73ecdc0aa4d6393bbe7dc29ef75d1df360f55687e6047"}},{"ruleId":"D1","level":"warning","message":{"text":"CompileTimeMachine::call_intrinsic (cyclomatic 38): CompileTimeMachine::call_intrinsic has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0ae42dfba6645ad6a9cb339cafeed58366f36758dae0dfce0bb1dd2d4393ff"}},{"ruleId":"D1","level":"warning","message":{"text":"macro_rules::is_in_follow (cyclomatic 38): macro_rules::is_in_follow has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee7363a2e45f2d56d60cf4c2a2273f2a6a898969450efb3a787897f4b300f01"}},{"ruleId":"D1","level":"warning","message":{"text":"check_match::report_non_exhaustive_match (cyclomatic 38): check_match::report_non_exhaustive_match has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"276a1ac9615c054448e99286546a88ff98cad763e49ccd741c159454764c902c"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_item_kind (cyclomatic 38): Parser::parse_item_kind has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6db4c6844db783c9784a513a93fcbd8aed3f241b1c4c966cd65465eb3e6e80"}},{"ruleId":"D1","level":"warning","message":{"text":"html_tags::visit_item (cyclomatic 38): html_tags::visit_item has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21a7cb65d9d04bba09c86056f60cd6da516f1b650555bf330aef0f2472140f2"}},{"ruleId":"D1","level":"warning","message":{"text":"items::opt_item (cyclomatic 38): items::opt_item has cyclomatic complexity 38 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/items.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d5be1924cfe5c2d083c170be80dcc70e865c2b78129ca83e8eae9e4ea24b26"}},{"ruleId":"D1","level":"warning","message":{"text":"prettify_macro_expansion::prettify_macro_expansion (cyclomatic 38): prettify_macro_expansion::prettify_macro_expansion has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax-bridge/src/prettify_macro_expansion.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d6e95338579d28a073fe38ad5776cf7d5eae3cd0a211416a6042321c9d3c17"}},{"ruleId":"D1","level":"warning","message":{"text":"abi::codegen_terminator_call (cyclomatic 37): abi::codegen_terminator_call has cyclomatic complexity 37 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 11 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff2a13b895f47f6b25dbc34a7151b252f41ae636a8460cdab0617cb7af40567"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_deref_ref_or_into (cyclomatic 37): FnCtxt::suggest_deref_ref_or_into has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"603902b9e38ccdafb518f81f5839df420146a86a5147e73feec8eb099a05a43a"}},{"ruleId":"D1","level":"warning","message":{"text":"ProbeContext::consider_probe (cyclomatic 37): ProbeContext::consider_probe has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c9a1994cebfde246ece87a287a73e2eac461c7696a89a5e206f8728cbe1961"}},{"ruleId":"D1","level":"warning","message":{"text":"diagnostics::suggest_constraining_type_params (cyclomatic 37): diagnostics::suggest_constraining_type_params has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/diagnostics.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53df60c95cc881610f879c8e864015e781e8eb9c4bac9dcb2583466becf595e"}},{"ruleId":"D1","level":"warning","message":{"text":"VnState::eval_to_const_inner (cyclomatic 37): VnState::eval_to_const_inner has cyclomatic complexity 37 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"194b8aa356a90f0a1820f11fc660698726670baf2d3e9d27f782fc5e538cdd3e"}},{"ruleId":"D1","level":"warning","message":{"text":"impls::show_candidates (cyclomatic 37): impls::show_candidates has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":3876}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ded1522e01a44bdff7666c41cd09b3f456a2564776c9d2ad724e7502449d90e"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprCollector::collect_pat (cyclomatic 37): ExprCollector::collect_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":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":2730}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccba941f75fe5e4d490352c90dd55ce39f02258b24e4ae59ad8c3a0e00b51129"}},{"ruleId":"D1","level":"warning","message":{"text":"matcher::match_loop_inner (cyclomatic 37): matcher::match_loop_inner has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"deec35855a0a0a329976f6342d93566aa38d0e5656f7d764d86615fec9e2f7bb"}},{"ruleId":"D1","level":"warning","message":{"text":"atom::atom_expr (cyclomatic 37): atom::atom_expr 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":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc4c03b50212e07e12ca0b91144bf6c0101b4a2f4fe5e72d6c0eea655bb7273"}},{"ruleId":"D1","level":"warning","message":{"text":"unpackPostingsList (cyclomatic 37): unpackPostingsList has cyclomatic complexity 37 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":4256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02e108697d1521fe20184f4fd1389c7b94915c008f139b407049bc133c76836"}},{"ruleId":"D1","level":"warning","message":{"text":"y::main (cyclomatic 36): y::main has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/build_system/main.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"58218a0f07233e3b8b6aa5b635eb11f7d078d816342656594dd89152a184c290"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineAsmCtxt::get_asm_ty (cyclomatic 36): InlineAsmCtxt::get_asm_ty has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"71954984060f4e3fc103f355233d4846cb0b740fe767927c2388fdabb006459b"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::check_unused (cyclomatic 36): Resolver::check_unused has cyclomatic complexity 36 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 4 belong to 2 function items declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/check_unused.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"3240dc692e291d06a391c300b018bd3b057a8a3734ad161a792d3a49f730c50d"}},{"ruleId":"D1","level":"warning","message":{"text":"ImproperCTypesVisitor::visit_type (cyclomatic 36): ImproperCTypesVisitor::visit_type has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cba8a08f46c2a93c6a21d5957b445fab68c236c007b0d95e4229e382fda0bef"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::try_lookup_name_relaxed (cyclomatic 36): LateResolutionVisitor::try_lookup_name_relaxed has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9df6a14ad8541f7707d0d5624ca3d61fc16f7acb823b2971348b5bb6353ddf"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformTy::fold_ty (cyclomatic 36): TransformTy::fold_ty has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8229d5495833c5564dcf60cc376b4bbbc7d08ad8e58f1ee9d58e5604a41764a9"}},{"ruleId":"D1","level":"warning","message":{"text":"FnAbi::adjust_for_foreign_abi (cyclomatic 36): FnAbi::adjust_for_foreign_abi has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/mod.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"8127b85fbd7bfc271938244e9106b92aa3998328c4ef6c16adf1b4f24e3dd5fb"}},{"ruleId":"D1","level":"warning","message":{"text":"NormalizedPat::from_pat (cyclomatic 36): NormalizedPat::from_pat has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"7833b08f1881ac84c76a3ef3e45896a48e33d9cf27b8a5a0f20cd95dc0a22fa0"}},{"ruleId":"D1","level":"warning","message":{"text":"unnecessary_cast::check (cyclomatic 36): unnecessary_cast::check has cyclomatic complexity 36 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f05e4884ed3d63b90fd792eb61b7951b96f314302d352ab429b5671d200e27"}},{"ruleId":"D1","level":"warning","message":{"text":"eager_or_lazy::expr_eagerness (cyclomatic 36): eager_or_lazy::expr_eagerness has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"17daa4bd64112b961b70fa73652b324630a77ade59b73c0bd4229396e66b3a17"}},{"ruleId":"D1","level":"warning","message":{"text":"Directive::check (cyclomatic 36): Directive::check has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/jsondocck/src/directive.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e092abc55d85dddcc855c57ee7c89995509c3cc8535d64131287d77f747bb119"}},{"ruleId":"D1","level":"warning","message":{"text":"phases::phase_rustc (cyclomatic 36): phases::phase_rustc has cyclomatic complexity 36 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 7 belong to 2 function items declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/cargo-miri/src/phases.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cc93c8815fc77834b8febc49841834ceda0e78ba72d8d8e6529e334700d573"}},{"ruleId":"D1","level":"warning","message":{"text":"path::lower_path (cyclomatic 36): path::lower_path has cyclomatic complexity 36 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/path.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"74aec44f1ae44c0dbdbe00bb76ae02d4841a6fd3c5e9a129b726080bd7abaadc"}},{"ruleId":"D1","level":"warning","message":{"text":"makeBranchesFromBinaryData (cyclomatic 36): makeBranchesFromBinaryData has cyclomatic complexity 36 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3045}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5404c7d289923684659423581853833d37ed25349973e40d3f5fd5711ea4f2"}},{"ruleId":"D1","level":"warning","message":{"text":"getNextElem (cyclomatic 36): getNextElem has cyclomatic complexity 36 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc23a3de107c15467835bb285652b59c48b90de0397d1c6fb1159f78dc3beff"}},{"ruleId":"D1","level":"warning","message":{"text":"TargetDataLayout::parse_from_llvm_datalayout_string (cyclomatic 35): TargetDataLayout::parse_from_llvm_datalayout_string 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":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd36c6b600ccfa12acb90dc7c9e4dfd53ff6fdcf9922bd0946665afe65ed880"}},{"ruleId":"D1","level":"warning","message":{"text":"attributes::llfn_attrs_from_instance (cyclomatic 35): attributes::llfn_attrs_from_instance 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":"compiler/rustc_codegen_llvm/src/attributes.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"673a60561648e2ff2bb504d8e23c7b6ab658140e53c4abfd10ef43f091dec14b"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckLoopVisitor::visit_expr (cyclomatic 35): CheckLoopVisitor::visit_expr has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/loops.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"640589e17719183dde9f9ded739fde86c26e09521ed3c31686093fac948af3c6"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::smart_resolve_macro_path (cyclomatic 35): Resolver::smart_resolve_macro_path 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":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d8b6e4899d3b7dbc7cb4073a25f3a778d8257115785bbe72745e197bd2d45d"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstToPat::valtree_to_pat (cyclomatic 35): ConstToPat::valtree_to_pat has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/const_to_pat.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"df568817cf77208888612a446e28701224bee90b93970a5782beeee9c6dc7efe"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_fn_front_matter (cyclomatic 35): Parser::parse_fn_front_matter 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":3094}}}],"partialFingerprints":{"codehealthFindingId/v1":"77166842d7e417459a092623a3ce1983cf548ca8c54e8e4b60dc4b00d1f51211"}},{"ruleId":"D1","level":"warning","message":{"text":"RustcPatCtxt::lower_pat (cyclomatic 35): RustcPatCtxt::lower_pat has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8c9ef0d3c722c0aac135517fda59e696858b7b870d3b2294e176ff9fe52907"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::resolve_expr (cyclomatic 35): LateResolutionVisitor::resolve_expr has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df96e28e1c6ce3811bedb75aafc606b8aa44672c7db932f23f01f6394d82b02"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::construct_generic_bound_failure (cyclomatic 35): TypeErrCtxt::construct_generic_bound_failure has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55f823b13441e2f10c46fac05d67ddc5869d2c10d21d624288503522839ab53"}},{"ruleId":"D1","level":"warning","message":{"text":"relate::structurally_relate_tys (cyclomatic 35): relate::structurally_relate_tys has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/relate.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedd6b463dee6e06743a39ddca752b78721475c2fdaa9c7bc3207d719d9cc4f0"}},{"ruleId":"D1","level":"warning","message":{"text":"CacheBuilder::fold_item (cyclomatic 35): CacheBuilder::fold_item has cyclomatic complexity 35 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/formats/cache.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"17db7579b7c629bb5b289bba832e79f638f0d25b1c6d50b1f1c754c080a69aab"}},{"ruleId":"D1","level":"warning","message":{"text":"LangString::parse (cyclomatic 35): LangString::parse has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b52619d916dbcbfd076f3500d94795fc426ebae9ba0a165e0eed59ed5f3b30f"}},{"ruleId":"D1","level":"warning","message":{"text":"SerializedSearchIndex::union (cyclomatic 35): SerializedSearchIndex::union has cyclomatic complexity 35 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 10 belong to one function item declared inside it. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67e4913a9fa447308a8493cb282025d2159c5387b918193f90db2289bcb12ff"}},{"ruleId":"D1","level":"warning","message":{"text":"format::fmt_type (cyclomatic 35): format::fmt_type has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/format.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"99eb4b3bdfac0f65017ef6b58ee328d580538cb8db73426e4e5eb5d896dbf1ee"}},{"ruleId":"D1","level":"warning","message":{"text":"eta_reduction::check_closure (cyclomatic 35): 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":"src/tools/clippy/clippy_lints/src/eta_reduction.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a97db899da60f5c94431a641d2e192947336d081e0cf487f22276f1dee66bfd"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_sse2_intrinsic (cyclomatic 35): EvalContextExt::emulate_x86_sse2_intrinsic has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/x86/sse2.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c34d7cbe9e2884fb75e5caf91b8135e111983db987bc04a522c89900201e26"}},{"ruleId":"D1","level":"warning","message":{"text":"MiriMachine::emit_diagnostic (cyclomatic 35): MiriMachine::emit_diagnostic has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/diagnostics.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1c45b2988b4f5106048d075b46de7b3e3bb574196e13df906a3c5691ecaae3"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cyclomatic 35): EvalContextExt::emulate_foreign_item_inner has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/linux/foreign_items.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df28f0af75c7b0af8537d5fce6cd5c538bd988dc6930708422621c19a744527"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::CreateFileW (cyclomatic 35): EvalContextExt::CreateFileW has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/fs.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"86930997891f54cf201a838d9c6887ff977f42a7b8e5b5174df8e0dcff7d14a5"}},{"ruleId":"D1","level":"warning","message":{"text":"ModCollector::collect (cyclomatic 35): ModCollector::collect has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1879}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad72fbda4b7962db25ed61b056a87832e0e37e1e61d2d11ffd7966f725a0d7d"}},{"ruleId":"D1","level":"warning","message":{"text":"display::write_bounds_like_dyn_trait (cyclomatic 35): display::write_bounds_like_dyn_trait has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/display.rs"},"region":{"startLine":2093}}}],"partialFingerprints":{"codehealthFindingId/v1":"362b2b34d425d34183eddfccbe643d9f345ee97d0d4b3ae0efbf7afb379d5709"}},{"ruleId":"D1","level":"warning","message":{"text":"write::produce_final_output_artifacts (cyclomatic 34): write::produce_final_output_artifacts has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"1976cab26ece15f1229fdf9e88e02d08f5c69c6fe449717b078e7c3f81de084f"}},{"ruleId":"D1","level":"warning","message":{"text":"ValidityVisitor::visit_value (cyclomatic 34): ValidityVisitor::visit_value has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfa2772f37e0e1eefc1160dd16b0ad97cedc4b8c7ca69e9bb9b14a22b05d8ea"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::report_path_resolution_error (cyclomatic 34): Resolver::report_path_resolution_error has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2926}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f6c96a6f2bfd2cae59cc2da5abafb82057910fc094a923b3b8dcb165bada20"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::make_base_error (cyclomatic 34): LateResolutionVisitor::make_base_error has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"627feb43c0e30392c46a1c282d1a3ed1a566243c546ff1492bc0e4963860dd32"}},{"ruleId":"D1","level":"warning","message":{"text":"WfPredicates::visit_ty (cyclomatic 34): WfPredicates::visit_ty has cyclomatic complexity 34 (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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fce86af021206dda8877a02fa84ea0d7a25ce1fd313bc3b47c4a4856c33d3db"}},{"ruleId":"D1","level":"warning","message":{"text":"TyKind::fmt (cyclomatic 34): TyKind::fmt has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/ty_kind.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e963a0fd21782c8621c93d665dd81a99a145f02dee13d482b37d020322fdf0"}},{"ruleId":"D1","level":"warning","message":{"text":"Display::fmt (cyclomatic 34): Display::fmt has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/cfg.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"407a21eb08265cd0318462dc7d3791bde211d62ca3fb0428dfebb5682712f4f0"}},{"ruleId":"D1","level":"warning","message":{"text":"search_index::simplify_fn_type (cyclomatic 34): search_index::simplify_fn_type has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bab10d9cd6a50f2b769eab20ca5f3fe414a187af8010f04c659904e11a05be"}},{"ruleId":"D1","level":"warning","message":{"text":"lifetime::hints_ (cyclomatic 34): lifetime::hints_ has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9fef3e371c069ebe683f4e722f1a748de2b8faaf5bd355fc3cb9bc06862ad1"}},{"ruleId":"D1","level":"warning","message":{"text":"macros::rewrite_macro_inner (cyclomatic 34): macros::rewrite_macro_inner has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/macros.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"03acd72957759f35f5a8f6f12fa0d314c845df91f793d5e19f5f06b34117a008"}},{"ruleId":"D1","level":"warning","message":{"text":"innerRunNameQuery (cyclomatic 34): innerRunNameQuery has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3940}}}],"partialFingerprints":{"codehealthFindingId/v1":"6feb3fe78143afe389f1a8a613a74abf6d9661252c05710ed9539b7181b52142"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_ty (cyclomatic 33): LoweringContext::lower_ty 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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6c734d0c3d16d629220cd75574d90f16322a03ae305635774a8bcb2ba4c03c"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineAssemblyGenerator::generate_asm_wrapper (cyclomatic 33): InlineAssemblyGenerator::generate_asm_wrapper 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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec99676566b11e9466d30acc6ff945a3a84d571a278e90968b59c3ba447ad744"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker::visit_terminator (cyclomatic 33): Checker::visit_terminator 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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bc42d9f12433517b2de71587cf70a430669a8b8d79f983100e0b711119570b"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_pat_inner (cyclomatic 33): FnCtxt::check_pat_inner 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"12187d558d81e112a59d33ab93d10125b8cb9ac2dcb892d63328f3b53d507f38"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::report_conflict (cyclomatic 33): Resolver::report_conflict 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f400975de5dc67a8c90216106a43bfb44ac4100ca7fa9d457e3cd0382cd1b184"}},{"ruleId":"D1","level":"warning","message":{"text":"LintLevelsBuilder::add (cyclomatic 33): LintLevelsBuilder::add 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":"compiler/rustc_lint/src/levels.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e99ff7ce7448ce4bdcbc95f0bb8c54a8b8b04ee254003c6ea530af4fca6dc31"}},{"ruleId":"D1","level":"warning","message":{"text":"SizeSkeleton::compute_inner (cyclomatic 33): SizeSkeleton::compute_inner 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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc86646d8161dc2d45910c1202904daafb53db3b020299b689314d476380614e"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineAsmClobberAbi::parse (cyclomatic 33): InlineAsmClobberAbi::parse 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":"compiler/rustc_target/src/asm/mod.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbeaa64d4843c1396117e163ffc27daae65b3eb507f6f53809334927d9b94596"}},{"ruleId":"D1","level":"warning","message":{"text":"never_loop::never_loop_expr (cyclomatic 33): 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":"src/tools/clippy/clippy_lints/src/loops/never_loop.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e4b4b3b80fedc7296caf8db8336e1c469d3a6fe415f3c1eadcc5a189b59908"}},{"ruleId":"D1","level":"warning","message":{"text":"cfg_process::macro_input_callback (cyclomatic 33): cfg_process::macro_input_callback has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/cfg_process.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4ed4dc1ec81d9296c78dc66cf15a44d30d5bf42805b9ad74dbaae356845764"}},{"ruleId":"D1","level":"warning","message":{"text":"UnsafeVisitor::walk_expr (cyclomatic 33): UnsafeVisitor::walk_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":"src/tools/rust-analyzer/crates/hir-ty/src/diagnostics/unsafe_check.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af03cb09c95255259e1b397d1d6e3c62c383766b27b6ca7ffed6c522a671d07"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_pat_inner (cyclomatic 33): InferenceContext::infer_pat_inner 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":"src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d247ab9ed9d6cac78b9284e2024c9ae9d66f13961c8862ac119cd9fc7e495827"}},{"ruleId":"D1","level":"warning","message":{"text":"matches::rewrite_match_body (cyclomatic 33): matches::rewrite_match_body has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/matches.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22353fe24234293251232f236630659ff540bf6645bff58733b0fd9e6a55e2d"}},{"ruleId":"D1","level":"warning","message":{"text":"unifyFunctionTypeIsMatchCandidate (cyclomatic 33): unifyFunctionTypeIsMatchCandidate has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3524}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84710d9cfc5d5a52dfda1cdd0afe1b20a339a57d0f275c6b4d8ad7044210181"}},{"ruleId":"D1","level":"warning","message":{"text":"link::link_binary (cyclomatic 32): link::link_binary has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5a5a97ac1169d395ecde3e60093169bac99d86c28716407c2feabb5c2676df"}},{"ruleId":"D1","level":"warning","message":{"text":"DiagCtxtInner::emit_diagnostic (cyclomatic 32): DiagCtxtInner::emit_diagnostic has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/lib.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c576e13b31fd05cd6542271eafedef45d6b3b1bdffab3456a112cb51265c46d"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_compatible_variants (cyclomatic 32): FnCtxt::suggest_compatible_variants has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2611}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ea85eef42ede5bb43220fe1c0524eafd71afad65e9cdd8264d9cef6f3881d2"}},{"ruleId":"D1","level":"warning","message":{"text":"lint_tail_expr_drop_order::run_lint (cyclomatic 32): lint_tail_expr_drop_order::run_lint has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/lint_tail_expr_drop_order.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"37aec960d068ef3d7867833b88e9768551ecf85c0c99d1214e5a9e45b14ad5fa"}},{"ruleId":"D1","level":"warning","message":{"text":"Constructor::is_covered_by (cyclomatic 32): Constructor::is_covered_by 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":"compiler/rustc_pattern_analysis/src/constructor.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7b75a0b0b5fdcf66e4205043270410912b186d3c99e8f8c57a575a33ba71f1"}},{"ruleId":"D1","level":"warning","message":{"text":"Target::abi_required_features (cyclomatic 32): Target::abi_required_features 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":"compiler/rustc_target/src/target_features.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca91085995b3b5d54d318d3a1fd3b03b66249ff144e5fe7bdb6be3e8363409ba"}},{"ruleId":"D1","level":"warning","message":{"text":"inline::build_impl (cyclomatic 32): inline::build_impl has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/inline.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23a1eb122f3bac43fb02ff584aa730b189706696426bfb4c0394b95c3688766"}},{"ruleId":"D1","level":"warning","message":{"text":"Matches::check_expr (cyclomatic 32): Matches::check_expr has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/mod.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bd9333d9f53fa773531a260b65b881a50cb944699f5d78c5793b7a04738478"}},{"ruleId":"D1","level":"warning","message":{"text":"ast_utils::eq_item_kind (cyclomatic 32): 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":"src/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19bafbc9f47a4a59ed0fd8db41663216bfa9de0e2f401d0a2f3077d5378a4f1"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionStore::visit_expr_children (cyclomatic 32): ExpressionStore::visit_expr_children 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":"src/tools/rust-analyzer/crates/hir-def/src/expr_store.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8c00488ee8906f74718bff026c80aac89db94698f02989aef0b94cc6b59bfe"}},{"ruleId":"D1","level":"warning","message":{"text":"display::render_const_scalar_from_valtree_inner (cyclomatic 32): display::render_const_scalar_from_valtree_inner has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/display.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5b0cbb74e775487402a10293289f1df032188969a0b3a5202cd854b861213f"}},{"ruleId":"D1","level":"warning","message":{"text":"extract_variable::extract_variable (cyclomatic 32): extract_variable::extract_variable has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_variable.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb24ce039d89ea75e06593e1f5686f0553a66243983ea7fcb8605202ae49730"}},{"ruleId":"D1","level":"warning","message":{"text":"unicode_table_generator::load_data (cyclomatic 32): unicode_table_generator::load_data has cyclomatic complexity 32 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/unicode-table-generator/src/main.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bead26f314a69e443ecb313d72fff47bc88c2509d8c858cccef30fe6e8bd36"}},{"ruleId":"D1","level":"warning","message":{"text":"constructor (cyclomatic 32): constructor has cyclomatic complexity 32 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"81334c9ed081e9a2083ea487cdfddf489832a9a97e6b23e4f34d93bfdec91a26"}},{"ruleId":"D1","level":"warning","message":{"text":"value_and_place::assert_assignable (cyclomatic 31): value_and_place::assert_assignable has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fbe1e73dc6548a3439a9f14fc21a2535efe8bdf3c7380535347a12553e8bf7"}},{"ruleId":"D1","level":"warning","message":{"text":"write::llvm_optimize (cyclomatic 31): write::llvm_optimize has cyclomatic complexity 31 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 6 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9cc35fa2fb04d5c9f16b935b9903b883217d4a39fafdb0a9e86cf1e6309228"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_scalar_binop (cyclomatic 31): FunctionCx::codegen_scalar_binop 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":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace3d28c1e4bb82828627cd8e41ac41d51e1cfcb97b4544e86258d17ea0b32e2"}},{"ruleId":"D1","level":"warning","message":{"text":"ops::build_error_for_const_call (cyclomatic 31): ops::build_error_for_const_call 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":"compiler/rustc_const_eval/src/check_consts/ops.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb97743c54a7c4ff3a61c6f2f6b9d89da10591bbd81d6f4a18055abf1f394db5"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::report_invalid_callee (cyclomatic 31): FnCtxt::report_invalid_callee 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":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17595e6c471f56537369e4015e2c411528faa6ebcdd737dadf1c2c00f5951e9"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::analyze_closure (cyclomatic 31): FnCtxt::analyze_closure 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4013010d9c0212ddbbb91b2c967a03ada61780247e5c867517e5ab2b574abc"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineAsmCtxt::check_asm (cyclomatic 31): InlineAsmCtxt::check_asm 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":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2ea6bb167771698efa999cf2fd6ecc35bd29443d513df5ba6ff7cc9d42f179"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::maybe_push_ambiguity (cyclomatic 31): Resolver::maybe_push_ambiguity 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1c954f0a9e9e2cb53c2441fa0176eb23485cbc9ad1f71416d6cab702f0f2a6"}},{"ruleId":"D1","level":"warning","message":{"text":"SubdiagnosticVariant::from_attr (cyclomatic 31): SubdiagnosticVariant::from_attr 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":"compiler/rustc_macros/src/diagnostics/utils.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf6f260f0ea7a95e1705f57af96e2e6ef2761671c2039e0f191e58f4360bb62"}},{"ruleId":"D1","level":"warning","message":{"text":"lint::emit_lint_base::emit_lint_base_impl (cyclomatic 31): lint::emit_lint_base::emit_lint_base_impl has cyclomatic complexity 31 (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":"compiler/rustc_middle/src/lint.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"e469b393df4430713bc587cd221ea7e8fa0cc7f6ec26be97f6792f4f4a9341a8"}},{"ruleId":"D1","level":"warning","message":{"text":"DefCollector::build_reduced_graph_for_use_tree (cyclomatic 31): DefCollector::build_reduced_graph_for_use_tree 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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cac614c5d80e3f223741140954c727140d44981eb7a5fbd319a42e3314d4ee"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::smart_resolve_path_fragment (cyclomatic 31): LateResolutionVisitor::smart_resolve_path_fragment 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":4549}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b9fd88e1fbac37f7fb701b2f2ef7d1b8c366c5b570c7890eb6f8e5208a8ae8"}},{"ruleId":"D1","level":"warning","message":{"text":"cfg::default_configuration (cyclomatic 31): cfg::default_configuration 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":"compiler/rustc_session/src/config/cfg.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"817d82431df3e53f5917aba661259534f42f1b00c586d3e081afe0892ca13536"}},{"ruleId":"D1","level":"warning","message":{"text":"explicit_iter_loop::is_ref_iterable (cyclomatic 31): 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":"src/tools/clippy/clippy_lints/src/loops/explicit_iter_loop.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"411b0991d32ce64c7e872e94871b22d35e640adacabb529cd4f20b2761f82c77"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_math_intrinsic (cyclomatic 31): EvalContextExt::emulate_math_intrinsic has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/math.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca78bc41d773ff4daa9b039fda834251d47551f81e2bcf93af319859a9659a0"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_avx_intrinsic (cyclomatic 31): EvalContextExt::emulate_x86_avx_intrinsic has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/x86/avx.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68c104c0a320b31677cdd8f2a6331798435d8ae74eacae8512b24a5c596a727"}},{"ruleId":"D1","level":"warning","message":{"text":"DefCollector::resolve_macros (cyclomatic 31): DefCollector::resolve_macros has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"1130e87f9f34da2514b8330e2c187b3e56390d48add4776c63d016c1423ec395"}},{"ruleId":"D1","level":"warning","message":{"text":"folding_ranges::folding_ranges (cyclomatic 31): folding_ranges::folding_ranges has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/folding_ranges.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf1f962342c1a5f90fdff8fcc8b54b5c9d1d43d79b06674521cd645ed2911a8"}},{"ruleId":"D1","level":"warning","message":{"text":"closing_brace::hints (cyclomatic 31): closing_brace::hints has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/closing_brace.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"541e0bf2b24d25abb2c1d9607c02b72c976ca515a49eaefd1addc1cc9be9a181"}},{"ruleId":"D1","level":"warning","message":{"text":"pattern::complete_pattern (cyclomatic 31): pattern::complete_pattern has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/pattern.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da132e798e89e3c89b429c3c0d18b32741238d167310345eb3980757ab949d7"}},{"ruleId":"D1","level":"warning","message":{"text":"to_parser_input::to_parser_input (cyclomatic 31): to_parser_input::to_parser_input has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax-bridge/src/to_parser_input.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa540ecc5bc88bd448ebb59ebabe815551984696968f9cb7c522179087de9dea"}},{"ruleId":"D1","level":"warning","message":{"text":"prefixMatches (cyclomatic 31): prefixMatches has cyclomatic complexity 31 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a79a24a50989765daf5e36c26796d4e92fa15aa00b118ee6f64821ac89da204"}},{"ruleId":"D1","level":"warning","message":{"text":"buildItemSearchType (cyclomatic 31): buildItemSearchType has cyclomatic complexity 31 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"7042282c59478bc70bec07894e77b6800f782df91d59bc30c3e5177a94fcb4f1"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkParser::extend (cyclomatic 30): LinkParser::extend has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/link_attrs.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bca80b73d0d6a69efc7140753c8b70dcfa111305868bbe4523a51f31e66c98"}},{"ruleId":"D1","level":"warning","message":{"text":"llvm_enzyme::expand_with_mode (cyclomatic 30): llvm_enzyme::expand_with_mode has cyclomatic complexity 30 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"31776acb4e0dbcbb39ebec19b04543b8261ff072c3539de174691f055aa6446d"}},{"ruleId":"D1","level":"warning","message":{"text":"codegen_f16_f128::codegen_cast (cyclomatic 30): codegen_f16_f128::codegen_cast 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":"compiler/rustc_codegen_cranelift/src/codegen_f16_f128.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7343a05c2b5ed0b2cb03d36dde08b2f9324298dae05d7fc0c9d6db831cad04d9"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::point_at_expr_if_possible (cyclomatic 30): FnCtxt::point_at_expr_if_possible 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":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f4e4fa0ceae359c553b5a715e4ba881a4906a6e11c94ac1e97dc374933b47a"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_argument_types (cyclomatic 30): FnCtxt::check_argument_types 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"11126032ab958fd8649f3a3977815b1da6347e8e88d9eb58792fc6f25ee6c7bf"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::throw_unresolved_import_error (cyclomatic 30): Resolver::throw_unresolved_import_error 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2f1a628216e1516db98d197d32ef5aca6e3e46c3f9464738168cd01b435d8d"}},{"ruleId":"D1","level":"warning","message":{"text":"foreign_modules::structurally_same_type_impl (cyclomatic 30): foreign_modules::structurally_same_type_impl has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/foreign_modules.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e077dece68657276e3e99cad9ab7a81e517d4a9b6941f130ea9a7029beaf4ff2"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminatorKind::fmt_head (cyclomatic 30): TerminatorKind::fmt_head has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"b845edf96ca33eff0e5f465089013b1ed9194a3bcd6c3cc72a0420b1d2e55d5a"}},{"ruleId":"D1","level":"warning","message":{"text":"fn_suffix::make_neon_suffix (cyclomatic 30): fn_suffix::make_neon_suffix has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-arm/src/fn_suffix.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e95e8912ecd33f566ffceec2cb9d71904e3d8a2bd5a15005f0c6919c5ff125"}},{"ruleId":"D1","level":"warning","message":{"text":"format::format (cyclomatic 30): format::format has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/format.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"900cb9ede2f2cbfdb32219c288d02c7a2df7dddec1e00f1187a4c742e9310094"}},{"ruleId":"D1","level":"warning","message":{"text":"manual_utils::check_with (cyclomatic 30): 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":"src/tools/clippy/clippy_lints/src/matches/manual_utils.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9041e1b1735f0e43a2f8f915608327d0958c33e9f7c62412b2d5ac07ba800600"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_aarch64_intrinsic (cyclomatic 30): EvalContextExt::emulate_aarch64_intrinsic has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"446650b02426124dceaab8ee5f509753e4c32d97eadb4bd1db87e5cfbcbe420f"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_sse42_intrinsic (cyclomatic 30): EvalContextExt::emulate_x86_sse42_intrinsic has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/x86/sse42.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c80a5e5f41adb0c1683abb27b0104e8c92cb4b7348edb90dd9dc82dac187423"}},{"ruleId":"D1","level":"warning","message":{"text":"moniker::def_to_kind (cyclomatic 30): moniker::def_to_kind has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/moniker.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac5397a666b60ead5a849864a4be6304fe49fa5eebb75dbc0c6c714f1a87632"}},{"ruleId":"D1","level":"warning","message":{"text":"highlight::highlight_name_ref (cyclomatic 30): highlight::highlight_name_ref has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a22c603a60b2f1de2454d49516fdf85812f86cdd7587e1889175dea8c6f681a"}},{"ruleId":"D1","level":"warning","message":{"text":"add_missing_match_arms::add_missing_match_arms (cyclomatic 30): add_missing_match_arms::add_missing_match_arms has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7c27828fab018ee0ead367f9021ab155ee430107de80ad134b31a1e02902be"}},{"ruleId":"D1","level":"warning","message":{"text":"transcriber::expand_subtree (cyclomatic 30): transcriber::expand_subtree has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/transcriber.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74ff8e306c01f8f064a52798a8aef50f6633560a571fa76f2ced6572fc16030"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalState::handle_task (cyclomatic 30): GlobalState::handle_task has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b2e740db8affe30e1162a7d541d51fb68fffb74a9405fbc4b70995c2ffcdcd"}},{"ruleId":"D1","level":"warning","message":{"text":"syntax_bridge::convert_tokens (cyclomatic 30): syntax_bridge::convert_tokens has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6650a40bc927d667238c8330a34402d763de93735593a6e81e8ec9d4bffa7ad8"}},{"ruleId":"D1","level":"warning","message":{"text":"intersection (cyclomatic 30): intersection has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab4609a1f8cae156ceef52977358667fb6c441a0dadb49f69a4342e23ae2cf0"}},{"ruleId":"D1","level":"warning","message":{"text":"comments::beautify_doc_string (cyclomatic 29): comments::beautify_doc_string has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 10 of the 29 points are its own statements and the rest belongs to 2 function items declared inside it (get_horizontal_trim, get_vertical_trim). 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":"compiler/rustc_ast/src/util/comments.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddfbd15c71c61416f172e848681628cc70e8b91255b042b68b07cd331a32ffe"}},{"ruleId":"D1","level":"warning","message":{"text":"expr::reconstruct_format_args_template_string (cyclomatic 29): expr::reconstruct_format_args_template_string 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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e2a55fe32ffa8093bf17e87f23479c16d85f740aab4b427e4da009083e7077"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_item (cyclomatic 29): State::print_item 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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64cad4fb14bb2c622f79673a3fadfc6ec1171911a72da12a6a1010365339012"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_expr_field (cyclomatic 29): FnCtxt::check_expr_field 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c1c736d12fa8a74ba79562fe8bb9d28cbabe010978a1c31e203f09b13d185b"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::cook_lexer_literal (cyclomatic 29): Lexer::cook_lexer_literal 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":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61d08554e51a73485d112cf9b01294b292400872914fc7afc7299c07831cc0b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::nonterminal_may_begin_with (cyclomatic 29): Parser::nonterminal_may_begin_with has cyclomatic complexity 29 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 3 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"compiler/rustc_parse/src/parser/nonterminal.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e8aefc4f94dded3180789381f069d8c8dca7947d4094980b0e98d23dd4fdec"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::resolve_item (cyclomatic 29): LateResolutionVisitor::resolve_item 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2824}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e7340b016026bdba3c538792a3cfb421d6a510fa1f9c5bbdb1ceffb065ebdf"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::cmp (cyclomatic 29): TypeErrCtxt::cmp has cyclomatic complexity 29 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 3 belong to 2 function items declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba7547b060b8f6f32e6ce13b3f4bb5ad8fd38aa49a7579bf9cd7a0341911b6a"}},{"ruleId":"D1","level":"warning","message":{"text":"SolverDelegate::compute_goal_fast_path (cyclomatic 29): SolverDelegate::compute_goal_fast_path 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":"compiler/rustc_trait_selection/src/solve/delegate.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"036a9495190a4b4daaec8f6e3805b10439c31d0f8baa30f196083a3f0e194551"}},{"ruleId":"D1","level":"warning","message":{"text":"libm_macros::validate (cyclomatic 29): libm_macros::validate 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":"library/compiler-builtins/crates/libm-macros/src/lib.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"051da7459504ec4ae1d8fb9d03702eda053d917b2d03adcc7ed2ef5ecd2dfa20"}},{"ruleId":"D1","level":"warning","message":{"text":"render::render_impl::doc_impl_item (cyclomatic 29): render::render_impl::doc_impl_item has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92cfbde4a2c21dc45f2b98a153f674950f39e0e36a5b4d56084e6dac0f3a0cf"}},{"ruleId":"D1","level":"warning","message":{"text":"clean::clean_middle_assoc_item (cyclomatic 29): clean::clean_middle_assoc_item has cyclomatic complexity 29 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 4 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"201ec47107d4239a1e94ff5f3998cb4163c59c80517835e2610b2580da3b8840"}},{"ruleId":"D1","level":"warning","message":{"text":"transmute_undefined_repr::check (cyclomatic 29): 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":"src/tools/clippy/clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"004eeeac1a54e5b99f366272cc7837ba9364c888a1d89bf0a5d2524a1a0198d0"}},{"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":"src/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0c57483d08c0dd8f35ecc016e20d3b3961c3b62c5f754a37b1431075bd72d3"}},{"ruleId":"D1","level":"warning","message":{"text":"phases::phase_cargo_miri (cyclomatic 29): phases::phase_cargo_miri has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/cargo-miri/src/phases.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f85b62729ea9cd5042704ebe2559b15ed3e7dacaeaf0ee198d4f72c8b8501f"}},{"ruleId":"D1","level":"warning","message":{"text":"math::fixed_float_value (cyclomatic 29): math::fixed_float_value 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":"src/tools/miri/src/math.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c7a2634be67fb00bbe5a49692506b8d6c9033b55cd184a78f5a1da8881cabb"}},{"ruleId":"D1","level":"warning","message":{"text":"Path::hir_fmt (cyclomatic 29): Path::hir_fmt has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/display.rs"},"region":{"startLine":2675}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb262fcbe29c23b7723abebacd385217a832f8f44ef1d6cb9853d8d4f9e93ead"}},{"ruleId":"D1","level":"warning","message":{"text":"hover::hover_offset (cyclomatic 29): hover::hover_offset has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/hover.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7b8bccb4f2c66d0ed77de8af14e3209e41294f0265ae9670c74942e5b739f2"}},{"ruleId":"D1","level":"warning","message":{"text":"format_string_exprs::parse_format_exprs (cyclomatic 29): format_string_exprs::parse_format_exprs has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string_exprs.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf0fa64f19ed048695aba705ab62464d4c71ffa657a83da8515006765139ae6"}},{"ruleId":"D1","level":"warning","message":{"text":"AnalysisStats::run_body_lowering (cyclomatic 29): AnalysisStats::run_body_lowering has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"802346ec4e6fb52127ab2b1180d17c3c50abfd5e773d96baa4e1c92adc2326fa"}},{"ruleId":"D1","level":"warning","message":{"text":"format::expand_format_args (cyclomatic 28): format::expand_format_args 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":"compiler/rustc_ast_lowering/src/format.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0ae0e8f568f8b2fdb93a5634d7dbaeabe1ead25dc1161da1a9bfb33bc349cf"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::debug_introduce_local (cyclomatic 28): FunctionCx::debug_introduce_local 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":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"762e57455f1e838a27e12197fb4f65f22c707dd3c7978e59f760f4dfe41dd138"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_rvalue (cyclomatic 28): FunctionCx::codegen_rvalue 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":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d520c51d48b25cff92d6fcfd0fef3519536a2baff2bb3a3363c000525f370999"}},{"ruleId":"D1","level":"warning","message":{"text":"linker::get_linker (cyclomatic 28): linker::get_linker has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db5e2e190215f09d9577fc71dad4401a106c734daa4423e333eb4437b033fcf"}},{"ruleId":"D1","level":"warning","message":{"text":"check::check_transparent (cyclomatic 28): check::check_transparent has cyclomatic complexity 28 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 9 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7042e3db989e390b76051e123dbe05cfbc4ec05f2d0431d964153c1dd5dfca7"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgMatrix::find_issue (cyclomatic 28): ArgMatrix::find_issue 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":"compiler/rustc_hir_typeck/src/fn_ctxt/arg_matrix.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c00aa9bf336266b02ffc15e7e440e847d4ad39a473b79aec3cb000db067c96e"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::as_rvalue (cyclomatic 28): Builder::as_rvalue 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":"compiler/rustc_mir_build/src/builder/expr/as_rvalue.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a3a662fce26a8764ab0cc8eb6be8b98fd9782355cbb9db589fd171b7ed84ad"}},{"ruleId":"D1","level":"warning","message":{"text":"check_match::find_fallback_pattern_typo (cyclomatic 28): check_match::find_fallback_pattern_typo 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":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05e86657963e9a7da388e56e7dbfba0d77ad6793ca37e600032d4e5e7609861"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_expr_assoc_rest_with (cyclomatic 28): Parser::parse_expr_assoc_rest_with 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6687805c1e0c79c56eaa4dc4ae19a9ec53ca210657872c2ccdc089798207f8"}},{"ruleId":"D1","level":"warning","message":{"text":"FlagComputation::add_kind (cyclomatic 28): FlagComputation::add_kind 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":"compiler/rustc_type_ir/src/flags.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e6b3c589d91bdc99f171d97daac60a94e1549a582703343ffe46cc0e170d7d"}},{"ruleId":"D1","level":"warning","message":{"text":"lgamma_r::lgamma_r (cyclomatic 28): lgamma_r::lgamma_r 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":"library/compiler-builtins/libm/src/math/lgamma_r.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e5cf7fc1c1ad5e21d48d7b60da976c052d36850304239b7d9f67ca4d50898d"}},{"ruleId":"D1","level":"warning","message":{"text":"RustdocVisitor::visit_item_inner (cyclomatic 28): RustdocVisitor::visit_item_inner has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/visit_ast.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a0088266b20af190d69b07ac583ef8ac7649a815b435e59ab68bac8688481c"}},{"ruleId":"D1","level":"warning","message":{"text":"unescaped_backticks::visit_item (cyclomatic 28): unescaped_backticks::visit_item has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/unescaped_backticks.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7bc0eecb7f715a9a052408da4ab11a87380eb6e832e1b9d5b0bddc5bf4efc0"}},{"ruleId":"D1","level":"warning","message":{"text":"literal::check (cyclomatic 28): literal::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":"src/tools/clippy/clippy_lints/src/write/literal.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b63d7d4f4401cb608293f11d2bb24017260de54ef736eb92989fcdf75a8e299"}},{"ruleId":"D1","level":"warning","message":{"text":"match_wild_enum::check (cyclomatic 28): 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":"src/tools/clippy/clippy_lints/src/matches/match_wild_enum.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5977543a3bd8a30f47274f4adfbabe4fb0ba2dc66746bb21e3fc7bc521d69a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Definition::label (cyclomatic 28): Definition::label 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":"src/tools/rust-analyzer/crates/ide-db/src/defs.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1f48ba2b8403fa8d97fd6e908290d70d4643a1c330ffa25681f93fbd5266fc"}},{"ruleId":"D1","level":"warning","message":{"text":"workspace::cargo_to_crate_graph (cyclomatic 28): workspace::cargo_to_crate_graph has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fd138a6a60e5758133b816ca158119288168fa84426cfc466539f479923a73"}},{"ruleId":"D1","level":"warning","message":{"text":"AnalysisStats::run_term_search (cyclomatic 28): AnalysisStats::run_term_search has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b073139bf1d9829419f3388540bcd3f513cecb5e95fbf3ed466440957b5ae6"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalState::switch_workspaces (cyclomatic 28): GlobalState::switch_workspaces has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a633941898dc26380209b6a66866964b78f2ff4bb9bf76dec4af8fb474df6a"}},{"ruleId":"D1","level":"warning","message":{"text":"notification::run_flycheck (cyclomatic 28): notification::run_flycheck has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/notification.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb789718c32bff1480dd9430e73acfe206f13e7e8a781114ce3bdc9af2166fc"}},{"ruleId":"D1","level":"warning","message":{"text":"FmtVisitor::visit_item (cyclomatic 28): FmtVisitor::visit_item 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":"src/tools/rustfmt/src/visitor.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc73f936b0fb56791e47ec3ac43d7927f0e8997726e10a21a7dce2b48baa1cae"}},{"ruleId":"D1","level":"warning","message":{"text":"types::join_bounds_inner (cyclomatic 28): types::join_bounds_inner has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/types.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcb683f30f399fec22fbc4f498204c2ed58a19397c894dadc2e5dbf24cc0152"}},{"ruleId":"D1","level":"warning","message":{"text":"union (cyclomatic 28): union has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"79904bcb4fef34af240311f686022230f8f08c79262ce360e841e51256c67c04"}},{"ruleId":"D1","level":"warning","message":{"text":"getItemsBefore (cyclomatic 28): getItemsBefore has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b907e320d9d4543b33f87695af82cab3a7d2eb7e19b9ccd7e7d2d0606035fd"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 28): (anonymous) has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2809}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85f2be4307767eec2d57fbac5e16c7fb2c2ccf29332f84182f415b972c96c55"}},{"ruleId":"D1","level":"warning","message":{"text":"Context::manage_cond_expr (cyclomatic 27): Context::manage_cond_expr has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/assert/context.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f735774b0423f5390aa28017f3d42f3b48c7a8bc1bfc201b0d0f7883ab2c9a"}},{"ruleId":"D1","level":"warning","message":{"text":"cast::clif_int_or_float_cast (cyclomatic 27): cast::clif_int_or_float_cast 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":"compiler/rustc_codegen_cranelift/src/cast.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5089b1a43ca1e1628880df939ca507d62f6720ced6b800da40f7980ba2cb7b34"}},{"ruleId":"D1","level":"warning","message":{"text":"asm::llvm_fixup_output (cyclomatic 27): asm::llvm_fixup_output has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52b5351c435310a380298f4875172d017e248d88f388ddf5de09f669166c677"}},{"ruleId":"D1","level":"warning","message":{"text":"link::add_native_libs_from_crate (cyclomatic 27): link::add_native_libs_from_crate 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac523008973abe73f9aaf7e0950387633ca4f24160de1c37188c268fb04f68fb"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker::visit_rvalue (cyclomatic 27): Checker::visit_rvalue has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec33bcfb502a4b7a40928b084446535bef951e39cc15b5f11766f0153051521"}},{"ruleId":"D1","level":"warning","message":{"text":"ValidityVisitor::check_safe_pointer (cyclomatic 27): ValidityVisitor::check_safe_pointer 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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d2d2a6733ea177a7c5b0ccda579293af2dadde93e280414be1374b1444e184"}},{"ruleId":"D1","level":"warning","message":{"text":"check::check_impl_items_against_trait (cyclomatic 27): check::check_impl_items_against_trait 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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"75452f44bd55bb0bf26b4d5de7aaf55408237dfde3fa8579daf8681389713fa7"}},{"ruleId":"D1","level":"warning","message":{"text":"UnusedDelimLint::is_expr_delims_necessary (cyclomatic 27): UnusedDelimLint::is_expr_delims_necessary has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c00fd46ae1e3d3e65c7fc49bd7fe247a1589f90983c5bd911241d31fd64b5e"}},{"ruleId":"D1","level":"warning","message":{"text":"CrateError::report (cyclomatic 27): CrateError::report has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb016a58622a4edca75cdc6ea41e080c73c390905f2961efb53ac8c4a11e73b"}},{"ruleId":"D1","level":"warning","message":{"text":"typetree::typetree_from_ty_impl_inner (cyclomatic 27): typetree::typetree_from_ty_impl_inner 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":"compiler/rustc_middle/src/ty/typetree.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8576a91f55aab909093263ed9441bb7f10cd5fc40a38cdd3b2171db55858faa2"}},{"ruleId":"D1","level":"warning","message":{"text":"Validator::validate_rvalue (cyclomatic 27): Validator::validate_rvalue 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":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79a9e99d8393147dc188d9542221a72372246587c01d6c72ef127133896ad47"}},{"ruleId":"D1","level":"warning","message":{"text":"ref_prop::compute_replacement (cyclomatic 27): ref_prop::compute_replacement 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":"compiler/rustc_mir_transform/src/ref_prop.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f7b2d4970abea2d41dff72ab80706e43a7ab0ca07019e34747b7decf424ea2"}},{"ruleId":"D1","level":"warning","message":{"text":"collector::collect_items_rec (cyclomatic 27): collector::collect_items_rec 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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"371d9ab6bf8cdd5fcc69b3c2224add134489093633bf25dff9b548d4f41120c8"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_struct_fields (cyclomatic 27): Parser::parse_struct_fields 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":3871}}}],"partialFingerprints":{"codehealthFindingId/v1":"4740cbfa896709afca3a1550b1b146831325974b7b5184cbcad06d55f0db3932"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::resolve_elided_lifetimes_in_path (cyclomatic 27): LateResolutionVisitor::resolve_elided_lifetimes_in_path has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"097546032bae93761a602dd6b29244ab3aca7b14070a1ce231f57c8ccdfff93b"}},{"ruleId":"D1","level":"warning","message":{"text":"FnAbi::apply_attrs_llfn (cyclomatic 27): FnAbi::apply_attrs_llfn 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":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0642eaf135b2172a6a2ca80a9f19235f2378563c3a891a95cce74b130dd31db"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoTraitFinder::evaluate_nested_obligations (cyclomatic 27): AutoTraitFinder::evaluate_nested_obligations 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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab8fa6ac0fdf51a44578f26c48eac2fb490196588aefa372aa377bda73f1a2b"}},{"ruleId":"D1","level":"warning","message":{"text":"project::assemble_candidates_from_impls (cyclomatic 27): project::assemble_candidates_from_impls has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ddd555d360cb26e4d70a8bffeca83f6d375ec0ad4d34e1f0177f578ba96365"}},{"ruleId":"D1","level":"warning","message":{"text":"div::div (cyclomatic 27): div::div 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":"library/compiler-builtins/compiler-builtins/src/float/div.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"22aff2c24d9cbff3f7cf58e099731fed1af01f8958ec7b5db747c76798eaca5a"}},{"ruleId":"D1","level":"warning","message":{"text":"lgammaf_r::lgammaf_r (cyclomatic 27): lgammaf_r::lgammaf_r 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":"library/compiler-builtins/libm/src/math/lgammaf_r.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"42dfdac5068861293ef0ee63759438d0cf9349967cb8425fcb14003376e8e18a"}},{"ruleId":"D1","level":"warning","message":{"text":"hvx::parse_header (cyclomatic 27): hvx::parse_header 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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"11df1b3caacec94dd22ceb38f3a61b1bfc451200f3937692d2a1a200dd45aa18"}},{"ruleId":"D1","level":"warning","message":{"text":"print_item::compare_names (cyclomatic 27): print_item::compare_names has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":2193}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e881ea1948b44d312b5c6ce9551a7c909036159b8fa0f165bfebb379c46bcb"}},{"ruleId":"D1","level":"warning","message":{"text":"ArbitrarySourceItemOrdering::check_item (cyclomatic 27): ArbitrarySourceItemOrdering::check_item has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75c79359cb8a953becdc69f5fe92a8376f6ce6302cdf66edcccf8a744d3a459"}},{"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":"src/tools/clippy/clippy_lints/src/indexing_slicing.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e687d3b415fb0a781326ca441331afe780f9f123b1e9b2e166c6523098dd675c"}},{"ruleId":"D1","level":"warning","message":{"text":"needless_range_loop::check (cyclomatic 27): needless_range_loop::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":"src/tools/clippy/clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"394d289e27c051980599ced0c477bac054e19b7cde4a64cbf746362585444cd0"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::gen_source_code (cyclomatic 27): Expr::gen_source_code has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/term_search/expr.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"620519e3576f8ad388fe7ec85d10668941fbbd4dbc331cc18ca77d8b217c8545"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprCollector::collect_format_args_impl (cyclomatic 27): ExprCollector::collect_format_args_impl has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7689a933b4fbfd50b39192d5bcf2361106121ceb379c23652825b72ed6d34b"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprCollector::maybe_collect_expr_as_pat (cyclomatic 27): ExprCollector::maybe_collect_expr_as_pat has cyclomatic complexity 27 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 9 belong to 3 function items declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae0bce86761bf6be2ede9a54f8221f12f840d6d1a7d13857edf49844d3b3e24"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer::print_path (cyclomatic 27): Printer::print_path has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b32b693c39d2722eede5af90525e5e4a7ee9c0bb8b03d02ceea6f504c0769a"}},{"ruleId":"D1","level":"warning","message":{"text":"Module::process_def_in_sel (cyclomatic 27): Module::process_def_in_sel has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_module.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd4238b16868a4935f879d96b775021dac83bde2edfe561e440a4089c7ba0ee"}},{"ruleId":"D1","level":"warning","message":{"text":"convert_closure_to_fn::convert_closure_to_fn (cyclomatic 27): convert_closure_to_fn::convert_closure_to_fn has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b416e030fd8a8108be92261173cca69fbcb1a0ff54c06eb1ec40a5bf7070d619"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionRelevance::score (cyclomatic 27): CompletionRelevance::score has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/item.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef430627fc3c7fb984d4e8ae350c1cf21bb6717e9c59637534f24729a036cc5"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis::expand (cyclomatic 27): analysis::expand has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f019cbfca1532d3733ec2864124476b850c891b5e0ec3780177fb5e881c986"}},{"ruleId":"D1","level":"warning","message":{"text":"Definition::range_for_rename (cyclomatic 27): Definition::range_for_rename has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/rename.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c2a63c68ec79ebc316bed1987b24e180be762508160d9f6a06cbb1b8f936a3"}},{"ruleId":"D1","level":"warning","message":{"text":"prime_caches::parallel_prime_caches (cyclomatic 27): prime_caches::parallel_prime_caches has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/prime_caches.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ade2846901b22f7b8aa47f4765d987d3c5cabcf6d900a7e40ff6ac29f067eac"}},{"ruleId":"D1","level":"warning","message":{"text":"GetOptsOptions::from_matches (cyclomatic 27): GetOptsOptions::from_matches has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/bin/main.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"898863fc097de646e2544b05393bf616c611d17043287c05f0260d56b72dd7f0"}},{"ruleId":"D1","level":"warning","message":{"text":"writeFn (cyclomatic 27): writeFn has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2504}}}],"partialFingerprints":{"codehealthFindingId/v1":"953e96bcf1527998284edf62590e00212e9e51e2c6cf4d84912ecc6007eecc40"}},{"ruleId":"D1","level":"warning","message":{"text":"AstValidator::visit_assoc_item (cyclomatic 26): AstValidator::visit_assoc_item 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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8abe8367a12de358d91b36e0614afff0ad6d4ace9de7af4705d05a52fe2b9f8"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChecker::check_iscleanup (cyclomatic 26): TypeChecker::check_iscleanup has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2082}}}],"partialFingerprints":{"codehealthFindingId/v1":"39835be7f1cfad4277533538e4a6948e06942971a3dc9f44bf2495f2dba5c3ec"}},{"ruleId":"D1","level":"warning","message":{"text":"printf::parse_next_substitution (cyclomatic 26): printf::parse_next_substitution 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":"compiler/rustc_builtin_macros/src/format_foreign.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d5d168867896dcd8198ffc354d600765537562d784ab901a779c413ac06f4b"}},{"ruleId":"D1","level":"warning","message":{"text":"asm::llvm_fixup_input (cyclomatic 26): asm::llvm_fixup_input 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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c87c14740e40a79e65e4d9d0a715102a829a5619818312fd3962e54a35f705"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_argument (cyclomatic 26): FunctionCx::codegen_argument 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"0756a9726283bddfb7dd41f0944e28ac8f778b64dbfe7f5a6691d2914c3bbe72"}},{"ruleId":"D1","level":"warning","message":{"text":"CastCheck::do_check (cyclomatic 26): CastCheck::do_check 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":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"766716ba5fa44b25e1639ed827611e7c51ef16d46f9eec9897139ae6d0fba381"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::unresolved_macro_suggestions (cyclomatic 26): Resolver::unresolved_macro_suggestions 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":1912}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82777df9272595a4fd394ff4f09ba76516c4e41e67f32b8ced62e310789870d"}},{"ruleId":"D1","level":"warning","message":{"text":"UnusedParens::check_ty (cyclomatic 26): UnusedParens::check_ty has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"228eac04733aeeb8120424395690f0cf82b6a138ebe45027f3ce26d4d69bfc2e"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::choose_bucket_for_candidate (cyclomatic 26): Builder::choose_bucket_for_candidate has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/matches/buckets.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb08848a6440d4c636ab6b0a835de5cb9da3248c23256960cf502af2137bc10"}},{"ruleId":"D1","level":"warning","message":{"text":"ThirPrinter::print_pat_kind (cyclomatic 26): ThirPrinter::print_pat_kind 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":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"e784f9d5a8d112aa4cf04e74c666570ae54b781d72f843c470c562ea6d10f1c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_pat_fields (cyclomatic 26): Parser::parse_pat_fields has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"638b2f37b553275a4ce63caf220d6f8c0f40114b203ec88878e7e29c94c71119"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::suggest_using_enum_variant (cyclomatic 26): LateResolutionVisitor::suggest_using_enum_variant has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5203643a5c02a8b35baa9988d9ba289a272fa93470623912a0f5889a709f31c9"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::source_span_for_markdown_range_inner (cyclomatic 26): rustdoc::source_span_for_markdown_range_inner has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/rustdoc.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd67e211380e4d623479f8748a153ce653e0b10f14e4aec238ff2984a8f4c78"}},{"ruleId":"D1","level":"warning","message":{"text":"x86::compute_abi_info (cyclomatic 26): x86::compute_abi_info has cyclomatic complexity 26 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 5 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/x86.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc92c040fa9f856ab3e9e47c5c069d8c2d5ba188f787bdc36ad85b7d49804051"}},{"ruleId":"D1","level":"warning","message":{"text":"NiceRegionError::report_trait_placeholder_mismatch (cyclomatic 26): NiceRegionError::report_trait_placeholder_mismatch has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a897a1e2445e5526a95d0f9d5f701da10f08ed4c085ce30b142902bf29aed2"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::posix_spawn (cyclomatic 26): Command::posix_spawn has cyclomatic complexity 26 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 4 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c0e9c197177112bd607410fb3762ca502ed8945df7a5e3c4d1e04d346a387f"}},{"ruleId":"D1","level":"warning","message":{"text":"stdarch_verify::functions (cyclomatic 26): stdarch_verify::functions 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":"library/stdarch/crates/stdarch-verify/src/lib.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd9ae793ed37a93e189eacd0e9aff39f89bf78fcb1567656d94a3f8a4710383"}},{"ruleId":"D1","level":"warning","message":{"text":"Cargo::configure_linker (cyclomatic 26): Cargo::configure_linker has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2aacc7d5f87a908f107c3269aae345e48e6155d3107f0534128face6dbfbe79"}},{"ruleId":"D1","level":"warning","message":{"text":"Stripper::fold_item (cyclomatic 26): Stripper::fold_item 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":"src/librustdoc/passes/stripper.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6577ccfbfcef1f712e54f137f2ece24d4c71f18c04bfb695397f979c3b8e73e5"}},{"ruleId":"D1","level":"warning","message":{"text":"render::render_impl (cyclomatic 26): render::render_impl has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4b5adbf6b00a5bdaa937432a89d0f1b548de4210afed9c1764ae93e8d04372"}},{"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":"src/tools/clippy/clippy_lints/src/tuple_array_conversions.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f6d769bb0a1a8a76b034069cc68a2e01e4676c01a23dd344ceae6d7239131d"}},{"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":"src/tools/clippy/clippy_lints/src/types/mod.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abea94f761f15fa553dc4a6a21eec8ec1df28718ef08ef6a1962d735dbd77aa"}},{"ruleId":"D1","level":"warning","message":{"text":"invalid_upcast_comparisons::upcast_comparison_bounds_err (cyclomatic 26): 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":"src/tools/clippy/clippy_lints/src/operators/invalid_upcast_comparisons.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92cffff5c75a40968c2e092efe69d60e33507719ef91127a2f16e302645501f"}},{"ruleId":"D1","level":"warning","message":{"text":"unnecessary_cast::walk_receiver_path_step (cyclomatic 26): 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":"src/tools/clippy/clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"851f05bf0cd56acfa85e408b00de8234fb19b668200ddccd557b5efc408d40b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Validator::check_item (cyclomatic 26): Validator::check_item 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":"src/tools/jsondoclint/src/validator.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa7c555c66e8010ca19561d62dbaf31762106519e8260caaaa6ae849dc52ecc"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cyclomatic 26): EvalContextExt::emulate_foreign_item_inner 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":"src/tools/miri/src/shims/unix/solarish/foreign_items.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac86a36c72b803d750baf4d9363a3a0e46971edc6348fcbaaf85729e24ab8c6"}},{"ruleId":"D1","level":"warning","message":{"text":"sse42::compare_strings (cyclomatic 26): sse42::compare_strings has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/x86/sse42.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"de81a99e2a27bb0be4f202d4de2583daaa435286b3892f9a8bdcc73f86d320bc"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer::print_type_ref (cyclomatic 26): Printer::print_type_ref has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"67da6a026dd22580718cb8ab7ef3fd4d2387c752bb97d33497c81a100cb0db7b"}},{"ruleId":"D1","level":"warning","message":{"text":"attrs::parse_repr_tt (cyclomatic 26): attrs::parse_repr_tt has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2f92cab541f29a53f2b179992e26d75279730fc5e4d15cecb6789d4761d8ed"}},{"ruleId":"D1","level":"warning","message":{"text":"TyLoweringContext::lower_dyn_trait (cyclomatic 26): TyLoweringContext::lower_dyn_trait has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"2110ab8d428be7c351ec96b366ce8c470a1a148e84a67477bfa9df33fcced323"}},{"ruleId":"D1","level":"warning","message":{"text":"valtree::allocation_to_const (cyclomatic 26): valtree::allocation_to_const 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":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"049b6ffd22e60eb45436130dd3051d1a5542994c020b34ea72e713749c995c88"}},{"ruleId":"D1","level":"warning","message":{"text":"inlay_hints::hints (cyclomatic 26): inlay_hints::hints 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":"src/tools/rust-analyzer/crates/ide/src/inlay_hints.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa66e00db293384e51ad9eaeb6d53c04b350c1e01d9df1081b59896744d543f"}},{"ruleId":"D1","level":"warning","message":{"text":"render::render_memory_layout (cyclomatic 26): render::render_memory_layout 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":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ed25e5956b28c625b54a1e3ea895a4e03a7979e2c960a43dbbe7e85c8606de"}},{"ruleId":"D1","level":"warning","message":{"text":"file_structure::structure_node (cyclomatic 26): file_structure::structure_node has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 3 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/file_structure.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"105a19508241294c3bd276cb3c83437d61140eb798ad1dc7e24372ec9f119887"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::read_tokenstream (cyclomatic 26): Reader::read_tokenstream has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5a81a74ce07673ae506719fa1e28d6031c24376bf4fb814e2885eb43d8b82c"}},{"ruleId":"D1","level":"warning","message":{"text":"Ty::ty_and_layout_field::field_ty_or_layout (cyclomatic 25): Ty::ty_and_layout_field::field_ty_or_layout 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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da0cfe378fb49b122141f2e8618344853b0f108a0eb101ef5fb2378680830db"}},{"ruleId":"D1","level":"warning","message":{"text":"RegionInferenceContext::best_blame_constraint (cyclomatic 25): RegionInferenceContext::best_blame_constraint has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/region_infer/mod.rs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b4eb031f7fc55de7b87a92749cf28e1d0e3533093ae911a4a3ee930070828f"}},{"ruleId":"D1","level":"warning","message":{"text":"places_conflict::place_projection_conflict (cyclomatic 25): places_conflict::place_projection_conflict has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/places_conflict.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ee6564a7a927618dfa11370a3c9186a2aba2067af64d704fd387c548ed0414"}},{"ruleId":"D1","level":"warning","message":{"text":"coerce_pointee::expand_deriving_coerce_pointee (cyclomatic 25): coerce_pointee::expand_deriving_coerce_pointee 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":"compiler/rustc_builtin_macros/src/deriving/coerce_pointee.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3e5e745c78c0a66bcb526a7f4285ca6a2275b30ada3ce540be14accae5a6ea"}},{"ruleId":"D1","level":"warning","message":{"text":"base::compile_codegen_unit::module_codegen (cyclomatic 25): base::compile_codegen_unit::module_codegen 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":"compiler/rustc_codegen_gcc/src/base.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb0f04bfb73d9b85294b6610b3b23ff5a98eb9dcfd94f73e9c8d451fc616290"}},{"ruleId":"D1","level":"warning","message":{"text":"asm::llvm_fixup_output_type (cyclomatic 25): asm::llvm_fixup_output_type 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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa5352417cf4474edb7a249cb7eb74e96512b3ee6e71b00919c1768ea18be6c"}},{"ruleId":"D1","level":"warning","message":{"text":"symbol_export::exported_generic_symbols_provider_local (cyclomatic 25): symbol_export::exported_generic_symbols_provider_local 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":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2c9dad225ca35ad718a5ca937b8878f8aa38c33a736c756e5ddcf8d4bec383"}},{"ruleId":"D1","level":"warning","message":{"text":"macro_rules::compile_declarative_macro (cyclomatic 25): macro_rules::compile_declarative_macro 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":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"366fdc5a0aee62551f86d01acdfbef0dbb8ec88fccc0bf581b6022de7db316f9"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::note_source_of_type_mismatch_constraint (cyclomatic 25): FnCtxt::note_source_of_type_mismatch_constraint 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":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cb8aa0a224c77a0e5de52c88848fe34e89a7116f219d3f415d5caf77d551f3"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::report_method_error (cyclomatic 25): FnCtxt::report_method_error has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b64a05234773d75dc0c21dc7b0797ba1dcb0160891a2048308b7b96bff314e"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_pat_ref (cyclomatic 25): FnCtxt::check_pat_ref 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2794}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b570d015041a70543a453b9bbf65ab46c42eeed81b80d27aebb586ac3407d0"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineAsmCtxt::check_asm_operand_type (cyclomatic 25): InlineAsmCtxt::check_asm_operand_type 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":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"352975f7a4861f70eb25658c2f68b918f838363d162574f96b7f96222641e60f"}},{"ruleId":"D1","level":"warning","message":{"text":"must_use::is_ty_must_use (cyclomatic 25): must_use::is_ty_must_use 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":"compiler/rustc_lint/src/unused/must_use.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c55d1bb03cc00d12603e36f7c572049808ab5bd37402296e3a428fd5a999bb"}},{"ruleId":"D1","level":"warning","message":{"text":"PatCtxt::lower_pattern_unadjusted (cyclomatic 25): PatCtxt::lower_pattern_unadjusted 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":"compiler/rustc_mir_build/src/thir/pattern/mod.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"e282520137dca90b772c7612ed72eda1235f943c57711533f85721d7ec5fcc15"}},{"ruleId":"D1","level":"warning","message":{"text":"constant::lit_to_const (cyclomatic 25): constant::lit_to_const 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":"compiler/rustc_mir_build/src/thir/constant.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1484a4deb035fa93199aafc8ecf6fdadf3823a0251e2e0ee22e145062d5dbff3"}},{"ruleId":"D1","level":"warning","message":{"text":"MoveDataBuilder::move_path_for (cyclomatic 25): MoveDataBuilder::move_path_for 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"588342192e3d1f51a51cad8861ae6c19ff9d3459887ee37b24d70e900fb7634a"}},{"ruleId":"D1","level":"warning","message":{"text":"AbortUnwindingCalls::run_pass (cyclomatic 25): AbortUnwindingCalls::run_pass 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":"compiler/rustc_mir_transform/src/abort_unwinding_calls.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3045e99b5a5d9c440ea87de9b1e87af2343b37d47eee59bf81ba78797a36104b"}},{"ruleId":"D1","level":"warning","message":{"text":"CondChecker::visit_expr (cyclomatic 25): CondChecker::visit_expr has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 belong to 2 function items declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":4351}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a292b276765cff306a5fcd7b83144b8c0596b56211f17498e7d331ddd05d8fc"}},{"ruleId":"D1","level":"warning","message":{"text":"ReachableContext::propagate_node (cyclomatic 25): ReachableContext::propagate_node 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":"compiler/rustc_passes/src/reachable.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97c6613ddcc4b457927c7f14e29a44e56de1293ec077f578eb580dc57c8964a"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::cmp_fn_sig (cyclomatic 25): TypeErrCtxt::cmp_fn_sig 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e11878c2d56f04f4f806eeedc3f1652273bd1d455dd0aaba8f7916375f9595"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::report_concrete_failure (cyclomatic 25): TypeErrCtxt::report_concrete_failure has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e621715ab347ec5f62383a622c64c3a72be0ad7d2eabf9f401cdc61b794d7b"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::report_fulfillment_errors (cyclomatic 25): TypeErrCtxt::report_fulfillment_errors 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":"compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf1e69c12d4c44e6ef2703711244633ec71755a09459a218500dee39e41fa54"}},{"ruleId":"D1","level":"warning","message":{"text":"atan2f::atan2f (cyclomatic 25): atan2f::atan2f 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":"library/compiler-builtins/libm/src/math/atan2f.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b56cf47569e56e1b4ab5f5fcb19a0844e89b5b617444ac52e4cbd730b05978"}},{"ruleId":"D1","level":"warning","message":{"text":"atan2::atan2 (cyclomatic 25): atan2::atan2 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":"library/compiler-builtins/libm/src/math/atan2.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd40a781a14ef4b01400ed6fd7cd71f19eedb9325960fbe0a1e92bd29ec5cac2"}},{"ruleId":"D1","level":"warning","message":{"text":"compile::run_cargo (cyclomatic 25): compile::run_cargo has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2624}}}],"partialFingerprints":{"codehealthFindingId/v1":"15465a2d2b0a6ffa06a247d183c0157742a6858dc7146d59e26390e77af95b15"}},{"ruleId":"D1","level":"warning","message":{"text":"Disambiguator::from_str (cyclomatic 25): Disambiguator::from_str 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":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"881ec71503729f692b59ecd5e788a8a3294b9b162592ab1116026733815b6e86"}},{"ruleId":"D1","level":"warning","message":{"text":"cfg::extract_cfg_from_attrs (cyclomatic 25): cfg::extract_cfg_from_attrs has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/cfg.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b6ece3e7cd428ccbeacd94a3f86d2445b4c1332c284a5fa0da4eba9e2a1547"}},{"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":"src/tools/clippy/clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bdbd516657560cd4db325dfb37d28e594f58b199d85811d1d62b01e8d99d03"}},{"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":"src/tools/clippy/clippy_lints/src/utils/author.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8eb6cc493100dc699b8a6f18b8bb5cea95d6e0b302558003f1d2e384257063"}},{"ruleId":"D1","level":"warning","message":{"text":"unwrap_expect_used::check (cyclomatic 25): 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":"src/tools/clippy/clippy_lints/src/methods/unwrap_expect_used.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6113fe4fe4b2b9fa8b06b5a057dc7b523f6411763089f839f030a5a358903ac"}},{"ruleId":"D1","level":"warning","message":{"text":"unnecessary_sort_by::mirrored_exprs (cyclomatic 25): 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":"src/tools/clippy/clippy_lints/src/methods/unnecessary_sort_by.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"af89183b6572d975fc84962884c24bffa8a7312530cbcb9313ea5f410cf83ae9"}},{"ruleId":"D1","level":"warning","message":{"text":"LintExtractor::lints_from_file (cyclomatic 25): LintExtractor::lints_from_file has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/lint-docs/src/lib.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee8b8e1c0510e054c2de537553084584311987599aa004be2b290de0987cc1c"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_avx2_intrinsic (cyclomatic 25): EvalContextExt::emulate_x86_avx2_intrinsic 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":"src/tools/miri/src/intrinsics/x86/avx2.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4511c591749226a525a98b112dfea1148ad208dfc2dd185eb937eb67acd8be"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_sse_intrinsic (cyclomatic 25): EvalContextExt::emulate_x86_sse_intrinsic 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":"src/tools/miri/src/intrinsics/x86/sse.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"686ab2967f61ad2cd90fc52041f3ea213197d7146b03eba2e817ac9b6819fe55"}},{"ruleId":"D1","level":"warning","message":{"text":"TcpSocket::setsockopt (cyclomatic 25): TcpSocket::setsockopt has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f1c98a6824c909019ddc7cdbe838219e53d7d7f379506ccfb6545f7db5bde5"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::try_find_coercion_lub (cyclomatic 25): InferenceContext::try_find_coercion_lub has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0ebae8d7678f72e8dffe76089e29c655daf192b9159a7d49b34cacb65573f0"}},{"ruleId":"D1","level":"warning","message":{"text":"goto_type_definition::goto_type_definition (cyclomatic 25): goto_type_definition::goto_type_definition 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":"src/tools/rust-analyzer/crates/ide/src/goto_type_definition.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fe529d1a1919e155b64a3eb7dca95042d03b9766aa7e5fdfd57ded4f9e5b57"}},{"ruleId":"D1","level":"warning","message":{"text":"signature_help::signature_help_for_call (cyclomatic 25): signature_help::signature_help_for_call 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":"src/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a59e869a73d201cf248e9d32d4b45e5b034f2d9fdfce245df2d4a417c456da1"}},{"ruleId":"D1","level":"warning","message":{"text":"unwrap_return_type::unwrap_return_type (cyclomatic 25): unwrap_return_type::unwrap_return_type has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_return_type.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9b44d6dbd0b4e3741b571b1dfce983bf744d8797fb2b281a578dfa79c7b40e"}},{"ruleId":"D1","level":"warning","message":{"text":"item_list::add_keywords (cyclomatic 25): item_list::add_keywords has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/item_list.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a157a4e6847419d1e1c2e59031dc426a4ff2de34f47303628571bf2dfd0285"}},{"ruleId":"D1","level":"warning","message":{"text":"pattern::complete_pattern_path (cyclomatic 25): pattern::complete_pattern_path 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":"src/tools/rust-analyzer/crates/ide-completion/src/completions/pattern.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3130fac143ca5dcfd6fe81f65763f40a4d359b1b970e453ad12d73b2bc4ab1"}},{"ruleId":"D1","level":"warning","message":{"text":"NameRefClass::classify (cyclomatic 25): NameRefClass::classify 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":"src/tools/rust-analyzer/crates/ide-db/src/defs.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"183b28f3e6ef1d3d9ccd9256de88f26c6fe58de5c339efcf1aaa12a1d3bfbf24"}},{"ruleId":"D1","level":"warning","message":{"text":"Ctx::transform_path_ (cyclomatic 25): Ctx::transform_path_ has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/path_transform.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"276f98dd79a14193c524e9eee57c5e759dcb07168e200926541886ab03165295"}},{"ruleId":"D1","level":"warning","message":{"text":"Converter::extend_literal (cyclomatic 25): Converter::extend_literal has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/lexed_str.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd22ac5beaa4e1fff6fc0b2e49d007d4c9bfa2fad195a2c84f20a2a0b3c06192"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalState::process_changes (cyclomatic 25): GlobalState::process_changes has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdcfca5b61f653d839be0173074ef5e9de0e98e88698ecaccc798ab277615e4"}},{"ruleId":"D1","level":"warning","message":{"text":"to_proto::completion_item (cyclomatic 25): to_proto::completion_item has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa32144c412687523206fff0b4c19d66e480fa00a9b18b8e30609a60686a653"}},{"ruleId":"D1","level":"warning","message":{"text":"FmtVisitor::visit_impl_items (cyclomatic 25): FmtVisitor::visit_impl_items 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":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"507824dc4e6cd2bee42c12d28feb99c4ad827acba4d849b523ac37cfdf277880"}},{"ruleId":"D1","level":"warning","message":{"text":"features::collect_lang_features_in (cyclomatic 25): features::collect_lang_features_in has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/features.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"881782540426d920ad35620b623d9c7769f9fb2d950d323fa1776ea5cd8c24c8"}},{"ruleId":"D1","level":"warning","message":{"text":"Canonicalized::canonicalize (cyclomatic 25): Canonicalized::canonicalize has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/unicode-table-generator/src/raw_emitter.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c888a8bdd70046c7fef6d1b26b6c16cc076b84db087e30cedbecde4964c8f4"}},{"ruleId":"D1","level":"warning","message":{"text":"getRow (cyclomatic 25): getRow has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f058acfffaa9c7030f55b0f8fcf4ddb82cb29d9d05d68d79f0ee4819419f75e"}},{"ruleId":"D1","level":"warning","message":{"text":"check_cfg::unexpected_cfg_name (cyclomatic 24): check_cfg::unexpected_cfg_name has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/check_cfg.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc18ffd9ea6a6ff59c4975e343c969e15550ef04c698a83e5df55b60ec14b66"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::add_move_hints (cyclomatic 24): MirBorrowckCtxt::add_move_hints 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":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b865b203b07354d6d9ac2445938dc66042e6746b4031ad4f3bdca5b88852b7"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChecker::visit_terminator (cyclomatic 24): TypeChecker::visit_terminator 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e9d7dd21122e7b0d875574e689fab6d30d2c57c388c7c648b8839f90f9a59d"}},{"ruleId":"D1","level":"warning","message":{"text":"abi::conv_to_fn_attribute (cyclomatic 24): abi::conv_to_fn_attribute 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":"compiler/rustc_codegen_gcc/src/abi.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33768e53fa2aae2af7239733cbbb53f838b3e6a60e23fc09cae567c464e0c13"}},{"ruleId":"D1","level":"warning","message":{"text":"simd::generic_simd_intrinsic::simd_simple_float_intrinsic (cyclomatic 24): simd::generic_simd_intrinsic::simd_simple_float_intrinsic 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":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b048bd29bf25e467e12cf143c5b55263c827adff074926cc870a40e45aa8561"}},{"ruleId":"D1","level":"warning","message":{"text":"abi::to_llvm_calling_convention (cyclomatic 24): abi::to_llvm_calling_convention 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":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce84e56acf8cf7867e561914f5237d12a369a14e2f8f7de3b983ea4689159e6"}},{"ruleId":"D1","level":"warning","message":{"text":"mir::arg_local_refs (cyclomatic 24): mir::arg_local_refs 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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"d765cdc04be7580c79b6f8e302c9a275a3d49114075c3bbebce5822d35d9fb11"}},{"ruleId":"D1","level":"warning","message":{"text":"WrongNumberOfGenericArgs::suggest_removing_args_or_generics (cyclomatic 24): WrongNumberOfGenericArgs::suggest_removing_args_or_generics 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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"047a81fa8ce650cdc7029b460c05a717f7dabcbea9624b2921fefd2c36718e75"}},{"ruleId":"D1","level":"warning","message":{"text":"clauses_of::gather_explicit_clauses_of (cyclomatic 24): clauses_of::gather_explicit_clauses_of 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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bfaf80f69cde16494e286d3c3e0936f66357787115fe174aef9bcba46d8a4b"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_type (cyclomatic 24): State::print_type 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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"7954a2ed04b43f950270902199a26012b1eb082da5da38f1101ea554ad4271bd"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::annotate_loop_expected_due_to_inference (cyclomatic 24): FnCtxt::annotate_loop_expected_due_to_inference 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":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"771b36a191637b76231512dbf272c4e6d65cb231097550a03ded0b166da279cd"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::note_type_is_not_clone (cyclomatic 24): FnCtxt::note_type_is_not_clone 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c91149c9c7cccb770e6aef005e1d79ab9d7c01073d55befac37fcdc4622f4e"}},{"ruleId":"D1","level":"warning","message":{"text":"VisitOpaqueTypes::visit_ty (cyclomatic 24): VisitOpaqueTypes::visit_ty 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":"compiler/rustc_lint/src/impl_trait_overcaptures.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"55de48dd92a24d56faa71675567143cf27187893a13a0374bcfbd5fb8b60297e"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentResult::report_fully_unused (cyclomatic 24): AssignmentResult::report_fully_unused 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":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a53be4dff879b9612f9296f66b73d9b08d67568e267b057841625aafb2ef6f0"}},{"ruleId":"D1","level":"warning","message":{"text":"pass_manager::run_passes_inner (cyclomatic 24): pass_manager::run_passes_inner 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":"compiler/rustc_mir_transform/src/pass_manager.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc8b1b18f830689a206d48b2925617ffb9305489b6c3a07037afb346092801b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_path_segment (cyclomatic 24): Parser::parse_path_segment 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":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"76400204f9c4aa8b4f47f5907ef099748479e98f8ae35286cc13926a41c689d7"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker::visit_item (cyclomatic 24): Checker::visit_item 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":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfe710a94e85b2f027304b3f792d80492099908acc9cd87ac841f87aec7cb60"}},{"ruleId":"D1","level":"warning","message":{"text":"stability::check_unused_or_stable_features (cyclomatic 24): stability::check_unused_or_stable_features has cyclomatic complexity 24 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 8 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ac174b9170ca16ef9b333e0286b292f21b29acd2886b0b760c23d9de2f02fd"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::suggest_assoc_type_from_bounds (cyclomatic 24): LateResolutionVisitor::suggest_assoc_type_from_bounds 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c818bf4b573c7a5bfad6f86066a8b78f7afdc8e5131dbb39ca37344df15def"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::lookup_assoc_candidate (cyclomatic 24): LateResolutionVisitor::lookup_assoc_candidate has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function item declared inside it. 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2786}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b7e3395dac42dada02f78e77c79472aa4b83e33a2db814ca71b27528b7447c"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::with_generic_param_rib (cyclomatic 24): LateResolutionVisitor::with_generic_param_rib 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":3085}}}],"partialFingerprints":{"codehealthFindingId/v1":"5811d120957b8b2f0d672538ed021da8070dde6d28bac59ed108d1ac9a7a534c"}},{"ruleId":"D1","level":"warning","message":{"text":"loongarch::classify_arg (cyclomatic 24): loongarch::classify_arg 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":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"cade40a7a529b8a2a2d2c406503e76988ec909ca86154fe6881ae30c7eadde06"}},{"ruleId":"D1","level":"warning","message":{"text":"riscv::classify_arg (cyclomatic 24): riscv::classify_arg 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":"compiler/rustc_target/src/callconv/riscv.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1df9f23dc278f51b73dd83512906d4aa34b6121c5836a01cfd434e91f456d4d"}},{"ruleId":"D1","level":"warning","message":{"text":"NeedsDropTypes::next (cyclomatic 24): NeedsDropTypes::next 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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3b410b089bb2f82e4abe4bc808942e23849c190cacffb9bb99d1c353866231"}},{"ruleId":"D1","level":"warning","message":{"text":"add::add (cyclomatic 24): add::add 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":"library/compiler-builtins/compiler-builtins/src/float/add.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8ccb70a438deaf74f27e468318bfa2e4dd8948d404a18c21a330099efd5eb2"}},{"ruleId":"D1","level":"warning","message":{"text":"remquof::remquof (cyclomatic 24): remquof::remquof 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":"library/compiler-builtins/libm/src/math/remquof.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ed0cffecf36d740162a887f374f511ca4e6cd324e41d6c2fe9638311742e22"}},{"ruleId":"D1","level":"warning","message":{"text":"fma::fma_round (cyclomatic 24): fma::fma_round 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":"library/compiler-builtins/libm/src/math/generic/fma.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c559d165f8e82cd4be1d79dd2fda0a19626e6c45a6ebfb7894f6e90f77520384"}},{"ruleId":"D1","level":"warning","message":{"text":"remquo::remquo (cyclomatic 24): remquo::remquo 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":"library/compiler-builtins/libm/src/math/remquo.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5202e98d0ef37fccaf6a833845dfeb6da51eb61bf3a4d3fb72637dbf29106504"}},{"ruleId":"D1","level":"warning","message":{"text":"jn::jn (cyclomatic 24): jn::jn 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":"library/compiler-builtins/libm/src/math/jn.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3cb83c562d8ed662dbde15924f62ed223ed949c261a4ac5e645fb9a2f05315"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolBuild::run (cyclomatic 24): ToolBuild::run has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/tool.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5b5333b40e27fd4090b7a1fd50941d46cf834fe2738bdf7295441f114e1d3b"}},{"ruleId":"D1","level":"warning","message":{"text":"TagParser::extract_opening_tag (cyclomatic 24): TagParser::extract_opening_tag has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"369adeabf658cf8ea4d97d56888c79d644c5e6968916e44c68851db9e8493253"}},{"ruleId":"D1","level":"warning","message":{"text":"RustdocVisitor::maybe_inline_local (cyclomatic 24): RustdocVisitor::maybe_inline_local 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":"src/librustdoc/visit_ast.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"580cfc0639e9bba4c52b80c7a0f6e85fbbef1bb01fe1328cd0a4ba8c0a938f3a"}},{"ruleId":"D1","level":"warning","message":{"text":"clean::clean_generics (cyclomatic 24): clean::clean_generics has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"310eb7bbe92ca5cda6bd0f9968774a7bdecd02733fbfcda6239661ffdd9dd784"}},{"ruleId":"D1","level":"warning","message":{"text":"main::main (cyclomatic 24): main::main 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":"src/tools/clippy/clippy_dev/src/main.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf03586947bd768f9faeb72a8fa5b87bbaa56139438a6c40cac1f9bd7fe8e8a"}},{"ruleId":"D1","level":"warning","message":{"text":"ItemNameRepetitions::check_item (cyclomatic 24): ItemNameRepetitions::check_item has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/item_name_repetitions.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5766ad29ea4f1295415e7e74cf27eca2b707762ec3ab2a0ff121f370bbee86"}},{"ruleId":"D1","level":"warning","message":{"text":"option_if_let_else::try_get_option_occurrence (cyclomatic 24): 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":"src/tools/clippy/clippy_lints/src/option_if_let_else.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbb32812fb9313bb0fdc40b31c48a6eb0a9001e66bd3ea8aef511077e4401cb"}},{"ruleId":"D1","level":"warning","message":{"text":"unnecessary_literal_unwrap::check (cyclomatic 24): unnecessary_literal_unwrap::check has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_literal_unwrap.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f244852a94c6a27e6165b084eb6f1b75b997095bacf60c6ef1b4830d7ce91515"}},{"ruleId":"D1","level":"warning","message":{"text":"lifetimes::could_use_elision (cyclomatic 24): 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":"src/tools/clippy/clippy_lints/src/lifetimes.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f1d0ec4c7f83d9b46b1d82440a592820b7a0ac79948195fac6552d5f686e4d"}},{"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":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e60e936f93be19ef544073910bf9f87c491a66ec9fa33a618a572a511b8877"}},{"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":"src/tools/clippy/clippy_utils/src/sugg.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"795ed8598af5b8de66933d2a8b4905f8734a721f03967fd361e778af64421b74"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCx::run_rmake_test (cyclomatic 24): TestCx::run_rmake_test has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/run_make.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13c5dd72280758fb7720f0d54b6dfcd0a83decbee926980b97aa6c103551b72"}},{"ruleId":"D1","level":"warning","message":{"text":"setup::setup (cyclomatic 24): setup::setup has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/cargo-miri/src/setup.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5dea19b81655cf78ee723740cb18d58f323df069fbe9c778937fe781077378"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_intrinsic (cyclomatic 24): EvalContextExt::emulate_x86_intrinsic 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":"src/tools/miri/src/intrinsics/x86/mod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8bd233195c17aac5757003be978f2bfccf1cae7e9eee1c1f1fbea8ae9d0918"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cyclomatic 24): EvalContextExt::emulate_foreign_item_inner 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":"src/tools/miri/src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad9057c2ca52613425660f24fd75a6d274cc825a01bf876ea9832c876ebddb6"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticsImpl::descend_into_macros_impl (cyclomatic 24): SemanticsImpl::descend_into_macros_impl has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b452f10200374e42877d4c437532b922410ddb673fc0c0f217899811b9f37cf6"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportMap::collect_import_map (cyclomatic 24): ImportMap::collect_import_map has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/import_map.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67a369cc4c593423def24e01e488f789c618f5da2c554dd590665a4c260af4c"}},{"ruleId":"D1","level":"warning","message":{"text":"ItemScope::push_res_with_import (cyclomatic 24): ItemScope::push_res_with_import has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"969ed3f497f80cac5447b7afb0829e6b8365003ad7826ef357e09871dc69ba54"}},{"ruleId":"D1","level":"warning","message":{"text":"CastCheck::do_check (cyclomatic 24): CastCheck::do_check 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":"src/tools/rust-analyzer/crates/hir-ty/src/infer/cast.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7b842b03ba4df611300a4595cc17d20bc71c4c2f5db4a44f458ccfb420ed9d"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::check_call_arguments (cyclomatic 24): InferenceContext::check_call_arguments has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"02aee6d058a0e0e7e5241bd3f7ba38ec1bfe8991d0bb64b9fb9535dca9c88580"}},{"ruleId":"D1","level":"warning","message":{"text":"consteval::literal_ty (cyclomatic 24): consteval::literal_ty 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":"src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f512b49617e37b4266bfb572db9137fc776c6461d2bad42ad977b8e2087001b0"}},{"ruleId":"D1","level":"warning","message":{"text":"doc_links::filename_and_frag_for_def (cyclomatic 24): doc_links::filename_and_frag_for_def 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":"src/tools/rust-analyzer/crates/ide/src/doc_links.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f035f3af65102b69c38427347474e3de0c633b7506baaa1768b0b6d73712df5"}},{"ruleId":"D1","level":"warning","message":{"text":"annotations::annotations (cyclomatic 24): annotations::annotations has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/annotations.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7c081ba087338c1f9ba612340f31426d0f98c44e69c2e51df1b186663a1fa6"}},{"ruleId":"D1","level":"warning","message":{"text":"flycheck_to_proto::map_rust_diagnostic_to_lsp (cyclomatic 24): flycheck_to_proto::map_rust_diagnostic_to_lsp has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/diagnostics/flycheck_to_proto.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc21ccd0958a2f679270058f4cf7add7d3d3722c171e1b0e0f3a69a45e54f039"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::needs_parens_in_expr (cyclomatic 24): Expr::needs_parens_in_expr 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":"src/tools/rust-analyzer/crates/syntax/src/ast/prec.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8d17939721f7364bfdc876d80f9a76331bff32a72f21cc8ebd7b3b36bc0b04"}},{"ruleId":"D1","level":"warning","message":{"text":"UseSegment::cmp (cyclomatic 24): UseSegment::cmp has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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/tools/rustfmt/src/imports.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb437c045db9b18e525a72265194ae21ada2aa02d65a735e371fef84649e6c88"}},{"ruleId":"D1","level":"warning","message":{"text":"items::format_trait (cyclomatic 24): items::format_trait has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a15d526ae82359bef444f6a93e9e16262413416a81526a5ec5b3b92860029ce"}},{"ruleId":"D1","level":"warning","message":{"text":"LoanInvalidationsGenerator::visit_terminator (cyclomatic 23): LoanInvalidationsGenerator::visit_terminator 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":"compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b182046fc0878e525e06549a2a434e1a1fbb03b53b18406c6332a20eb44723"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigInfo::setup (cyclomatic 23): ConfigInfo::setup 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":"compiler/rustc_codegen_gcc/build_system/src/config.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb736833f27e687998e6c7cb69d073100aab7162ae59ed743eb6c223f737baec"}},{"ruleId":"D1","level":"warning","message":{"text":"common::clif_type_from_ty (cyclomatic 23): common::clif_type_from_ty 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":"compiler/rustc_codegen_cranelift/src/common.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ee4c4bf62ba6a072d68ed8e3c0755a4569cf757324974992aa06e484e1057e"}},{"ruleId":"D1","level":"warning","message":{"text":"constant::mir_operand_get_const_val (cyclomatic 23): constant::mir_operand_get_const_val 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":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7aca0862bc2b9b52dad1a7c1da32e797302b282ba02df9239a813b4ed0147ea"}},{"ruleId":"D1","level":"warning","message":{"text":"write::codegen (cyclomatic 23): write::codegen 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":"compiler/rustc_codegen_gcc/src/back/write.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"069fab7b34a9cfef2677cb2a22577ed89d91f33f927fffefae1243a4f0004fd4"}},{"ruleId":"D1","level":"warning","message":{"text":"metadata::spanned_type_di_node (cyclomatic 23): metadata::spanned_type_di_node 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":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"33db5efb0fb1912afbc2a8b48a007549e4ad44ff78a0b5eae41672f54e73c567"}},{"ruleId":"D1","level":"warning","message":{"text":"GccLinker::export_symbols (cyclomatic 23): GccLinker::export_symbols 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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dd1b70882ce79549b0e4fc8aa0c93da71cdfaf7af1d4b399eea3e94a227efa"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminatorCodegenHelper::do_call (cyclomatic 23): TerminatorCodegenHelper::do_call has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a84b934a9b5de266d0e7073565eb4be79a57d2dac5bee085b87a17ed304c7e"}},{"ruleId":"D1","level":"warning","message":{"text":"link::report_linker_output (cyclomatic 23): link::report_linker_output has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efb4f08dec2d38fbf0128b2be3303c1342931e9503513c9a448e8f780507cdf"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_driver_impl::run_compiler (cyclomatic 23): rustc_driver_impl::run_compiler 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":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1d6a143bd43ac232da13d05f77290f3d9fc12d8ff4cb2d93763447e2aaf0ca"}},{"ruleId":"D1","level":"warning","message":{"text":"clauses_of::const_conditions (cyclomatic 23): clauses_of::const_conditions 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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c657d4a30ca13d6932a99575614af9df1694b500cbc691128411d975bb8ba2"}},{"ruleId":"D1","level":"warning","message":{"text":"errors::generics_args_err_extend (cyclomatic 23): errors::generics_args_err_extend 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e671523b0d29be865ee3004f6288e2ba8a72aa5ecfe5857496a41b9a358fbf"}},{"ruleId":"D1","level":"warning","message":{"text":"orphan::orphan_check_impl (cyclomatic 23): orphan::orphan_check_impl has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/orphan.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a61cd43d903e3da6147533c22bf5df058024084c9a9e3cd36219db4a55c2aa"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::emit_err_pat_wrong_number_of_fields (cyclomatic 23): FnCtxt::emit_err_pat_wrong_number_of_fields 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cbba704b2f406c1733b108411a4ac21d9ea1ec5927a7d59d4887a03e3532c0"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyPrinter::pretty_print_const_valtree (cyclomatic 23): PrettyPrinter::pretty_print_const_valtree 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"77218317ba9c3dd47cc75dc83ed17f0146f579e02435221d08ba8278b16d1fda"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstAnalysis::handle_assign (cyclomatic 23): ConstAnalysis::handle_assign 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":"compiler/rustc_mir_transform/src/dataflow_const_prop.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7714d0936e8c1946ecd9007c13b7870ea4a769412ae7bafb2440354a47d9982"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalCtxt::term_is_fully_unconstrained (cyclomatic 23): EvalCtxt::term_is_fully_unconstrained 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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54ec10d1232218aecd6704b4956201ac99849e7339c284d865c07f0d847f8e0"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::collect_tokens (cyclomatic 23): Parser::collect_tokens 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":"compiler/rustc_parse/src/parser/attr_wrapper.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"a188c2e3a9ea6d4edc6c81420fccad5228e1fa5f07fd8b6bd18bea04dacd02dc"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_arm (cyclomatic 23): Parser::parse_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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":3359}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1d533f087da5993519272fb1dbcf335753e927aa917e135f8f93aa0cd1ea94"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_item_impl (cyclomatic 23): Parser::parse_item_impl has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"66caa1755db6bd616083577fe15cf3b6160ae7b2b0cb3ad71f9fe84ad4052282"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::compare_generics (cyclomatic 23): TypeErrCtxt::compare_generics 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9bb577979e583c5b54a980447414578862dd9c61edf834d03c3ad896341123"}},{"ruleId":"D1","level":"warning","message":{"text":"sig_types::walk_types (cyclomatic 23): sig_types::walk_types 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":"compiler/rustc_ty_utils/src/sig_types.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"233a02506006170d759fec0e17d335c3d4c05b4620cc03cbdf3ef85de1a136d6"}},{"ruleId":"D1","level":"warning","message":{"text":"x86::detect_features (cyclomatic 23): x86::detect_features 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":"library/std_detect/src/detect/os/x86.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"617fd166085671ca1835f4991b894faba3f055ee3ecdb04f44987e1c17900351"}},{"ruleId":"D1","level":"warning","message":{"text":"print_item::render_struct_fields (cyclomatic 23): print_item::render_struct_fields has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8eeb462f84233939853dbe09221dd29de121f3375ab01e13f849deeebec6739"}},{"ruleId":"D1","level":"warning","message":{"text":"Cursor::match_impl (cyclomatic 23): Cursor::match_impl has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_dev/src/parse/cursor.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e24fd2da03d91ba912f1c8209320e9c4f5aa7db39371c942b2bc939a419bf6"}},{"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":"src/tools/clippy/clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6788d8c6bc02f4359ca24ca457f173e9387d86ba88988966cebcb3b678ab910"}},{"ruleId":"D1","level":"warning","message":{"text":"NonCopyConst::is_non_freeze_init_borrowed (cyclomatic 23): NonCopyConst::is_non_freeze_init_borrowed 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":"src/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2deb8df8c5e4d3f3815609b8895a0263fd9202566f405c3b2aed4ce035542e5"}},{"ruleId":"D1","level":"warning","message":{"text":"Checker::check_url (cyclomatic 23): Checker::check_url 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":"src/tools/linkchecker/main.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b0e176b8846a78c117add5ac8e7fd0618026ecc8e8ffb1ef9dd70b96d6ffc2"}},{"ruleId":"D1","level":"warning","message":{"text":"display::write_function (cyclomatic 23): display::write_function has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc1efc7ea3f840071c0754220c39188c195643c1f1f4fb8090030dd2d768c18"}},{"ruleId":"D1","level":"warning","message":{"text":"attrs::resolve_doc_path_on_ (cyclomatic 23): attrs::resolve_doc_path_on_ 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":"src/tools/rust-analyzer/crates/hir/src/attrs.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a1572302468303196e7896b37e6986d329c0bd0c393cd87f79d8fc512140d2"}},{"ruleId":"D1","level":"warning","message":{"text":"DefCollector::seed_with_top_level (cyclomatic 23): DefCollector::seed_with_top_level 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":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8588eeabcf7dac7b1b88e62c5a01caf370e5856707ebeee81a69551d8763087f"}},{"ruleId":"D1","level":"warning","message":{"text":"DefCollector::push_res_and_update_glob_vis (cyclomatic 23): DefCollector::push_res_and_update_glob_vis has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22114853d1a0ac943ddba08502810908ebb4a560b35374d9a033637a8c10302"}},{"ruleId":"D1","level":"warning","message":{"text":"Pat::hir_fmt (cyclomatic 23): Pat::hir_fmt has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/diagnostics/match_check.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fecbbc64c9c5e8930c69dcae413f4fad7484e6467e8574d95e258bb0232cc8"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::check_record_expr_fields (cyclomatic 23): InferenceContext::check_record_expr_fields has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d094d28bcd81c06ac384b91e0dd4a51ca0c778f337306ba14507301de145721"}},{"ruleId":"D1","level":"warning","message":{"text":"drop::has_drop_glue_impl (cyclomatic 23): drop::has_drop_glue_impl has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/drop.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"41adfb9a2dfe980f3dd6f0458a6ddde7abf182d3bdce7ad4bafe501dee18e5c1"}},{"ruleId":"D1","level":"warning","message":{"text":"highlight_related::highlight_references (cyclomatic 23): highlight_related::highlight_references has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/highlight_related.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8330461e05cc0a296811941353b19c7b9eb543eda6e95e58b5e2c5548a0b346"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionBody::analyze_container (cyclomatic 23): FunctionBody::analyze_container 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80c42bd7bf8b42b17c14b6beefc5655ed9ecd690acc13829c6a2de09fa9ab57"}},{"ruleId":"D1","level":"warning","message":{"text":"render::render_resolution_path (cyclomatic 23): render::render_resolution_path 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":"src/tools/rust-analyzer/crates/ide-completion/src/render.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b4048ef271bbad8a01bf5c90ffe01018359123e9f6b303b3f5f7c9284b2a02"}},{"ruleId":"D1","level":"warning","message":{"text":"ModResolver::find_external_module (cyclomatic 23): ModResolver::find_external_module has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/modules.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a514ea80c90fc058cce9f5bbe57e7328b27bdf1c950fb4ffda40fdd5cba77e"}},{"ruleId":"D1","level":"warning","message":{"text":"valueCheck (cyclomatic 23): valueCheck 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":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7bf3800ef18051da0da6f076b4ac207641fa328d692eb282cd40f46b1de275"}},{"ruleId":"D1","level":"warning","message":{"text":"unifyGenericTypes (cyclomatic 23): unifyGenericTypes 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":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3312}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe0529e30cdc136952c65ba1f5fac35f0a561f8700080688a130f16b42461ca"}},{"ruleId":"D1","level":"warning","message":{"text":"Ty::ty_and_layout_pointee_info_at (cyclomatic 22): Ty::ty_and_layout_pointee_info_at 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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9ac901080c7c4af33b8bc20fd85a5b95da0262ac366e89a27aef4fd07e1b9a"}},{"ruleId":"D1","level":"warning","message":{"text":"AttributeParser::parse_attribute_list (cyclomatic 22): AttributeParser::parse_attribute_list 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":"compiler/rustc_attr_parsing/src/interface.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f89036af23084d74a326d61263fe5497979b81a5206947e7a522c5412b150da"}},{"ruleId":"D1","level":"warning","message":{"text":"filter_profile::main (cyclomatic 22): filter_profile::main 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":"compiler/rustc_codegen_cranelift/scripts/filter_profile.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cec5e8be6818fc4abcf011dfa72ecad700bd8bff8b5b7e9aa20e43672cc4d43"}},{"ruleId":"D1","level":"warning","message":{"text":"write::codegen (cyclomatic 22): write::codegen has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dc7a25a185189083012edc5dafd14069550eddb1e1c8479623d6e0d638570e"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_statement (cyclomatic 22): FunctionCx::codegen_statement 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":"compiler/rustc_codegen_ssa/src/mir/statement.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"371de11ed045e8168eefd6fd306ae57f00c7afa3bbdc9a9794a7155c8feb19db"}},{"ruleId":"D1","level":"warning","message":{"text":"link::add_order_independent_options (cyclomatic 22): link::add_order_independent_options 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3018}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e82b3b5bc48dee05caed50a97bfafe13080ed944c01145fc07661779623b536"}},{"ruleId":"D1","level":"warning","message":{"text":"link::get_apple_sdk_root (cyclomatic 22): link::get_apple_sdk_root 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3827}}}],"partialFingerprints":{"codehealthFindingId/v1":"a068c89f578ff133f8612bcf79b33deb7b05e5f92ecdccfa59852c97fcb209fd"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::init_stack_frame (cyclomatic 22): InterpCx::init_stack_frame 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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd022e70e60342cb7e26442075cf90a32c485cc75ac5de617dcb049a716a5e32"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::eval_terminator (cyclomatic 22): InterpCx::eval_terminator 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":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"8435e49bb119bee87e1bbf06afe5b9a56b5ae9479e3d7b6013fb209772b5b258"}},{"ruleId":"D1","level":"warning","message":{"text":"ValidityVisitor::try_visit_primitive (cyclomatic 22): ValidityVisitor::try_visit_primitive 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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"0329e823bc3622bf8cea9ff86b01a5d2472c3bca631ff8930689ba7d71e6497b"}},{"ruleId":"D1","level":"warning","message":{"text":"macro_rules::check_matcher_core (cyclomatic 22): macro_rules::check_matcher_core 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":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7642cb4a104be3e982429fa88c80e5e1acab956ffb171aaace67b2346594d4"}},{"ruleId":"D1","level":"warning","message":{"text":"remove_or_use_generic::suggest_to_remove_or_use_generic (cyclomatic 22): remove_or_use_generic::suggest_to_remove_or_use_generic 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":"compiler/rustc_hir_analysis/src/diagnostics/remove_or_use_generic.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f01562e3d8921fa2f2ee6119c28f50bda0fd63fe116ac59d65055e18e91143"}},{"ruleId":"D1","level":"warning","message":{"text":"check::bounds_from_generic_clauses (cyclomatic 22): check::bounds_from_generic_clauses 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":"compiler/rustc_hir_analysis/src/check/mod.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61d6956d612da4372ffec0d26e24ae073d655524857056595b95e8180805028"}},{"ruleId":"D1","level":"warning","message":{"text":"CoerceMany::coerce_inner (cyclomatic 22): CoerceMany::coerce_inner 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddf153d64c061dc1c69999acbb6ec00f42effea84384298f685b6d003d8a4ab"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_tupled_arguments (cyclomatic 22): FnCtxt::check_tupled_arguments 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc1340e73fbedfea655e41ce8a72da1f42e67ed84506995accb4faa4909b636"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_missing_break_or_return_expr (cyclomatic 22): FnCtxt::suggest_missing_break_or_return_expr has cyclomatic complexity 22 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 10 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b76ff2c1a84d971e7e6d569d58e0aae2bd7bf9c9b408f52f08966eefbd51eb"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::report_binop_fulfillment_errors (cyclomatic 22): FnCtxt::report_binop_fulfillment_errors 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":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b185a35ca64b2119426f70b095cafbedd77a4483f068a2752ddb976da7070a"}},{"ruleId":"D1","level":"warning","message":{"text":"passes::write_out_deps (cyclomatic 22): passes::write_out_deps has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16caa56587cbaa976bb1686862cfe46f38cae1f85a1b361e8acffb76e6f6c6f"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyPrinter::pretty_print_const_expr (cyclomatic 22): PrettyPrinter::pretty_print_const_expr 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27f53cf44b040547c4541fa7cfc3a75e74a90f6e53a84b9cb193587893ad5ba"}},{"ruleId":"D1","level":"warning","message":{"text":"pretty::pretty_print_const_value_tcx (cyclomatic 22): pretty::pretty_print_const_value_tcx 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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"409e76cca5640ffe0b6e6ea47f97f5a992ad4e7c586b2db4bcf4f9723334d80e"}},{"ruleId":"D1","level":"warning","message":{"text":"CostChecker::visit_terminator (cyclomatic 22): CostChecker::visit_terminator 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":"compiler/rustc_mir_transform/src/cost_checker.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"925b5c901149c05c12f3935e3d415d3b038454fb65e583f0a49e7b8cd384df50"}},{"ruleId":"D1","level":"warning","message":{"text":"VnState::simplify_cast (cyclomatic 22): VnState::simplify_cast 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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c7d4a911c05c3c46b4cf5c9bbd817cc6a994b3de5883cf2e12baf9865afd7e"}},{"ruleId":"D1","level":"warning","message":{"text":"Integrator::visit_terminator (cyclomatic 22): Integrator::visit_terminator 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4656c2eecb841cdcf15c1a754ecf045d0e7912b33bc2a82459b09bab743384"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::format (cyclomatic 22): Parser::format 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":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"236d9cc147eb7721d19a70df53c1b711a839a397e20b564d92c5e381087f9487"}},{"ruleId":"D1","level":"warning","message":{"text":"Constructor::fmt_fields (cyclomatic 22): Constructor::fmt_fields 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":"compiler/rustc_pattern_analysis/src/constructor.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c6e45c9a7af1b7038d8f3c467fd8544de7f1d42d16d28eb9e639bef2b2ed66"}},{"ruleId":"D1","level":"warning","message":{"text":"RustcPatCtxt::ctors_for_ty (cyclomatic 22): RustcPatCtxt::ctors_for_ty has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f12153e6be57fd07b8c8f40c4a504fd122460d7061f1845e7ae6399223bc14c"}},{"ruleId":"D1","level":"warning","message":{"text":"RustcPatCtxt::print_witness_pat (cyclomatic 22): RustcPatCtxt::print_witness_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":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"68729bf2c9c2ee578a7a2b339406e4215a8db6eaf40c61b2da14963b39af2235"}},{"ruleId":"D1","level":"warning","message":{"text":"PointerAuthConfig::from_raw (cyclomatic 22): PointerAuthConfig::from_raw 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":"compiler/rustc_session/src/session.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8df937e4345f1de6387c937ae6d2c844990e8a9c616e6267ca6b3babcaa166"}},{"ruleId":"D1","level":"warning","message":{"text":"V0SymbolMangler::print_const (cyclomatic 22): V0SymbolMangler::print_const 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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"02108a35e6b76f6c2a2f98c8cf5bada741299cd7cb0bec3d1d0923d54c2143cc"}},{"ruleId":"D1","level":"warning","message":{"text":"FnAbi::adjust_for_rust_abi (cyclomatic 22): FnAbi::adjust_for_rust_abi 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":"compiler/rustc_target/src/callconv/mod.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4871577aa2bdccf7776b487acdf155fdfb0177665efaf6126f5f9816fd6ec6"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::try_conversion_context (cyclomatic 22): TypeErrCtxt::try_conversion_context 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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6a725ecd69a8094e5e9e68be518a9b727e9a5db63efecb0120f48a4cf1f384"}},{"ruleId":"D1","level":"warning","message":{"text":"const_evaluatable::is_const_evaluatable (cyclomatic 22): const_evaluatable::is_const_evaluatable 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":"compiler/rustc_trait_selection/src/traits/const_evaluatable.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc9cf2f2341c4aa4aa9fc3bffdf6315ca4e84ea90bcd26f50e253c1062e7312"}},{"ruleId":"D1","level":"warning","message":{"text":"decimal_seq::parse_decimal_seq (cyclomatic 22): decimal_seq::parse_decimal_seq 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":"library/core/src/num/imp/dec2flt/decimal_seq.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7aaedf2b1ff93c9993fff24bd1c68ca2c5e285072e72adb644b7d9140807ac0"}},{"ruleId":"D1","level":"warning","message":{"text":"Mode::fmt (cyclomatic 22): Mode::fmt has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"8562a86888dfd621c7eb676ae5cb551c97c5a940edcf14037d24ecb7e25ea30b"}},{"ruleId":"D1","level":"warning","message":{"text":"assert_instr_macro::assert_instr (cyclomatic 22): assert_instr_macro::assert_instr 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":"library/stdarch/crates/assert-instr-macro/src/lib.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5d0e2b30d19c1763fc26f6f377234edf15ff85a6b9920af8283bf528f79ffb"}},{"ruleId":"D1","level":"warning","message":{"text":"scalar::parse_header (cyclomatic 22): scalar::parse_header 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":"library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2c8b4eb253527db0af2380de758ee88bf6303d4a9efffa2c3c6f8c593c0642"}},{"ruleId":"D1","level":"warning","message":{"text":"cli_paths::match_paths_to_steps_and_run (cyclomatic 22): cli_paths::match_paths_to_steps_and_run has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/cli_paths.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"283a5a8b2dcf1064feb53056e1a4a3873476cb9a2a38b1709efdad582938aa43"}},{"ruleId":"D1","level":"warning","message":{"text":"rustdoc::main_args (cyclomatic 22): rustdoc::main_args has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/lib.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c40f69dc54933f9dd61309c7f71c1227c2a292247304073ef2da690b53b57e"}},{"ruleId":"D1","level":"warning","message":{"text":"fmt::fmt_conf (cyclomatic 22): 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":"src/tools/clippy/clippy_dev/src/fmt.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"630db2989720727a44756ab13c9bdecfafc0872a00706ec053eb7b869469ca41"}},{"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":"src/tools/clippy/clippy_lints/src/matches/single_match.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cf17cc66875f131bcb823d6e24fc6d804c1ecc65a70b54986297143088d55f"}},{"ruleId":"D1","level":"warning","message":{"text":"MissingConstForFn::check_fn (cyclomatic 22): MissingConstForFn::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":"src/tools/clippy/clippy_lints/src/missing_const_for_fn.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"14434be4926025e7804623208a5c7dbb949e41dfc59fd6c2a39a73584a26b61e"}},{"ruleId":"D1","level":"warning","message":{"text":"needless_collect::check (cyclomatic 22): needless_collect::check has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c2ba29f98febc4bf47981fb48ac0cfa18641634c36a94efad2e843da03e852"}},{"ruleId":"D1","level":"warning","message":{"text":"visitors::for_each_unconsumed_temporary::helper (cyclomatic 22): 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":"src/tools/clippy/clippy_utils/src/visitors.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"6549143b914a5cad796912973e15554b9ebc478893d95f87a727bdc53e76ab4f"}},{"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 declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"93604abc4bb2b7ebce4d47acf721467a7635257d60f3d59af2bded0a24dd6ae4"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceToDefCtx::container_to_def (cyclomatic 22): SourceToDefCtx::container_to_def has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ed2b9af28a5f3865d99c5199120f6d03ced84fe585546363aadd480014cf6a"}},{"ruleId":"D1","level":"warning","message":{"text":"Printer::print_mod_item (cyclomatic 22): Printer::print_mod_item 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":"src/tools/rust-analyzer/crates/hir-def/src/item_tree/pretty.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb00dd99142d7b4fec4883f0f3b6fc89a06cb4e11f31765b1932631335657eee"}},{"ruleId":"D1","level":"warning","message":{"text":"DefCollector::record_resolved_import (cyclomatic 22): DefCollector::record_resolved_import has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"7035e55087a5f5bf76373dfd9dc24dd41b96f8fb534ad3cab08c23ad047f2d00"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::resolve_path_in_type_ns_with_prefix_info (cyclomatic 22): Resolver::resolve_path_in_type_ns_with_prefix_info has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"313c57b5654c714f090a10d6e0caec35ad5eba1be9d62a43ccd780b73c23009e"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::interpret_mir (cyclomatic 22): Evaluator::interpret_mir has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"4824d18eb61373873e7d4fb9a278123b446e860755843e6421a482454fc7dddf"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::create_memory_map::rec (cyclomatic 22): Evaluator::create_memory_map::rec 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":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2370}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa1903a889d9443287d093c8b16fc57ad4b647d01385410a57ad4a64e9fe08a"}},{"ruleId":"D1","level":"warning","message":{"text":"borrowck::mutability_of_locals (cyclomatic 22): borrowck::mutability_of_locals has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/borrowck.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9039f891f1fe0e88d9e38ced9368a68fb88b1e9df823e9a04e62ab31b2f16b"}},{"ruleId":"D1","level":"warning","message":{"text":"join_lines::remove_newline (cyclomatic 22): join_lines::remove_newline has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/join_lines.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2cbe59d1642e99de6d15ddb3bc1e554066c1eb06b20110277a1c2935336545"}},{"ruleId":"D1","level":"warning","message":{"text":"bind_pat::hints (cyclomatic 22): bind_pat::hints has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/bind_pat.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a892b0a944da8a34594825e7ff5a89474f5e4bf2d5bb53d5305e7f8ae323e3"}},{"ruleId":"D1","level":"warning","message":{"text":"use_::complete_use_path (cyclomatic 22): use_::complete_use_path has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/use_.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcb693ce5470d6e0b886c1ba800c1d4014fe55728272273b09fa48f6bbf4f15"}},{"ruleId":"D1","level":"warning","message":{"text":"FindUsages::short_associated_function_fast_search::collect_possible_aliases (cyclomatic 22): FindUsages::short_associated_function_fast_search::collect_possible_aliases has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2027b2ea66a13aaff719f980e062ea88bedbab5d15acbf1b38781a28034aa2f"}},{"ruleId":"D1","level":"warning","message":{"text":"matcher::match_loop (cyclomatic 22): matcher::match_loop has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59ca1bc5134893d5c800723eb5cdb2b6c9e4e404cbd726b33d0e66047a4b3d2"}},{"ruleId":"D1","level":"warning","message":{"text":"atom::parse_asm_expr (cyclomatic 22): atom::parse_asm_expr has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2be0549cb50a49c155900275c319462083d831f3639a3ad4c18b7d3279ed868"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::read_subtree (cyclomatic 22): Reader::read_subtree has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"23dc13eff9c3c196c3a756547aff1b35dddb57853c6860a8b931d26495daf4e5"}},{"ruleId":"D1","level":"warning","message":{"text":"Scip::run (cyclomatic 22): Scip::run has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d7dbc98abfd6c0fbdf6d458131a778be3e2dd184feea2967cc48b19679c207"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalState::current_status (cyclomatic 22): GlobalState::current_status has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d095474fab62493642e908e752e97c20b451ace5f283365f8de5054dd2d626"}},{"ruleId":"D1","level":"warning","message":{"text":"FmtVisitor::close_block (cyclomatic 22): FmtVisitor::close_block has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/visitor.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b0278ec8230673ed9da4b3239b2f96eac5e4901b42b9852d9b86c765d7e5a7"}},{"ruleId":"D1","level":"warning","message":{"text":"features::map_lib_features (cyclomatic 22): features::map_lib_features has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/features.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85145005c20ad82d9bfe90e44214f3c3cc9cc956e250d25b6b6e07378525a79"}},{"ruleId":"D1","level":"warning","message":{"text":"getIdentEndPosition (cyclomatic 22): getIdentEndPosition has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d56e0a0029c8099140425c20e4238f9b771057a83162f5667be4b230cfdabc"}},{"ruleId":"D1","level":"warning","message":{"text":"transformResults (cyclomatic 22): transformResults has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2660}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6744ed15670e695b1816c2c570d4716de9e041fcfc863b7b8350d5d51b3929"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_qpath (cyclomatic 21): LoweringContext::lower_qpath 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":"compiler/rustc_ast_lowering/src/path.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca0541ae7c41e4ab86759ff3ffeb8a6de0b64eb2cf6a52f08b8c73b41652b66"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::describe_place_with_options (cyclomatic 21): MirBorrowckCtxt::describe_place_with_options 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":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab249c2d9fbd725f9e698ae0bc7ec85f2bfd1d7862063a0bbb7c983511170044"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::consume_rvalue (cyclomatic 21): MirBorrowckCtxt::consume_rvalue has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a490ccea63ad5d0d7eb0d3b8d02a4f4de1abbc36cdf9bc008130c0cb64183d5"}},{"ruleId":"D1","level":"warning","message":{"text":"format::report_invalid_references (cyclomatic 21): format::report_invalid_references 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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10a7b78b69544ae2a37b2ab647eb8caa6a5436b1410f58bd67fc1fd7419cf75"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigInfo::parse_argument (cyclomatic 21): ConfigInfo::parse_argument has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/build_system/src/config.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3630fbf7c318c97db3af5b7a6ebae6c291670709b7a02e368607048bbcd3b8"}},{"ruleId":"D1","level":"warning","message":{"text":"constant::codegen_const_value (cyclomatic 21): constant::codegen_const_value 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":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8d654e29487b87d869a21359b17b50c8a602d4000ff47e4673ff39b83a3a14"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::gcc_icmp (cyclomatic 21): Builder::gcc_icmp has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2411fe20a98c939e08fca4f0378bf6094c3eb197643d7dd858b02a188d0ebc8"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::load_operand (cyclomatic 21): Builder::load_operand has cyclomatic complexity 21 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 8 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"4619d8bd99c8fda7a2d0292f4051829fe824086b5bceae17e988497e2cb6b5ca"}},{"ruleId":"D1","level":"warning","message":{"text":"autodiff::match_args_from_caller_to_enzyme (cyclomatic 21): autodiff::match_args_from_caller_to_enzyme 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":"compiler/rustc_codegen_llvm/src/builder/autodiff.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc2826808672fafaec3d8504354e53a79755ce8b591c14d1d03b3af95a39902"}},{"ruleId":"D1","level":"warning","message":{"text":"type_of::uncached_llvm_type (cyclomatic 21): type_of::uncached_llvm_type has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/type_of.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b66a492f88d1084077da87575358476fcc56658661317ef5929ae478e50510"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::codegen_switchint_terminator (cyclomatic 21): FunctionCx::codegen_switchint_terminator 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"5521356e244fbd842e0e725fce0c7034a16209a4345307a1919756413c043710"}},{"ruleId":"D1","level":"warning","message":{"text":"link::link_rlib (cyclomatic 21): link::link_rlib 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"23065eaefa97afe4c9f4a7e104412b90c8c4928033b97450671e3afd6e33eb8a"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::eval_rvalue_into_place (cyclomatic 21): InterpCx::eval_rvalue_into_place 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":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f9468d47f710496be9de753a561921bf27210701546ddb3d7a634dad6d85a2"}},{"ruleId":"D1","level":"warning","message":{"text":"check_validity_requirement::check_validity_requirement_lax (cyclomatic 21): check_validity_requirement::check_validity_requirement_lax has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/util/check_validity_requirement.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c969b48b65b2d9ebb99e2ec802ac707e00a926bd0f937c14f593b5dad7251bb5"}},{"ruleId":"D1","level":"warning","message":{"text":"diagnostics::failed_to_match_macro (cyclomatic 21): diagnostics::failed_to_match_macro 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":"compiler/rustc_expand/src/mbe/diagnostics.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f92c5556827e66de1790e406e6406d6a45a1b9135dc278758c7ea0ee3f99f5a"}},{"ruleId":"D1","level":"warning","message":{"text":"diagnostics::emit_frag_parse_err (cyclomatic 21): diagnostics::emit_frag_parse_err 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":"compiler/rustc_expand/src/mbe/diagnostics.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5f2606293fb79ec78946484a693fb3aee71d7e9b4fbf87ee33acfbb1d3adb5"}},{"ruleId":"D1","level":"warning","message":{"text":"expand::parse_ast_fragment (cyclomatic 21): expand::parse_ast_fragment has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"33036d5a53b07247cb4ede3c9a6b4ebd2eb8dda0452ff7f9e66ed4ee13bd4793"}},{"ruleId":"D1","level":"warning","message":{"text":"InherentOverlapChecker::check_item (cyclomatic 21): InherentOverlapChecker::check_item has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/inherent_impls_overlap.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"072d55a7f063c6cbe52267a20f99b98d43ebc45a722ac467c5a19e62e602c0cf"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstraintContext::add_constraints_from_ty (cyclomatic 21): ConstraintContext::add_constraints_from_ty has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/variance/constraints.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"194d5cd93bb6bc9e10107579869608f6c5752438576afe75a0d41192ab4525bf"}},{"ruleId":"D1","level":"warning","message":{"text":"check::check_opaque_precise_captures (cyclomatic 21): check::check_opaque_precise_captures 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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d197f25339a759857be9cff7cc1ffe374537d890880c7b61fa1732613741a7"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprUseVisitor::cat_pattern (cyclomatic 21): ExprUseVisitor::cat_pattern has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"1392df860c64fb862835d41167cf75431cc94e2f40b1241b972393ca63f9b8da"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::try_find_coercion_lub (cyclomatic 21): FnCtxt::try_find_coercion_lub has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb7b8ea6a3497e4d89c2a07feaede1e168d09647809954bc91d32f876b4e031"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_method_not_found_because_of_unsatisfied_bounds (cyclomatic 21): FnCtxt::suggest_method_not_found_because_of_unsatisfied_bounds 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dcf137a8bb54b532277c199198dd70f32fa7ec8cc19d961cf44044cfb6dc58"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::borrow_pat_suggestion (cyclomatic 21): FnCtxt::borrow_pat_suggestion 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec03a1ae31608ef506d7c6e525b11aaeda537022dbc13c0e0ce7512f0df290b"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::finalize_macro_resolutions (cyclomatic 21): Resolver::finalize_macro_resolutions has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"844f4e75cfe3b305652096d91b0c8e638723a0db1ea2e1790e60e9bfd72a56a1"}},{"ruleId":"D1","level":"warning","message":{"text":"VnState::project (cyclomatic 21): VnState::project 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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0c3e6c4d215914134d60cd2ae22d97426c56143c74b85097fc24308f648cde"}},{"ruleId":"D1","level":"warning","message":{"text":"ReplacementVisitor::visit_statement (cyclomatic 21): ReplacementVisitor::visit_statement has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/sroa.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8097de6bf95a596d1a76b6214fdbf9cb3ab6b07d838048ebbe726bec2dd86d"}},{"ruleId":"D1","level":"warning","message":{"text":"cross_crate_inline::cross_crate_inlinable (cyclomatic 21): cross_crate_inline::cross_crate_inlinable has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/cross_crate_inline.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1dbc50fad930b81def3090052328a440f0395a0a24ce86fd81f46d78a7bd0e1"}},{"ruleId":"D1","level":"warning","message":{"text":"partitioning::collect_and_partition_mono_items (cyclomatic 21): partitioning::collect_and_partition_mono_items has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a31cfc339f2f45d12ea791c0fcbd1f01fc24c12b3aabc9d8cb1e6bd81bf686"}},{"ruleId":"D1","level":"warning","message":{"text":"OrphanChecker::visit_ty (cyclomatic 21): OrphanChecker::visit_ty 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":"compiler/rustc_next_trait_solver/src/coherence.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc20f7a0dbe23679ba2307f97c7fc7fa1b3fc23da7a7ccee97edb2f20fde95b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parameter_without_type (cyclomatic 21): Parser::parameter_without_type has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":2237}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fc6732d559a076cfde6669861589e9ac88fd1cafe34cf719ff0afcc5575f47"}},{"ruleId":"D1","level":"warning","message":{"text":"x86_64::classify_arg (cyclomatic 21): x86_64::classify_arg has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to one function item declared inside it (classify). 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":"compiler/rustc_target/src/callconv/x86_64.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"52028d3e2899fae1d3108198046dd29781419130563b0f97efc029e73a728410"}},{"ruleId":"D1","level":"warning","message":{"text":"AddLifetimeParamsSuggestion::add_to_diag (cyclomatic 21): AddLifetimeParamsSuggestion::add_to_diag 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":"compiler/rustc_trait_selection/src/diagnostics.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b703315cad626459a83820861233b6b5e59fddb6d974e5622359bc9c0111f64"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectionContext::assemble_candidates_from_auto_impls (cyclomatic 21): SelectionContext::assemble_candidates_from_auto_impls 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":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ff1b4c090d8ce3df728bda52747887e175e468410387981148c1570f0c3dcf"}},{"ruleId":"D1","level":"warning","message":{"text":"call_kind::call_kind (cyclomatic 21): call_kind::call_kind 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":"compiler/rustc_trait_selection/src/error_reporting/traits/call_kind.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf422f71fbe6007535ff03e594ab6eff8fd4cc080ef46c6ae6da36b323ca199"}},{"ruleId":"D1","level":"warning","message":{"text":"static_impl_trait::suggest_new_region_bound (cyclomatic 21): static_impl_trait::suggest_new_region_bound 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/static_impl_trait.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc78d71a79e80e8c962e5e9f811d58a09a1d28f6cf121c5a088b047ed332aaa1"}},{"ruleId":"D1","level":"warning","message":{"text":"abi::arg_attrs_for_rust_scalar (cyclomatic 21): abi::arg_attrs_for_rust_scalar 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":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa911d02c13d1d36096402c6cafdfdcf4a1cace5012714cd86794d3c735661f3"}},{"ruleId":"D1","level":"warning","message":{"text":"walk::push_inner (cyclomatic 21): walk::push_inner has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/walk.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc918db52af8405f547c5bfb4631a24f1b7da80fbc7a3463f42d087d1ed9ac1f"}},{"ruleId":"D1","level":"warning","message":{"text":"Sysroot::run (cyclomatic 21): Sysroot::run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe9322eb4a608551fd6c6dcff693de2fa7962435b2dba64bccc2a574a3b0dbb"}},{"ruleId":"D1","level":"warning","message":{"text":"SerializedSearchIndex::sort (cyclomatic 21): SerializedSearchIndex::sort has cyclomatic complexity 21 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 10 belong to one function item declared inside it. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5621d607cbd52ee3c6727cd415d33605c7e96ebd0619f7f1fc5ef8c09767b8"}},{"ruleId":"D1","level":"warning","message":{"text":"clean::first_non_private (cyclomatic 21): clean::first_non_private has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ccfc93ade7e6b02ab57f378b687fb9253825ac6242a8fe07bcc7f9efb65489"}},{"ruleId":"D1","level":"warning","message":{"text":"clean::clean_ty (cyclomatic 21): clean::clean_ty has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"c389c4a3bfb150fac9a79ad5662818f38595ff866a2aaabefb9a8d7de69c796d"}},{"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 declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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/tools/clippy/clippy_lints/src/booleans.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba81b93564ceaaa57ce14abd42b4ae2040a507f73258693a72272e24af35854"}},{"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":"src/tools/clippy/clippy_lints/src/unused_peekable.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d2eadf16e1403dd523c4054c3c8bd60664ed6dc4fdae88d12f7a733459326f"}},{"ruleId":"D1","level":"warning","message":{"text":"assign_op_pattern::check (cyclomatic 21): 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":"src/tools/clippy/clippy_lints/src/operators/assign_op_pattern.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e89bc25d5a82c22e1e8577fda2d2083e4207e1803cec688653abb8d6f1dc931"}},{"ruleId":"D1","level":"warning","message":{"text":"manual_div_ceil::check (cyclomatic 21): 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":"src/tools/clippy/clippy_lints/src/operators/manual_div_ceil.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e818849eb3b4104703044f47d533db70eefbc85c7ea42a3232e56a18fe1a1c"}},{"ruleId":"D1","level":"warning","message":{"text":"ranges::check_possible_range_contains (cyclomatic 21): 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":"src/tools/clippy/clippy_lints/src/ranges.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"77456c1db170f6cf01a3f1316d9d81d12b1301c57c6161c311432d209a95739f"}},{"ruleId":"D1","level":"warning","message":{"text":"unnecessary_to_owned::can_change_type (cyclomatic 21): unnecessary_to_owned::can_change_type has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"859c891b069f93986a70e857382264f5adebfd6603ab8bf041af0848fa3eb976"}},{"ruleId":"D1","level":"warning","message":{"text":"needless_return::check_final_expr (cyclomatic 21): needless_return::check_final_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":"src/tools/clippy/clippy_lints/src/returns/needless_return.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bec6e5c5c6a2576f154eeda6d1cd7655ef8a591d8a99451180fd4fcf9e5e00"}},{"ruleId":"D1","level":"warning","message":{"text":"collapsible_match::check_arm (cyclomatic 21): collapsible_match::check_arm has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/collapsible_match.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff90377cc498c794d7e75bed22242410104237f6a16e462334bbb035ae52645"}},{"ruleId":"D1","level":"warning","message":{"text":"bit_mask::check (cyclomatic 21): bit_mask::check has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/bit_mask.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e4f1ffd1c1374d4f866e179d72fa604be16ab9e27df5a68b59cf2c9c6c9e9c"}},{"ruleId":"D1","level":"warning","message":{"text":"lifetimes::check_fn_inner (cyclomatic 21): 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":"src/tools/clippy/clippy_lints/src/lifetimes.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"904f151335a66e4722f878dbddd0cb033f5cf5fab8dd47e575de8f261ca1e915"}},{"ruleId":"D1","level":"warning","message":{"text":"paths::local_item_child_by_name (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/paths.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9c17123c8e9842f31c93dd8dfafc28bf4cb6101ddf2f6b192bf7ae89ef15c6"}},{"ruleId":"D1","level":"warning","message":{"text":"driver::main (cyclomatic 21): 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 declared inside it. 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/tools/clippy/src/driver.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"44691d4e9a2b5d44845aed53c291c4755f85be8ab79b363ade5b6a536d28ade9"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_simd_intrinsic (cyclomatic 21): EvalContextExt::emulate_simd_intrinsic has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/simd.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5db4dd5d0ee3f08f5bf2143279d13358f9ed330e33a3fa57fb8b38febbafc3a"}},{"ruleId":"D1","level":"warning","message":{"text":"attrs::resolve_assoc_or_field (cyclomatic 21): attrs::resolve_assoc_or_field has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/attrs.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a155dc5426bd7345ee8b29f8159639694eb84884209539b1c820403e2dea6fb9"}},{"ruleId":"D1","level":"warning","message":{"text":"fn_macro::concat_expand (cyclomatic 21): fn_macro::concat_expand has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba481ca846b5527a65684167abee97ecac3989aa81305f1e129148b229cd297"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::exec_simd_intrinsic (cyclomatic 21): Evaluator::exec_simd_intrinsic has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim/simd.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97e474ca53ca1fbeb3cafd782756f151e2a2d1bc6039c8484518569db12e528"}},{"ruleId":"D1","level":"warning","message":{"text":"Context::add_constraints_from_ty (cyclomatic 21): Context::add_constraints_from_ty has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/variance.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de8f3d9c62ab9ea26afde1f82f094aee3c703ca493964896513bf78e6304412"}},{"ruleId":"D1","level":"warning","message":{"text":"path::substs_from_args_and_bindings (cyclomatic 21): path::substs_from_args_and_bindings has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea95c45cb72fbd586af34e1c1ae719ffedbc680351cdf0a5b7caaa22bb730fd8"}},{"ruleId":"D1","level":"warning","message":{"text":"borrowck::moved_out_of_ref (cyclomatic 21): borrowck::moved_out_of_ref has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/borrowck.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59af70103a4e4281e0799551e77ba262a49a635ee85f52039482cfd9c17d9ff"}},{"ruleId":"D1","level":"warning","message":{"text":"goto_definition::goto_definition (cyclomatic 21): goto_definition::goto_definition has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/goto_definition.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7404555dc010c24bdfc05cc61f67718fed0c85685cec4f20b561535d59530a"}},{"ruleId":"D1","level":"warning","message":{"text":"add_turbo_fish::add_turbo_fish (cyclomatic 21): add_turbo_fish::add_turbo_fish has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_turbo_fish.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29c19a1f3468c5fc9d4d1fca19942e0fadb9ea5fa3691cdc11465d3e0a22dc1"}},{"ruleId":"D1","level":"warning","message":{"text":"insert_use::guess_granularity_from_scope (cyclomatic 21): insert_use::guess_granularity_from_scope has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/insert_use.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f4afe0d748833c9caca823e8bb1890778efc5178d31efcd60d1965bee2b88c"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::apply_change_with_sink (cyclomatic 21): Config::apply_change_with_sink has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7efa70b03826554c5f1194061517244d3377330eb8990757d03708cb595989"}},{"ruleId":"D1","level":"warning","message":{"text":"request::handle_runnables (cyclomatic 21): request::handle_runnables has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"c973d271693986d632d593e1a196d8d0d9ff071f628319bed52a2de6c6285327"}},{"ruleId":"D1","level":"warning","message":{"text":"NotifyActor::run (cyclomatic 21): NotifyActor::run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/vfs-notify/src/lib.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11ee168c89542073df30564451dea44fd1cc6343e1875c8e6b2270b99f06649"}},{"ruleId":"D1","level":"warning","message":{"text":"UseTree::normalize (cyclomatic 21): UseTree::normalize has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/imports.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef9f3610781751976bdf000fe8acccdc6e29e646b0ef27aee3ae528b1374c92"}},{"ruleId":"D1","level":"warning","message":{"text":"Context::try_overflow_last_item (cyclomatic 21): Context::try_overflow_last_item has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/overflow.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"db824414361523153dcf3a3fdd7c6980ef22a3cf3f4c6539561bff7db8bd518b"}},{"ruleId":"D1","level":"warning","message":{"text":"items::format_impl (cyclomatic 21): items::format_impl has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd187a046d3dec6f35ef3b4efad6952cdae01e3553f16720404f1b67466e983"}},{"ruleId":"D1","level":"warning","message":{"text":"comment::identify_comment (cyclomatic 21): comment::identify_comment has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 belong to 2 function items declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33b948a91e92cf10c4885aff1ac0c75647c34ac0756b90cfba975d253b54178"}},{"ruleId":"D1","level":"warning","message":{"text":"triagebot::check (cyclomatic 21): triagebot::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":"src/tools/tidy/src/triagebot.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"643d7296e48bb665352c0085407d223a19bad86e4ea069e99e1b1d6a39ea8b16"}},{"ruleId":"D1","level":"warning","message":{"text":"substringMatches (cyclomatic 21): substringMatches has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afbeff164917baccfbf235e4000c3dd4b039ef80f206fa5176d25510a43f12a"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::can_lower_expr_to_const_arg_direct (cyclomatic 20): LoweringContext::can_lower_expr_to_const_arg_direct 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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":2707}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadc198c5de1caa95709c3d7ea655d720fa37bba73b68b8fe2f87cbea03fc61b"}},{"ruleId":"D1","level":"warning","message":{"text":"AstValidator::visit_fn (cyclomatic 20): AstValidator::visit_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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d35034a20ec6622c93b7bbc388baccb3acc8ee8138a6872ce44b429c23ac9e"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::was_captured_by_trait_object (cyclomatic 20): MirBorrowckCtxt::was_captured_by_trait_object 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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"415bed8465a55479ec24bf5f321b1a53b467b669b1b687f16f274caa67bdc229"}},{"ruleId":"D1","level":"warning","message":{"text":"TraitDef::create_derived_impl (cyclomatic 20): TraitDef::create_derived_impl has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/deriving/generic/mod.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9486a60d3cec6d5fe5305dde58d83a8af87933b11e39f467e4d623be27aee9f"}},{"ruleId":"D1","level":"warning","message":{"text":"concat::expand_concat (cyclomatic 20): concat::expand_concat 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":"compiler/rustc_builtin_macros/src/concat.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf7cbb69045f453d8c3d9ef822dd4686ef925653b68ada27106c5bcaf409534"}},{"ruleId":"D1","level":"warning","message":{"text":"num::codegen_float_binop (cyclomatic 20): num::codegen_float_binop 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":"compiler/rustc_codegen_cranelift/src/num.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"4908368019c84d2492099fad2104ad2998433eaf52ce744883c8fa39d71f9454"}},{"ruleId":"D1","level":"warning","message":{"text":"base::compile_codegen_unit::module_codegen (cyclomatic 20): base::compile_codegen_unit::module_codegen 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":"compiler/rustc_codegen_llvm/src/base.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72c1dcc96c00df18fcd6bf3e1e501cd063a5d2297d8ccadb5d5b5c8c5ba9c82"}},{"ruleId":"D1","level":"warning","message":{"text":"va_arg::emit_powerpc_va_arg (cyclomatic 20): va_arg::emit_powerpc_va_arg 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":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78463ccbd4dc3554ac2cc9da6063607fa79bf547acbca3cfc38375066b430a6"}},{"ruleId":"D1","level":"warning","message":{"text":"ArArchiveBuilder::build_inner (cyclomatic 20): ArArchiveBuilder::build_inner has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/archive.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1e6bb5854d82a7902d3f6209d7d46686db5bf398f5d76dc2651db9e4e98315"}},{"ruleId":"D1","level":"warning","message":{"text":"CrateInfo::new (cyclomatic 20): CrateInfo::new 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":"compiler/rustc_codegen_ssa/src/base.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be1f81300fd01ec0e4520120b0afa9f9837217198e4c736d3df8073e74cf9ad"}},{"ruleId":"D1","level":"warning","message":{"text":"valtrees::const_to_valtree_inner (cyclomatic 20): valtrees::const_to_valtree_inner 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":"compiler/rustc_const_eval/src/const_eval/valtrees.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c33e5b21aafff9cc10495e9ebcb208d3de9d91f7b7991e81cdfdbbabf804ef2"}},{"ruleId":"D1","level":"warning","message":{"text":"transcribe::transcribe_pnr (cyclomatic 20): transcribe::transcribe_pnr 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":"compiler/rustc_expand/src/mbe/transcribe.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"fada7f32aa8955abcd1f9a40bc755f04686cc14dc1b83a576358365bae5ea43c"}},{"ruleId":"D1","level":"warning","message":{"text":"check::opaque_type_cycle_error (cyclomatic 20): check::opaque_type_cycle_error 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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":2143}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb70a00aba7f6ca8913df27c440464c69f7701e04b36a6fe1196a2bf46d274c2"}},{"ruleId":"D1","level":"warning","message":{"text":"generics::lower_generic_args (cyclomatic 20): generics::lower_generic_args 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9be750d59cc6654eca15d674d9cd2f27f0669405973a2082a058fe2da1d8b0"}},{"ruleId":"D1","level":"warning","message":{"text":"wfcheck::check_gat_where_clauses (cyclomatic 20): wfcheck::check_gat_where_clauses 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"38748dcd9eb6b2fb573cfe4e5e5d9652243a08763d8ace8b5cb1dcd5179f65d3"}},{"ruleId":"D1","level":"warning","message":{"text":"entry::check_main_fn_ty (cyclomatic 20): entry::check_main_fn_ty has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 9 belong to 5 function items declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/entry.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"904e437a3bb4bb6fc74760879fc6b44b0813f92f39ce5ebb064bfbe193369669"}},{"ruleId":"D1","level":"warning","message":{"text":"refine::check_refining_return_position_impl_trait_in_trait (cyclomatic 20): refine::check_refining_return_position_impl_trait_in_trait 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":"compiler/rustc_hir_analysis/src/check/compare_impl_item/refine.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bbb3c2bf476a65292f9cfb7d4ebc450bedf642440f0dd91b14e8cb0f51e6bb"}},{"ruleId":"D1","level":"warning","message":{"text":"region::resolve_local::record_rvalue_scope_if_borrow_expr (cyclomatic 20): region::resolve_local::record_rvalue_scope_if_borrow_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":"compiler/rustc_hir_analysis/src/check/region.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90642316075827539c7ab243096f73099285a7115ea1a6bbc14779c89ec67c1"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_use_shadowed_binding_with_method (cyclomatic 20): FnCtxt::suggest_use_shadowed_binding_with_method 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"85375cef3b969994308b4ba477be745d877902de81ca158e08f68898948524f4"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_unsatisfied_ty_or_trait (cyclomatic 20): FnCtxt::suggest_unsatisfied_ty_or_trait 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b0bf2f99bce89da62b4c0c6f4f94055605dfd2881ac75de9de26c9e0f44e4c"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_unwrapping_inner_self (cyclomatic 20): FnCtxt::suggest_unwrapping_inner_self 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":3282}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7c2ba641bb896d48d4dd05afaa1111710189262ca80251d06482c77de1a644"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_struct_pat_fields (cyclomatic 20): FnCtxt::check_struct_pat_fields 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c872f765e400f0c0b9b6cb741534373fada9af5ccab53bea10241a15570e1e3"}},{"ruleId":"D1","level":"warning","message":{"text":"IfLetRescope::probe_if_cascade (cyclomatic 20): IfLetRescope::probe_if_cascade 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":"compiler/rustc_lint/src/if_let_rescope.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"768ce7baf2812209c148f2afa8d1ccbdb0bf4bf6dfc9c69c7f42bbb3fe452d22"}},{"ruleId":"D1","level":"warning","message":{"text":"UnusedDelimLint::check_expr (cyclomatic 20): UnusedDelimLint::check_expr has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffbe74a1ed5f425694b486c215cdd01d32cb322a17846827089eeb77c43468d"}},{"ruleId":"D1","level":"warning","message":{"text":"EncodeContext::encode_mir (cyclomatic 20): EncodeContext::encode_mir 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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"f000d2c84bf1e2f235b0ca61165e0fc51ccd2e4e9e8ac0878c492eaba205632c"}},{"ruleId":"D1","level":"warning","message":{"text":"dependency_format::verify_ok (cyclomatic 20): dependency_format::verify_ok 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":"compiler/rustc_metadata/src/dependency_format.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fc800fc30fa4a4499487d5c9a6e1d8878136f93aacc1858d415c80a025a313"}},{"ruleId":"D1","level":"warning","message":{"text":"pretty::write_scope_tree (cyclomatic 20): pretty::write_scope_tree 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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73a577c866082b8423d934979dafdd7be5491ca3ce22ca83a94fd971e37ee96"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstAnalysis::handle_rvalue (cyclomatic 20): ConstAnalysis::handle_rvalue 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":"compiler/rustc_mir_transform/src/dataflow_const_prop.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9546492337afa19e08a3de9f49214806d5e8713d4d6b38be8193f6c4de8a12cb"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstPropagator::eval_rvalue (cyclomatic 20): ConstPropagator::eval_rvalue 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":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb66167cfb0d226a8b4857dbedd845201c44100f0a368c498fc942b4554df6b"}},{"ruleId":"D1","level":"warning","message":{"text":"shim::build_call_shim (cyclomatic 20): shim::build_call_shim 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4b629a5eacf4885abe25f4f07ca7167397ed2bb24b8987d7e62c1b40c33a67"}},{"ruleId":"D1","level":"warning","message":{"text":"MirUsedCollector::visit_terminator (cyclomatic 20): MirUsedCollector::visit_terminator 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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72847a75d73b6a9175227ed481086dc65e8ac8e620b1b3ab980f96d59747075"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::recover_missing_kw_before_item (cyclomatic 20): Parser::recover_missing_kw_before_item 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc2ac7ef33f7582a4072b4812c920603d89f444ca55f6eddcbbbafcf51cb47b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_self_param (cyclomatic 20): Parser::parse_self_param 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":3535}}}],"partialFingerprints":{"codehealthFindingId/v1":"c626c63a2192d4398af22a5227293a6e5bf13d969e149ad75d72ed99200c1b7e"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_generic_arg (cyclomatic 20): Parser::parse_generic_arg 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":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dffcbdcdaf9949630306241d2883b2b0ee2f6de4b9dc034ec450dff895a32ed"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkSymbolVisitor::visit_node (cyclomatic 20): MarkSymbolVisitor::visit_node 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":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"322bef7eafc1999845486b29c0afba64914ba45fd200ee7cf780341abe7e2fc4"}},{"ruleId":"D1","level":"warning","message":{"text":"MissingStabilityAnnotations::check_compatible_stability (cyclomatic 20): MissingStabilityAnnotations::check_compatible_stability 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":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9f1f6c39f8f99dce4b94560822150cc61e437666bf34cf255b5794af544d4f"}},{"ruleId":"D1","level":"warning","message":{"text":"PathSource::descr_expected (cyclomatic 20): PathSource::descr_expected 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4a7c41d26fd33d390869558bd4b12f7e7dd20c9ea06ad6037e2da7325b2658"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::suggest_introducing_lifetime_filtered (cyclomatic 20): LateResolutionVisitor::suggest_introducing_lifetime_filtered 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"148c648bbab172044339fdf2bd5dcbaa738c72eb42374b3644c7e855932bf0fb"}},{"ruleId":"D1","level":"warning","message":{"text":"diagnostics::create_lit_error (cyclomatic 20): diagnostics::create_lit_error has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 6 belong to 2 function items declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"compiler/rustc_session/src/diagnostics.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"d398c3ff00e90b6e8654dcb2bf04a34cd763114818cca2218c246db439071108"}},{"ruleId":"D1","level":"warning","message":{"text":"read::default_read_to_end (cyclomatic 20): read::default_read_to_end has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/io/read.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9cbcb62aaa54e56fe9cfd2d733fc36eebe3fb646064aa1cdeba64b08403432"}},{"ruleId":"D1","level":"warning","message":{"text":"delegate::u128_divide_sparc (cyclomatic 20): delegate::u128_divide_sparc 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":"library/compiler-builtins/compiler-builtins/src/int/specialized_div_rem/delegate.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"943b1c1c2fc08d974f0a05a973979dd892ceea0eb06ffe078000ae5f0be362f0"}},{"ruleId":"D1","level":"warning","message":{"text":"rem_pio2::rem_pio2 (cyclomatic 20): rem_pio2::rem_pio2 has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/rem_pio2.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7e4dd46d8ab9442dde2ed1e731ee63ca966ccbf46c6cd103fcc0d797b17604"}},{"ruleId":"D1","level":"warning","message":{"text":"jnf::jnf (cyclomatic 20): jnf::jnf 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":"library/compiler-builtins/libm/src/math/jnf.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff386cd22bbe4e37a26655246ba3057b131c942dc8f0a6dab7b74bdc1a9a7ef3"}},{"ruleId":"D1","level":"warning","message":{"text":"dragon::format_exact (cyclomatic 20): dragon::format_exact 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":"library/core/src/num/imp/flt2dec/strategy/dragon.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffaeea28cdb313b7f0b447ed7c3f74560c1856b0297ee447b3902a8082ef3803"}},{"ruleId":"D1","level":"warning","message":{"text":"grisu::format_exact_opt (cyclomatic 20): grisu::format_exact_opt has cyclomatic complexity 20 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 9 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/imp/flt2dec/strategy/grisu.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"20701331cb19dde0486ce651bb087e514bfa0add301c50f86c7664487d625904"}},{"ruleId":"D1","level":"warning","message":{"text":"validations::run_utf8_validation (cyclomatic 20): validations::run_utf8_validation 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":"library/core/src/str/validations.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b5fce7c79900bcf4c1d1be3c59dcc53210330bc460b91dc5fd5ed784c038a2"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::fmt (cyclomatic 20): Command::fmt 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":"library/std/src/sys/process/unix/common.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"791aaced03d8d33d18654a55071f866aa36eb73a4563886fa3b48f847812b10f"}},{"ruleId":"D1","level":"warning","message":{"text":"unix::init (cyclomatic 20): unix::init has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to 2 function items declared inside it (sanitize_standard_fds, reset_sigpipe). 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":"library/std/src/sys/pal/unix/mod.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d67dc1a543bf56057ef2cb1f20e2d0efa2ff09981601eab150e71639a83fdb9"}},{"ruleId":"D1","level":"warning","message":{"text":"backtrace::_print_fmt (cyclomatic 20): backtrace::_print_fmt 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":"library/std/src/sys/backtrace.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7929b263c68749a375c2dd1101f64d9ea80bf93b4b3f7a4b76628b8d0692761a"}},{"ruleId":"D1","level":"warning","message":{"text":"Wildcard::from_str (cyclomatic 20): Wildcard::from_str 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":"library/stdarch/crates/stdarch-gen-arm/src/wildcards.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0883abab09df3910826cacbdc32866d3c20ac598e3bbc1b81f1d55e9357f4381"}},{"ruleId":"D1","level":"warning","message":{"text":"intrinsic::create_tokens (cyclomatic 20): intrinsic::create_tokens 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":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"5680615bbdd397df6d36bfe8ec53938ec8f6e617e6e8adebc6650e4a2c926a6b"}},{"ruleId":"D1","level":"warning","message":{"text":"Libunwind::run (cyclomatic 20): Libunwind::run has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"489d28339594c7f614fc3fbfcde0fa40e0732e6eb8ef4c276bc521c7531ff405"}},{"ruleId":"D1","level":"warning","message":{"text":"auto_trait::clean_region_outlives_constraints (cyclomatic 20): auto_trait::clean_region_outlives_constraints has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/auto_trait.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a61a09fa0b6fc5600ba1d849cf363de12f2c6939773c76f226e09df78a1377"}},{"ruleId":"D1","level":"warning","message":{"text":"edit_lints::rename_update_fn (cyclomatic 20): 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":"src/tools/clippy/clippy_dev/src/edit_lints.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce440b4a8ef2f2823da3a332cabecac10fde741d455c362f546fc997ba2dd6a"}},{"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":"src/tools/clippy/clippy_lints/src/default_numeric_fallback.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3e2dbe66f2c6e1e01892db4c93b95bbc6409e94b762bf87d7246a0b0afccd0"}},{"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":"src/tools/clippy/clippy_lints/src/float_literal.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a767be1dcc3d346e6e74e066a1f6e2591160a6ff06e180bad20230844c05dc"}},{"ruleId":"D1","level":"warning","message":{"text":"DecimalLiteralRepresentation::do_lint (cyclomatic 20): DecimalLiteralRepresentation::do_lint has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/literal_representation.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7e10bebdffe1f0c648ad689b9348b42505029e43a52a15bbda6a25c7d6e682"}},{"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":"src/tools/clippy/clippy_lints/src/only_used_in_recursion.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7ea4406f9285135cd8393784f19cdb24968a01337e86c14832c4775d443ac2"}},{"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":"src/tools/clippy/clippy_lints/src/pass_by_ref_or_value.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"233b7763d4e1f0afbd97c3e762360a8035dde7516b7a6c428f353de2e41f0736"}},{"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":"src/tools/clippy/clippy_lints/src/single_component_path_imports.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"726ec610cb6d31fee85690914768e5ae049f7f4ebf445b5f8c5653fdde61b17a"}},{"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":"src/tools/clippy/clippy_lints/src/zombie_processes.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74493b25ca93d3ba5cdf68c22d4b1609c2cf77cfc713f7384833f11444271a0"}},{"ruleId":"D1","level":"warning","message":{"text":"match_same_arms::check (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3d9c734b3228a255acbc20eca3ad34e1a0730723e2c9a97e6faf9a95a3c3c4"}},{"ruleId":"D1","level":"warning","message":{"text":"manual_saturating_arithmetic::is_min_or_max (cyclomatic 20): 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":"src/tools/clippy/clippy_lints/src/methods/manual_saturating_arithmetic.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ad30dc2c87a60a3e611f9b9642628e0a55cbed06d8f3d58170affef6bcc993"}},{"ruleId":"D1","level":"warning","message":{"text":"map_clone::check (cyclomatic 20): 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":"src/tools/clippy/clippy_lints/src/methods/map_clone.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f531f7b121eed5c078dea77e9b60930c235ca05b5303544b8b69c5cf35ec3b"}},{"ruleId":"D1","level":"warning","message":{"text":"string_patterns::check_manual_pattern_char_comparison (cyclomatic 20): 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":"src/tools/clippy/clippy_lints/src/string_patterns.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6c6d31e027068c08d455adfd68f3a8f6aaa09465832ae169b09baded94535b"}},{"ruleId":"D1","level":"warning","message":{"text":"let_unit_value::check (cyclomatic 20): 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":"src/tools/clippy/clippy_lints/src/unit_types/let_unit_value.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f9805b50220c712405ddec90660a35b65b18273e9a6e90f7f4ee247d1ff672"}},{"ruleId":"D1","level":"warning","message":{"text":"implicit_saturating_sub::check_with_condition (cyclomatic 20): implicit_saturating_sub::check_with_condition has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/implicit_saturating_sub.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"5264e0aa86f38880da49b33d0f8b61ed9ff9476b7e5f3e06aef4f03dce26e11f"}},{"ruleId":"D1","level":"warning","message":{"text":"no_effect::reduce_expression (cyclomatic 20): 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":"src/tools/clippy/clippy_lints/src/no_effect.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd8add4bb4afaae42b15f3d317a9ee597258508971476c3c1eab501fd205615"}},{"ruleId":"D1","level":"warning","message":{"text":"while_let_on_iterator::needs_mutable_borrow (cyclomatic 20): while_let_on_iterator::needs_mutable_borrow has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/while_let_on_iterator.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"328c7910ea59d3c29a453636c9c36bff0357f50f071b20636558f0bfcf1dec70"}},{"ruleId":"D1","level":"warning","message":{"text":"type_certainty::expr_type_certainty (cyclomatic 20): 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":"src/tools/clippy/clippy_utils/src/ty/type_certainty/mod.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05be42ee6e717dfcd0fc8ea90a7d4d87b3087b01554779d24c745fb31d8780b"}},{"ruleId":"D1","level":"warning","message":{"text":"ChromeLayer::new (cyclomatic 20): ChromeLayer::new has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/bin/log/tracing_chrome.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6e8d1c40af959ef538332d6f45bae220dfd5b0a8677f8de4e0cb8c30bea423"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_avx512_intrinsic (cyclomatic 20): EvalContextExt::emulate_x86_avx512_intrinsic 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":"src/tools/miri/src/intrinsics/x86/avx512.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1026c6771c4595e0803995ebb3dd91fcdfe3e202e6ecd0f3fc5133f4a66c9fb"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprCollector::lower_type_ref (cyclomatic 20): ExprCollector::lower_type_ref 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":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"06155c4f293aaf5cd6173f3b0fc725ca6d6b65d8d4aed47baead93f355833417"}},{"ruleId":"D1","level":"warning","message":{"text":"ItemScope::dump (cyclomatic 20): ItemScope::dump 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":"src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bff319b2f88c93dd4245ca630d00db2999e678a339dbaacea1c8a36436d5d1"}},{"ruleId":"D1","level":"warning","message":{"text":"lang_item::crate_lang_items (cyclomatic 20): lang_item::crate_lang_items 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":"src/tools/rust-analyzer/crates/hir-def/src/lang_item.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6f86305ec88d4736b9deab2da8eabe88850aa48a75ad1ab55b8cfb90b5b724"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::analyze_closure (cyclomatic 20): InferenceContext::analyze_closure has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c61a40ffd00d9958bfe36c6b7650b0bd9ec823822da9f1591ed3e64e521d9e0"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_ref_pat (cyclomatic 20): InferenceContext::infer_ref_pat has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39ac97586713a5f0b878e56c52059b572a41078a56da4ca020ee0ee5b0ef70b"}},{"ruleId":"D1","level":"warning","message":{"text":"TyLoweringContext::lower_ty_ext (cyclomatic 20): TyLoweringContext::lower_ty_ext 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":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa47ebcca99496b96ea7ce8d6d0aa5a9e7fdd708add92ddcba98e686991fb5c"}},{"ruleId":"D1","level":"warning","message":{"text":"SolverContext::compute_goal_fast_path (cyclomatic 20): SolverContext::compute_goal_fast_path has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/solver.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af8b287d208249c3470f884c85a8fbce1f1d6ab9037b9e37af180171b3001b0"}},{"ruleId":"D1","level":"warning","message":{"text":"typing::on_eq_typed (cyclomatic 20): typing::on_eq_typed has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 3 function items declared inside it (assign_expr, let_stmt, assign_to_eq). 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":"src/tools/rust-analyzer/crates/ide/src/typing.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca622c7e061a9082e53606faf936b04e7b46889091c7a80380c3816f38ec2137"}},{"ruleId":"D1","level":"warning","message":{"text":"render::literal (cyclomatic 20): render::literal 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":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"862605f737967a8081a868b2dd335e41198bc76f648b72a75f7c282ab1a8b68d"}},{"ruleId":"D1","level":"warning","message":{"text":"remove_dbg::compute_dbg_replacement (cyclomatic 20): remove_dbg::compute_dbg_replacement has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/remove_dbg.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b6e7a800b61f618c7e3c3bf6e51b60d91bcde2e8aed969fcdb957122938f92"}},{"ruleId":"D1","level":"warning","message":{"text":"extract_type_alias::collect_used_generics (cyclomatic 20): extract_type_alias::collect_used_generics has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_type_alias.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7537c00527c5e47189a6fddfc5e73bcc4b83c8823ff31ace01095ff1b229ad4"}},{"ruleId":"D1","level":"warning","message":{"text":"gen_trait_fn_body::gen_partial_eq (cyclomatic 20): gen_trait_fn_body::gen_partial_eq has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8a42a4279263e5c011002cbbee851b9b59f22b7175bc2152ec129a6dd1183e"}},{"ruleId":"D1","level":"warning","message":{"text":"extract_function::extract_function (cyclomatic 20): extract_function::extract_function has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"644a0d1564509babe90438faf82033178a43e866d80bcbef9b0ded7cf1a79fb2"}},{"ruleId":"D1","level":"warning","message":{"text":"attribute::complete_attribute_path (cyclomatic 20): attribute::complete_attribute_path 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":"src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaf82a6f3f0cfdc5fcc007c52060a6660e0dd8d17707766d5279de7dc5261ce"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis::analyze (cyclomatic 20): analysis::analyze has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e3eec753239bf09dc88af9536836ca61805d5ba3b70a0604b25bd74836f525"}},{"ruleId":"D1","level":"warning","message":{"text":"matcher::match_meta_var (cyclomatic 20): matcher::match_meta_var 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":"src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"332e222adedef6369cf98ef1dc24a36ef8b959ae245704b56285935b16249f25"}},{"ruleId":"D1","level":"warning","message":{"text":"FlycheckActor::run (cyclomatic 20): FlycheckActor::run has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/flycheck.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"3274e8f43c5989d5f50510073b3e436d37458091f0e02bc7a139e72cadcf44cb"}},{"ruleId":"D1","level":"warning","message":{"text":"request::run_rustfmt (cyclomatic 20): request::run_rustfmt has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":2407}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff007adf4fc57be390dd8ca79761c04cad13a111a990a5ab331584f86822a19"}},{"ruleId":"D1","level":"warning","message":{"text":"validation::validate_literal (cyclomatic 20): validation::validate_literal has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"918951967f0195f97579176761a0231965e65c590ccfad8743faea90b407c6a8"}},{"ruleId":"D1","level":"warning","message":{"text":"ChainFormatterShared::format_last_child (cyclomatic 20): ChainFormatterShared::format_last_child has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/chains.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"63044bcc141213b4f07952eeb5ecc6542e45dd58d20faff039f65bbcbc449ae1"}},{"ruleId":"D1","level":"warning","message":{"text":"string::break_string (cyclomatic 20): string::break_string has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/string.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cb91f53e44a03555a3ac6427328f38b85ddc42d58671ea4285192940940bc7"}},{"ruleId":"D1","level":"warning","message":{"text":"createQueryElement (cyclomatic 20): createQueryElement has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"729ec0776981b851aba5ddf61e1394dd0771278313dc15e9b26906ff18a17cae"}},{"ruleId":"D1","level":"warning","message":{"text":"TyAndLayout::homogeneous_aggregate (cyclomatic 19): TyAndLayout::homogeneous_aggregate has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/callconv.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d648c5e66adf6c21214b827d72bee48d43962e467b554906803a3c92bd4101"}},{"ruleId":"D1","level":"warning","message":{"text":"LitKind::from_token_lit (cyclomatic 19): LitKind::from_token_lit has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/util/literal.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a7a1423790311dff5101fd4ad3bf7707df8558ded2537494c6cbf080244035"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_inline_asm (cyclomatic 19): State::print_inline_asm 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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7bfa3cb5b23e1b82a2d3ead6474897dd50ea38e45637fb2d179e841c5a6e2c"}},{"ruleId":"D1","level":"warning","message":{"text":"SanitizeParser::convert (cyclomatic 19): SanitizeParser::convert has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/codegen_attrs.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdced4c610bfaedeff0bf50f7fe7400717ba3780c0f0053dbfc15f6c683f429b"}},{"ruleId":"D1","level":"warning","message":{"text":"debug::show_substructure (cyclomatic 19): debug::show_substructure has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/deriving/debug.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ce1dddf02a6fb22555dd7b785c8414f2e68efaf9a39afaf5b5f468b366df23"}},{"ruleId":"D1","level":"warning","message":{"text":"concat_bytes::expand_concat_bytes (cyclomatic 19): concat_bytes::expand_concat_bytes has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/concat_bytes.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d09196fbb73dec1eaa554fe15bfd259bfa14f642593d9b7a00b8f5a5a6ad3d1"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineAssemblyGenerator::allocate_registers (cyclomatic 19): InlineAssemblyGenerator::allocate_registers 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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f81dcdb3547a930e9d605fdee413fac108fb7d45bfc87ba0c0421aaabaa8543"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::dbg_scope_fn (cyclomatic 19): Builder::dbg_scope_fn has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 3 function items declared inside it (get_function_signature, get_containing_scope, get_template_parameters). 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":"compiler/rustc_codegen_llvm/src/debuginfo/mod.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c126285ad72ab466b58ca522043e8a2d3363ac1566175b2cece9d6f398d40ad0"}},{"ruleId":"D1","level":"warning","message":{"text":"OperandRef::codegen_get_discr (cyclomatic 19): OperandRef::codegen_get_discr 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":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff060ba62667bdc863d8a00b49a901bc38acd0c49e878c61c88b814a8c182ea"}},{"ruleId":"D1","level":"warning","message":{"text":"link::link_staticlib (cyclomatic 19): link::link_staticlib 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"31747edd0aae7e089330e483467550c5cb380203a24abce4d9825fc2c7ce07ed"}},{"ruleId":"D1","level":"warning","message":{"text":"TtParser::match_one (cyclomatic 19): TtParser::match_one 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":"compiler/rustc_expand/src/mbe/macro_parser.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"c179cb2c0f5335aff917b224f826f1f36041059cec925c09a9b90d17f3a245c0"}},{"ruleId":"D1","level":"warning","message":{"text":"builtin::visit_implementation_of_dispatch_from_dyn (cyclomatic 19): builtin::visit_implementation_of_dispatch_from_dyn 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a387d763eed25236a7c2edb6b07c7ea77c1fbcd3b56a9b5b86e25e92075a83"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::no_such_field_err (cyclomatic 19): FnCtxt::no_such_field_err 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d964b621fc4a3ea48bdb7d8ab54979b933faaf4604d59df08d7e3f94b0af5e"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::adjust_fulfillment_error_for_expr_obligation (cyclomatic 19): FnCtxt::adjust_fulfillment_error_for_expr_obligation has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8b5212ac23e0899c349dde789d8a55f0ad8a631817e3ef582ac380d91cfe36"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_missing_return_type (cyclomatic 19): FnCtxt::suggest_missing_return_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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63da04f28adb4a0950c1f6ebed7309e741a276748cd4cc86b7388466db77c74"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::probe_op (cyclomatic 19): FnCtxt::probe_op 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"9731dcb241f7ea45375b5d4d828ea02d0f306c3e0524d1e5d197207101ad5694"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::resolve_ident_in_module (cyclomatic 19): Resolver::resolve_ident_in_module 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edc5eff8f309647246b5f60969197426adbb47749c1222b9591bbb47083f59d"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector::build_dll_import (cyclomatic 19): Collector::build_dll_import 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":"compiler/rustc_metadata/src/native_libs.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3114a1451cddf2340191ab20f1cdacc26c56fe3fb4d54b7ef748cf35f4bab1e"}},{"ruleId":"D1","level":"warning","message":{"text":"pretty::write_allocation_bytes (cyclomatic 19): pretty::write_allocation_bytes 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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a9d71ecd3ac7e5ec7d3cf151d5dc24482526fad9ddf93975d68ead84984b3a"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::visit_primary_bindings_special (cyclomatic 19): Builder::visit_primary_bindings_special has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8d019d71f31ee26668c8d0a23a9a7623b0f19505afd6c61650d7ec8602804f"}},{"ruleId":"D1","level":"warning","message":{"text":"VnState::simplify_aggregate (cyclomatic 19): VnState::simplify_aggregate has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f05c2126ca43d6589e880df402b56f1794b518baa71592d36efdb0f2cd8232d"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeChecker::visit_statement (cyclomatic 19): TypeChecker::visit_statement 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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c80b6880074cb64ec8d96c42d747bbddcdb628d0801cf028ec69f1074663d9"}},{"ruleId":"D1","level":"warning","message":{"text":"layout::check_must_not_suspend_ty (cyclomatic 19): layout::check_must_not_suspend_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":"compiler/rustc_mir_transform/src/coroutine/layout.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad309d04e2fd341de787d285fa529b59d051f4a2b965c58b505af87333b537e"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::check_no_chained_comparison (cyclomatic 19): Parser::check_no_chained_comparison 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e314db80c9132add2c61e31e418bfcfb2dbb860acd316d4a010475db0424bb"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_param_general (cyclomatic 19): Parser::parse_param_general 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":3420}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c18fb621128f8cf3e7e76bec70f234fac8cc540fb5a92fb1a9762f65e5f100"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_nonterminal (cyclomatic 19): Parser::parse_nonterminal has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/nonterminal.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd2061bce4f6692270c4b487fd605813cfdfb31da175f5a4e4e5b846fbb33bb"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckAttrVisitor::check_repr (cyclomatic 19): CheckAttrVisitor::check_repr has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9d67359058823ae21d9952f2d8bdee6040bac2f98b9381c76b31a23058ea16"}},{"ruleId":"D1","level":"warning","message":{"text":"DefCollector::build_reduced_graph_for_item (cyclomatic 19): DefCollector::build_reduced_graph_for_item 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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"b812e85ba14cb2246cf5145ba326341eb5bbe1a8be7042b902dd1d988c739c4b"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::resolve_lifetime (cyclomatic 19): LateResolutionVisitor::resolve_lifetime 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a0c87bc634e7be7ab82ae743981de3a9e9d8018a4841899cb2266de3248309"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::resolve_qpath (cyclomatic 19): LateResolutionVisitor::resolve_qpath 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":4904}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d6e83e51fbb96d84a04009d3898512f8b817b667e20b2f090bb163313c9969"}},{"ruleId":"D1","level":"warning","message":{"text":"check_unused::calc_unused_spans (cyclomatic 19): check_unused::calc_unused_spans 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":"compiler/rustc_resolve/src/check_unused.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbfaa4fea3507b68bd66823f8e77ebc30580a208dfa948a20df2beb6ea63c38"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacySymbolMangler::write_str (cyclomatic 19): LegacySymbolMangler::write_str has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_symbol_mangling/src/legacy.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7fc90e8911723c9abb77b4d87d00eb5336331d3aae59c60e84b0b2649bca42"}},{"ruleId":"D1","level":"warning","message":{"text":"x86_win64::compute_abi_info (cyclomatic 19): x86_win64::compute_abi_info 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":"compiler/rustc_target/src/callconv/x86_win64.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb295086cac0ca9ccf583dadd4a9409f7ed256f7065f40b6d2089570586ed515"}},{"ruleId":"D1","level":"warning","message":{"text":"loongarch::should_use_fp_conv_helper (cyclomatic 19): loongarch::should_use_fp_conv_helper has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6da297bb2909de597f3b7c0c1dadf10e0f97e3bde7da7c3a0300fe47b3756fe"}},{"ruleId":"D1","level":"warning","message":{"text":"x86_64::compute_abi_info (cyclomatic 19): x86_64::compute_abi_info 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":"compiler/rustc_target/src/callconv/x86_64.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4abfa1008bff31cae66f55663edcce4312fc16ad6987979c6423744da7faf5d"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::consider_returning_binding_diag (cyclomatic 19): TypeErrCtxt::consider_returning_binding_diag 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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"884c065bfba88063ded114355a4f03b4269eb317d3679bc28979406d4ad8430b"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectionContext::assemble_builtin_copy_clone_candidate (cyclomatic 19): SelectionContext::assemble_builtin_copy_clone_candidate 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":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"771bdae446adac3f4c5f2f203413b0f4406874e87fd6196858a301aaa884c15b"}},{"ruleId":"D1","level":"warning","message":{"text":"traits::try_evaluate_const (cyclomatic 19): traits::try_evaluate_const 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":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2f768844cebac52194568058e2aab9398da5107ff1b462130cdf141d6dd337"}},{"ruleId":"D1","level":"warning","message":{"text":"dyn_compatibility::virtual_call_violations_for_method (cyclomatic 19): dyn_compatibility::virtual_call_violations_for_method 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":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"662aeed7ca375000620abf0361fcabfe52b39a2cac83ad60292a2611159c276e"}},{"ruleId":"D1","level":"warning","message":{"text":"mul::mul (cyclomatic 19): mul::mul 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":"library/compiler-builtins/compiler-builtins/src/float/mul.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"97addd4e642c5b7d4d72d6df9f1573b5016e32c6cd56be7ac6e17db51e745b41"}},{"ruleId":"D1","level":"warning","message":{"text":"escape::escape_ascii (cyclomatic 19): escape::escape_ascii has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/escape.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"059e5157f421e6cca5fbb6c730fe65bc960e235e4a1068eaaa89963a4c9ff591"}},{"ruleId":"D1","level":"warning","message":{"text":"quote::quote (cyclomatic 19): quote::quote has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/proc_macro/src/quote.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d10fcc7b5b3fdec9b1c00e72b54d3bb163aed5f8b2a662e3afbe82720b93d4"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::do_exec (cyclomatic 19): Command::do_exec 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":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf3a73860eb34c02fcd74da6056dab8a3cd89638c8a1b1fd2ec91cf4a0cedf1"}},{"ruleId":"D1","level":"warning","message":{"text":"sgx::decode_error_kind (cyclomatic 19): sgx::decode_error_kind 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":"library/std/src/sys/io/error/sgx.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0864e33e102a12379b274c4f8215536ae91a5c252c2d495e450ff0a69d10cf0d"}},{"ruleId":"D1","level":"warning","message":{"text":"Expression::build (cyclomatic 19): Expression::build 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":"library/stdarch/crates/stdarch-gen-arm/src/expression.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6051b0d13ffb04354c5a790fc35580239187e55836f8158df918884cd9726151"}},{"ruleId":"D1","level":"warning","message":{"text":"Intrinsic::generate_big_endian (cyclomatic 19): Intrinsic::generate_big_endian 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":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"563787f7b88d9bf6d29ff8e1611bfa211bc3f9cefcc65ca555f1c8e0a030502a"}},{"ruleId":"D1","level":"warning","message":{"text":"compile::std_cargo (cyclomatic 19): compile::std_cargo has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ebf4f24fab6b8b372fe1b42a5b25841715960522979eb263160021b8675213"}},{"ruleId":"D1","level":"warning","message":{"text":"main::main (cyclomatic 19): main::main has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/bin/main.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"52aa5443aedd65864abab5493d4804179a8bec6ca7437bb9d105ce523569af1a"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::is_doc_subtype_of (cyclomatic 19): Type::is_doc_subtype_of has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/types.rs"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4a19abb49f3240435b4777128b85b1a013943a93321b33fae1648ee7b5d026"}},{"ruleId":"D1","level":"warning","message":{"text":"Context::render_item (cyclomatic 19): Context::render_item has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/context.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"583ca7844cf2eccd92ae2d37721228673e82aa716e7073031e4ff953265dff6a"}},{"ruleId":"D1","level":"warning","message":{"text":"SelfTyHead::of (cyclomatic 19): SelfTyHead::of has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_trait_impls.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"0698ec0c3c6120f906f0b7d4f13bfc65e95adb11316e940588267d2eceb383df"}},{"ruleId":"D1","level":"warning","message":{"text":"render_macro_matchers::print_tts (cyclomatic 19): render_macro_matchers::print_tts has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/render_macro_matchers.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76550fa000f3133288019733ed2a8b4a6afe2488c36ba7a2fba1633709e9858"}},{"ruleId":"D1","level":"warning","message":{"text":"collect_intra_doc_links::preprocess_link (cyclomatic 19): collect_intra_doc_links::preprocess_link has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10d6a21449c029bb2e6aa2099e3741e7d7cbe9432733aaf31f4d2426c2e46ed"}},{"ruleId":"D1","level":"warning","message":{"text":"collect_trait_impls::collect_trait_impls (cyclomatic 19): collect_trait_impls::collect_trait_impls has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_trait_impls.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e76a35cfdf56d42779da84269033d03a0bdf478a9e7c1f86246e0b18377fdc0"}},{"ruleId":"D1","level":"warning","message":{"text":"LiteralDigitGrouping::check_for_mistyped_suffix (cyclomatic 19): LiteralDigitGrouping::check_for_mistyped_suffix has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/literal_representation.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d5ba11c174f4d9adfa5a51c40a85623c0b1a77de0482e25844c3e24f48f8d5"}},{"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":"src/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e86f64c32391fd703575cf7a7f38e7ce070de6985bd541b283a0e114fe20ebe"}},{"ruleId":"D1","level":"warning","message":{"text":"VecPushSearcher::display_err (cyclomatic 19): VecPushSearcher::display_err has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/vec_init_then_push.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92e7b06962a7779a00af67031c74a12c395a834cecc67486b902aec05cdecd0"}},{"ruleId":"D1","level":"warning","message":{"text":"doc_paragraphs_missing_punctuation::is_missing_punctuation (cyclomatic 19): doc_paragraphs_missing_punctuation::is_missing_punctuation has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/doc/doc_paragraphs_missing_punctuation.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48e0018eb9ea6e7de167de5e40fc01350f9da7647bb40da603463bdd611aa7c"}},{"ruleId":"D1","level":"warning","message":{"text":"implicit_return::lint_implicit_returns (cyclomatic 19): 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":"src/tools/clippy/clippy_lints/src/implicit_return.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d44f0a4eb032d0453a469cd386a04cde78d6339b5f0821936427fd0c4ba5b3"}},{"ruleId":"D1","level":"warning","message":{"text":"needless_borrows_for_generic_args::needless_borrow_count (cyclomatic 19): needless_borrows_for_generic_args::needless_borrow_count has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_borrows_for_generic_args.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"42be9c59abf81dcf96deb699b9803d871724fb6163d88dbc0c8946a24ad9b959"}},{"ruleId":"D1","level":"warning","message":{"text":"manual_let_else::replace_in_pattern (cyclomatic 19): 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":"src/tools/clippy/clippy_lints/src/manual_let_else.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f13e96cf42ebc50ee9dd2ea0191884138110c4eb2fdb09c5c46017871d278e"}},{"ruleId":"D1","level":"warning","message":{"text":"option_as_ref_deref::check (cyclomatic 19): 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":"src/tools/clippy/clippy_lints/src/methods/option_as_ref_deref.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f49d7735a90c5ae553cdd9a0207e13318168cc2a7b4c7ba830b887d3a803e6"}},{"ruleId":"D1","level":"warning","message":{"text":"ptr_arg::check_ptr_arg_usage (cyclomatic 19): ptr_arg::check_ptr_arg_usage has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/ptr/ptr_arg.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"579be90a56d9e074b24193068eb7c3f450bc2c37db5fb27913081558cb0c0af1"}},{"ruleId":"D1","level":"warning","message":{"text":"HirEqInterExpr::eq_block (cyclomatic 19): HirEqInterExpr::eq_block has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"0372ee86bb49fee28b86fcf80ebe4002df9d224e7b78a6e1d5af3d92779a3422"}},{"ruleId":"D1","level":"warning","message":{"text":"HirEqInterExpr::eq_pat (cyclomatic 19): HirEqInterExpr::eq_pat has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e3cc42e6466b9cc77ce2ff1653c59527854b67496e095464140e087549ef6b"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCx::run_codegen_units_test (cyclomatic 19): TestCx::run_codegen_units_test has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 5 belong to 3 function items declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/codegen_units.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca964d02aab899b82285542d988fb50a6e3c89626e3b9ac49950950816220deb"}},{"ruleId":"D1","level":"warning","message":{"text":"TestCx::compare_output (cyclomatic 19): TestCx::compare_output has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":2715}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccf5e6cb6579b40b0d04066bc48a2800800d16eb4889b65b8cfa4eacc81354b"}},{"ruleId":"D1","level":"warning","message":{"text":"directives::ignore_llvm (cyclomatic 19): directives::ignore_llvm has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/directives.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e314610754d7b91c7a8ce376b0da9cb30d023fc5368fc35c45fb194abacd15e"}},{"ruleId":"D1","level":"warning","message":{"text":"Node::trim_clone (cyclomatic 19): Node::trim_clone has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/generate-copyright/src/main.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bfb9273a17d7bbf9184eba7baac70bb9667bebfc5c0bec6e6d8b9a17189e22"}},{"ruleId":"D1","level":"warning","message":{"text":"NewPermission::new (cyclomatic 19): NewPermission::new has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/borrow_tracker/tree_borrows/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"248ebd9a543ed2ddd0eeadb49f82fdae24877882bf6967cc803814f1c9facf8b"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::open (cyclomatic 19): EvalContextExt::open has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce4bb25bebc34cf967cefd4391d2576d4c57fe373358dfd142ab89a89754fad"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprUseVisitor::walk_pat (cyclomatic 19): ExprUseVisitor::walk_pat has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce331d01301f43757870e627bbc0aa2182b4123f37a6ecb56a701f65d89d4b4d"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprUseVisitor::cat_pattern (cyclomatic 19): ExprUseVisitor::cat_pattern has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"331b7c704cfad10dd31f0ed7fc87f30d1d5828b7c059e3917ed123e5b1fb9473"}},{"ruleId":"D1","level":"warning","message":{"text":"ProbeContext::consider_probe (cyclomatic 19): ProbeContext::consider_probe has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd4b885bb821251e27ebca385b33470268cf51d9a26183fb47052f6a3f75757"}},{"ruleId":"D1","level":"warning","message":{"text":"MirEvalError::pretty_print (cyclomatic 19): MirEvalError::pretty_print has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa3f13c8459b9dea55b87ae50dffba22a33f4ae8b1950e4dc252cbdb55874ef"}},{"ruleId":"D1","level":"warning","message":{"text":"lower::resolve_type_param_assoc_type_shorthand (cyclomatic 19): lower::resolve_type_param_assoc_type_shorthand has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb51b5219e4b7495b959d9f4b37ebb8fbb311a0ec2ea17fe0febdec62de7fa2"}},{"ruleId":"D1","level":"warning","message":{"text":"param_name::get_segment_representation (cyclomatic 19): param_name::get_segment_representation has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/param_name.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6de37267a68ddbdd4f5171babe89f229a307e7e37fa3fc6ed0d736d96a6fe7b"}},{"ruleId":"D1","level":"warning","message":{"text":"Module::get_usages_and_record_fields (cyclomatic 19): Module::get_usages_and_record_fields has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_module.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bf8b4b1d93cd173e088db900a288c9e4e38d13bb43ec73fcda9ad4acc554a2"}},{"ruleId":"D1","level":"warning","message":{"text":"inline_type_alias::create_replacement (cyclomatic 19): inline_type_alias::create_replacement has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_type_alias.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e99a7d92d1f43fdc227e6f51c069d8ed3fd2ebebef92b0d635f34ec04a5cd3"}},{"ruleId":"D1","level":"warning","message":{"text":"convert_let_else_to_match::remove_mut_and_collect_idents (cyclomatic 19): convert_let_else_to_match::remove_mut_and_collect_idents has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_let_else_to_match.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"919b2a1be75ae614829c8321fb009a6ffd70d48c74c8ac82dcface0af44ccbff"}},{"ruleId":"D1","level":"warning","message":{"text":"insert_use::insert_use_with_alias_option_with_editor (cyclomatic 19): insert_use::insert_use_with_alias_option_with_editor has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/insert_use.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfecbebfc65256f1def089a39f27eedcf9b3e066d3a4895b21a31af28e204873"}},{"ruleId":"D1","level":"warning","message":{"text":"node_ext::for_each_tail_expr (cyclomatic 19): node_ext::for_each_tail_expr has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"731acc1797f5cd1272f5537ebc7241db5cf5611abd3e788618c9cece782cbf7e"}},{"ruleId":"D1","level":"warning","message":{"text":"import_assets::filter_by_definition_kind (cyclomatic 19): import_assets::filter_by_definition_kind has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffe3b1439c3a40dcb02bb9f32d2c5eef44f256fe0ca2160e9f28efd599a856f"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectFolders::new (cyclomatic 19): ProjectFolders::new has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/load-cargo/src/lib.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4e2a1e6d304a135f1ec7c11bbe25f17aeeca4c639b9a36e966f2688e1d6c7e"}},{"ruleId":"D1","level":"warning","message":{"text":"parser::eat_fragment_kind (cyclomatic 19): parser::eat_fragment_kind has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/parser.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b460eba75a3b9aeb1710162864c5fb352077aac36bda76bb68d20e5ce18a36"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::subtree (cyclomatic 19): Writer::subtree has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea6382fc4318fa6ea97a12f640864b4b23d0b2bdacf5ac04889e702bc295788"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::group (cyclomatic 19): Writer::group has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"b775d93975daace51fbbeb97facaa31e9ee55d945f9f0b16a1dbf06ef6dfe23a"}},{"ruleId":"D1","level":"warning","message":{"text":"workspace::handle_rustc_crates (cyclomatic 19): workspace::handle_rustc_crates has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb85241b6f2c3e73b01ccf7a0c77d4441dede061b02f6f3fe2d30f75a9166632"}},{"ruleId":"D1","level":"warning","message":{"text":"prec::precedence (cyclomatic 19): prec::precedence has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/prec.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"473acb7a797a632ad7910bdc8ed5bd755fd29252d6c9fcd23eddacd6d7942498"}},{"ruleId":"D1","level":"warning","message":{"text":"ControlFlow::rewrite_cond (cyclomatic 19): ControlFlow::rewrite_cond has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/expr.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab267b0145b0bf3818596d66aec615a724973ccafe348354ce96a52f16e91e6d"}},{"ruleId":"D1","level":"warning","message":{"text":"comment::combine_strs_with_missing_comments (cyclomatic 19): comment::combine_strs_with_missing_comments has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"65518ef6314c8a039a18a23ba497a84ce4730c5a170ad2ccc3fde66315fda1cb"}},{"ruleId":"D1","level":"warning","message":{"text":"substringMatches (cyclomatic 19): substringMatches has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2447}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3897bb803299dfe1b8a58a90ac66532e3f64c42618dcdb655477862140caef3"}},{"ruleId":"D1","level":"warning","message":{"text":"handleShortcut (cyclomatic 19): handleShortcut has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aaad9357a9b0d7fafa3cddf59927e381238922d55af5f0d9a750d1270a3c886"}},{"ruleId":"D1","level":"warning","message":{"text":"feature_gate::check_crate (cyclomatic 18): feature_gate::check_crate 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":"compiler/rustc_ast_passes/src/feature_gate.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa43d24b63353c69cff3035df6640a7c3954c2ade79a1b38be5d237d4ac97fad"}},{"ruleId":"D1","level":"warning","message":{"text":"DeprecatedParser::convert (cyclomatic 18): DeprecatedParser::convert 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":"compiler/rustc_attr_parsing/src/attributes/deprecation.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"def65b5bede974ab595ed3f56a46a7bf4d0adac7e73bc18ac3363156d02b3659"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::later_use_kind (cyclomatic 18): MirBorrowckCtxt::later_use_kind 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":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2c7f66dd3007c409e73ab640898d7da130d6fc6ff76be9028253a7d61ef2c3"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::suggest_map_index_mut_alternatives (cyclomatic 18): MirBorrowckCtxt::suggest_map_index_mut_alternatives has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to 2 function items declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a21a3bd6667b77a6a416da527db841a12be1d39f49d6d31b4fb7df05cefc624"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::give_name_if_anonymous_region_appears_in_output (cyclomatic 18): MirBorrowckCtxt::give_name_if_anonymous_region_appears_in_output 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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"41097332002b179ed33b10373dfe619d402c87eeb6ccfaee643c82a145c86995"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::visit_after_early_terminator_effect (cyclomatic 18): MirBorrowckCtxt::visit_after_early_terminator_effect 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"233580e802312133d0af72e6f5c4575d13da8b1367d72156ae539cec1a4e27bf"}},{"ruleId":"D1","level":"warning","message":{"text":"bound_region_errors::try_extract_error_from_region_constraints (cyclomatic 18): bound_region_errors::try_extract_error_from_region_constraints 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":"compiler/rustc_borrowck/src/diagnostics/bound_region_errors.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f27799b3b8103c053d6f70b8e0f90a0d2210813838394dfcceca63ccc76860"}},{"ruleId":"D1","level":"warning","message":{"text":"num::codegen_int_binop (cyclomatic 18): num::codegen_int_binop 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":"compiler/rustc_codegen_cranelift/src/num.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"179afa6eee614536421b8b180169ab1436dcc09911ac2480abed8cdf5f2bdfce"}},{"ruleId":"D1","level":"warning","message":{"text":"va_arg::emit_x86_64_sysv64_va_arg (cyclomatic 18): va_arg::emit_x86_64_sysv64_va_arg 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":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7943abee8bec9097aef16c2b0402c79ef7f0823647ce7945435d473cef286d5"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkingFailed::into_diag (cyclomatic 18): LinkingFailed::into_diag 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":"compiler/rustc_codegen_ssa/src/diagnostics.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b881e121b43db0c82aa248425ef50f0aa58484df1fcce69dba6ca2d3fd9c46"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionCx::compute_per_local_var_debug_info (cyclomatic 18): FunctionCx::compute_per_local_var_debug_info 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":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9134fbdefc34990f282aee8affbec3a9b76df304233723332d083d429b4d3c"}},{"ruleId":"D1","level":"warning","message":{"text":"link::add_apple_link_args (cyclomatic 18): link::add_apple_link_args 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3614}}}],"partialFingerprints":{"codehealthFindingId/v1":"654f98812e155e5536e94dd9633311d2209b6a08fd0b8d603aa97f01ebc05979"}},{"ruleId":"D1","level":"warning","message":{"text":"pretty::print (cyclomatic 18): pretty::print 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":"compiler/rustc_driver_impl/src/pretty.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84783addf16e18e7406ccf24494e0e21ffeb47ffcd122930ff9315b4cdeef6e"}},{"ruleId":"D1","level":"warning","message":{"text":"quoted::parse_tree (cyclomatic 18): quoted::parse_tree 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":"compiler/rustc_expand/src/mbe/quoted.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"74912b3b6a01f59b985d23279f069779231ba094997938a26eb2d1dc264a27a0"}},{"ruleId":"D1","level":"warning","message":{"text":"generics::generic_arg_mismatch_err (cyclomatic 18): generics::generic_arg_mismatch_err 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5448a17417ad149a6087bfd255a3d0c1eeaa0d26e5a648035df1404b6c773f9"}},{"ruleId":"D1","level":"warning","message":{"text":"orphan::emit_orphan_check_error (cyclomatic 18): orphan::emit_orphan_check_error 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":"compiler/rustc_hir_analysis/src/coherence/orphan.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f984b10b5cde92aa1ca6697ff595eb6eb564f1c8fabece204b48dad2eba4e25"}},{"ruleId":"D1","level":"warning","message":{"text":"variance::variance_of_opaque (cyclomatic 18): variance::variance_of_opaque 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":"compiler/rustc_hir_analysis/src/variance/mod.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c166a3e044448e3ae3f7b69cfee42b155f602cd29743c9467577e5552db0ce83"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::deduce_closure_signature_from_predicates (cyclomatic 18): FnCtxt::deduce_closure_signature_from_predicates 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":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e871d7757b05088152a2013d188ca4dc55b7089689f0c670c29a3cbb7200512"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::annotate_expected_due_to_let_ty (cyclomatic 18): FnCtxt::annotate_expected_due_to_let_ty 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":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a0b0c92800b99df5885fcfbc8f00448b9a99b9f3275dbb76f475ddec6726d6"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_expr_with_expectation_and_args (cyclomatic 18): FnCtxt::check_expr_with_expectation_and_args 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddeabd2fee8e373b90a16eb3a4ab04a5511f2cc7d0f2e9d480fe78911751cd24"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::blame_specific_part_of_expr_corresponding_to_generic_param (cyclomatic 18): FnCtxt::blame_specific_part_of_expr_corresponding_to_generic_param 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":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e241a6295c54fe62c707c3aba07d8ab32b4ce50f650966186f3d27fcdd7e25b"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_expr_block (cyclomatic 18): FnCtxt::check_expr_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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"002de49c435de35b7cbd1f846572c090795ab878009caa4cf794e9b553829342"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::note_candidates_on_method_error (cyclomatic 18): FnCtxt::note_candidates_on_method_error 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"facdfb1dc7e9409dd2334443a37c12c1ef46c54ade73e1e55e1fb7d09773c32c"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::compute_definition_site_hidden_types (cyclomatic 18): FnCtxt::compute_definition_site_hidden_types 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":"compiler/rustc_hir_typeck/src/opaque_types.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e5dd0daac8b1a25cc98ed469e6f2a49547077d653394fa7412c963d54beb0e"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::add_scope_set_candidates (cyclomatic 18): Resolver::add_scope_set_candidates 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"112d21814905581429256e57c8d825cf762c8e74433403a3555adaa581c70cd1"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::resolve_ident_in_module_globs_unadjusted (cyclomatic 18): Resolver::resolve_ident_in_module_globs_unadjusted 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a204abc603ccb02303169f2723fcc878249879502099672c5bc5179ddb7acf"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_hir_typeck::extend_err_with_const_context (cyclomatic 18): rustc_hir_typeck::extend_err_with_const_context 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":"compiler/rustc_hir_typeck/src/lib.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f7b3296b2f7e97007e2a038304ea3070a71216e499b4b62a6972b95c21c174"}},{"ruleId":"D1","level":"warning","message":{"text":"NonLocalDefinitions::check_item (cyclomatic 18): NonLocalDefinitions::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":"compiler/rustc_lint/src/non_local_def.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34a514fc7035075191a919fb615f13351f3af97ae83d3cb848d30c7056d6506"}},{"ruleId":"D1","level":"warning","message":{"text":"lifetime_syntax::emit_mismatch_diagnostic (cyclomatic 18): lifetime_syntax::emit_mismatch_diagnostic 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":"compiler/rustc_lint/src/lifetime_syntax.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"589f9991227fd83edbdd06e552a2d5b31f8dbfcbdc1e50dfb7c36b39092828aa"}},{"ruleId":"D1","level":"warning","message":{"text":"CrateLocator::extract_one (cyclomatic 18): CrateLocator::extract_one 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ced3b0a5044da47b9cce4d20462532c5ea07308c107691f6531357f3b934f06"}},{"ruleId":"D1","level":"warning","message":{"text":"MirDumper::dump_path (cyclomatic 18): MirDumper::dump_path 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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"687af15d523834b1dafc8a1b194fe35c97e399381b3ef131cd559caa917b589d"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminatorKind::successors_mut (cyclomatic 18): TerminatorKind::successors_mut 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":"compiler/rustc_middle/src/mir/terminator.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc13253660bb4260152610de2dcf7f9a1194da6473648cb94f34688cc4c14847"}},{"ruleId":"D1","level":"warning","message":{"text":"pretty::write_allocations (cyclomatic 18): pretty::write_allocations has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b56fc5db2a0430becde820d796b9618a73dd1645c3b13cdc35c6b7c6287212a"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::as_temp_inner (cyclomatic 18): Builder::as_temp_inner 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":"compiler/rustc_mir_build/src/builder/expr/as_temp.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53fb08df4f7c7097439f44f3f97f798ef20ee4e3676b8eaad7a120a2f7fc911"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::static_pattern_match_inner (cyclomatic 18): Builder::static_pattern_match_inner has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":2929}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3098435b3ed6e788c41e1b56e3ba8d14c886dde7960af1cbb19fb6dcb3bcfd5"}},{"ruleId":"D1","level":"warning","message":{"text":"TailCallCkVisitor::check_tail_call (cyclomatic 18): TailCallCkVisitor::check_tail_call 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":"compiler/rustc_mir_build/src/check_tail_calls.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3cfbafee7a042e4349f0f2fbe6bd66ccb2c37e40c7041ed663566f03d9d9ee"}},{"ruleId":"D1","level":"warning","message":{"text":"VnState::simplify_binary_inner (cyclomatic 18): VnState::simplify_binary_inner has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"023e5b57789e17580f73fbfeba70e2c0de3ec4f6c544b86b09f8d13cb61e13e6"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentResult::find_dead_assignments (cyclomatic 18): AssignmentResult::find_dead_assignments 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":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9ab4eb25a1b2b5fc4b2f1c34ddf789fd918dcf3cf4c4a47edbada594c2310d"}},{"ruleId":"D1","level":"warning","message":{"text":"AssignmentResult::report_unused_assignments (cyclomatic 18): AssignmentResult::report_unused_assignments 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":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9422b2619c703be1c8d191cf369d2d78512dd020e8567fd3580ceb37a1d18ef6"}},{"ruleId":"D1","level":"warning","message":{"text":"structural_traits::extract_tupled_inputs_and_output_from_callable (cyclomatic 18): structural_traits::extract_tupled_inputs_and_output_from_callable 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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ed9b8f8be002db0bdf32ea2794d06c338982092277da95df3229336d4d7e87"}},{"ruleId":"D1","level":"warning","message":{"text":"asm::parse_asm_operand (cyclomatic 18): asm::parse_asm_operand 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":"compiler/rustc_parse/src/parser/asm.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99ea9a86fbb7076665903c602497fd50c37cd2fbf3382973464dfc421cdd1c7"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::recover_stmt_ (cyclomatic 18): Parser::recover_stmt_ has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":2142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6709b278a243ecd6722eb47e85d312d6fef274f1ba4088307df37f9d9f8c1ace"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_pat_no_top_guard_inner (cyclomatic 18): Parser::parse_pat_no_top_guard_inner 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":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42dfcb622ffaae2f645076a419661a3e4c9330c70cc6ba66c610c26f542a531"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::maybe_augment_stashed_expr_in_pats_with_suggestions (cyclomatic 18): Parser::maybe_augment_stashed_expr_in_pats_with_suggestions has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"c216cab117d0e78a85e4028a6f2ecc76d965653ccc42328430cd06b8fdf83d4b"}},{"ruleId":"D1","level":"warning","message":{"text":"dead::maybe_record_as_seed (cyclomatic 18): dead::maybe_record_as_seed 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":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf02559d10ee68ee0158f394aaaca14a717733efb20a6fda7485a8016983ef1f"}},{"ruleId":"D1","level":"warning","message":{"text":"dead::lint_dead_codes (cyclomatic 18): dead::lint_dead_codes 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":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f820acb9c4115dc37d62d87d0b35a03e2a177ffd7052f566b0638fe80ea5924"}},{"ruleId":"D1","level":"warning","message":{"text":"usefulness::compute_exhaustiveness_and_usefulness (cyclomatic 18): usefulness::compute_exhaustiveness_and_usefulness 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":"compiler/rustc_pattern_analysis/src/usefulness.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"616d665c7090c17050f222adcbb19845d73b64375cd1128864850e4abe7fc780"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::resolve_anonymous_lifetime (cyclomatic 18): LateResolutionVisitor::resolve_anonymous_lifetime 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"35510addabd3d15a9352815df60a2a2b4c06577cc3f86f845ff9881040e99db9"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::resolve_fn_params (cyclomatic 18): LateResolutionVisitor::resolve_fn_params 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2488}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c9f6134c424fb8b6009b77f999a36be8b1cd6f2c3a5675c781186d131252e7"}},{"ruleId":"D1","level":"warning","message":{"text":"transform::transform_instance (cyclomatic 18): transform::transform_instance 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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb47c9b500615eb441dd7c06c3f618f558b31837518f56a413ecc43a431540a7"}},{"ruleId":"D1","level":"warning","message":{"text":"parse::parse_autodiff (cyclomatic 18): parse::parse_autodiff 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":"compiler/rustc_session/src/options.rs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecc41558ccb8e2901200e97256b79e91e5a6e70f3848a058b1086eee9a29f20"}},{"ruleId":"D1","level":"warning","message":{"text":"s390x::classify_arg (cyclomatic 18): s390x::classify_arg 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":"compiler/rustc_target/src/callconv/s390x.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c854a09640fa675501dbaaf58888709bb4fbd9874d0c020e0ad23a119058e3b0"}},{"ruleId":"D1","level":"warning","message":{"text":"riscv::should_use_fp_conv_helper (cyclomatic 18): riscv::should_use_fp_conv_helper 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":"compiler/rustc_target/src/callconv/riscv.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9936ec90008ec65dfea46cd8446c0c098ea064b4c3ee1b7aa9ac81fda13654e"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::type_error_additional_suggestions (cyclomatic 18): TypeErrCtxt::type_error_additional_suggestions has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ae6759f397975ee116dc133bed44e1f184adee0333d22e5fcd8c3d45e2ecc5"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::annotate_source_of_ambiguity (cyclomatic 18): TypeErrCtxt::annotate_source_of_ambiguity 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":"compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c57bb8c4b0a31de945e28b8bc914b058d98d8249191d77c60f5252d3602fe6"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectionContext::candidate_from_obligation_no_cache (cyclomatic 18): SelectionContext::candidate_from_obligation_no_cache 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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"c579a03980f127c9798651c7186dca31abbf48e4d0884cf78904e0904e241e40"}},{"ruleId":"D1","level":"warning","message":{"text":"region::suggest_precise_capturing (cyclomatic 18): region::suggest_precise_capturing 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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"911f65c9bb7e1c94a2e0c590503c5525e85300ea6c4bdbf7835357526d06993d"}},{"ruleId":"D1","level":"warning","message":{"text":"dropck_outlives::dtorck_constraint_for_ty_inner (cyclomatic 18): dropck_outlives::dtorck_constraint_for_ty_inner 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":"compiler/rustc_trait_selection/src/traits/query/dropck_outlives.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2756ddc37275aafadfd7a1d4d5e7561375f8c244dc8aba4e8b5f40478f5d016"}},{"ruleId":"D1","level":"warning","message":{"text":"misc::type_allowed_to_implement_const_param_ty (cyclomatic 18): misc::type_allowed_to_implement_const_param_ty 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":"compiler/rustc_trait_selection/src/traits/misc.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfb9de36051fc40cc50f409ef1934a7bdfb639bbc6a409d0d835e4e20813652"}},{"ruleId":"D1","level":"warning","message":{"text":"sincosf::sincosf (cyclomatic 18): sincosf::sincosf 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":"library/compiler-builtins/libm/src/math/sincosf.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd0bf45682b042c9024330059981dd632814ce0f987f6bcf6e5ef492a8416eb"}},{"ruleId":"D1","level":"warning","message":{"text":"expm1::expm1 (cyclomatic 18): expm1::expm1 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":"library/compiler-builtins/libm/src/math/expm1.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"df947751872c707af99400e4844a6c59eedaf2bf3bac078a162ed4280ffabf02"}},{"ruleId":"D1","level":"warning","message":{"text":"expm1f::expm1f (cyclomatic 18): expm1f::expm1f 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":"library/compiler-builtins/libm/src/math/expm1f.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5128128b1b1a78a2e89ff1ac17c38f66cef0bd0cdf8f1957eececb3aa5bc7efe"}},{"ruleId":"D1","level":"warning","message":{"text":"Utf8Chunks::next (cyclomatic 18): Utf8Chunks::next 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":"library/core/src/str/lossy.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b5fe9992b6e1a27b929f3fd0d2c2a70b90884578291cdef8945e83b36a12f6"}},{"ruleId":"D1","level":"warning","message":{"text":"slow::parse_long_mantissa (cyclomatic 18): slow::parse_long_mantissa 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":"library/core/src/num/imp/dec2flt/slow.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b54a7f7d3290e31c71031dace8d11b537af63997908060438a8159f91981f35"}},{"ruleId":"D1","level":"warning","message":{"text":"windows::parse_lp_cmd_line (cyclomatic 18): windows::parse_lp_cmd_line 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":"library/std/src/sys/args/windows.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4c8a7d8a9aceeb5ad021ac1980475c964735d2b16f75ed6391865cd924518e"}},{"ruleId":"D1","level":"warning","message":{"text":"Intrinsic::defer_to_existing_llvm_link (cyclomatic 18): Intrinsic::defer_to_existing_llvm_link 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":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6549a194e989b42e49fbea55d5ced06ec590be6d198b9203c59539ed2f8d6b1"}},{"ruleId":"D1","level":"warning","message":{"text":"cc_detect::default_compiler (cyclomatic 18): cc_detect::default_compiler has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/utils/cc_detect.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6928de5acacfafad7b89333ad1ff2c401bf789d40cb8b560c89fcd3dc8fb94fd"}},{"ruleId":"D1","level":"warning","message":{"text":"dist::copy_src_dirs (cyclomatic 18): dist::copy_src_dirs has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to one function item declared inside it (filter_fn). 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":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7bbbbea8ecc1bf788684d4da500bbde342ecee985c3fe4726dad21b633cabc"}},{"ruleId":"D1","level":"warning","message":{"text":"tool::prepare_tool_cargo (cyclomatic 18): tool::prepare_tool_cargo has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/tool.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7784c7e5cfb4ef04ae42331a70914a442e907d7a1913d10d4d23e1354e810f"}},{"ruleId":"D1","level":"warning","message":{"text":"DocTestBuilder::generate_unique_doctest (cyclomatic 18): DocTestBuilder::generate_unique_doctest has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest/make.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b45c373dee7e3aa58377a2f3a37c89080f5c41e25a817b0f4cbe479c5dbea5e"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkReplacerInner::handle_event (cyclomatic 18): LinkReplacerInner::handle_event has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"1361bb4c46af70349edbed745f99269b0bf764251598c442524a9a5409faf10b"}},{"ruleId":"D1","level":"warning","message":{"text":"TagParser::extract_html_tag (cyclomatic 18): TagParser::extract_html_tag has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef66be2430484615dc6aa1ddb9b0611d989a5ebb8aa3c19973d6a56b1ace752"}},{"ruleId":"D1","level":"warning","message":{"text":"Stripper::fold_item (cyclomatic 18): Stripper::fold_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":"src/librustdoc/passes/strip_hidden.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7182b48dd3f459f0bf4d1cbea6a3681a45319197d5ad1562e340eea20bc31ba7"}},{"ruleId":"D1","level":"warning","message":{"text":"render::repr_attribute (cyclomatic 18): render::repr_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":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71dabfc2279cf5592fe8099263e12b3ae4655c8dffe1d8c07adc623608122cd"}},{"ruleId":"D1","level":"warning","message":{"text":"clean::clean_ty_generics_inner (cyclomatic 18): clean::clean_ty_generics_inner has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7ab78a6eae4b461e5bbb711bfca0957fa7e8865eccf09e70fecb0502880ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"clean::clean_maybe_renamed_item (cyclomatic 18): clean::clean_maybe_renamed_item 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":"src/librustdoc/clean/mod.rs"},"region":{"startLine":2866}}}],"partialFingerprints":{"codehealthFindingId/v1":"424e330f3847d99b793a06ebd9d7c7d5e1d191a693a7992d22862ffe885dba25"}},{"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":"src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"02358ef5a9909e06174ceec9bab73d40ffc8536191a8f6be2f2982c2c7347e0b"}},{"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":"src/tools/clippy/clippy_lints/src/default.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"040d5f46fdaf86eb433b3818724077b7398be32cd11a53dee943f43161e9383e"}},{"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":"src/tools/clippy/clippy_lints/src/entry.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"883cc26c1adbc8c26a05faa7ac216e46a75de6ce09b9bd673f2968e63d24bbd8"}},{"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":"src/tools/clippy/clippy_lints/src/loops/mod.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf11aa0aeccd2c177688f71f9c61d766777f2a5347e680753e89ace70bd9ce62"}},{"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":"src/tools/clippy/clippy_lints/src/loops/utils.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9383898f07a95588bc2cb9788cacec48a9415136bdc9cba034614d262107d10"}},{"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":"src/tools/clippy/clippy_lints/src/manual_option_as_slice.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a187b855a128bd16472ef11ccf43b08e23a3f3a95d53c16684abc26e35bb4e49"}},{"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":"src/tools/clippy/clippy_lints/src/methods/filter_map.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b848e8dcd6d6cf0c79063f4da936fa15e34f4cca37d97ed0a313e9a0a355df"}},{"ruleId":"D1","level":"warning","message":{"text":"UnsafeExprCollector::visit_expr (cyclomatic 18): UnsafeExprCollector::visit_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":"src/tools/clippy/clippy_lints/src/multiple_unsafe_ops_per_block.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d5d1df9240f2b52b8173b47e31e09805ec5cc7c0fc9afc43bfb8dd242617c8"}},{"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":"src/tools/clippy/clippy_lints/src/non_expressive_names.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"62055c478ec70a74c0a5d0c15fc639547452308deeccae4abaeacd17e1886591"}},{"ruleId":"D1","level":"warning","message":{"text":"single_match::report_single_pattern (cyclomatic 18): 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":"src/tools/clippy/clippy_lints/src/matches/single_match.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3412a04a0b5b0ce7f2aa6cb1740a9c3c48215fcd54935d04aef6c58ebb2ecac5"}},{"ruleId":"D1","level":"warning","message":{"text":"suspicious_operation_groupings::check_binops (cyclomatic 18): 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":"src/tools/clippy/clippy_lints/src/suspicious_operation_groupings.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a720fcfbfdf765ade203f0903f7b45bd502526e324a371bc9713affa423ec6"}},{"ruleId":"D1","level":"warning","message":{"text":"unnecessary_map_or::check (cyclomatic 18): unnecessary_map_or::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":"src/tools/clippy/clippy_lints/src/methods/unnecessary_map_or.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"050ce2f3dd46b422d365a768f7819afccf110c55db1295ce3e34401d64675847"}},{"ruleId":"D1","level":"warning","message":{"text":"clippy_utils::is_default_equivalent_call (cyclomatic 18): clippy_utils::is_default_equivalent_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":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be834f4fe9ebdc6197feb9515008df812a7c32abb8bcc23cc927ecfe4784f3f"}},{"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":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":2681}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f6303b8eac18186d5c295f44d2c13ca2b50d70b8d96a8c4d16ab06a83fc009"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_sse41_intrinsic (cyclomatic 18): EvalContextExt::emulate_x86_sse41_intrinsic 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":"src/tools/miri/src/intrinsics/x86/sse41.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec9c6cb640a88cb54e1e9ef3528b362fd223e248218069a2b1e88d706e126f6"}},{"ruleId":"D1","level":"warning","message":{"text":"TcpSocket::getsockopt (cyclomatic 18): TcpSocket::getsockopt has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2b585bc4df5cf51a9778eac7e8207eb7f38559cfadbd69a3cba0d758267d5b"}},{"ruleId":"D1","level":"warning","message":{"text":"tactics::data_constructor (cyclomatic 18): tactics::data_constructor has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ac1a80c38571fac3cb0e652478aff5c133e16f6cc99ba54181682386484e14"}},{"ruleId":"D1","level":"warning","message":{"text":"source_analyzer::resolve_hir_path_ (cyclomatic 18): source_analyzer::resolve_hir_path_ has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f469d83fdff0d62c283a31bdc02e6e4e1327477af8f00de0513332f0f459a92"}},{"ruleId":"D1","level":"warning","message":{"text":"lower::lower_body (cyclomatic 18): lower::lower_body has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36264f60ef97ca6e1b4a4597903b324d54801d9ac90cb3170e808ad716ec300"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::exec_extern_c (cyclomatic 18): Evaluator::exec_extern_c 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":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec53ea0ab6d521e827c56b3dce079fbba36c5604a12e033c4b3a78fc83fd2791"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::place_addr_and_ty_and_metadata (cyclomatic 18): Evaluator::place_addr_and_ty_and_metadata 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":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"3325ae413362b4ca30062068b10d1abf507b9f9d610b10a44e07be002943e1b5"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBody::walk_places (cyclomatic 18): MirBody::walk_places has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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/tools/rust-analyzer/crates/hir-ty/src/mir.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef546ab3cc89a377996839fcb71a9df0c0fe55946c4b0e575459f557f6687ae"}},{"ruleId":"D1","level":"warning","message":{"text":"BestObligation::visit_goal (cyclomatic 18): BestObligation::visit_goal 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":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/errors.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa072e00c66fe65ad07dad3ad9aef44373063413bd13de3736587dd0d0de7767"}},{"ruleId":"D1","level":"warning","message":{"text":"borrowck::partially_moved (cyclomatic 18): borrowck::partially_moved 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":"src/tools/rust-analyzer/crates/hir-ty/src/mir/borrowck.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab49bd6927d5bd3afa56e113b41e044e06b3bc824079bd04709dd0b0dcbd433a"}},{"ruleId":"D1","level":"warning","message":{"text":"borrowck::ever_initialized_map::dfs (cyclomatic 18): borrowck::ever_initialized_map::dfs 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":"src/tools/rust-analyzer/crates/hir-ty/src/mir/borrowck.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"2531a6b39e28372e54085439903dc68e7b62bc8a6f8eb174d52e789808ea07d2"}},{"ruleId":"D1","level":"warning","message":{"text":"render::definition_owner_name (cyclomatic 18): render::definition_owner_name 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":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cdefa00ef9429b0a37ec1811f5bb732bb219b2305d299a25fc55312a697a71"}},{"ruleId":"D1","level":"warning","message":{"text":"highlight::highlight_name_ref_by_syntax (cyclomatic 18): highlight::highlight_name_ref_by_syntax 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":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff2c30dafae7708b6631370c7362eac8dab35185d9df06395f0d08fb0fbb060"}},{"ruleId":"D1","level":"warning","message":{"text":"view_memory_layout::view_memory_layout (cyclomatic 18): view_memory_layout::view_memory_layout has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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/tools/rust-analyzer/crates/ide/src/view_memory_layout.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92bc80b51f4bdbcb912958446508c8e7087617b99aadc98b164deeba507ead9"}},{"ruleId":"D1","level":"warning","message":{"text":"signature_help::signature_help (cyclomatic 18): signature_help::signature_help has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11ca7e6de16000525af731fb9419952bfa7520fabea36c04b997f44299fac1c"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_new::generate_new (cyclomatic 18): generate_new::generate_new has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_new.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ba445afed9df6a4aef4f2406bcf3ef0bbcb7ea1cf3590727a607252c0639b3"}},{"ruleId":"D1","level":"warning","message":{"text":"extract_module::extract_module (cyclomatic 18): extract_module::extract_module has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_module.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"09699fd4416e285af526cf666273f0d3979fcf8e733f215eea0c46e538ba78b2"}},{"ruleId":"D1","level":"warning","message":{"text":"unwrap_branch::unwrap_branch (cyclomatic 18): unwrap_branch::unwrap_branch 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_branch.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde6487d4b307c538e3f97e1aa922766e70913e7d42f7b040a5e7f173c227c93"}},{"ruleId":"D1","level":"warning","message":{"text":"apply_demorgan::apply_demorgan (cyclomatic 18): apply_demorgan::apply_demorgan has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/apply_demorgan.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c39089e463bab51f66c52dd1b7653d09fbf8bb9f5ff0378ca2e2188f69cd0de"}},{"ruleId":"D1","level":"warning","message":{"text":"completions::complete_name_ref (cyclomatic 18): completions::complete_name_ref 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":"src/tools/rust-analyzer/crates/ide-completion/src/completions.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"77336501f0fe51be90997d26c5554855847857b7cda9d37e7f5c9b97169b018b"}},{"ruleId":"D1","level":"warning","message":{"text":"function::render (cyclomatic 18): function::render 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":"src/tools/rust-analyzer/crates/ide-completion/src/render/function.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"520d0c0daed4da1d7f20500cbc7ce09924373d641c950fb246774511a76d0141"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::inlay_hints (cyclomatic 18): Config::inlay_hints 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":"src/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4075a2d066a7593dcbac9767187657a0f2ba2d24105310b0f41a8cda4c53962"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::binding_power (cyclomatic 18): Expr::binding_power 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":"src/tools/rust-analyzer/crates/syntax/src/ast/prec.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9521272507875a3e7467dc08c46091b5c5c3235b2cf0fc6b40107ccd5ea0dd"}},{"ruleId":"D1","level":"warning","message":{"text":"TtTreeSink::token (cyclomatic 18): TtTreeSink::token 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":"src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf0557279979593f1f58e444a92547825075eeb71c794b6ec17dcb4fce2ce51"}},{"ruleId":"D1","level":"warning","message":{"text":"lexer::advance (cyclomatic 18): lexer::advance 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":"src/tools/rust-analyzer/lib/ungrammar/src/lexer.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ac02fffeb60a66f41d0e6e733c7eb707af93d9ad2555ccc425fa4e80ef32ca"}},{"ruleId":"D1","level":"warning","message":{"text":"UseTree::from_ast (cyclomatic 18): UseTree::from_ast has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/imports.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"846785643bedb159dcf6ee707749b50c0577427786f07b7cf94b9eaef38363fb"}},{"ruleId":"D1","level":"warning","message":{"text":"expr::can_be_overflowed_expr (cyclomatic 18): expr::can_be_overflowed_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":"src/tools/rustfmt/src/expr.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"5059c812cc8a6251b218061bb85ef44be6d61214bb88bb49cb097ad41012187b"}},{"ruleId":"D1","level":"warning","message":{"text":"extra_checks::check (cyclomatic 18): extra_checks::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":"src/tools/tidy/src/extra_checks/mod.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fcf92c36a169575a6a78485d7ed444611fe2b60cf2f8b5133cfcc5288c2324"}},{"ruleId":"D1","level":"warning","message":{"text":"features::check (cyclomatic 18): features::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":"src/tools/tidy/src/features.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26c611f001df260a0e5f35883bdb78aefdc39c0f897180956113e46e211a37d"}},{"ruleId":"D1","level":"warning","message":{"text":"buildHrefAndPath (cyclomatic 18): buildHrefAndPath 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":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a6d6f452b281eee8484d2710a9eb29adcb99fc9947be45de57d0388da9bfe8"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_fn_decl (cyclomatic 17): LoweringContext::lower_fn_decl 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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"9792f79c1489d4f58d2ede6f7f0c07f10480d6c4a89b65c98605a9c7fb544f9b"}},{"ruleId":"D1","level":"warning","message":{"text":"PrintState::print_comment (cyclomatic 17): PrintState::print_comment 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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb1536f128658fdb155759b6a1f8587f3ac7ce8aa22bad6ac9a85d026ff70be"}},{"ruleId":"D1","level":"warning","message":{"text":"diagnostic::parse_directive_items (cyclomatic 17): diagnostic::parse_directive_items 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":"compiler/rustc_attr_parsing/src/attributes/diagnostic/mod.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb7a287ff13bff90689daad69b2bb15493365bc4999672ead75af73e26ba1da"}},{"ruleId":"D1","level":"warning","message":{"text":"check_cfg::unexpected_cfg_value (cyclomatic 17): check_cfg::unexpected_cfg_value 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":"compiler/rustc_attr_parsing/src/check_cfg.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74e7d6d2734f968f74c5df40c662b89c068e08907b0688ca59f48f0dfa8c5a5"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::add_move_error_suggestions (cyclomatic 17): MirBorrowckCtxt::add_move_error_suggestions 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":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d8f4673e7c4f1008af2a9bcba9c5d8c84a0869c7f597224eca60a010044323"}},{"ruleId":"D1","level":"warning","message":{"text":"LoanInvalidationsGenerator::consume_rvalue (cyclomatic 17): LoanInvalidationsGenerator::consume_rvalue 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":"compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"111b156affe413d3989306131ec053c9d1fae769580bcb39a8c5b2dd10bf417e"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_codegen_cranelift::build_isa (cyclomatic 17): rustc_codegen_cranelift::build_isa 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":"compiler/rustc_codegen_cranelift/src/lib.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f77f005c4da0906412885213e49999d3458605e2b828950c88f493a66c56de"}},{"ruleId":"D1","level":"warning","message":{"text":"abi::codegen_fn_prelude (cyclomatic 17): abi::codegen_fn_prelude 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":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc76017947863748a785462133ab3d831ab4a66c0c26bd74e950b4e8ccfa602a"}},{"ruleId":"D1","level":"warning","message":{"text":"constant::define_all_allocs (cyclomatic 17): constant::define_all_allocs 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":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"912b4e376e56be24dcd6ca8fb90623bb2728e6fa2926ff869acd4deff8efe9e4"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::gcc_checked_binop (cyclomatic 17): Builder::gcc_checked_binop 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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e72cd2b5608caafc6337fbfc9c0760480f527eea2b1667f24dff0aca53df8c"}},{"ruleId":"D1","level":"warning","message":{"text":"CodegenCx::get_static_inner (cyclomatic 17): CodegenCx::get_static_inner has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7e5731f295319fcbaabd4a92fc581ad3de527eb42dae30f5928196c9f56f7d"}},{"ruleId":"D1","level":"warning","message":{"text":"allocator::codegen (cyclomatic 17): allocator::codegen 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":"compiler/rustc_codegen_llvm/src/allocator.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee648945286ad83900246777cd0dcfb48efb5c99131f253f8349788d9c96f6c"}},{"ruleId":"D1","level":"warning","message":{"text":"GccLinker::set_output_kind (cyclomatic 17): GccLinker::set_output_kind 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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"013990be90d4f06fa5dc34411cac554cced50bf07d095d6ab28da972a233accf"}},{"ruleId":"D1","level":"warning","message":{"text":"mir::codegen_mir (cyclomatic 17): mir::codegen_mir 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":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"072da9ae05fd0ad38a138fa22a09ff11b955a6209503f84cb9b6fb9acd3f9821"}},{"ruleId":"D1","level":"warning","message":{"text":"target_features::from_target_feature_attr (cyclomatic 17): target_features::from_target_feature_attr 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":"compiler/rustc_codegen_ssa/src/target_features.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d1ccc4482d5aa83d8f3ff89944d559364818d041f80be419a428e6eafe944f"}},{"ruleId":"D1","level":"warning","message":{"text":"target_features::cfg_target_feature (cyclomatic 17): target_features::cfg_target_feature 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":"compiler/rustc_codegen_ssa/src/target_features.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"a419c9c316c0ccd36b9278c9bd7bb6cebecc0e361eadf34d583b8d7fc28748eb"}},{"ruleId":"D1","level":"warning","message":{"text":"link::linker_and_flavor (cyclomatic 17): link::linker_and_flavor has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 2 function items declared inside it (infer_from, adjust_flavor_to_features). 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28f9b6d3e921825b4dfccfdfce11e012d5f56759a8a16303b9763d639077efc"}},{"ruleId":"D1","level":"warning","message":{"text":"link::exec_linker (cyclomatic 17): link::exec_linker has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function item declared inside it. 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2bd1fc356d883635fd626a34a67dea7f1f610972bbf071ac323770eea8fa8e"}},{"ruleId":"D1","level":"warning","message":{"text":"ValidityVisitor::aggregate_field_path_elem (cyclomatic 17): ValidityVisitor::aggregate_field_path_elem 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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"d133547c19e444fe7703e8fc17ad18d3cb4abe4aacc6156c7be9c32f6b1dcd5f"}},{"ruleId":"D1","level":"warning","message":{"text":"intern::intern_const_alloc_recursive (cyclomatic 17): intern::intern_const_alloc_recursive 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":"compiler/rustc_const_eval/src/interpret/intern.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"527b36808480aef37c6987e8135d36f7ae68557e44d034ed53099b53b11c56b6"}},{"ruleId":"D1","level":"warning","message":{"text":"emitter::detect_confusion_type (cyclomatic 17): emitter::detect_confusion_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":"compiler/rustc_errors/src/emitter.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbcab5557b973baac645f02ae258f2bff4b5888ebee159a2f26c09bd5877593"}},{"ruleId":"D1","level":"warning","message":{"text":"clauses_of::assert_only_contains_clauses_from (cyclomatic 17): clauses_of::assert_only_contains_clauses_from 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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cd749615c7881898a627a514f548ae29876731950ff6288d66aaf216fa3f6c"}},{"ruleId":"D1","level":"warning","message":{"text":"generics::check_generic_arg_count (cyclomatic 17): generics::check_generic_arg_count 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fa60eab5f79fe404e6f5715b45fc4296909e25db9d47a330a1444c583a3908"}},{"ruleId":"D1","level":"warning","message":{"text":"wfcheck::check_where_clauses (cyclomatic 17): wfcheck::check_where_clauses 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90b340451cc861b90ee9ebf3b311e1c4b7f2c7d9667b5f3fe8c7518fb78d267"}},{"ruleId":"D1","level":"warning","message":{"text":"errors::prohibit_assoc_item_constraint (cyclomatic 17): errors::prohibit_assoc_item_constraint 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"17afcdeab4f436a506600aa33371700e24a0875554aed6fbb90276ebde4e5dc1"}},{"ruleId":"D1","level":"warning","message":{"text":"Coerce::coerce (cyclomatic 17): Coerce::coerce 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88ba2a2302074fc00a3648408fa17b2ffa1540c2f991b4b9c7dd359d1a1ad46"}},{"ruleId":"D1","level":"warning","message":{"text":"CoerceMany::report_return_mismatched_types (cyclomatic 17): CoerceMany::report_return_mismatched_types 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59f86ee4ca12fbcd600b7a927485bc1d02afa6c6a3f13465325180eede65bf6"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprUseVisitor::walk_pat (cyclomatic 17): ExprUseVisitor::walk_pat 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cf4d9d13ee4de8c242cd7bf89e6a69dbf46e166c72dbfb064b067e625ee574"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_expr_asm (cyclomatic 17): FnCtxt::check_expr_asm 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":3708}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6139c9f9da54a109ae07b988cd8b5a38dbb0d2d3c05cb77b84c6efc60cd084e"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::binop_accepts_types (cyclomatic 17): FnCtxt::binop_accepts_types has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42acba9ec63caab9ea48ce17064f9f9ffcff64ad8632599fb9c1cf83acf19f2"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::check_pat_ident (cyclomatic 17): FnCtxt::check_pat_ident 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dbe56c96ddaa05207c100bfd4234f86c427ae8033c05974965e7685b95618e"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::ambiguity_diagnostic (cyclomatic 17): Resolver::ambiguity_diagnostic 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"23557c92fd00cd01c051ed1506b48cb44a4aa36fce34155226675d264e5d0178"}},{"ruleId":"D1","level":"warning","message":{"text":"LexicalResolver::expansion (cyclomatic 17): LexicalResolver::expansion 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e56d719800998c69510db9b0097596643ed037acd18bb105d56011f2c5ad88"}},{"ruleId":"D1","level":"warning","message":{"text":"LintStore::check_lint_name (cyclomatic 17): LintStore::check_lint_name 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":"compiler/rustc_lint/src/context.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e37ddb2118ff634972677ddafa0335c3d0b2f02f7aa3d1d38aa1b67f3ad89c3"}},{"ruleId":"D1","level":"warning","message":{"text":"rustc_log::init_logger_with_additional_layer (cyclomatic 17): rustc_log::init_logger_with_additional_layer 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":"compiler/rustc_log/src/lib.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"eede2c664017c417b7c12680e91376670774ac635a648fe9abe3db36a134c084"}},{"ruleId":"D1","level":"warning","message":{"text":"CrateLocator::find_library_crate (cyclomatic 17): CrateLocator::find_library_crate 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4975c5bb77fda95b9d2bcd75b7d00dc878f54ce0c7d0b80a716990a095cea7"}},{"ruleId":"D1","level":"warning","message":{"text":"AdtDefData::new (cyclomatic 17): AdtDefData::new 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":"compiler/rustc_middle/src/ty/adt.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8165792f2c1926b7512c4d9dc6bd3122dc7cf39c00a507720532050dbf6520"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyPrinter::try_print_visible_def_path_recur (cyclomatic 17): PrettyPrinter::try_print_visible_def_path_recur 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff85144aabdbbdfb7689e39ac2655741531583a4cb61fea63cb8ba97e1b30b3"}},{"ruleId":"D1","level":"warning","message":{"text":"FmtPrinter::name_all_regions (cyclomatic 17): FmtPrinter::name_all_regions has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2785}}}],"partialFingerprints":{"codehealthFindingId/v1":"7284c4240ce011bbe6cf897b84f3adb72e75a7f2e4d93a1f055f28e564012c70"}},{"ruleId":"D1","level":"warning","message":{"text":"UnsafetyVisitor::visit_pat (cyclomatic 17): UnsafetyVisitor::visit_pat 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":"compiler/rustc_mir_build/src/check_unsafety.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46a2a21624c860b243b5faa51115006fb610b6223eeaecc0fc267fb0e645d69"}},{"ruleId":"D1","level":"warning","message":{"text":"ConstToPat::alias_to_pat (cyclomatic 17): ConstToPat::alias_to_pat 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":"compiler/rustc_mir_build/src/thir/pattern/const_to_pat.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e870ad90aa12a6def9b966e99274bd59f91c69bbda9897882dd16f2055ff596"}},{"ruleId":"D1","level":"warning","message":{"text":"MoveDataBuilder::gather_terminator (cyclomatic 17): MoveDataBuilder::gather_terminator 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"77af4a8f61a66c2af391ee883fffaf6288ab4c02b7f09000291cf558bf9d770f"}},{"ruleId":"D1","level":"warning","message":{"text":"NormalInliner::check_callee_mir_body (cyclomatic 17): NormalInliner::check_callee_mir_body 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c9a4ea7f46c0b4f6d176d5d404b099fa4130fe99d7a87f71062563dfbdb6f4"}},{"ruleId":"D1","level":"warning","message":{"text":"ffi_unwind_calls::has_ffi_unwind_calls (cyclomatic 17): ffi_unwind_calls::has_ffi_unwind_calls 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":"compiler/rustc_mir_transform/src/ffi_unwind_calls.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3d9fc11b83907c3295cf043f299f1593ffd20c7293c483fa566910455d5f83"}},{"ruleId":"D1","level":"warning","message":{"text":"shim::make_shim (cyclomatic 17): shim::make_shim 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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d8eab689770a047bad061539c052e452aeeaaec6bf8e65fa63d691c17b1961"}},{"ruleId":"D1","level":"warning","message":{"text":"partitioning::mono_item_visibility (cyclomatic 17): partitioning::mono_item_visibility 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":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d34dab0b5ef79bb9cf7ecc4b62e8600c56330dc12ec5619c3b1bd5ad11f880"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_trait_bound (cyclomatic 17): Parser::parse_trait_bound 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":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4a40696d09820d44610c68e84e67b2b8293eeb811ee22b6b4f218838aeabe5"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::lookup_typo_candidate (cyclomatic 17): LateResolutionVisitor::lookup_typo_candidate 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2896}}}],"partialFingerprints":{"codehealthFindingId/v1":"950f81fbc99996426f682d405c8c2e723990d8a76cd7836f2e5fffd60219729b"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::suggest_adding_generic_parameter (cyclomatic 17): LateResolutionVisitor::suggest_adding_generic_parameter 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3508}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5df9fb54ce3bd0a4b017697e903c39e464fdd6bc1e52cebb63b64607075f3b"}},{"ruleId":"D1","level":"warning","message":{"text":"LateResolutionVisitor::resolve_doc_links (cyclomatic 17): LateResolutionVisitor::resolve_doc_links 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5447}}}],"partialFingerprints":{"codehealthFindingId/v1":"370dc75c46e5b2881344865facfafc0dfe6ee5e633f7cbaf11c39cf144d54ee2"}},{"ruleId":"D1","level":"warning","message":{"text":"encode::encode_ty_name (cyclomatic 17): encode::encode_ty_name 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":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e91d658392aa34f5af22c5141cc12e89f75a943787f1a6c32a37193a06bde75"}},{"ruleId":"D1","level":"warning","message":{"text":"FnAbi::gcc_type (cyclomatic 17): FnAbi::gcc_type has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/abi.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd83af03941fc64e3e040ccac8f56bd44c653db19d56952380f1a465736ed65"}},{"ruleId":"D1","level":"warning","message":{"text":"x86_win32::compute_abi_info (cyclomatic 17): x86_win32::compute_abi_info 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":"compiler/rustc_target/src/callconv/x86_win32.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aeb96974a2bc834161b8962f00a59230140dfffde97bd7bd2fa4a69a4d1c9b0"}},{"ruleId":"D1","level":"warning","message":{"text":"sparc64::classify (cyclomatic 17): sparc64::classify 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":"compiler/rustc_target/src/callconv/sparc64.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a6fbd3815c0a2d69b1e08184e8dd72fcba95382b601676cae1aa08b1810317"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::suggest_function_pointers_impl (cyclomatic 17): TypeErrCtxt::suggest_function_pointers_impl 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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"920ae711ce7ff23f11f53693afb1261b29a48c70e140cfce663699bf074496f2"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeErrCtxt::report_host_effect_error (cyclomatic 17): TypeErrCtxt::report_host_effect_error 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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"884f5f439045a47cdae460dea6201a492b4ecbba9330e917b74881e600933bbd"}},{"ruleId":"D1","level":"warning","message":{"text":"BestObligation::visit_goal (cyclomatic 17): BestObligation::visit_goal 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":"compiler/rustc_trait_selection/src/solve/fulfill/derive_errors.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"448e7ad74d3164ac3f45114027d36fcc02ce901f5c6574999ab7ee0fc1e3745c"}},{"ruleId":"D1","level":"warning","message":{"text":"AmbiguityCausesVisitor::visit_goal (cyclomatic 17): AmbiguityCausesVisitor::visit_goal 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":"compiler/rustc_trait_selection/src/traits/coherence.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"c936976c07f94355eacdd5e339f6825fd5bcf5bb1415e3e3a5db5ae907bec0b8"}},{"ruleId":"D1","level":"warning","message":{"text":"project::confirm_async_closure_candidate (cyclomatic 17): project::confirm_async_closure_candidate 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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"0719ddf3a8dc324f24a4e0fb4aebec731b70f3101705752cbe9512af722036a9"}},{"ruleId":"D1","level":"warning","message":{"text":"MaybeTransmutableQuery::answer_impl (cyclomatic 17): MaybeTransmutableQuery::answer_impl 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":"compiler/rustc_transmute/src/maybe_transmutable/mod.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"588a95ca93e67fed97e58cef0daa9de8ff8eb8ad6c7c253f396468e3344cbccb"}},{"ruleId":"D1","level":"warning","message":{"text":"NormalizesTo::consider_impl_candidate (cyclomatic 17): NormalizesTo::consider_impl_candidate 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":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b36dce9394931b40e91646352ad6e49c80a3c73044f44eb905a00d50d20ff42"}},{"ruleId":"D1","level":"warning","message":{"text":"region_constraint::rewrite_type_outlives_constraints_in_universe_for_eager_placeholder_handling (cyclomatic 17): region_constraint::rewrite_type_outlives_constraints_in_universe_for_eager_placeholder_handling 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":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"7813782c26854afe45b2e5180523bd41c2352d5d5281b6d117582f99ef90c060"}},{"ruleId":"D1","level":"warning","message":{"text":"libm_macros::expand (cyclomatic 17): libm_macros::expand 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":"library/compiler-builtins/crates/libm-macros/src/lib.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbf0367f9976ed01a83508d68ce8304c8f526b7359fb2ecd5be78558f0acb3c"}},{"ruleId":"D1","level":"warning","message":{"text":"cbrt::cbrt_round (cyclomatic 17): cbrt::cbrt_round 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":"library/compiler-builtins/libm/src/math/cbrt.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"02beddde9ca3c4ec6ea5a735c80a9de256b942d16b840cf9f5184be7b0dc5a9c"}},{"ruleId":"D1","level":"warning","message":{"text":"hvx::parse_compound_expr (cyclomatic 17): hvx::parse_compound_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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"43161b544faea38ac8b8aecc41b1db60137e8c56820e8093d0f85eeaf1681300"}},{"ruleId":"D1","level":"warning","message":{"text":"Rustc::run (cyclomatic 17): Rustc::run has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to one function item declared inside it (prepare_image). 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":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ded99e3cdce6483de54a8d24ad32b91a7c84ced2f5888a670ebe6a3be4f69c"}},{"ruleId":"D1","level":"warning","message":{"text":"DeferredCommand::finish_process (cyclomatic 17): DeferredCommand::finish_process has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/utils/exec.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c83b4632fe33708a5f54626a550509fae2e8982d7a77c7c83fd0861e4da2db5"}},{"ruleId":"D1","level":"warning","message":{"text":"compile::rustc_cargo_env (cyclomatic 17): compile::rustc_cargo_env has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"1587ae9b4b6099be8e91c3ef0eb69bc8c5e5c2d0b4e683ab78ad0d26e1f72a99"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis::report_test_diffs (cyclomatic 17): analysis::report_test_diffs has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to 2 function items declared inside it. 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/ci/citool/src/analysis.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad7e3c630df731b59d1c17b297f552a4e3ceb77ff9f45ed4f2d4c468709df1f"}},{"ruleId":"D1","level":"warning","message":{"text":"TagIterator::parse_outside_attribute_block (cyclomatic 17): TagIterator::parse_outside_attribute_block has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bd0f924c1c79263e7bbed05e4defe8830cab5a4ea89d6cabf531b5b2f8d294"}},{"ruleId":"D1","level":"warning","message":{"text":"FindCalls::visit_expr (cyclomatic 17): FindCalls::visit_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":"src/librustdoc/scrape_examples.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f68b62085e0fb7d7b926da6cf319f22f6ccbf550579c4803959ecdd122790ee"}},{"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":"src/tools/clippy/clippy_lints/src/booleans.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"10dd9d3a0a92733a8871ea7ac6e16c6302625a783523f3646febc6a8cf42dc95"}},{"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":"src/tools/clippy/clippy_lints/src/len_zero.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d2ef3fedfe1d55b53eefd9dab087c8201d05b9941c1efbd27ad07f482882eb"}},{"ruleId":"D1","level":"warning","message":{"text":"useless_attribute::check (cyclomatic 17): 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":"src/tools/clippy/clippy_lints/src/attrs/useless_attribute.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe2953813e68a601450adedd4a473e38671e341f8a0dcaaa9906ad8bdbcb154"}},{"ruleId":"D1","level":"warning","message":{"text":"needless_type_cast::has_generic_return_type (cyclomatic 17): 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":"src/tools/clippy/clippy_lints/src/casts/needless_type_cast.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc3ce4b18eac90104181222f70af1339bd94ee458fd5842ed656d38d407b23e"}},{"ruleId":"D1","level":"warning","message":{"text":"search_is_some::check (cyclomatic 17): 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":"src/tools/clippy/clippy_lints/src/methods/search_is_some.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4b7faf4954ca089b9875d9586301a0ebaf56f5c20efaddf693f739a38167b7"}},{"ruleId":"D1","level":"warning","message":{"text":"cast_possible_truncation::apply_reductions (cyclomatic 17): 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":"src/tools/clippy/clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf3356d3c5965dd3ff2f4d9cf4e6c63865abaab1496e87ee5bc76f569d0db75"}},{"ruleId":"D1","level":"warning","message":{"text":"cast_possible_truncation::check (cyclomatic 17): 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":"src/tools/clippy/clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9687e825069aff69b686761279dc0b932b2fd2766c4666f2ff5c972b694c10a"}},{"ruleId":"D1","level":"warning","message":{"text":"undocumented_unsafe_blocks::text_has_safety_comment (cyclomatic 17): undocumented_unsafe_blocks::text_has_safety_comment has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7496d241f907f0cfd6a9ff83782713860a8131d0a4b9b423c659fcb811e505"}},{"ruleId":"D1","level":"warning","message":{"text":"open_options::get_open_options (cyclomatic 17): 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":"src/tools/clippy/clippy_lints/src/methods/open_options.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e88ef0c46e18718f4224afbe609d260acabe58d621321b7bd3d8e1917a738e"}},{"ruleId":"D1","level":"warning","message":{"text":"ranges::can_switch_ranges (cyclomatic 17): ranges::can_switch_ranges has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/ranges.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bee52ad8c0e852269446e0f03a9130fb764e4c992b3dc5b45c7115f8f71f0de"}},{"ruleId":"D1","level":"warning","message":{"text":"misnamed_getters::check_fn (cyclomatic 17): misnamed_getters::check_fn has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/functions/misnamed_getters.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b100fe17e3a07c808840a6e6aa179332be051f6fae2f932bd6ce2287f5ce588"}},{"ruleId":"D1","level":"warning","message":{"text":"branches_sharing_code::scan_block_for_eq (cyclomatic 17): 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":"src/tools/clippy/clippy_lints/src/ifs/branches_sharing_code.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"9feee57c6978d1870dde3f53da21ded82b80bf7f3e77066b028869b9aeef993a"}},{"ruleId":"D1","level":"warning","message":{"text":"str_splitn::parse_iter_usage (cyclomatic 17): str_splitn::parse_iter_usage has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/str_splitn.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9986d898caff6e7b7fcebc1fb91b69a421601979c048a143dbaf0d16e50be5ab"}},{"ruleId":"D1","level":"warning","message":{"text":"or_fun_call::check (cyclomatic 17): 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":"src/tools/clippy/clippy_lints/src/methods/or_fun_call.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00fccfec47c6455f36f79e365e167446dd545d3b0d38ba8659202c892f77621"}},{"ruleId":"D1","level":"warning","message":{"text":"cmp_owned::check_op (cyclomatic 17): cmp_owned::check_op has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/cmp_owned.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebd4f0b6611d9a11342dd441513a220661a9e4c07cf13f790f3d23ce9fd2c05"}},{"ruleId":"D1","level":"warning","message":{"text":"markdown::check (cyclomatic 17): 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":"src/tools/clippy/clippy_lints/src/doc/markdown.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd8cedf346ff10d555f91af799d4e8785172c8cfb4560293a6cf42c31811a43"}},{"ruleId":"D1","level":"warning","message":{"text":"ptr_arg::check_fn_args (cyclomatic 17): 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":"src/tools/clippy/clippy_lints/src/ptr/ptr_arg.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1210e44201e893308d1b05f4b7bc9b07e813447a1037fb8352fcd77befd983"}},{"ruleId":"D1","level":"warning","message":{"text":"useless_asref::check (cyclomatic 17): useless_asref::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":"src/tools/clippy/clippy_lints/src/methods/useless_asref.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cb9c6255adf4dad853139c59f7d08350e39850c655a18142c9256a82f954c1"}},{"ruleId":"D1","level":"warning","message":{"text":"unnecessary_sort_by::detect_lint (cyclomatic 17): 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":"src/tools/clippy/clippy_lints/src/methods/unnecessary_sort_by.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7150e2b5dcf61526f96703c390224f61f6d2bcf7b92676a9599d3d2d4919bc76"}},{"ruleId":"D1","level":"warning","message":{"text":"transmute_undefined_repr::reduce_ty (cyclomatic 17): transmute_undefined_repr::reduce_ty 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":"src/tools/clippy/clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a585fee9110750acc2d4159ebfb3de5c8b86f5841ea9790aba628716f71b16f"}},{"ruleId":"D1","level":"warning","message":{"text":"radians::check (cyclomatic 17): radians::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":"src/tools/clippy/clippy_lints/src/floating_point_arithmetic/radians.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a31095cf9aeaa75ac0fd349ef1319d403307951a13b5dc45834d712aa88ed4"}},{"ruleId":"D1","level":"warning","message":{"text":"iter_overeager_cloned::check (cyclomatic 17): iter_overeager_cloned::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":"src/tools/clippy/clippy_lints/src/methods/iter_overeager_cloned.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbff3606c10eea4a0c97f1386c816cfb4db0a0181f00a9534726ea3c938d40a"}},{"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":"src/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb4a55a34f995cf3b0e3aeee2697757484b13b3d041a2aec487f769e8030113"}},{"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bd450be9d18b08deab827126616ee6d952be80042377401c610a9f64c1128b"}},{"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8efafe40acb30b89b89a0c94eee5a0b0c66b336471f5eea89457059b95c488"}},{"ruleId":"D1","level":"warning","message":{"text":"json::push_actual_errors (cyclomatic 17): json::push_actual_errors has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/json.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ceaa2d32801a9fd747a6897363c8c089701ccd2463f754a32e136b671ef159f"}},{"ruleId":"D1","level":"warning","message":{"text":"DisplayRepr::print (cyclomatic 17): DisplayRepr::print has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/borrow_tracker/tree_borrows/diagnostics.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df090a30ce5da313973662a65a3bd3dd7fed302de39a4c26b0bab6b27f382c0"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::linux_statx (cyclomatic 17): EvalContextExt::linux_statx has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f240b75c774d93fc9e96307576b448d7e58db2182bb3789542c9340a2b1c06e"}},{"ruleId":"D1","level":"warning","message":{"text":"foreign_items::win_get_full_path_name (cyclomatic 17): foreign_items::win_get_full_path_name has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd1ce37aff0bf1212ac2854f279d4ac5c89ae96cae2e5f8a8ca93d8cb70bb66"}},{"ruleId":"D1","level":"warning","message":{"text":"find_path::find_path_for_module (cyclomatic 17): find_path::find_path_for_module has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/find_path.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f8cd6c314b89c7057a84b51f218ab8e26201d2bf5edbfa62d54b5b114f9477"}},{"ruleId":"D1","level":"warning","message":{"text":"MacroCallId::expand_speculative (cyclomatic 17): MacroCallId::expand_speculative has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"facf48d3eeb77a32642b5c9cebdf663241d9d02e8386f028011588fe865813ba"}},{"ruleId":"D1","level":"warning","message":{"text":"mod_path::convert_path (cyclomatic 17): mod_path::convert_path 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":"src/tools/rust-analyzer/crates/hir-expand/src/mod_path.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c709c73b580b5bbd3f2b5bff8b566723f7d75bc545207ad2c0782ad7baebc1b4"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::deduce_closure_signature_from_predicates (cyclomatic 17): InferenceContext::deduce_closure_signature_from_predicates has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad05c2b7fd189cbc26319b85825c4476e63936071c4c315220b42a6292bccd6b"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::resolve_all (cyclomatic 17): InferenceContext::resolve_all has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"6489356235fe3d82434c342736d37baaa567fb737f1b78b24ce4a3ce1c9ecaa5"}},{"ruleId":"D1","level":"warning","message":{"text":"Evaluator::patch_addresses (cyclomatic 17): Evaluator::patch_addresses 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":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd69dbf38cc1ec36418cb9cfbefb2eafc097cde1e6775a1a20a29de4203139a"}},{"ruleId":"D1","level":"warning","message":{"text":"path::check_generic_args_len (cyclomatic 17): path::check_generic_args_len 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":"src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"49423a1ca3e573d3fb48df7529eae90a463af7cb2bf390068d4b76f59e7b8c86"}},{"ruleId":"D1","level":"warning","message":{"text":"binding_mode::hints (cyclomatic 17): binding_mode::hints 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":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/binding_mode.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"58018cf004cf7b540d8cf25cf58e3b7b77026806ce3e9ea0d85d222668d67bb9"}},{"ruleId":"D1","level":"warning","message":{"text":"generic_param::hints (cyclomatic 17): generic_param::hints 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":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/generic_param.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"001c0e6499ff1127c0c9573913a6fb0596205e14f306a1df17e00678b61f349a"}},{"ruleId":"D1","level":"warning","message":{"text":"signature_help::signature_help_for_generics (cyclomatic 17): signature_help::signature_help_for_generics has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"3379884401d3f9ae255cccf0e8ca2b8f0822573104bb0a645912eed764b7f09e"}},{"ruleId":"D1","level":"warning","message":{"text":"auto_import::relevance_score (cyclomatic 17): auto_import::relevance_score 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/auto_import.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c76920afb3107decaf8faa9b40b9712a39ddca2510c78ee5834a54718119b9"}},{"ruleId":"D1","level":"warning","message":{"text":"wrap_return_type::wrap_return_type (cyclomatic 17): wrap_return_type::wrap_return_type has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/wrap_return_type.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37fb1ec88f2f9def5691706ac258a7b3ecb0e0d63e2d587a5bcfcaed0977393"}},{"ruleId":"D1","level":"warning","message":{"text":"convert_bool_to_enum::replace_usages (cyclomatic 17): convert_bool_to_enum::replace_usages has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_to_enum.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a587c51b1303b56d570a28577d771ef943f309be29ad30873f825e31ddb2ddee"}},{"ruleId":"D1","level":"warning","message":{"text":"toggle_macro_delimiter::toggle_macro_delimiter (cyclomatic 17): toggle_macro_delimiter::toggle_macro_delimiter 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/toggle_macro_delimiter.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b468bb4da0fa543c4cd35f86293e442eb0f256716167310bc2c8afb46ba061"}},{"ruleId":"D1","level":"warning","message":{"text":"extract_function::make_body (cyclomatic 17): extract_function::make_body 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"230c940c522846d25b486b189df89ffa10ace98a1288dd9ae0119d88d26704e9"}},{"ruleId":"D1","level":"warning","message":{"text":"version_sort::version_sort (cyclomatic 17): version_sort::version_sort 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":"src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c74e045c3fcca67f5559f15d0e2c3e8c8f85d9a10ac9a37a30cf08f0ad8279"}},{"ruleId":"D1","level":"warning","message":{"text":"merge_imports::recursive_normalize (cyclomatic 17): merge_imports::recursive_normalize has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"43470d21ce15098e472a8f1d07d5b3837958596cca95667ea9616b1d02dec573"}},{"ruleId":"D1","level":"warning","message":{"text":"import_assets::validate_resolvable (cyclomatic 17): import_assets::validate_resolvable 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":"src/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"223c3f570de86bd10f6611b575c082d573ea9e7070fe871932be5932fc1d85cf"}},{"ruleId":"D1","level":"warning","message":{"text":"tree_diff::diff (cyclomatic 17): tree_diff::diff has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 2 function items declared inside it (go, syntax_element_eq). 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":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/tree_diff.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0db575e7fdf52424029d27440f0b12c2387da90d77b5e23042ec390eb536a6"}},{"ruleId":"D1","level":"warning","message":{"text":"atom::builtin_expr (cyclomatic 17): atom::builtin_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":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"402ff59690d972fd562b81d1189e5efa5a7e753b4200ac1afededa0e8ea06bd1"}},{"ruleId":"D1","level":"warning","message":{"text":"CargoWorkspace::new (cyclomatic 17): CargoWorkspace::new has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function item declared inside it. 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/tools/rust-analyzer/crates/project-model/src/cargo_workspace.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fd44e72c84521e87e86e6647b520c67feea378f60dea34875c5d429eae2de6"}},{"ruleId":"D1","level":"warning","message":{"text":"lsp::completion_item_hash (cyclomatic 17): lsp::completion_item_hash has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function item declared inside it (hash_completion_relevance). 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":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5019fdab139deea202b34f03760f92cc726b04228c100018f1e6441325c61cec"}},{"ruleId":"D1","level":"warning","message":{"text":"to_proto::code_lens (cyclomatic 17): to_proto::code_lens has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"b922d589d37a64f391d56f8d8cd897d4ea2901b95195b668397defb97074346a"}},{"ruleId":"D1","level":"warning","message":{"text":"sort::version_sort (cyclomatic 17): sort::version_sort 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":"src/tools/rustfmt/src/sort.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfac113d5b8baad407ef4606a8f41d70e2d5369ee9aaf49db5271c4bc92b229a"}},{"ruleId":"D1","level":"warning","message":{"text":"comment::comment_style (cyclomatic 17): comment::comment_style has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"33719fb237b35da457a47ffe422697d5ee5efc8a466cb1f7096fdb8d86352c36"}},{"ruleId":"D1","level":"warning","message":{"text":"decode (cyclomatic 17): decode has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"074c81dc9c71d76369d13f48ac8d29103eee0bb5460e4f75e762d906317c66b9"}},{"ruleId":"D1","level":"warning","message":{"text":"changeSetting (cyclomatic 17): changeSetting has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/settings.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9906b15af035dd5853ff3530fb0f87adbd39356e2e2371ba8818734a31d922eb"}},{"ruleId":"D1","level":"warning","message":{"text":"calculate (cyclomatic 17): calculate has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b071b643c1db6196dba17d2dc0172e0b1960c64502fe0c31616d1ffc07dc1f"}},{"ruleId":"D1","level":"warning","message":{"text":"parseInput (cyclomatic 17): parseInput has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2265e3c04de3a6a13d44c573440ac0a3b1b47cb09e6cdea80c6527d6d18f57"}},{"ruleId":"D1","level":"warning","message":{"text":"innerRunTypeQuery (cyclomatic 17): innerRunTypeQuery has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":4182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09e90084c240c5279abf7473112e232a371c0111dae14e36221e6ef548df269"}},{"ruleId":"D1","level":"warning","message":{"text":"register_type_impls (cyclomatic 17): register_type_impls has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bf8d1eedf5c9cacc4424ab1a5ad0b3c0b6ef9506e047af1b64fb36bab79e3e"}},{"ruleId":"D1","level":"warning","message":{"text":"Reg::llvm_type (cyclomatic 16): Reg::llvm_type 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":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3373211c907424999ecd2f2955d0eabd12244c4149610e441dfceb1c7f1a7a4d"}},{"ruleId":"D1","level":"warning","message":{"text":"coroutine::coroutine_saved_local_eligibility (cyclomatic 16): coroutine::coroutine_saved_local_eligibility 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":"compiler/rustc_abi/src/layout/coroutine.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25b64f00db13b6edb322aca380d19c094c0db7d71d6590159303bf620c89335"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_path_segment (cyclomatic 16): LoweringContext::lower_path_segment 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":"compiler/rustc_ast_lowering/src/path.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e347ece66e5ffb8bf984c6c40129d9bffc4f192084474dc9742fee1800216027"}},{"ruleId":"D1","level":"warning","message":{"text":"MirBorrowckCtxt::is_mutable (cyclomatic 16): MirBorrowckCtxt::is_mutable 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":2561}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9ee16b751c8d67dccee7476095e5768759c7a83773b8394d534e62be067d91"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalizedConstraintGraph::traverse (cyclomatic 16): LocalizedConstraintGraph::traverse 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":"compiler/rustc_borrowck/src/polonius/constraints.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53a74389f34e9c0312924e504a0067808967fab4642f14e353946740294a4ae"}},{"ruleId":"D1","level":"warning","message":{"text":"MethodDef::expand_enum_method_body (cyclomatic 16): MethodDef::expand_enum_method_body has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/deriving/generic/mod.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4974d88d69aecb7b61a353896fcc335e166f989a2eceb1b2eec17cc41391983a"}},{"ruleId":"D1","level":"warning","message":{"text":"format::report_missing_placeholders (cyclomatic 16): format::report_missing_placeholders 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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcf3b901dffd5af051e1f08b65890591fd8a62cf56e5896bfbc700544fab500"}},{"ruleId":"D1","level":"warning","message":{"text":"inline_asm::codegen_inline_asm_terminator (cyclomatic 16): inline_asm::codegen_inline_asm_terminator 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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e31452054db1c91509b610ebe83d65f9220d4e280a41ddbaaf268d92883cf0"}},{"ruleId":"D1","level":"warning","message":{"text":"abi::get_attrs (cyclomatic 16): abi::get_attrs 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":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"443961754fe8c2061f677c8616eefa5a08350800b43327942cf9a432db2bc5bb"}},{"ruleId":"D1","level":"warning","message":{"text":"llvm_util::configure_llvm (cyclomatic 16): llvm_util::configure_llvm has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/llvm_util.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d783c84882476c05e842498c696d1d4f84f25da45aa55ce105f2d898cb288fe4"}},{"ruleId":"D1","level":"warning","message":{"text":"callee::get_fn (cyclomatic 16): callee::get_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":"compiler/rustc_codegen_llvm/src/callee.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd76e2aaf2d4b2f71ca02c2838dabb12f13796b4c5ea0ac0a86ac13b7702abb0"}},{"ruleId":"D1","level":"warning","message":{"text":"ModuleConfig::new (cyclomatic 16): ModuleConfig::new has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b410aef854c2c50a562816d78e1d2e59ada1d5e861bdfd6b73a230260ddf6af"}},{"ruleId":"D1","level":"warning","message":{"text":"common::i686_decorated_name (cyclomatic 16): common::i686_decorated_name 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":"compiler/rustc_codegen_ssa/src/common.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b1ebd69d801d2aa05634cf1c6883cfcc55631173db3b389fff7e582982de22"}},{"ruleId":"D1","level":"warning","message":{"text":"link::add_sanitizer_libraries (cyclomatic 16): link::add_sanitizer_libraries 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a7c6abeee331d5da672e1dfeb76db5a467fd300d6ce205b9464909e71dfce1"}},{"ruleId":"D1","level":"warning","message":{"text":"link::add_linked_symbol_object (cyclomatic 16): link::add_linked_symbol_object has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e567bb1471a79fb42b2f414bc8c2b207d360c950870462c5cb309b5314d311f"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::layout_compat (cyclomatic 16): InterpCx::layout_compat 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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af7e7a27225e04ea7d8d279bc4d5a70b8f165047ef5eebc5a4e568e3dc88926"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpCx::cast (cyclomatic 16): InterpCx::cast 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":"compiler/rustc_const_eval/src/interpret/cast.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd88f30a0324f238af0e5736f21e9248d97192e5f0a6cfd92e61b07b52194bad"}},{"ruleId":"D1","level":"warning","message":{"text":"Node::ty (cyclomatic 16): Node::ty 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":"compiler/rustc_hir/src/hir.rs"},"region":{"startLine":5320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86dee1d45260924f237debd0ae49a734143691889f0b8b47bc1c5c9fb14523c"}},{"ruleId":"D1","level":"warning","message":{"text":"WrongNumberOfGenericArgs::get_lifetime_args_suggestions_from_param_names (cyclomatic 16): WrongNumberOfGenericArgs::get_lifetime_args_suggestions_from_param_names 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":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff494632ac9ea2aaeed1fa65e0fd2060a59ab8a15b947314cdbf17de10f60d2"}},{"ruleId":"D1","level":"warning","message":{"text":"wfcheck::check_param_wf (cyclomatic 16): wfcheck::check_param_wf has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7c7e62aace23121f78071f12872e3013d0e962811e9c0c30d0b7cfc15155fa"}},{"ruleId":"D1","level":"warning","message":{"text":"wfcheck::check_type_defn (cyclomatic 16): wfcheck::check_type_defn 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"941da3165c5d083cafc1b5bf0f54ba035937e38c321d7977965b0e3332bc9eeb"}},{"ruleId":"D1","level":"warning","message":{"text":"compare_impl_item::compare_number_of_generics (cyclomatic 16): compare_impl_item::compare_number_of_generics 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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ce0da7cd9f3039ef57d00045d12ea57eb1d1d1bf5b13fbdb1483c2abf0104a"}},{"ruleId":"D1","level":"warning","message":{"text":"builtin::coerce_unsized_info (cyclomatic 16): builtin::coerce_unsized_info 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"829edcd9d00b8e46ff8cdeca93aace30835a72ba55b8d1f3585b4cafa5296fd5"}},{"ruleId":"D1","level":"warning","message":{"text":"item_bounds::remap_gat_vars_and_recurse_into_nested_projections (cyclomatic 16): item_bounds::remap_gat_vars_and_recurse_into_nested_projections 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":"compiler/rustc_hir_analysis/src/collect/item_bounds.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bb04f471268663e5fd3daf66bc73bfcc011d446a2d72ff80a38b8b941a72b8"}},{"ruleId":"D1","level":"warning","message":{"text":"State::print_inline_asm (cyclomatic 16): State::print_inline_asm 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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4d10758c1b4c8241e87a8da311c4d9d131b7b8da918c954ef5a88df9708d4e"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::lint_edition_dependent_dot_call (cyclomatic 16): FnCtxt::lint_edition_dependent_dot_call has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/prelude_edition_lints.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dbb2e808f9c37118911fae3baee95d46ed7f3a1db8f7bbcbab793f1d597fd9"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::set_not_found_span_label (cyclomatic 16): FnCtxt::set_not_found_span_label 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea50007f939847a44f21f5c5ddb37b5c663a7cdff507fb1422aac5e680f0deb8"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::suggest_enum_variant_for_method_call (cyclomatic 16): FnCtxt::suggest_enum_variant_for_method_call 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a205b2a3f8650162c0e60e9c9d1cabb5780ec89bba6e2a5425e3b0c956a14c9"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::compute_min_captures (cyclomatic 16): FnCtxt::compute_min_captures has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item declared inside it. 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"7273a01f353bd8f91db1ce65608ca6f76386fddf95dc17c1ea9e8201d9ca6823"}},{"ruleId":"D1","level":"warning","message":{"text":"FnCtxt::perform_2229_migration_analysis (cyclomatic 16): FnCtxt::perform_2229_migration_analysis 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0df9d1f6730bd19109918b8d2ea4ed90572c895db8fa4293c21b70308ca3b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Resolver::resolve_ident_in_scope_set_inner (cyclomatic 16): Resolver::resolve_ident_in_scope_set_inner 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46d20e07d6f958047e57c53a91e53f7839fb546fbae09d5b86977eeefdef6db"}},{"ruleId":"D1","level":"warning","message":{"text":"op::is_builtin_binop (cyclomatic 16): op::is_builtin_binop has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22187390ddbb285b96f29316d1036b5d160259e474ccb93662f26905af54855"}},{"ruleId":"D1","level":"warning","message":{"text":"fs::garbage_collect_session_directories (cyclomatic 16): fs::garbage_collect_session_directories 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c5c67a7628131186079acc7dc06b8df9b6062c9cdbf79f65792573a887d55d"}},{"ruleId":"D1","level":"warning","message":{"text":"CStore::report_target_modifiers_extended (cyclomatic 16): CStore::report_target_modifiers_extended 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b958ed4de8b8d33576f2a3a468b479e10ca90da2e531b15cf42a5aa75ff228"}},{"ruleId":"D1","level":"warning","message":{"text":"CStore::inject_allocator_crate (cyclomatic 16): CStore::inject_allocator_crate 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1310610eb9088df976b0ad75757474c6196240648f69909e417c5e3d67ac57"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector::process_command_line (cyclomatic 16): Collector::process_command_line 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":"compiler/rustc_metadata/src/native_libs.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d7f3c5ec412477610727cb6b30c2767ef86c37157596f41f3fd3df1415f96f"}},{"ruleId":"D1","level":"warning","message":{"text":"cstore_impl::provide (cyclomatic 16): cstore_impl::provide 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":"compiler/rustc_metadata/src/rmeta/decoder/cstore_impl.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff3e3bfdeb7ae91ecda0687ef5514ce8d0bc0e0f0f983697d71281cc63e20a7"}},{"ruleId":"D1","level":"warning","message":{"text":"FmtPrinter::print_type (cyclomatic 16): FmtPrinter::print_type has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"0778762dc0ef0eaceae68083c13c27eca8605f8e8705fc74cc72c4d63c8bd803"}},{"ruleId":"D1","level":"warning","message":{"text":"pretty::for_each_def (cyclomatic 16): pretty::for_each_def 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":3468}}}],"partialFingerprints":{"codehealthFindingId/v1":"7509093a46a6fff466e35efb40866abc57cfb3b68e7109ebb66c64e4c50f1222"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::expr_as_place (cyclomatic 16): Builder::expr_as_place 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":"compiler/rustc_mir_build/src/builder/expr/as_place.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72bc1b0de14836fa472123e80a3ecbe386b463926fcd832d78a62ec93fe2eb4"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::stmt_expr (cyclomatic 16): Builder::stmt_expr has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/expr/stmt.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c3c5bd963a6c7c4653b74a87b9a7d8d454f3814f42644752c94b07bd94d381"}},{"ruleId":"D1","level":"warning","message":{"text":"AddCallGuards::run_pass (cyclomatic 16): AddCallGuards::run_pass has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/add_call_guards.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfc8a1811ec0062b4eda910faa6e092234b2e2ea7e2538c26a0b33baee1003b"}},{"ruleId":"D1","level":"warning","message":{"text":"VnState::simplify_unary (cyclomatic 16): VnState::simplify_unary 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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"2221c96e15e50d63683cb248dfe22fb44aee01db0777005b4d279e7c82c04d17"}},{"ruleId":"D1","level":"warning","message":{"text":"TOFinder::process_assign (cyclomatic 16): TOFinder::process_assign 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":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4f2fdf8b5d8908eb1499d16b3e70ebcbc86c70eee0e036d9d8419b941ea692"}},{"ruleId":"D1","level":"warning","message":{"text":"CfgChecker::check_cleanup_control_flow (cyclomatic 16): CfgChecker::check_cleanup_control_flow 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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"576352c4fbe5cfe36e61b67bd3c67a9bdcf11eccdb25caaa238b62761b962ac4"}},{"ruleId":"D1","level":"warning","message":{"text":"dest_prop::save_as_intervals (cyclomatic 16): dest_prop::save_as_intervals 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":"compiler/rustc_mir_transform/src/dest_prop.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe8f0c72c5edc7b15a538e436e889b845b04a581c8ae7560badf0b055c87c80"}},{"ruleId":"D1","level":"warning","message":{"text":"eval_ctxt::should_rerun_after_erased_canonicalization (cyclomatic 16): eval_ctxt::should_rerun_after_erased_canonicalization 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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab99b7a6da85ea728eaa11335807b8df6aa1ee21419b5f6e19824cbcbf8f447"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::expected_ident_found (cyclomatic 16): Parser::expected_ident_found 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b379782cd3d098173cce1413cf637ee5f2e51970575eed511bdb7ea973e86aa8"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_floating_field_access (cyclomatic 16): Parser::parse_floating_field_access 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4b6ca1aaa4fade37ddf58ecda1f8b9dc779261a35596cf7e1ff328423c6b65"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_expr_labeled (cyclomatic 16): Parser::parse_expr_labeled 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1588258435c9d0f00791f10808662bcc19d6add8e7bc9253d8ec397de8df2e"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_generic_params (cyclomatic 16): Parser::parse_generic_params has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/generics.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf7467be8b231033d9704c1b4744bd3fdbea8dd43dfcb801a55239ba0243ea2"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::new (cyclomatic 16): Parser::new 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":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e161d56726a454a0d83da2efb8a3b1b3ad74562389b648eb8aa08b76af16ad8"}},{"ruleId":"D1","level":"warning","message":{"text":"PlaceInfo::split_column_ctors (cyclomatic 16): PlaceInfo::split_column_ctors has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/usefulness.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0c1c874e3a5181251ade76b01de7e7dde4a133b33dd1cf487e8005d6b00c13"}},{"ruleId":"D1","level":"warning","message":{"text":"print::write_struct_like (cyclomatic 16): print::write_struct_like 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":"compiler/rustc_pattern_analysis/src/rustc/print.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2d2462957de2879a73e3d2101a34981a93eb623b2af2bfec2a924af6b80e18"}},{"ruleId":"D1","level":"warning","message":{"text":"FnAbi::apply_attrs_callsite (cyclomatic 16): FnAbi::apply_attrs_callsite 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":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dca1750dd47893ea711d95ddf7573e7a102d80145d0cc9c7f2a5611eff2512"}},{"ruleId":"D1","level":"warning","message":{"text":"powerpc64::classify (cyclomatic 16): powerpc64::classify 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":"compiler/rustc_target/src/callconv/powerpc64.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a26a84a06319af6fad68a57abe161ba519d21f9b924d59985e3117bc872cee3"}},{"ruleId":"D1","level":"warning","message":{"text":"AutoTraitFinder::map_vid_to_region (cyclomatic 16): AutoTraitFinder::map_vid_to_region 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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cd8f5b3e6dc9f31109f85b26ba2c67728e6aba4973e885ecd1c1009d1eb839"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectionContext::assemble_candidates_for_unsizing (cyclomatic 16): SelectionContext::assemble_candidates_for_unsizing 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":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e9410304cca24efe7aa57b8e2d5f61b97f55bbfdedc2218876aca7d2219877"}},{"ruleId":"D1","level":"warning","message":{"text":"abi::fn_sig_for_fn_abi (cyclomatic 16): abi::fn_sig_for_fn_abi 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":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"650d3b6f5aa8fd0912e78362aeb4012d58f6a5e19ce23580135ab23cc3696b3a"}},{"ruleId":"D1","level":"warning","message":{"text":"abi::fn_abi_sanity_check (cyclomatic 16): abi::fn_abi_sanity_check 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 declared inside it (fn_arg_sanity_check, fn_arg_attrs_sanity_check). 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":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e49c043661f4d262382a56318096a1534879a04296bb191dbf835e3edb7b4e"}},{"ruleId":"D1","level":"warning","message":{"text":"OutlivesCollector::visit_ty (cyclomatic 16): OutlivesCollector::visit_ty 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":"compiler/rustc_type_ir/src/outlives.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ee97d8dae9da3417ddf1c272e76a69533489a2c34fc74f4908a6e94808a446"}},{"ruleId":"D1","level":"warning","message":{"text":"jn::yn (cyclomatic 16): jn::yn 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":"library/compiler-builtins/libm/src/math/jn.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ffb6b4fb51dc3785c2267de6be92515a51e991257c8fb268d156cccd82c8bf"}},{"ruleId":"D1","level":"warning","message":{"text":"TwoWaySearcher::next (cyclomatic 16): TwoWaySearcher::next 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":"library/core/src/str/pattern.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2e09889d05e4d49d3289ab132c73f2436a259d5f284f19c702dba963be6955"}},{"ruleId":"D1","level":"warning","message":{"text":"TwoWaySearcher::next_back (cyclomatic 16): TwoWaySearcher::next_back 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":"library/core/src/str/pattern.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"7341f6e826bbb9713e7d8839f04e3c5d7837b83c3b7644daf6a9aaedfbb9a267"}},{"ruleId":"D1","level":"warning","message":{"text":"Copier::copy (cyclomatic 16): Copier::copy 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":"library/std/src/sys/io/kernel_copy/linux.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"8016d7b5a12da23c6f4ac7b2b3716fb90343708685e849dea9b96dc8ebe9d8a0"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::fmt (cyclomatic 16): Command::fmt 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":"library/std/src/sys/process/unsupported.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3d702e9476aec67d0a00be6c5213d970bdc185a504e854b01c65baef3f284e"}},{"ruleId":"D1","level":"warning","message":{"text":"uefi::parse_lp_cmd_line (cyclomatic 16): uefi::parse_lp_cmd_line has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/args/uefi.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea37ebbe6b6a9e44f509565f5f07fc44c3fe776b377c3e6de241e3435203f20c"}},{"ruleId":"D1","level":"warning","message":{"text":"linux::getrandom (cyclomatic 16): linux::getrandom 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":"library/std/src/sys/random/linux.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da19b46cc1ad898b965c61986bf6c40ebd03c1bbb8d3aeec4edfbf8fdb12c8f"}},{"ruleId":"D1","level":"warning","message":{"text":"windows::append_bat_arg (cyclomatic 16): windows::append_bat_arg 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":"library/std/src/sys/args/windows.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0de5fe7aa9f387968b16d5817a3040c7298ac4525835a58632754dd85729af3"}},{"ruleId":"D1","level":"warning","message":{"text":"linux::copy_regular_files (cyclomatic 16): linux::copy_regular_files has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"library/std/src/sys/io/kernel_copy/linux.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a621a8b723c3aec2358ba1940a2385df8c208aeb943ab6464daefeae94207c6"}},{"ruleId":"D1","level":"warning","message":{"text":"Build::rustc_features (cyclomatic 16): Build::rustc_features has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/lib.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"31387a6873bb84c8f4092fbcf43b6c474261b166bddbcc7e26f957a0f630e09d"}},{"ruleId":"D1","level":"warning","message":{"text":"HirCollector::visit_testable (cyclomatic 16): HirCollector::visit_testable has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest/rust.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb47660e3b3d6b1c786c7054258a387fd528a55c718edd08907c1461e657034"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeBlocks::next (cyclomatic 16): CodeBlocks::next has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefbd9199cfbb6219d152c4810b0e789f9cfdfca9b2b80c175a5baba6e5c4daf"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkCollector::resolve_with_disambiguator_cached (cyclomatic 16): LinkCollector::resolve_with_disambiguator_cached has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fe2f424bd206256ce2ff839d692be028a6fe4128749def54f80b823d6aec89"}},{"ruleId":"D1","level":"warning","message":{"text":"ImplStripper::fold_item (cyclomatic 16): ImplStripper::fold_item has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/stripper.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5bd261d8fcd86f03c6546f9c198ffbcba5d54818889432de35332fade1ce4d"}},{"ruleId":"D1","level":"warning","message":{"text":"format::href_with_root_path (cyclomatic 16): format::href_with_root_path has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/format.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"1178c20f1a05fd050273d9a83dc15a7149d3f30a99e0adde35bfc98b60ece416"}},{"ruleId":"D1","level":"warning","message":{"text":"sidebar::print_sidebar (cyclomatic 16): sidebar::print_sidebar 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":"src/librustdoc/html/render/sidebar.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"40870684149422bce68966cc8c43a36bbbb860e5edcc684d0de59bb1ac1f5a5c"}},{"ruleId":"D1","level":"warning","message":{"text":"clean::clean_use_statement_inner (cyclomatic 16): clean::clean_use_statement_inner has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":3159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9977b29b0ca785c49883aab4c209f04c8168e9d37684b03012ff41a99af64f31"}},{"ruleId":"D1","level":"warning","message":{"text":"PostExpansionEarlyAttributes::check_attribute (cyclomatic 16): PostExpansionEarlyAttributes::check_attribute has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/attrs/mod.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96a3d844d4bc769a00ec1c9639f72f18ae021326405760709493c8034ebd3ce"}},{"ruleId":"D1","level":"warning","message":{"text":"Documentation::check_attributes (cyclomatic 16): Documentation::check_attributes 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":"src/tools/clippy/clippy_lints/src/doc/mod.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"3092ef7c50f60a706bf9853dd1db5180c2dd599cb663c5933b00c0c68d379cd8"}},{"ruleId":"D1","level":"warning","message":{"text":"IdentVisitor::visit_id (cyclomatic 16): IdentVisitor::visit_id has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/min_ident_chars.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c633aa48e5b1daa5568a507074c12e747862a8cee4eb5570a44046259ef574"}},{"ruleId":"D1","level":"warning","message":{"text":"NewWithoutDefault::check_item (cyclomatic 16): NewWithoutDefault::check_item has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/new_without_default.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5294bc346fcc62203a8b6dd4624c21fe9bbb28e7697c8e16076151615d6f9b"}},{"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":"src/tools/clippy/clippy_lints/src/no_effect.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"7387a19881fe7c5b42a4c35aa48f59ad87927cc7cca3c51f0bd46fdaf24ae540"}},{"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":"src/tools/clippy/clippy_lints/src/unnecessary_wraps.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff5a0a0f6dc58d178e6145ba3794af232120569f8c08a20e1bf0168f6197f46"}},{"ruleId":"D1","level":"warning","message":{"text":"map_unwrap_or::check (cyclomatic 16): 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":"src/tools/clippy/clippy_lints/src/methods/map_unwrap_or.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"be55090f874bbb68b85589b0e98584aa97362f54c1ca80f8d0e1711f5dd418f8"}},{"ruleId":"D1","level":"warning","message":{"text":"question_mark::check_if_let_some_or_err_and_early_return (cyclomatic 16): 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":"src/tools/clippy/clippy_lints/src/question_mark.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"222aaee8c44a44ca5c6f6f10c5492cbef76d2996bb488b2a68416928156da61d"}},{"ruleId":"D1","level":"warning","message":{"text":"booleans::simplify_not (cyclomatic 16): 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":"src/tools/clippy/clippy_lints/src/booleans.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"a802b69ec3366864ba8c5fa650adeb777dd19ad3bba35bcfc75c25809d16ed70"}},{"ruleId":"D1","level":"warning","message":{"text":"or_fun_call::check_unwrap_or_default (cyclomatic 16): or_fun_call::check_unwrap_or_default has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/or_fun_call.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"92454376e5793768e3822831e77d1026f3d4e42022bce3a8d508fa61319221a0"}},{"ruleId":"D1","level":"warning","message":{"text":"markdown::check_word (cyclomatic 16): markdown::check_word has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 8 of the 16 points are its own statements and the rest belongs to 3 function items declared inside it (is_camel_case, has_underscore, has_hyphen). 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":"src/tools/clippy/clippy_lints/src/doc/markdown.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc59d0112e1678374f57f1e89c253996b943d106cfd6319d03e80ff8cdf040c1"}},{"ruleId":"D1","level":"warning","message":{"text":"float_cmp::check (cyclomatic 16): float_cmp::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":"src/tools/clippy/clippy_lints/src/operators/float_cmp.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24f1a68dd3c18e22d941ca5ee1c2371d3c51356f23b7cb7e97bf09be784b17b"}},{"ruleId":"D1","level":"warning","message":{"text":"redundant_guards::check (cyclomatic 16): redundant_guards::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":"src/tools/clippy/clippy_lints/src/matches/redundant_guards.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"279383000e8ff11543242954e9a7b6e15e3340199d608fe7e2707fba8bf6db66"}},{"ruleId":"D1","level":"warning","message":{"text":"no_effect::has_no_effect (cyclomatic 16): no_effect::has_no_effect has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/no_effect.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a924b174a2b757b659f0aa8faf660431b314e59345e4fc7e82ded692240a15fd"}},{"ruleId":"D1","level":"warning","message":{"text":"manual_clamp::is_call_max_min_pattern (cyclomatic 16): 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 declared inside it (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":"src/tools/clippy/clippy_lints/src/manual_clamp.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb8f15d360bd50669502efda8b2be958e83d7175fc426605213ea64c5afe4ff"}},{"ruleId":"D1","level":"warning","message":{"text":"HirEqInterExpr::eq_item (cyclomatic 16): HirEqInterExpr::eq_item 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":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f06b00b5292f850514e9aa233b70fc26c1203f05c0cb5c4f88d6000f5c140d"}},{"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 declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/lintcheck/src/input.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4efdc55ff7fac8b29ba5f3e1c8693225a4b95ca38304d6244cbf71ee057b1c5"}},{"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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/lintcheck/src/main.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c53f4177711a75a2cdb256bea4a6fe6c5281233536b741568129e01bfd3e076"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextPrivExt::tb_reborrow (cyclomatic 16): EvalContextPrivExt::tb_reborrow has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/borrow_tracker/tree_borrows/mod.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cc106c0dab8afab247bcc71ba367e5c83e2580d487e9a5c3509ffdbe1d9bba"}},{"ruleId":"D1","level":"warning","message":{"text":"VClockAlloc::report_data_race (cyclomatic 16): VClockAlloc::report_data_race has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/concurrency/data_race.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a95d8638c5b113a37a9a99369b881e2bdc4ed8ea5c0334ad70ddb78a3a7e46f"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::emulate_x86_bmi_intrinsic (cyclomatic 16): EvalContextExt::emulate_x86_bmi_intrinsic has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/x86/bmi.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"36de9a43479d2896d5900ba4fe8d40a67e25488d4ffae73d790d2c558c6c1fed"}},{"ruleId":"D1","level":"warning","message":{"text":"EvalContextExt::epoll_ctl (cyclomatic 16): EvalContextExt::epoll_ctl has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/linux_like/epoll.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"521e9acbc77e5f08cce3b43074e8cbfeb181475b488d5e6c4d548e0a131cd96f"}},{"ruleId":"D1","level":"warning","message":{"text":"diagnostics::report_msg (cyclomatic 16): diagnostics::report_msg has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/diagnostics.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26a83cc05cd2e692a50e9a5f81d1aaf76cc5ead2290381bafea061cee3e5350"}},{"ruleId":"D1","level":"warning","message":{"text":"UseTree::expand_impl (cyclomatic 16): UseTree::expand_impl has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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/tools/rust-analyzer/crates/hir-def/src/item_tree.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"0897a5aa9bc8b0ecfb42264598c2dffcc3abe113ec4d104509f8ef0650e3c594"}},{"ruleId":"D1","level":"warning","message":{"text":"DefMap::resolve_path_fp_with_macro_single (cyclomatic 16): DefMap::resolve_path_fp_with_macro_single has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca158f2fe6287129c0696b1764951fb11f826613fb0480fcfe1728376e96c17"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionSignature::with_source_map (cyclomatic 16): FunctionSignature::with_source_map has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/signatures.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a94f74ada86e2d30d16eed50889b4d003ff2479f472f0d1ad699c087aeb9b5"}},{"ruleId":"D1","level":"warning","message":{"text":"find_path::find_local_import_locations (cyclomatic 16): find_path::find_local_import_locations has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/find_path.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04c527de2b98df6c0ef64d5d4b80fb08e30e03efd161b35538a380121ef0785"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::compute_min_captures (cyclomatic 16): InferenceContext::compute_min_captures has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item declared inside it. 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/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcdf0abed69ed7e38ee96b515c182f3a3bc3aa42820169d65a7ac8c939a1b89"}},{"ruleId":"D1","level":"warning","message":{"text":"PathLoweringContext::resolve_path_in_value_ns (cyclomatic 16): PathLoweringContext::resolve_path_in_value_ns 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":"src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"92be390bd92e25231b974fb3b2440e2155069a6fc75bf87c3453907365883735"}},{"ruleId":"D1","level":"warning","message":{"text":"MirLowerCtx::lower_expr_as_place_without_adjust (cyclomatic 16): MirLowerCtx::lower_expr_as_place_without_adjust 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":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower/as_place.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"051951c651520e7dd2317aa20fac67f97ad8aee92454d006797a3595ec127ce5"}},{"ruleId":"D1","level":"warning","message":{"text":"Filler::fill_body (cyclomatic 16): Filler::fill_body 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":"src/tools/rust-analyzer/crates/hir-ty/src/mir/monomorphization.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"014949571fa50990fff23b61d89faee014eb21660cea36fbadaa24653c41418c"}},{"ruleId":"D1","level":"warning","message":{"text":"Generalizer::tys (cyclomatic 16): Generalizer::tys has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"4289b4d26a05000192aaacdd2a2f2630e77ee229c2bc922af68bb90dc236364a"}},{"ruleId":"D1","level":"warning","message":{"text":"infer::infer_query_with_inspect (cyclomatic 16): infer::infer_query_with_inspect 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":"src/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ce1798598bf7ae714dceacc159405324bab1cac48cad6b5460be3f5da0f994"}},{"ruleId":"D1","level":"warning","message":{"text":"implicit_drop::hints (cyclomatic 16): implicit_drop::hints 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":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/implicit_drop.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a159048ebcb8fb92c64ab7690fc2c61d1c2c535e017748d5e374bbaa8cbf45"}},{"ruleId":"D1","level":"warning","message":{"text":"render::try_expr (cyclomatic 16): render::try_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":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"faae56208331b352a9963d25649d200cad747145f64e4101ff458463f3cc7dea"}},{"ruleId":"D1","level":"warning","message":{"text":"rename::find_definitions (cyclomatic 16): rename::find_definitions 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":"src/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b55a814a47e4321ace0e3314a7ecfc644d8fa3714c4c6d676358f41147b138"}},{"ruleId":"D1","level":"warning","message":{"text":"hover::goto_type_action_for_def (cyclomatic 16): hover::goto_type_action_for_def 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":"src/tools/rust-analyzer/crates/ide/src/hover.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b0685bbccf3402b72bf1d78730e6a687643634c0adf62f64d104a4408df682"}},{"ruleId":"D1","level":"warning","message":{"text":"wrap_unwrap_cfg_attr::attempt_get_derive (cyclomatic 16): wrap_unwrap_cfg_attr::attempt_get_derive has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/wrap_unwrap_cfg_attr.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4a5bc0556dc9cafc10da1cc91d40acd895d1e55eda670612892af40a3ae4ed"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionContext::new (cyclomatic 16): CompletionContext::new has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0919446c8f2dda21e678820258c05ef7be3c844530d8090090de33ac3e35ae1"}},{"ruleId":"D1","level":"warning","message":{"text":"merge_imports::use_tree_cmp (cyclomatic 16): merge_imports::use_tree_cmp 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":"src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"debb08bb97b677abf936467b40c135c3627c72f311c0dc65215613460db4e4d2"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceBuildScripts::run_command (cyclomatic 16): WorkspaceBuildScripts::run_command has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d452bf5102d3f29c449ab3b43feedaa044a6755865e2a9aeab39e338c0d025"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceBuildScripts::build_command (cyclomatic 16): WorkspaceBuildScripts::build_command has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fe35cb206eae07854452a60f2053963e1dfa03ac65df30a55b43ead7543467"}},{"ruleId":"D1","level":"warning","message":{"text":"Sysroot::load_workspace (cyclomatic 16): Sysroot::load_workspace has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/sysroot.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c81424ffa480a5f1f7565e271e25cb1ef0db360dfa2bdca36143c7ae0cacf7"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectWorkspace::load_cargo (cyclomatic 16): ProjectWorkspace::load_cargo 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":"src/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"471e7937d98bdb777cf04fd8649c80b7463b9824e6f4a77dc2faae6a1e872017"}},{"ruleId":"D1","level":"warning","message":{"text":"workspace::project_json_to_crate_graph (cyclomatic 16): workspace::project_json_to_crate_graph has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a92ccebb7d6ee5c6729bb53955c37233ed83d74921e18da29d2c9b3ba38b99c"}},{"ruleId":"D1","level":"warning","message":{"text":"FlycheckActor::check_command (cyclomatic 16): FlycheckActor::check_command has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/flycheck.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"0942849de81ca332a288b36f3cd578f17b2137f867346ed31e13ee98d42e4a20"}},{"ruleId":"D1","level":"warning","message":{"text":"session::run_session (cyclomatic 16): session::run_session has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/session.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f5e8e0927b0e1a87f65612d1a28c25103fc9f9201e9ff3f0208a4009ee347a"}},{"ruleId":"D1","level":"warning","message":{"text":"AstIdMap::from_source (cyclomatic 16): AstIdMap::from_source has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/span/src/ast_id.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"372583f6a9ef38eb130da850a63035bfaf86dde3f3440238e50248c155ae3ebe"}},{"ruleId":"D1","level":"warning","message":{"text":"lints::generate_lint_descriptor (cyclomatic 16): lints::generate_lint_descriptor has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to one function item declared inside it. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/xtask/src/codegen/lints.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"95933f25f050fd78e6cbe2d523a2c57a498bb926a813a31e31c21adcce55884d"}},{"ruleId":"D1","level":"warning","message":{"text":"notes::get_next_line_component (cyclomatic 16): notes::get_next_line_component 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":"src/tools/rust-analyzer/xtask/src/publish/notes.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a1dd2b58c25072e37f1b3a5f35c5881f9398650967d3ae6c97999728c7da13"}},{"ruleId":"D1","level":"warning","message":{"text":"MacroBranch::rewrite (cyclomatic 16): MacroBranch::rewrite has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/macros.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"25084a690f226273d1a967ac5bcc08c0211aa91d445e8ea695eda63bda3e4c74"}},{"ruleId":"D1","level":"warning","message":{"text":"expr::rewrite_struct_lit (cyclomatic 16): expr::rewrite_struct_lit 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":"src/tools/rustfmt/src/expr.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f52c9b8a83107bf3d0b582969179eceaef886605a6bfffddf70201fde51b97"}},{"ruleId":"D1","level":"warning","message":{"text":"runSearch (cyclomatic 16): runSearch has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71006375c841814a988904b4b788f8ac824d5829f78c241b6555a0cf05e600e"}},{"ruleId":"D1","level":"warning","message":{"text":"showResults (cyclomatic 16): showResults has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":5233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfde735a84aaf3566f0b59f209f965ceed305eff9a01b53d43ea4209e8dbfbe"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 16): (anonymous) has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":5452}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62ecf773ec75a1d14569c80ab405932245e52bdbedd84ed3e7d93d8ead6e2d6"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_loongarch::gen_test_body (cognitive 224): stdarch_gen_loongarch::gen_test_body has cognitive complexity 224 (threshold 15). Drivers by points: loops 144, if/else 54, boolean chains 14, match/switch 12 (nesting depth added 84). 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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"88784674f1798e71786c491e4957df5c4ea9eaaede1f50d87e32b8b400844a0f"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::add_missing_lifetime_specifiers_label (cognitive 180): LateResolutionVisitor::add_missing_lifetime_specifiers_label has cognitive complexity 180 (threshold 15). Drivers by points: if/else 120, match/switch 35, loops 17, boolean chains 8 (nesting depth added 113). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":4077}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3453362e8267aea8d42e018b0f5196bddd0b52e9bdd055dbdc0e4108daed91"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_traits_to_import (cognitive 178): FnCtxt::suggest_traits_to_import has cognitive complexity 178 (threshold 15). Drivers by points: if/else 107, match/switch 33, boolean chains 19, loops 19 (nesting depth added 97). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":4147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4391a9c2ba92df2cdfb11254cce4ad508dacd29d44c648a6d99d1485ce4de6a5"}},{"ruleId":"D2","level":"warning","message":{"text":"makeSearchTreeFromBase64 (cognitive 176): makeSearchTreeFromBase64 has cognitive complexity 176 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3009}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fe9ee09943cc94235bd85ba0cd2c1f35ef759b5a773898b4dc00b4d98bb3ce"}},{"ruleId":"D2","level":"warning","message":{"text":"simd::codegen_simd_intrinsic_call (cognitive 174): simd::codegen_simd_intrinsic_call has cognitive complexity 174 (threshold 15). Drivers by points: if/else 99, match/switch 44, loops 28, boolean chains 3 (nesting depth added 80). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ed92347fd3dadabc31e00cca63723fc67783f5b68f41f76a76cf3f6eb44ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis::classify_name_ref (cognitive 172): analysis::classify_name_ref has cognitive complexity 172 (threshold 15). Drivers by points: if/else 80, match/switch 68, boolean chains 15, loops 9 (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"894ab9b1edf81a938c4c90ec6c2343f06c60a346b5a75becd79870f720b4ad84"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::report_selection_error (cognitive 170): TypeErrCtxt::report_selection_error has cognitive complexity 170 (threshold 15). Drivers by points: if/else 130, boolean chains 19, match/switch 17, loops 4 (nesting depth added 91). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"420a672b6e22e5a698f86776d58525fdbe8900fb5e8e09162ed54776471a7446"}},{"ruleId":"D2","level":"warning","message":{"text":"search_index::build_index (cognitive 166): search_index::build_index has cognitive complexity 166 (threshold 15). Drivers by points: if/else 101, loops 38, boolean chains 14, match/switch 13 (nesting depth added 88). Of this number, 128 points are the body\u0027s own statements and 38 belong to 3 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"522219549c2525cfc8156dd60bfa275a8ca92cf75dbbe3675df41902ccc00fc2"}},{"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 101, match/switch 59, 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":"src/tools/clippy/clippy_lints/src/methods/mod.rs"},"region":{"startLine":5268}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbce1e13519b3d4340ce2e470b070a8be01b83fa639ac1a8bccf0f700c688b60"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::visit_rvalue (cognitive 164): TypeChecker::visit_rvalue has cognitive complexity 164 (threshold 15). Drivers by points: if/else 120, loops 30, match/switch 9, boolean chains 5 (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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"36257eb9a17571341ba00fa40af10f7f0cb5953af4d4c4f4fb7487694a78f346"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::eval_simd_intrinsic (cognitive 161): InterpCx::eval_simd_intrinsic has cognitive complexity 161 (threshold 15). Drivers by points: if/else 72, match/switch 51, loops 36, boolean chains 2 (nesting depth added 88). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf90c5572d0228eedffc2880d0eff96f088848afb86c9e344dd330f0574f37e"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::cargo (cognitive 155): Builder::cargo has cognitive complexity 155 (threshold 15). Drivers by points: if/else 116, boolean chains 18, match/switch 15, loops 6 (nesting depth added 29). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57472cf59217d4c73b0ff6e1a08409f616f021b451d0838a782497bd49cab0f"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::parse_inner (cognitive 151): Config::parse_inner has cognitive complexity 151 (threshold 15). Drivers by points: if/else 104, boolean chains 25, match/switch 19, loops 3 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/config.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c599b4934a667585573c0c5b6edca22b24810ba761df00c69c49166bac6ca70"}},{"ruleId":"D2","level":"warning","message":{"text":"Ty::hir_fmt (cognitive 149): Ty::hir_fmt has cognitive complexity 149 (threshold 15). Drivers by points: if/else 102, match/switch 42, boolean chains 3, loops 2 (nesting depth added 78). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/display.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9f7fadfd48343a4d604ef52df58e968d69ad6163b2984ef5b676adf3aa251d"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::report_mutability_error (cognitive 148): MirBorrowckCtxt::report_mutability_error has cognitive complexity 148 (threshold 15). Drivers by points: if/else 107, match/switch 27, loops 10, boolean chains 4 (nesting depth added 86). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7706cdad1cdb2fedfc5375e97e590c0fa964845d83d6fc7161a1566bdd3088"}},{"ruleId":"D2","level":"warning","message":{"text":"format::make_format_args (cognitive 147): format::make_format_args has cognitive complexity 147 (threshold 15). Drivers by points: if/else 85, match/switch 48, loops 9, boolean chains 5 (nesting depth added 82). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"313226a620f4e7dc3c69ab0247ce523153a9637d9687b4ac83b59d6fe1fa0bfe"}},{"ruleId":"D2","level":"warning","message":{"text":"type_names::push_debuginfo_type_name (cognitive 142): type_names::push_debuginfo_type_name has cognitive complexity 142 (threshold 15). Drivers by points: if/else 113, match/switch 13, loops 12, boolean chains 4 (nesting depth added 63). Of this number, 138 points are the body\u0027s own statements and 4 belong to 2 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/debuginfo/type_names.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"32df240853c3c366f0fa80750a1bd0d304a287dc43b692ca01288ca48ad2638f"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::resolve_path_with_ribs (cognitive 142): Resolver::resolve_path_with_ribs has cognitive complexity 142 (threshold 15). Drivers by points: if/else 104, boolean chains 18, match/switch 15, loops 5 (nesting depth added 75). Of this number, 140 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdb6a3eee64b0f350016f557c54e8f26d17aaa764868d3afded584e0f8853de"}},{"ruleId":"D2","level":"warning","message":{"text":"ThirBuildCx::make_mirror_unadjusted (cognitive 142): ThirBuildCx::make_mirror_unadjusted has cognitive complexity 142 (threshold 15). Drivers by points: if/else 75, match/switch 59, loops 5, boolean chains 3 (nesting depth added 76). Of this number, 138 points are the body\u0027s own statements and 4 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72ad2e4c1f5508228e2aaec100eb0aada2fa5bdb3f8cc11b850fcdfb781fb16"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::explain_captures (cognitive 141): MirBorrowckCtxt::explain_captures has cognitive complexity 141 (threshold 15). Drivers by points: if/else 96, match/switch 22, boolean chains 12, loops 11 (nesting depth added 88). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d09d65d1ea4e3f80e50069e195530640b18331beaac525f9d183895980811e"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::note_and_explain_type_err (cognitive 141): TypeErrCtxt::note_and_explain_type_err has cognitive complexity 141 (threshold 15). Drivers by points: if/else 95, match/switch 20, boolean chains 14, loops 12 (nesting depth added 86). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"455333ec3882be71da303c9b61033a93f47b3ec73bec28ce2fda63f29972576f"}},{"ruleId":"D2","level":"warning","message":{"text":"intrinsic::generic_simd_intrinsic (cognitive 139): intrinsic::generic_simd_intrinsic has cognitive complexity 139 (threshold 15). Drivers by points: if/else 78, match/switch 50, boolean chains 7, loops 4 (nesting depth added 52). Of this number, 136 points are the body\u0027s own statements and 3 belong to 3 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5d9afb288336d821b5da892f35168eafaabd76334cdf19e2667dc41c16f135"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_inline_asm (cognitive 137): LoweringContext::lower_inline_asm has cognitive complexity 137 (threshold 15). Drivers by points: if/else 92, match/switch 27, loops 11, boolean chains 7 (nesting depth added 78). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/asm.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91ef36371d9f27aec23f858c6a04231e3ef922765629a4cd409ba023f523d6c"}},{"ruleId":"D2","level":"warning","message":{"text":"MirLowerCtx::lower_expr_to_place_without_adjust (cognitive 137): MirLowerCtx::lower_expr_to_place_without_adjust has cognitive complexity 137 (threshold 15). Drivers by points: if/else 68, match/switch 56, loops 9, boolean chains 4 (nesting depth added 71). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e0d5b34de570f073bd7a3197ad4f7a5e83ca10eac2cb59382b0e6772faa46a"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::eval_rvalue (cognitive 134): Evaluator::eval_rvalue has cognitive complexity 134 (threshold 15). Drivers by points: match/switch 68, if/else 54, loops 12 (nesting depth added 85). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ad773a4675c98cf9bc284fb086d637d89c08f79befd0336d141c6bf0977adf"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_deref_or_ref (cognitive 133): FnCtxt::suggest_deref_or_ref has cognitive complexity 133 (threshold 15). Drivers by points: if/else 103, boolean chains 14, match/switch 13, loops 3 (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2943}}}],"partialFingerprints":{"codehealthFindingId/v1":"129adf9d422bbad925fe86624c3505a8cee0bfc92038b063469135f3f8bcc9a4"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalysisStats::run_inference (cognitive 132): AnalysisStats::run_inference has cognitive complexity 132 (threshold 15). Drivers by points: if/else 113, match/switch 8, boolean chains 6, loops 5 (nesting depth added 77). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"074aa8ca9f1fedaabf13dbb4da48293620dd98296c703d4940292e8b96ef0dfb"}},{"ruleId":"D2","level":"warning","message":{"text":"simd::generic_simd_intrinsic (cognitive 129): simd::generic_simd_intrinsic has cognitive complexity 129 (threshold 15). Drivers by points: if/else 54, match/switch 44, loops 22, boolean chains 9 (nesting depth added 38). Of this number, 109 points are the body\u0027s own statements and 20 belong to 5 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f68e086151aa76ec11d51993784a806014d2bf39b3b6d711f6a759bbd164c5"}},{"ruleId":"D2","level":"warning","message":{"text":"expr::complete_expr_path (cognitive 128): expr::complete_expr_path has cognitive complexity 128 (threshold 15). Drivers by points: if/else 84, match/switch 32, boolean chains 6, loops 6 (nesting depth added 71). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27deeb8f21a004d091d21fb2d4b26310b6b6bd5d18e16c4c49bb2e0df61ba17"}},{"ruleId":"D2","level":"warning","message":{"text":"pow::pow (cognitive 127): pow::pow has cognitive complexity 127 (threshold 15). Drivers by points: if/else 122, boolean chains 5 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/pow.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"055cc836698918fa595b15c528f820a31d5a7992824ee1a0b8dc344e9f1ca5c5"}},{"ruleId":"D2","level":"warning","message":{"text":"miri::main (cognitive 126): miri::main has cognitive complexity 126 (threshold 15). Drivers by points: if/else 99, match/switch 11, loops 9, boolean chains 7 (nesting depth added 34). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/bin/miri.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"176de429d5f341bb84437755088f805b16202549836482b227ab51f8a58e1de6"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::label_fn_like (cognitive 124): FnCtxt::label_fn_like has cognitive complexity 124 (threshold 15). Drivers by points: if/else 70, loops 28, match/switch 17, boolean chains 9 (nesting depth added 76). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b7c216b82e5baa794bd3020cd72d6be9b76009fb002b88cc04b1788e0bdf7a"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::handle_unsatisfied_predicates (cognitive 124): FnCtxt::handle_unsatisfied_predicates has cognitive complexity 124 (threshold 15). Drivers by points: if/else 69, match/switch 27, loops 17, boolean chains 11 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"b004c6bed00bc90b7c393ac6d28cd12f7ed4f2c54628fc8931c3e3b52c59d214"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::note_type_err (cognitive 123): TypeErrCtxt::note_type_err has cognitive complexity 123 (threshold 15). Drivers by points: if/else 77, match/switch 21, boolean chains 19, loops 6 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a85cb102b31fb717d77d93207ebdd9477453e76df061d9786e77b5bfdd8258f"}},{"ruleId":"D2","level":"warning","message":{"text":"doc::check_doc (cognitive 123): doc::check_doc has cognitive complexity 123 (threshold 15). Drivers by points: if/else 81, boolean chains 22, match/switch 14, loops 6 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/doc/mod.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe1e3f9d3bbb2375f8a3dd10172aa0ff5a6b987b37fa1720d6508b32fe52bf4"}},{"ruleId":"D2","level":"warning","message":{"text":"lists::write_list (cognitive 122): lists::write_list has cognitive complexity 122 (threshold 15). Drivers by points: if/else 93, boolean chains 19, loops 6, match/switch 4 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/lists.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"698e19bc6be5c4fc95bf54d1f58f1943ff903dc79888db58074d079e0935adc1"}},{"ruleId":"D2","level":"warning","message":{"text":"Options::from_matches (cognitive 121): Options::from_matches has cognitive complexity 121 (threshold 15). Drivers by points: if/else 62, match/switch 35, loops 14, boolean chains 10 (nesting depth added 44). Of this number, 119 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/config.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17c6f6637b84ad1c34d620e9e5062fbecb85317cb738f1469bc61706d49b406"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCallDiagCtxt::labels_and_suggestion_text (cognitive 120): FnCallDiagCtxt::labels_and_suggestion_text has cognitive complexity 120 (threshold 15). Drivers by points: if/else 77, match/switch 31, loops 7, boolean chains 5 (nesting depth added 71). Of this number, 119 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":2527}}}],"partialFingerprints":{"codehealthFindingId/v1":"2282ed7e6e09a1493f2db0e166d751911f9a79549e763fecf4e5416bc57b61ac"}},{"ruleId":"D2","level":"warning","message":{"text":"layout::layout_of_uncached (cognitive 120): layout::layout_of_uncached has cognitive complexity 120 (threshold 15). Drivers by points: if/else 90, match/switch 24, boolean chains 6 (nesting depth added 72). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a043b1a13a025f8818cb75ba3e35d6e36632ca10bf5faa782a1374e90594614"}},{"ruleId":"D2","level":"warning","message":{"text":"Module::diagnostics (cognitive 120): Module::diagnostics has cognitive complexity 120 (threshold 15). Drivers by points: if/else 57, loops 35, match/switch 21, boolean chains 7 (nesting depth added 77). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"b729abcbe74da52be1325825f2629e87cb8efc7b7d8e13323499c2fa355d85c2"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::maybe_report_ambiguity (cognitive 118): TypeErrCtxt::maybe_report_ambiguity has cognitive complexity 118 (threshold 15). Drivers by points: if/else 96, match/switch 15, boolean chains 7 (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcb72cd5c903305a5beb863d17799d83a85f4682cd1cc44767e7c332e142ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::codegen_inline_asm (cognitive 117): Builder::codegen_inline_asm has cognitive complexity 117 (threshold 15). Drivers by points: if/else 77, match/switch 20, loops 18, boolean chains 2 (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c8ee41c33ac90e5c7b4d72f6b2b32522576bac7a8915fcca4bd23a92bb7d5e"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::validate_res_from_ribs (cognitive 116): Resolver::validate_res_from_ribs has cognitive complexity 116 (threshold 15). Drivers by points: if/else 79, match/switch 28, loops 6, boolean chains 3 (nesting depth added 77). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84442eb317d24964a800784e48b484235314a00d30d66a0cc99782e4b9a9e4a"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::report_similar_impl_candidates (cognitive 116): TypeErrCtxt::report_similar_impl_candidates has cognitive complexity 116 (threshold 15). Drivers by points: if/else 92, loops 12, boolean chains 10, match/switch 2 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a4af98190132b32dd50e0c3a81f3822030c6cb973361404570840ce051bae1"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_expr_inner (cognitive 116): InferenceContext::infer_expr_inner has cognitive complexity 116 (threshold 15). Drivers by points: match/switch 56, if/else 47, loops 10, boolean chains 3 (nesting depth added 59). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"218c022d2f34776f8da887668cb38bd8780bfb0c7106c7b233dfc0ddc9ba1b41"}},{"ruleId":"D2","level":"warning","message":{"text":"style::check_file_style (cognitive 116): style::check_file_style has cognitive complexity 116 (threshold 15). Drivers by points: if/else 66, boolean chains 44, match/switch 5, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/style.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd08d5719c7028af55b5a9ff325d13ea54cfcaf14b77d5c2f6415f747aafc920"}},{"ruleId":"D2","level":"warning","message":{"text":"sanity::check (cognitive 115): sanity::check has cognitive complexity 115 (threshold 15). Drivers by points: if/else 75, boolean chains 21, loops 13, match/switch 6 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/sanity.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c21cc7d651fef9b8fc7e22884a39332061643076e45a6562e00e2abf179f3b"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::codegen_inline_asm (cognitive 111): Builder::codegen_inline_asm has cognitive complexity 111 (threshold 15). Drivers by points: if/else 66, match/switch 30, loops 11, boolean chains 4 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5109cc4808863cd64242b1b975854b723d9bb06a1a913f8097fa932450010c"}},{"ruleId":"D2","level":"warning","message":{"text":"collect_intra_doc_links::resolution_failure (cognitive 111): collect_intra_doc_links::resolution_failure has cognitive complexity 111 (threshold 15). Drivers by points: if/else 86, match/switch 12, loops 8, boolean chains 5 (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"5063e37ad595dab4440471bb38644d24cdfaeda7e69b4c6a6bc39bdd8e968619"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::handle_event (cognitive 111): GlobalState::handle_event has cognitive complexity 111 (threshold 15). Drivers by points: if/else 62, boolean chains 19, loops 16, match/switch 14 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebce23fdf059e26da6c14dcdf6ae698be940aecfca108479ca36ea71986aea3"}},{"ruleId":"D2","level":"warning","message":{"text":"print_item::item_trait (cognitive 110): print_item::item_trait has cognitive complexity 110 (threshold 15). Drivers by points: if/else 62, loops 36, boolean chains 9, match/switch 3 (nesting depth added 45). Of this number, 103 points are the body\u0027s own statements and 7 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"9361a54af9e388ea28c2112d7e07b096e15bc115bf7ec6074422fdd92cdfdbc9"}},{"ruleId":"D2","level":"warning","message":{"text":"DefWithBody::diagnostics (cognitive 110): DefWithBody::diagnostics has cognitive complexity 110 (threshold 15). Drivers by points: match/switch 63, if/else 27, loops 19, boolean chains 1 (nesting depth added 76). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/lib.rs"},"region":{"startLine":2023}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adb7ec16839b8c3e584ee6413f91d26aee85a6dec9c4c358e2e054542bf60c5"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprCollector::maybe_collect_expr (cognitive 110): ExprCollector::maybe_collect_expr has cognitive complexity 110 (threshold 15). Drivers by points: if/else 82, match/switch 21, loops 6, boolean chains 1 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b556d830ace2aab7faf60d7e4530d5b88ed4136ac8652f0d8a8c16b81c7cce"}},{"ruleId":"D2","level":"warning","message":{"text":"asm::expand_preparsed_asm (cognitive 107): asm::expand_preparsed_asm has cognitive complexity 107 (threshold 15). Drivers by points: if/else 71, match/switch 26, loops 9, boolean chains 1 (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/asm.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb7f1a3c22b961a4579c2990deaf79fb31019352586a85eac2cc766a05d07aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::codegen_intrinsic_call (cognitive 107): Builder::codegen_intrinsic_call has cognitive complexity 107 (threshold 15). Drivers by points: if/else 79, match/switch 20, boolean chains 6, loops 2 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b8c342e17a7eb7f5bed35675fa9b5b13ba3b28d02faf8a8e89273122847d0a"}},{"ruleId":"D2","level":"warning","message":{"text":"interface::parse_check_cfg (cognitive 107): interface::parse_check_cfg has cognitive complexity 107 (threshold 15). Drivers by points: if/else 80, loops 10, boolean chains 9, match/switch 8 (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_interface/src/interface.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"adef042f263988b02f46d808c78ef98465816c360ab2ff685a35dd5ec1ce64d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::into_struct_error (cognitive 106): Resolver::into_struct_error has cognitive complexity 106 (threshold 15). Drivers by points: if/else 53, match/switch 26, loops 18, boolean chains 9 (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"496d73a7faf64ad45b95f1be67dc5b1fcfbd096d4299fee737071e33d6c6938a"}},{"ruleId":"D2","level":"warning","message":{"text":"BorrowExplanation::add_explanation_to_diagnostic (cognitive 105): BorrowExplanation::add_explanation_to_diagnostic has cognitive complexity 105 (threshold 15). Drivers by points: if/else 83, match/switch 10, boolean chains 8, loops 4 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08df04ba61c5c719ffe26dcacf802136f05647d173c307a0e9dd579c6afdf64"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotateSnippetEmitter::emit_messages_default (cognitive 105): AnnotateSnippetEmitter::emit_messages_default has cognitive complexity 105 (threshold 15). Drivers by points: if/else 90, loops 9, boolean chains 4, match/switch 2 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b70812735f1d9a93e5c962fa210239377f537f7f304b0301f495039a65a25c"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::check_expected_errors (cognitive 105): TestCx::check_expected_errors has cognitive complexity 105 (threshold 15). Drivers by points: if/else 72, loops 21, boolean chains 8, match/switch 4 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6c085d763f8c585fb0b2e2e1d86c8e96f61aaa47ef4593c4ba8c836eb1f427"}},{"ruleId":"D2","level":"warning","message":{"text":"syntax_highlighting::traverse (cognitive 103): syntax_highlighting::traverse has cognitive complexity 103 (threshold 15). Drivers by points: if/else 50, match/switch 49, boolean chains 3, loops 1 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7445ded8167b52217b6251a39f4076ea87a572ce42bb4f69b07ee730704ccdc9"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_call_terminator (cognitive 102): FunctionCx::codegen_call_terminator has cognitive complexity 102 (threshold 15). Drivers by points: if/else 60, match/switch 29, loops 7, boolean chains 6 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"08be42da0f36d1a179056b79d9b0bdd8f05b013cf18838550cfbea387951adc8"}},{"ruleId":"D2","level":"warning","message":{"text":"link::link_natively (cognitive 102): link::link_natively has cognitive complexity 102 (threshold 15). Drivers by points: if/else 71, loops 13, boolean chains 9, match/switch 9 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"3417fbfe0ef95a6de7aa87eaaf2f0c7f02402ffaca6a8b66dd0cf0d62aea690a"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::report_privacy_error (cognitive 102): Resolver::report_privacy_error has cognitive complexity 102 (threshold 15). Drivers by points: if/else 72, loops 12, match/switch 10, boolean chains 8 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae567d0f45908b029915faaae6143318f475c63e56191d1439fad6d49c1a37b2"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutCalculator::layout_of_enum (cognitive 101): LayoutCalculator::layout_of_enum has cognitive complexity 101 (threshold 15). Drivers by points: if/else 60, match/switch 18, loops 16, boolean chains 7 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ed5b955f2d9a68e34cbf73f6c58e1c3822c46c5c9a607a5efe5ac52aa90e15"}},{"ruleId":"D2","level":"warning","message":{"text":"format_string::lex_format_specifiers (cognitive 101): format_string::lex_format_specifiers has cognitive complexity 101 (threshold 15). Drivers by points: if/else 62, match/switch 29, boolean chains 7, loops 3 (nesting depth added 66). Of this number, 92 points are the body\u0027s own statements and 9 belong to 2 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b094e2cbf40db2c839e1e1d8582bae882e11d3546611dff7ece74d47c0f231f"}},{"ruleId":"D2","level":"warning","message":{"text":"EncodeContext::encode_def_ids (cognitive 100): EncodeContext::encode_def_ids has cognitive complexity 100 (threshold 15). Drivers by points: if/else 81, loops 10, boolean chains 6, match/switch 3 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"1202f1a22ff0d008ba33505f2867948c335b04265121feb01994d0f49c8fed75"}},{"ruleId":"D2","level":"warning","message":{"text":"impls::show_candidates (cognitive 99): impls::show_candidates has cognitive complexity 99 (threshold 15). Drivers by points: if/else 73, loops 17, match/switch 6, boolean chains 3 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":3876}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5eb193b9e9f21ed3be6c18be0a0c3cd751c44286794b0bf530ae8fe9384dde"}},{"ruleId":"D2","level":"warning","message":{"text":"session::validate_commandline_args_with_session_available (cognitive 99): session::validate_commandline_args_with_session_available has cognitive complexity 99 (threshold 15). Drivers by points: if/else 74, boolean chains 23, match/switch 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/session.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e2ea5794b76ba070bade66e4053aca1a9749fda199b890b4b61a7c83f7078b"}},{"ruleId":"D2","level":"warning","message":{"text":"SerializedSearchIndex::union (cognitive 99): SerializedSearchIndex::union has cognitive complexity 99 (threshold 15). Drivers by points: loops 69, if/else 15, match/switch 15 (nesting depth added 68). Of this number, 72 points are the body\u0027s own statements and 27 belong to one function item declared inside it. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c4a68fa7108d9bc3345a15d3cb8bee5d5dab144debd41e5a90b1bf74f2a7f5"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceAnalyzer::resolve_path (cognitive 99): SourceAnalyzer::resolve_path has cognitive complexity 99 (threshold 15). Drivers by points: if/else 67, match/switch 23, loops 6, boolean chains 3 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a166171ef4dafa65c93065bea510486da3c256c8ed25b577cdc36646bf07917d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::visit_rvalue (cognitive 98): TypeChecker::visit_rvalue has cognitive complexity 98 (threshold 15). Drivers by points: match/switch 49, if/else 44, boolean chains 5 (nesting depth added 60). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"837e000d3c88d657b3cad22b1ac1f2cd7327bdafae712254b28378f41671fe2d"}},{"ruleId":"D2","level":"warning","message":{"text":"FindUsages::search (cognitive 98): FindUsages::search has cognitive complexity 98 (threshold 15). Drivers by points: if/else 44, loops 36, match/switch 17, boolean chains 1 (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"181be9f0abf07e06c105039e5a4b59ccef0fb1fc19f9a8e6514f02296307eec4"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::smart_resolve_context_dependent_help (cognitive 97): LateResolutionVisitor::smart_resolve_context_dependent_help has cognitive complexity 97 (threshold 15). Drivers by points: if/else 66, match/switch 14, boolean chains 13, loops 4 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc89c507435d6a0e370b6addb739bd5bb65f4c0496b676da4cf7292428dcec2"}},{"ruleId":"D2","level":"warning","message":{"text":"items::rewrite_fn_base (cognitive 97): items::rewrite_fn_base has cognitive complexity 97 (threshold 15). Drivers by points: if/else 77, boolean chains 13, match/switch 7 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7b581cdaf1e03c2c47c1e3fc7615d362462e098574dfb9a300fe6e92b9bd7c"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_struct_fields (cognitive 94): FnCtxt::check_expr_struct_fields has cognitive complexity 94 (threshold 15). Drivers by points: if/else 74, match/switch 11, boolean chains 6, loops 3 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3bf75455975e83e6eb8d6372ef27799534c88692225da0b9d004453ac4c168"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_expr_in (cognitive 94): Printer::print_expr_in has cognitive complexity 94 (threshold 15). Drivers by points: if/else 54, match/switch 21, loops 19 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f36b554afbc59c1329db515b22c45733ed75a75afd619dfce3aa89874d8e8f"}},{"ruleId":"D2","level":"warning","message":{"text":"matcher::match_loop_inner (cognitive 94): matcher::match_loop_inner has cognitive complexity 94 (threshold 15). Drivers by points: if/else 76, match/switch 11, boolean chains 4, loops 3 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"1631ee4dabcc9cce8d4696229f22abb7878c848587d86af86cfce60db0c11e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"write::start_executing_work (cognitive 93): write::start_executing_work has cognitive complexity 93 (threshold 15). Drivers by points: if/else 64, match/switch 16, loops 8, boolean chains 5 (nesting depth added 45). Of this number, 92 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"6427634fcbda861217465704b1d0520564c8065c27862f61ec9361174f86f997"}},{"ruleId":"D2","level":"warning","message":{"text":"base::codegen_fn_body (cognitive 92): base::codegen_fn_body has cognitive complexity 92 (threshold 15). Drivers by points: if/else 69, loops 11, match/switch 9, boolean chains 3 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/base.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cc99ff66eab50500bc7f71e9e50aede46e16cb8ef2a57d0bcd27efb5637d20"}},{"ruleId":"D2","level":"warning","message":{"text":"hvx::parse_header (cognitive 92): hvx::parse_header has cognitive complexity 92 (threshold 15). Drivers by points: if/else 68, loops 12, match/switch 9, boolean chains 3 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a14727fe837b5998e8dfc18eac4a9ad111b5d55cd96051fd7163d1c48b0cf56"}},{"ruleId":"D2","level":"warning","message":{"text":"render::definition (cognitive 92): render::definition has cognitive complexity 92 (threshold 15). Drivers by points: if/else 64, match/switch 28 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72c2faf75d8eccb89b4182f35abc01f51f54e624968f41fcdc87b8ecb15efe8"}},{"ruleId":"D2","level":"warning","message":{"text":"rem_pio2_large::rem_pio2_large (cognitive 91): rem_pio2_large::rem_pio2_large has cognitive complexity 91 (threshold 15). Drivers by points: loops 44, if/else 41, match/switch 5, boolean chains 1 (nesting depth added 48). 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":"library/compiler-builtins/libm/src/math/rem_pio2_large.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cc867a1afa75c448200797175e04b9d02b44fd4cd8c5aee49ad67285611c05"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_loongarch::gen_bind_body (cognitive 91): stdarch_gen_loongarch::gen_bind_body has cognitive complexity 91 (threshold 15). Drivers by points: if/else 49, match/switch 22, boolean chains 20 (nesting depth added 13). 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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"66895fd8273fd856c2b1261d4b085555e5bc473652e7e5ebc659ee595e949442"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutCalculator::univariant_biased (cognitive 89): LayoutCalculator::univariant_biased has cognitive complexity 89 (threshold 15). Drivers by points: if/else 54, match/switch 29, boolean chains 5, loops 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e91788096e2c121be35a722ed3fe2b5b96b0a801c825aa491430d9e55bb19d"}},{"ruleId":"D2","level":"warning","message":{"text":"Dereferencing::check_expr (cognitive 89): Dereferencing::check_expr has cognitive complexity 89 (threshold 15). Drivers by points: if/else 59, boolean chains 17, match/switch 10, loops 3 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/dereference.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d88c8be80da8150666ef7df38807da027ec6cbca9a67c3cada010e950fb1675"}},{"ruleId":"D2","level":"warning","message":{"text":"FulfillProcessor::process_obligation (cognitive 88): FulfillProcessor::process_obligation has cognitive complexity 88 (threshold 15). Drivers by points: if/else 44, match/switch 41, boolean chains 3 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2eeed8ec018bccb0f97c9fc5fe0c393c77ad3864c8a8af112b6e0d22d4a57e"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroExpander::expand_invoc (cognitive 87): MacroExpander::expand_invoc has cognitive complexity 87 (threshold 15). Drivers by points: if/else 49, match/switch 36, boolean chains 2 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4ae89de98fc489606578818a2f74eb84c769faaf79013e152b9c6adb6453f4"}},{"ruleId":"D2","level":"warning","message":{"text":"CastCheck::report_cast_error (cognitive 87): CastCheck::report_cast_error has cognitive complexity 87 (threshold 15). Drivers by points: if/else 69, match/switch 10, boolean chains 8 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cad3f507b5a0eda9fdacf59916c6731ac806ee232bc623b00d243a7af782bf"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::note_error_origin (cognitive 85): TypeErrCtxt::note_error_origin has cognitive complexity 85 (threshold 15). Drivers by points: if/else 61, match/switch 13, boolean chains 7, loops 4 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaa288bb0d76680af498731d7d13bf0f07c072110f1793ba2aad3f897bd91a9"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::evaluate_predicate_recursively (cognitive 85): SelectionContext::evaluate_predicate_recursively has cognitive complexity 85 (threshold 15). Drivers by points: if/else 45, match/switch 28, boolean chains 7, loops 5 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdebc435c6e46aa792a4668705e64514f1a64d1baacdac3d193bd367049c6426"}},{"ruleId":"D2","level":"warning","message":{"text":"FindUsages::short_associated_function_fast_search::collect_possible_aliases (cognitive 85): FindUsages::short_associated_function_fast_search::collect_possible_aliases has cognitive complexity 85 (threshold 15). Drivers by points: if/else 61, loops 20, boolean chains 4 (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec388c293763ea61e30c6dcf656da692ccdd91c25be993c6d5d816665c91925a"}},{"ruleId":"D2","level":"warning","message":{"text":"unifyFunctionTypes (cognitive 85): unifyFunctionTypes has cognitive complexity 85 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2979}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f7479024e81c0891e25e039388aadc7903a7873788830cedf10299186a8b4b"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::note_type_is_not_clone (cognitive 83): FnCtxt::note_type_is_not_clone has cognitive complexity 83 (threshold 15). Drivers by points: if/else 52, match/switch 15, loops 10, boolean chains 6 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4704de61546d96af9e73543499acdfa6424aea53127da421947489b17092a2"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyPrinter::pretty_print_opaque_impl_type (cognitive 82): PrettyPrinter::pretty_print_opaque_impl_type has cognitive complexity 82 (threshold 15). Drivers by points: if/else 46, loops 14, match/switch 13, boolean chains 9 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db540733c630000086ae1b76a56dc058a43b344ae8a4426e6f1edacb6c18a81"}},{"ruleId":"D2","level":"warning","message":{"text":"instance::resolve_associated_item (cognitive 82): instance::resolve_associated_item has cognitive complexity 82 (threshold 15). Drivers by points: if/else 58, match/switch 19, boolean chains 5 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/instance.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"684a105d914cbaf465bd814b3ef6592d7714bde6384e9e59ee2561f0b3c030e4"}},{"ruleId":"D2","level":"warning","message":{"text":"cfg_process::macro_input_callback (cognitive 82): cfg_process::macro_input_callback has cognitive complexity 82 (threshold 15). Drivers by points: if/else 57, match/switch 11, loops 10, boolean chains 4 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/cfg_process.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dc6cc36b2baf5f4c982bbd818506ddf64b92d6803ea43595560533078678f7"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_deref_ref_or_into (cognitive 81): FnCtxt::suggest_deref_ref_or_into has cognitive complexity 81 (threshold 15). Drivers by points: if/else 48, match/switch 14, loops 12, boolean chains 7 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdb3cade2329b409a32683827c9aad0e4e086820d696c33cec5bbd5d2c1db02"}},{"ruleId":"D2","level":"warning","message":{"text":"UselessConversion::check_expr (cognitive 81): UselessConversion::check_expr has cognitive complexity 81 (threshold 15). Drivers by points: if/else 61, boolean chains 15, match/switch 5 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/useless_conversion.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0463de57fe9a2b914f55d18fa60478bddbbc1b2910c69cd414535b6b2885db9"}},{"ruleId":"D2","level":"warning","message":{"text":"makeBranchesFromBinaryData (cognitive 81): makeBranchesFromBinaryData has cognitive complexity 81 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":3045}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdee3e387e29a8cc1a22d86a85293c23584ef111e8c4a8def2e41b18b36f6d1"}},{"ruleId":"D2","level":"warning","message":{"text":"inline_call::inline (cognitive 80): inline_call::inline has cognitive complexity 80 (threshold 15). Drivers by points: if/else 50, match/switch 14, boolean chains 8, loops 8 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_call.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bba3e57c9bccba56fef572770b7e2143e75f0b67eeed2b601aa9b795bf3982"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalysisStats::run (cognitive 80): AnalysisStats::run has cognitive complexity 80 (threshold 15). Drivers by points: if/else 34, match/switch 22, loops 21, boolean chains 3 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7b341103a9c33945eed1c2491ec3617d50789cccd78932d3f4c2513c842b98"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::winnow_candidates (cognitive 79): SelectionContext::winnow_candidates has cognitive complexity 79 (threshold 15). Drivers by points: if/else 61, loops 8, match/switch 7, boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"2858ed313bc0cc1a071a3f9127f745e2c456756b9db7a2d0e0b810466f5b5edf"}},{"ruleId":"D2","level":"warning","message":{"text":"check::check_item_type (cognitive 78): check::check_item_type has cognitive complexity 78 (threshold 15). Drivers by points: if/else 48, match/switch 21, loops 7, boolean chains 2 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"695f54dff7898ef1a3284785aea20d4523b161c654640d2d67c968e36f6ad8fa"}},{"ruleId":"D2","level":"warning","message":{"text":"LintLevelsBuilder::add (cognitive 78): LintLevelsBuilder::add has cognitive complexity 78 (threshold 15). Drivers by points: if/else 49, match/switch 19, loops 8, boolean chains 2 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/levels.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9fda08e31bb2eafb50701b4346d928774dda76dfb11ab1e13b919030dd3a62"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::exec_intrinsic (cognitive 78): Evaluator::exec_intrinsic has cognitive complexity 78 (threshold 15). Drivers by points: if/else 40, match/switch 29, loops 6, boolean chains 3 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"c369128f5dd232cd7c6e57ac1ecef46f42cb1201965472b35f0fc932f605c4b9"}},{"ruleId":"D2","level":"warning","message":{"text":"intrinsics::codegen_regular_intrinsic_call (cognitive 77): intrinsics::codegen_regular_intrinsic_call has cognitive complexity 77 (threshold 15). Drivers by points: if/else 49, match/switch 27, boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"d948e278b9ff8c6d10f0e8ec7ecce621e1dc6110a7f4e79b0f9b64718c21fbb9"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::lookup_import_candidates_from_module (cognitive 77): Resolver::lookup_import_candidates_from_module has cognitive complexity 77 (threshold 15). Drivers by points: if/else 53, boolean chains 19, match/switch 4, loops 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1e5ec04a5b2f7c53271f7182b7f781b1ea9977faa5fb08390556142fede191"}},{"ruleId":"D2","level":"warning","message":{"text":"Extended::run (cognitive 77): Extended::run has cognitive complexity 77 (threshold 15). Drivers by points: if/else 63, boolean chains 7, loops 7 (nesting depth added 20). Of this number, 72 points are the body\u0027s own statements and 5 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2be19fadec2226372e7a87aecdc1d558f172fb7eb02df3fd569e194899db19d"}},{"ruleId":"D2","level":"warning","message":{"text":"make::parse_source (cognitive 77): make::parse_source has cognitive complexity 77 (threshold 15). Drivers by points: if/else 47, boolean chains 11, match/switch 10, loops 9 (nesting depth added 37). Of this number, 61 points are the body\u0027s own statements and 16 belong to 3 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest/make.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fba2e00a4a0d5c43ea780618f4f92b83ebaf1b21e76b689aba36541b1040586"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_intrinsic_call (cognitive 76): FunctionCx::codegen_intrinsic_call has cognitive complexity 76 (threshold 15). Drivers by points: if/else 47, match/switch 20, boolean chains 9 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/intrinsic.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d1a15ea89753ef69d6f15ac55cab54ba50bd421e2a8d1c16d49e469ea640df"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_pat (cognitive 76): State::print_pat has cognitive complexity 76 (threshold 15). Drivers by points: if/else 72, match/switch 3, boolean chains 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc5bd8ea1bf0f8c26e4e16c1ae061f125e8feb2bd3a80f5e1c3c79decc7197d"}},{"ruleId":"D2","level":"warning","message":{"text":"powf::powf (cognitive 76): powf::powf has cognitive complexity 76 (threshold 15). Drivers by points: if/else 70, boolean chains 4, match/switch 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":"library/compiler-builtins/libm/src/math/powf.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed0a93883b2fdb93d03ef8a8191ed4aa087c3e235c425abcfd461ccd5acc029"}},{"ruleId":"D2","level":"warning","message":{"text":"folding_ranges::folding_ranges (cognitive 76): folding_ranges::folding_ranges has cognitive complexity 76 (threshold 15). Drivers by points: if/else 65, match/switch 8, boolean chains 2, loops 1 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/folding_ranges.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ebcfbda61924f3af2c7272399345b5fe4ce3a0870da6c735c4598dd0ed468f"}},{"ruleId":"D2","level":"warning","message":{"text":"prefixMatches (cognitive 76): prefixMatches has cognitive complexity 76 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b427be34dac2d5cc5232e6a450488194def22f37451c205157732dfbeea563"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::try_lookup_name_relaxed (cognitive 75): LateResolutionVisitor::try_lookup_name_relaxed has cognitive complexity 75 (threshold 15). Drivers by points: if/else 53, match/switch 12, boolean chains 8, loops 2 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"89704d4ed0940661474ec69af517eb23429aeb9d275a200ee036099135118963"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::resolve_macros (cognitive 75): DefCollector::resolve_macros has cognitive complexity 75 (threshold 15). Drivers by points: if/else 56, match/switch 11, loops 6, boolean chains 2 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a683c9e95f3131607bc83c9c75f1dd27f0f69238d2fe58452b9e97a7b34de2e6"}},{"ruleId":"D2","level":"warning","message":{"text":"format::expand_format_args (cognitive 74): format::expand_format_args has cognitive complexity 74 (threshold 15). Drivers by points: if/else 59, match/switch 8, loops 4, boolean chains 3 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/format.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c19bec678d0b41b23d9002c1d4d59156839c6055e82bc354c9fab87becdfd0"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::was_captured_by_trait_object (cognitive 74): MirBorrowckCtxt::was_captured_by_trait_object has cognitive complexity 74 (threshold 15). Drivers by points: if/else 50, match/switch 22, boolean chains 1, loops 1 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1aedbf18429b02ff9936b8e4a776103cf12f4a11ef26901d618c711af74c92"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_compatible_variants (cognitive 74): FnCtxt::suggest_compatible_variants has cognitive complexity 74 (threshold 15). Drivers by points: if/else 49, match/switch 13, boolean chains 7, loops 5 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2611}}}],"partialFingerprints":{"codehealthFindingId/v1":"621792909774b86c3d102f41dcd1f2d86075c445cfc49b8464e8788a5e136f80"}},{"ruleId":"D2","level":"warning","message":{"text":"phases::phase_rustc (cognitive 74): phases::phase_rustc has cognitive complexity 74 (threshold 15). Drivers by points: if/else 54, loops 13, boolean chains 7 (nesting depth added 35). Of this number, 62 points are the body\u0027s own statements and 12 belong to 2 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/cargo-miri/src/phases.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ceae778947fa2888c28c8791bfc3431d5110ca3e7d16949264fe999bf109548"}},{"ruleId":"D2","level":"warning","message":{"text":"layout::layout_of_ty_query (cognitive 74): layout::layout_of_ty_query has cognitive complexity 74 (threshold 15). Drivers by points: if/else 53, match/switch 21 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/layout.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50d2e6079de526091dce5905a43d0ab0b68f24ca6c4d7d1f682d3cdcf7a713b"}},{"ruleId":"D2","level":"warning","message":{"text":"display::write_bounds_like_dyn_trait (cognitive 74): display::write_bounds_like_dyn_trait has cognitive complexity 74 (threshold 15). Drivers by points: if/else 66, boolean chains 5, match/switch 2, loops 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/display.rs"},"region":{"startLine":2093}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1045054691555ced3f1f5249863c0990a2f5cb309b4fce5ba1aa386a638c2fe"}},{"ruleId":"D2","level":"warning","message":{"text":"edit_algo::apply_edits (cognitive 74): edit_algo::apply_edits has cognitive complexity 74 (threshold 15). Drivers by points: match/switch 34, if/else 29, loops 9, boolean chains 2 (nesting depth added 34). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edit_algo.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7adaa4f895f3b0e71807a06a35cfe50e902245f42bca48c65dc7ca44d46d0d"}},{"ruleId":"D2","level":"warning","message":{"text":"llvm_enzyme::gen_enzyme_decl (cognitive 73): llvm_enzyme::gen_enzyme_decl has cognitive complexity 73 (threshold 15). Drivers by points: if/else 53, match/switch 10, loops 8, boolean chains 2 (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":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"4406da09fbf7e4d39bd34fbb316bc856512c1dc1f48928895f77c23855563a8b"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::expected_one_of_not_found (cognitive 73): Parser::expected_one_of_not_found has cognitive complexity 73 (threshold 15). Drivers by points: if/else 45, boolean chains 27, loops 1 (nesting depth added 8). Of this number, 68 points are the body\u0027s own statements and 5 belong to one function item declared inside it. 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":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c969f0cf841a38fedc6b58d8bb24841d2d3ddca2b83c9e67df0db3cf443d46"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_fn_front_matter (cognitive 73): Parser::parse_fn_front_matter has cognitive complexity 73 (threshold 15). Drivers by points: if/else 40, match/switch 30, boolean chains 3 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":3094}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f43ad112570efa04c01d55b5c4edaa725c82aff2ede0827eecfa007deb8d0cc"}},{"ruleId":"D2","level":"warning","message":{"text":"markdown::markdown_links (cognitive 73): markdown::markdown_links has cognitive complexity 73 (threshold 15). Drivers by points: if/else 40, loops 15, match/switch 12, boolean chains 6 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cabbdb368671905ed68d465f9c66a2b0cd286ee2e718c313ac903362923b49b"}},{"ruleId":"D2","level":"warning","message":{"text":"doctest::run_test (cognitive 73): doctest::run_test has cognitive complexity 73 (threshold 15). Drivers by points: if/else 55, match/switch 9, boolean chains 7, loops 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed6812059002e2d912050baa64e41708f60318eea7d3839fbe6b6d5f630c289"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprCollector::lower_inline_asm (cognitive 73): ExprCollector::lower_inline_asm has cognitive complexity 73 (threshold 15). Drivers by points: if/else 38, match/switch 28, loops 5, boolean chains 2 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/asm.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b39e06f0fa9c42f1420d26ad8c7ec98cff37d9ccacc64d539a927a19d02948a"}},{"ruleId":"D2","level":"warning","message":{"text":"Path::hir_fmt (cognitive 73): Path::hir_fmt has cognitive complexity 73 (threshold 15). Drivers by points: if/else 42, match/switch 18, loops 11, boolean chains 2 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/display.rs"},"region":{"startLine":2675}}}],"partialFingerprints":{"codehealthFindingId/v1":"7870e713b752e33589d15c864733a8a6f37c0b6e98cf4142f3e2cf068c822b3d"}},{"ruleId":"D2","level":"warning","message":{"text":"unpackPostingsList (cognitive 73): unpackPostingsList has cognitive complexity 73 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":4256}}}],"partialFingerprints":{"codehealthFindingId/v1":"636ed5f802caabfe38b68c13022d2b502b077914b0867aae923ae78d8e1825ed"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyPrinter::pretty_print_type (cognitive 72): PrettyPrinter::pretty_print_type has cognitive complexity 72 (threshold 15). Drivers by points: if/else 57, match/switch 14, boolean chains 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8665b3186ebfd3d44282b0e3e2f7b8ec2378e27285a378f64cae2d273ef71d"}},{"ruleId":"D2","level":"warning","message":{"text":"lint_tail_expr_drop_order::run_lint (cognitive 72): lint_tail_expr_drop_order::run_lint has cognitive complexity 72 (threshold 15). Drivers by points: if/else 54, loops 15, boolean chains 3 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/lint_tail_expr_drop_order.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ae1b105f7ea01dc656890a5f2c990ad612eb7afaecc0c6a8ba3f9f2972e1c8"}},{"ruleId":"D2","level":"warning","message":{"text":"fixup::fixup_syntax (cognitive 72): fixup::fixup_syntax has cognitive complexity 72 (threshold 15). Drivers by points: if/else 48, match/switch 17, boolean chains 6, loops 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/fixup.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f6fb7949f2d14b6b9fadf4e1e85fd9df621ddccf57f39acbec7eda52495830"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::instantiate_value_path (cognitive 71): FnCtxt::instantiate_value_path has cognitive complexity 71 (threshold 15). Drivers by points: if/else 46, match/switch 17, loops 5, boolean chains 3 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0983b2cc932d11c58edd181969e08e01ecca99927f44d886e8ba6ec5c15a83"}},{"ruleId":"D2","level":"warning","message":{"text":"ProbeContext::consider_probe (cognitive 71): ProbeContext::consider_probe has cognitive complexity 71 (threshold 15). Drivers by points: if/else 46, match/switch 11, boolean chains 7, loops 7 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddfc42d0b8019f6d164bdd469f01e69708decec4cfc27a531636f160ad19211"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprCollector::collect_format_args_impl (cognitive 71): ExprCollector::collect_format_args_impl has cognitive complexity 71 (threshold 15). Drivers by points: if/else 56, match/switch 8, loops 4, boolean chains 3 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/format_args.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ca5481bfa7f6aecdb1fcd812513a6279fa2a7e085662f1074ac1785164e526"}},{"ruleId":"D2","level":"warning","message":{"text":"asm::validate_asm_args (cognitive 70): asm::validate_asm_args has cognitive complexity 70 (threshold 15). Drivers by points: if/else 43, match/switch 13, boolean chains 7, loops 7 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/asm.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d212855fd8307068a13d12841f9236ec6add05ea8eda1e619057988c73ba52"}},{"ruleId":"D2","level":"warning","message":{"text":"codegen_attrs::process_builtin_attrs (cognitive 70): codegen_attrs::process_builtin_attrs has cognitive complexity 70 (threshold 15). Drivers by points: if/else 49, match/switch 12, boolean chains 5, loops 4 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/codegen_attrs.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d96629b0f42e0352b90d368894599d36a12dc2832667eb6c39d7f53e1da9fa"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::expr_into_dest (cognitive 70): Builder::expr_into_dest has cognitive complexity 70 (threshold 15). Drivers by points: if/else 37, match/switch 30, loops 2, boolean chains 1 (nesting depth added 32). Of this number, 65 points are the body\u0027s own statements and 5 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/expr/into.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5637f16b8f11b66f654aa2e113c4731dbbc1dcd03e8cc818db3b51fd3af803d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Assemble::run (cognitive 70): Assemble::run has cognitive complexity 70 (threshold 15). Drivers by points: if/else 45, loops 14, boolean chains 9, match/switch 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1f23a8df248d930458f23c322264a9b74714a3023026d93a848a3c4228b386"}},{"ruleId":"D2","level":"warning","message":{"text":"Llvm::run (cognitive 70): Llvm::run has cognitive complexity 70 (threshold 15). Drivers by points: if/else 51, boolean chains 11, match/switch 7, loops 1 (nesting depth added 7). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5f53cdbd7cd632c6be17abe11302ebcad2489cdde20117651263f6c1b13c2f"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExtPriv::emulate_foreign_item_inner (cognitive 70): EvalContextExtPriv::emulate_foreign_item_inner has cognitive complexity 70 (threshold 15). Drivers by points: if/else 56, match/switch 11, 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":"src/tools/miri/src/shims/foreign_items.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cec3ebcc0d961a266acd769befbfcf7d19f9b75374371281976103f20ac5c6"}},{"ruleId":"D2","level":"warning","message":{"text":"MirLowerCtx::pattern_match_inner (cognitive 70): MirLowerCtx::pattern_match_inner has cognitive complexity 70 (threshold 15). Drivers by points: if/else 52, match/switch 10, loops 6, boolean chains 2 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower/pattern_matching.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"198b5d96ece4c70efd1788381e0a6dd05c29493d555306e55a5df441ac4db548"}},{"ruleId":"D2","level":"warning","message":{"text":"base::codegen_stmt (cognitive 69): base::codegen_stmt has cognitive complexity 69 (threshold 15). Drivers by points: if/else 36, match/switch 30, loops 3 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/base.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55dc66a3771487c406ae5b4bfdf1e3345dca936925a8fe1267832a0ea2296a6"}},{"ruleId":"D2","level":"warning","message":{"text":"check::opaque_type_cycle_error (cognitive 69): check::opaque_type_cycle_error has cognitive complexity 69 (threshold 15). Drivers by points: if/else 32, loops 31, match/switch 4, boolean chains 2 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":2143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bc1545b7e5d14177cfe5e2e7404bf98ce476e99445810e6fa53761b3f44b24"}},{"ruleId":"D2","level":"warning","message":{"text":"needless_range_loop::check (cognitive 69): needless_range_loop::check has cognitive complexity 69 (threshold 15). Drivers by points: if/else 57, boolean chains 7, match/switch 5 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a05debfb58aec9b3572aac82963546fcd7bc745493ccb86ed72f9493d9869c"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::make_compile_args (cognitive 69): TestCx::make_compile_args has cognitive complexity 69 (threshold 15). Drivers by points: if/else 49, boolean chains 10, match/switch 10 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"209210a775ddf4c5f19cb92a93f19994b689ae7932bba8232310aca290bb7781"}},{"ruleId":"D2","level":"warning","message":{"text":"highlight::highlight_def (cognitive 69): highlight::highlight_def has cognitive complexity 69 (threshold 15). Drivers by points: if/else 42, match/switch 22, boolean chains 5 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ebf2eaf18a528efb7cb6734e601e7a72652fc4563df681bbdef2ab3b66ab06"}},{"ruleId":"D2","level":"warning","message":{"text":"notification::run_flycheck (cognitive 69): notification::run_flycheck has cognitive complexity 69 (threshold 15). Drivers by points: if/else 36, match/switch 19, loops 11, boolean chains 3 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/notification.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2aee3f47b5b39ffc5ad6acd83c60637b23db72bfa608cff1aa774295b9162fc"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentRewrite::handle_line (cognitive 69): CommentRewrite::handle_line has cognitive complexity 69 (threshold 15). Drivers by points: if/else 48, boolean chains 11, match/switch 10 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3dd5d316d5164f0d008dc01586dbaa5496fbccd8042e48bd74e795510be8a1"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_driver_impl::print_crate_info (cognitive 68): rustc_driver_impl::print_crate_info has cognitive complexity 68 (threshold 15). Drivers by points: if/else 31, loops 25, match/switch 8, boolean chains 4 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a553d31d81923bc64379971feb303566c8cf208da0f37d7728a5c75a53e212e"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineAsmCtxt::check_asm (cognitive 68): InlineAsmCtxt::check_asm has cognitive complexity 68 (threshold 15). Drivers by points: if/else 46, match/switch 17, loops 5 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"6407091d3a1f4042a1e21809a4f681e474e085b327af6ce70aa32a637e904d71"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnostics::suggest_constraining_type_params (cognitive 68): diagnostics::suggest_constraining_type_params has cognitive complexity 68 (threshold 15). Drivers by points: if/else 53, match/switch 12, boolean chains 2, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/diagnostics.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47290aaf676ba3ee28d2f4cd1b485f8af323f0f3d7eeb8387e7979f9f8e18bf"}},{"ruleId":"D2","level":"warning","message":{"text":"UnsafetyVisitor::visit_expr (cognitive 68): UnsafetyVisitor::visit_expr has cognitive complexity 68 (threshold 15). Drivers by points: if/else 48, match/switch 11, boolean chains 5, loops 4 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/check_unsafety.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3992f2891611bb5bf336cef836c571e5c0b82f5fb388ec559808d68f9c93565"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_pat_fields (cognitive 68): Parser::parse_pat_fields has cognitive complexity 68 (threshold 15). Drivers by points: if/else 61, match/switch 4, boolean chains 2, loops 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7a80c069777c5a3fb42ec623795d15aa9481ad85edc79d61d5bfdfa7c8db57"}},{"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 58, boolean chains 7, match/switch 3 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/indexing_slicing.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea8e0b560bd65d3c70f81beea02d411669e0872e3c6684223c6eea54537c459"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::CreateFileW (cognitive 68): EvalContextExt::CreateFileW has cognitive complexity 68 (threshold 15). Drivers by points: if/else 52, match/switch 9, boolean chains 6, loops 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/fs.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53addd44ebe4a9cb1330a50fcea24c99973d0b6f1c2a6343f73ce7f9a4a381d"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::resolve_variant (cognitive 68): InferenceContext::resolve_variant has cognitive complexity 68 (threshold 15). Drivers by points: if/else 49, match/switch 13, boolean chains 4, loops 2 (nesting depth added 33). Of this number, 66 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be547a725b84401b275e51c8b1a71a8b766f22b289ff30af43cf564d6b9a960"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::annotate_loop_expected_due_to_inference (cognitive 67): FnCtxt::annotate_loop_expected_due_to_inference has cognitive complexity 67 (threshold 15). Drivers by points: if/else 38, match/switch 16, loops 8, boolean chains 5 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c4708572e5db912a175f8055b21e1872ae44c8af7dc744e021156d1908fd35"}},{"ruleId":"D2","level":"warning","message":{"text":"check_match::find_fallback_pattern_typo (cognitive 67): check_match::find_fallback_pattern_typo has cognitive complexity 67 (threshold 15). Drivers by points: if/else 47, loops 13, match/switch 4, boolean chains 3 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f279c9bf94b3d71906b89bc13d99d032180b7ec79c0e5ab5bc28c0c9c3bfac"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstructorSet::split (cognitive 67): ConstructorSet::split has cognitive complexity 67 (threshold 15). Drivers by points: if/else 38, loops 14, match/switch 14, boolean chains 1 (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":"compiler/rustc_pattern_analysis/src/constructor.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db7f28319212d4c9d3a9a032ebc6f0e575c174ae34449dce3e6b7f0a630a078"}},{"ruleId":"D2","level":"warning","message":{"text":"DerefDelegate::borrow (cognitive 67): DerefDelegate::borrow has cognitive complexity 67 (threshold 15). Drivers by points: if/else 47, match/switch 11, loops 5, boolean chains 4 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/sugg.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a5fe60848f783550e129363de304cd5a72b4e188380c7e287eefdc58b12f77"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticsImpl::descend_into_macros_impl (cognitive 67): SemanticsImpl::descend_into_macros_impl has cognitive complexity 67 (threshold 15). Drivers by points: if/else 30, match/switch 20, loops 16, boolean chains 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af1791cdb38ecce6742d8ba2badbebed6fad43c0821b36f1ddfcd94ce1a9f80"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalysisStats::run_term_search (cognitive 67): AnalysisStats::run_term_search has cognitive complexity 67 (threshold 15). Drivers by points: if/else 31, match/switch 26, loops 8, boolean chains 2 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"be479788cf18a784a49b413e6a1fad5969ad0d6f784dbd4251a97ae26b559a77"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::report_path_resolution_error (cognitive 66): Resolver::report_path_resolution_error has cognitive complexity 66 (threshold 15). Drivers by points: if/else 54, match/switch 10, boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2926}}}],"partialFingerprints":{"codehealthFindingId/v1":"449fa2311df80417a7a45aafa985e3f06af7b73cc070838827517a725c499b16"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::make_base_error (cognitive 66): LateResolutionVisitor::make_base_error has cognitive complexity 66 (threshold 15). Drivers by points: if/else 39, match/switch 17, boolean chains 10 (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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf10c93a2effb1e6d9325aae9b8b62c3bd11b629a1034b1e73d62c0cb96c4ac"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc::main (cognitive 66): rustc::main has cognitive complexity 66 (threshold 15). Drivers by points: if/else 41, boolean chains 11, loops 10, match/switch 4 (nesting depth added 14). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/bin/rustc.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbefa46125f74dca81afb40482496dcfb095e86f010b5ee86c21af1a45fd468"}},{"ruleId":"D2","level":"warning","message":{"text":"search_index::simplify_fn_type (cognitive 66): search_index::simplify_fn_type has cognitive complexity 66 (threshold 15). Drivers by points: if/else 49, boolean chains 7, loops 6, match/switch 4 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d360a0a1251d31ec863be9cb6d62071c63cb8b11e4d3b20c5f0d381e3eb2f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"Dereferencing::report (cognitive 66): Dereferencing::report has cognitive complexity 66 (threshold 15). Drivers by points: if/else 40, boolean chains 13, match/switch 13 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/dereference.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"f400fb52d1d5b8c4bd137174cf2bd46d71fbcd228938683aabca717e18a1bedf"}},{"ruleId":"D2","level":"warning","message":{"text":"path::lower_path (cognitive 66): path::lower_path has cognitive complexity 66 (threshold 15). Drivers by points: if/else 45, match/switch 15, boolean chains 5, loops 1 (nesting depth added 30). Of this number, 65 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower/path.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ce7106e6355f5e2c469d4af0afb440112b5ba620acfe94056c9e13d2775f83"}},{"ruleId":"D2","level":"warning","message":{"text":"llvm_x86::codegen_x86_llvm_intrinsic_call (cognitive 65): llvm_x86::codegen_x86_llvm_intrinsic_call has cognitive complexity 65 (threshold 15). Drivers by points: if/else 27, loops 22, match/switch 16 (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":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cae50d00b393738f003f6cfd6ac106729fb319d00330684a24d077b7bf0fc0"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidityVisitor::check_safe_pointer (cognitive 65): ValidityVisitor::check_safe_pointer has cognitive complexity 65 (threshold 15). Drivers by points: if/else 44, match/switch 17, boolean chains 4 (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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"1069cce96a326d4a3390c7b3fdd98a5f2911e63c07e673e6920ff898a4be4ba6"}},{"ruleId":"D2","level":"warning","message":{"text":"clean::clean_generics (cognitive 65): clean::clean_generics has cognitive complexity 65 (threshold 15). Drivers by points: if/else 31, loops 22, match/switch 11, boolean chains 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"284cc1d8b75a0e8ff54c4a32ac11a39fb75f5159b9487caf5a2f21fb595d6f59"}},{"ruleId":"D2","level":"warning","message":{"text":"eta_reduction::check_closure (cognitive 65): eta_reduction::check_closure has cognitive complexity 65 (threshold 15). Drivers by points: if/else 38, match/switch 19, 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":"src/tools/clippy/clippy_lints/src/eta_reduction.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"974b9b004c977d7a2840eaa4c0011be5d431c6c4f515c08acceb5c7f75cff6e4"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::run_ui_test (cognitive 65): TestCx::run_ui_test has cognitive complexity 65 (threshold 15). Drivers by points: if/else 56, boolean chains 7, match/switch 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/ui.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3913b450369859933f4fb54d09bc778b03f7c1b51cc46c5a3410b4fb137486fd"}},{"ruleId":"D2","level":"warning","message":{"text":"AstValidator::visit_item (cognitive 64): AstValidator::visit_item has cognitive complexity 64 (threshold 15). Drivers by points: if/else 48, loops 7, boolean chains 5, match/switch 4 (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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8caf15335e0694f10f8299017a77cf27ca881802f23cebcc2d735491b31929f"}},{"ruleId":"D2","level":"warning","message":{"text":"InherentOverlapChecker::check_item (cognitive 64): InherentOverlapChecker::check_item has cognitive complexity 64 (threshold 15). Drivers by points: loops 37, if/else 24, match/switch 3 (nesting depth added 43). 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":"compiler/rustc_hir_analysis/src/coherence/inherent_impls_overlap.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"408a45fa1840ba506f0cff28bae9937139dde93b6c43e64da4ff9326cedb6f27"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::resolve_ident_in_scope (cognitive 64): Resolver::resolve_ident_in_scope has cognitive complexity 64 (threshold 15). Drivers by points: if/else 36, match/switch 22, boolean chains 4, loops 2 (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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d418ded725ffbc9c900ec3caa95214b3aeeed1885bdcd46d0b842a7188e1b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Matches::check_expr (cognitive 64): Matches::check_expr has cognitive complexity 64 (threshold 15). Drivers by points: if/else 52, boolean chains 8, loops 2, match/switch 2 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/mod.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbde7a8760127e4ac9de345b71caaeefa7a9c78a18b1ffed7f73c6e8a5c1af7e"}},{"ruleId":"D2","level":"warning","message":{"text":"manual_inspect::check (cognitive 64): manual_inspect::check has cognitive complexity 64 (threshold 15). Drivers by points: if/else 30, match/switch 19, boolean chains 9, loops 6 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/manual_inspect.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fb385db4b5c7a455313c589275f35c8f5bd4d52a4dcee577281c80dfe87368"}},{"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 44, loops 11, boolean chains 5, match/switch 4 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":3000}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74b5936e78912db3bd589801f4c68540c089b236211bb841610a6642eeea570"}},{"ruleId":"D2","level":"warning","message":{"text":"transcriber::expand_subtree (cognitive 64): transcriber::expand_subtree has cognitive complexity 64 (threshold 15). Drivers by points: if/else 29, match/switch 28, loops 7 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/transcriber.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec61e716578ba7c4d6f248b4f6af9dada5a6535219d1ea18f311810ccefee939"}},{"ruleId":"D2","level":"warning","message":{"text":"dependency_format::calculate_type (cognitive 63): dependency_format::calculate_type has cognitive complexity 63 (threshold 15). Drivers by points: if/else 34, loops 14, boolean chains 8, match/switch 7 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/dependency_format.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a8a7d3c7e36c4e4cd4dbb64406ee076165dc8c54761f8c7c2b48df40d4c445"}},{"ruleId":"D2","level":"warning","message":{"text":"check_match::report_non_exhaustive_match (cognitive 63): check_match::report_non_exhaustive_match has cognitive complexity 63 (threshold 15). Drivers by points: if/else 49, boolean chains 7, loops 5, match/switch 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2b6c6ba2e12466edd6802608df06458ee3cf59d0b632e237f9c889796e6330"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::visit_item (cognitive 63): Checker::visit_item has cognitive complexity 63 (threshold 15). Drivers by points: if/else 47, loops 6, boolean chains 5, match/switch 5 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ec3d4194fcfa0699f3c2c37af13f0e9712535e225712d6b2fb2fa811ea8213"}},{"ruleId":"D2","level":"warning","message":{"text":"Directive::check (cognitive 63): Directive::check has cognitive complexity 63 (threshold 15). Drivers by points: if/else 52, loops 6, match/switch 5 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/jsondocck/src/directive.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cdebbf7fe197f46e57d64f5bbe1a24f4bed09b3675214ddad933179c8ff04f"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace::cargo_to_crate_graph (cognitive 63): workspace::cargo_to_crate_graph has cognitive complexity 63 (threshold 15). Drivers by points: if/else 46, loops 12, 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":"src/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7caae7359d35161761699b56079f85815b296f2b7a89b1eef5097f44e4621f6"}},{"ruleId":"D2","level":"warning","message":{"text":"NotifyActor::run (cognitive 63): NotifyActor::run has cognitive complexity 63 (threshold 15). Drivers by points: if/else 36, loops 13, match/switch 10, boolean chains 4 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/vfs-notify/src/lib.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eed605b2c6b9774b05d6c37981a16fc2374b908bca2e4a96cd2da6e4a9a48dd"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_expr_outer_attr_style (cognitive 62): State::print_expr_outer_attr_style has cognitive complexity 62 (threshold 15). Drivers by points: if/else 41, boolean chains 7, loops 7, match/switch 7 (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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cda666b8f39f487c2d43e283b97d734cd247e650fc753e07fbbc35664cdc187"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::suggest_make_local_mut (cognitive 62): MirBorrowckCtxt::suggest_make_local_mut has cognitive complexity 62 (threshold 15). Drivers by points: if/else 43, boolean chains 10, match/switch 6, loops 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a6640e3e13f1f35ca575159afb3680e27b7ddb3a0f9db577b6b569e4e2f404"}},{"ruleId":"D2","level":"warning","message":{"text":"macro_rules::check_matcher_core (cognitive 62): macro_rules::check_matcher_core has cognitive complexity 62 (threshold 15). Drivers by points: if/else 38, match/switch 13, loops 7, boolean chains 4 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf18156668e7fd9b4d4e43e3df314b1a4260c6009e0d4efcda861d5fd50d9cb"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_field (cognitive 62): FnCtxt::check_expr_field has cognitive complexity 62 (threshold 15). Drivers by points: if/else 49, boolean chains 5, loops 4, match/switch 4 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":2741}}}],"partialFingerprints":{"codehealthFindingId/v1":"c402ff1cc2ed50e850cf99a14f86c53e73cde2e07d6e02e1c9b7bd6b4808cc06"}},{"ruleId":"D2","level":"warning","message":{"text":"clean::clean_middle_assoc_item (cognitive 62): clean::clean_middle_assoc_item has cognitive complexity 62 (threshold 15). Drivers by points: if/else 33, match/switch 27, boolean chains 2 (nesting depth added 34). Of this number, 57 points are the body\u0027s own statements and 5 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a4ccd4250b1b8e2e048e949bf321dc530f5c4adf0d2398c12370df2e8d8b68"}},{"ruleId":"D2","level":"warning","message":{"text":"Ty::rewrite_result (cognitive 61): Ty::rewrite_result has cognitive complexity 61 (threshold 15). Drivers by points: if/else 54, match/switch 5, boolean chains 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/types.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb889bb9fce9238f82de3b40f35b58d99294d12eeadd668d6b29ca174aecd33"}},{"ruleId":"D2","level":"warning","message":{"text":"naked_asm::prefix_and_suffix (cognitive 61): naked_asm::prefix_and_suffix has cognitive complexity 61 (threshold 15). Drivers by points: if/else 32, match/switch 27, 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":"compiler/rustc_codegen_ssa/src/mir/naked_asm.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7d4ff25dcda640c9936d5b2d73398fa979ed7d1f369d2deff85dcc7cae662a"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::binary_int_op (cognitive 61): InterpCx::binary_int_op has cognitive complexity 61 (threshold 15). Drivers by points: if/else 43, match/switch 12, boolean chains 6 (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":"compiler/rustc_const_eval/src/interpret/operator.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a797adceee8a38bb1736a8e4917c5e9ff5f46614b5216aacc82e4be805e32374"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::next_token_from_cursor (cognitive 61): Lexer::next_token_from_cursor has cognitive complexity 61 (threshold 15). Drivers by points: if/else 54, match/switch 5, boolean chains 1, loops 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9584272d91e832e34e5bb4ea64b565f6259b6e9497cf15bb07bd215eebf8fdbf"}},{"ruleId":"D2","level":"warning","message":{"text":"static_impl_trait::suggest_new_region_bound (cognitive 61): static_impl_trait::suggest_new_region_bound has cognitive complexity 61 (threshold 15). Drivers by points: if/else 53, match/switch 5, boolean chains 2, loops 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/static_impl_trait.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a019b2c94f161e123f24cf372c9a49048a85c6614b7aacaa28a01e49bd8858"}},{"ruleId":"D2","level":"warning","message":{"text":"llvm::configure_cmake (cognitive 61): llvm::configure_cmake has cognitive complexity 61 (threshold 15). Drivers by points: if/else 51, boolean chains 7, loops 2, match/switch 1 (nesting depth added 8). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8efb4b952b0cfab37ce8c369dea63bfb889baf2c351b0d4755b79f774f0b5ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::resolve_path_in_value_ns_with_prefix_info (cognitive 61): Resolver::resolve_path_in_value_ns_with_prefix_info has cognitive complexity 61 (threshold 15). Drivers by points: if/else 41, match/switch 11, boolean chains 5, loops 4 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1bc9733ae836990bdcb4b5bc31d6043e7374d45d1c9511540b0b45d0ca723d"}},{"ruleId":"D2","level":"warning","message":{"text":"postfix::complete_postfix (cognitive 61): postfix::complete_postfix has cognitive complexity 61 (threshold 15). Drivers by points: if/else 36, match/switch 15, boolean chains 10 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/postfix.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"255968e2373e0c36254cf6094557d51a6910df2faad0389544733f707d4a2236"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineAssemblyGenerator::generate_asm_wrapper (cognitive 60): InlineAssemblyGenerator::generate_asm_wrapper has cognitive complexity 60 (threshold 15). Drivers by points: if/else 30, match/switch 16, loops 12, boolean chains 2 (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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fa4cbe4895ce12ba4b7e58a9843f7450932ebca197531836464121abef9a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"TagParser::extract_html_tag (cognitive 60): TagParser::extract_html_tag has cognitive complexity 60 (threshold 15). Drivers by points: if/else 49, loops 7, boolean chains 2, match/switch 2 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"179d0109ff0a1a05ce9f9bf590a9af0bd4f27bfdd8ea4ccd47448553e9777ebb"}},{"ruleId":"D2","level":"warning","message":{"text":"highlight_related::highlight_references (cognitive 60): highlight_related::highlight_references has cognitive complexity 60 (threshold 15). Drivers by points: if/else 40, match/switch 14, loops 4, boolean chains 2 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/highlight_related.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"781a180a7ffcec745198bdb3314541a5f10469e5023781d4778ee30ae24f5a35"}},{"ruleId":"D2","level":"warning","message":{"text":"Canonicalized::canonicalize (cognitive 60): Canonicalized::canonicalize has cognitive complexity 60 (threshold 15). Drivers by points: if/else 29, loops 29, match/switch 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/unicode-table-generator/src/raw_emitter.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5df4cee4af50ea87a06230fdedcc1670269116f5f8eb0628b393d6f4513af5"}},{"ruleId":"D2","level":"warning","message":{"text":"innerRunNameQuery (cognitive 60): innerRunNameQuery has cognitive complexity 60 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3940}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a2086bb555515bb12be4923d459df53bf3859138ff9eba78602adc476d8b97"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_cast (cognitive 59): FnCtxt::suggest_cast has cognitive complexity 59 (threshold 15). Drivers by points: if/else 43, match/switch 12, boolean chains 4 (nesting depth added 12). 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":3365}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1aeb63d04c3b6c1827c346a4e90287fedbe373e5463042fd54ca6fb2a6881ba"}},{"ruleId":"D2","level":"warning","message":{"text":"scalar::parse_header (cognitive 59): scalar::parse_header has cognitive complexity 59 (threshold 15). Drivers by points: if/else 49, loops 7, boolean chains 3 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"002f6a80c41a202ee36a262beaa005f55982260b6a2fb3bc38463547840fbbb7"}},{"ruleId":"D2","level":"warning","message":{"text":"print_item::item_module (cognitive 59): print_item::item_module has cognitive complexity 59 (threshold 15). Drivers by points: match/switch 28, if/else 22, loops 9 (nesting depth added 30). Of this number, 54 points are the body\u0027s own statements and 5 belong to 3 function items declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"395981a779290288672dcb1c1e756ee957004b2621187b23f2ce7ec953ac521e"}},{"ruleId":"D2","level":"warning","message":{"text":"unescaped_backticks::visit_item (cognitive 59): unescaped_backticks::visit_item has cognitive complexity 59 (threshold 15). Drivers by points: if/else 42, boolean chains 8, match/switch 8, loops 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/unescaped_backticks.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a04b60fc31e2a162df3b68e60f6da97ed2eb0d8b529d4855ba6f1b28106b602"}},{"ruleId":"D2","level":"warning","message":{"text":"LintExtractor::lints_from_file (cognitive 59): LintExtractor::lints_from_file has cognitive complexity 59 (threshold 15). Drivers by points: if/else 39, match/switch 13, loops 7 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/lint-docs/src/lib.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3604a2332a9ec3416e4eda5c10c536b9285dbf8af434187310f1d4c3ec2645d"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis::expected_type_and_name (cognitive 59): analysis::expected_type_and_name has cognitive complexity 59 (threshold 15). Drivers by points: if/else 25, match/switch 23, boolean chains 6, loops 5 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"725ef3c600398b0c0ef4fe6efb018e72a5cbb4822d176daf2359909d855cd0c5"}},{"ruleId":"D2","level":"warning","message":{"text":"context::create_module (cognitive 58): context::create_module has cognitive complexity 58 (threshold 15). Drivers by points: if/else 42, match/switch 10, boolean chains 5, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/context.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"816d4d6b5f61906fa09cf381e0c41826e7ba2bb5fc54a304bde3fc7e178ef402"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckLoopVisitor::visit_expr (cognitive 58): CheckLoopVisitor::visit_expr has cognitive complexity 58 (threshold 15). Drivers by points: if/else 35, match/switch 21, boolean chains 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/loops.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc65eb1c347f074745d5fb28f380f54ffe52ccf1257179e89e725441a3a64f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Rvalue::fmt (cognitive 58): Rvalue::fmt has cognitive complexity 58 (threshold 15). Drivers by points: if/else 22, loops 22, match/switch 11, boolean chains 3 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf65274f2ca2cb3260c643a82eb77432de3287e9ab5e011cbb9fc2a70cddb94"}},{"ruleId":"D2","level":"warning","message":{"text":"CfgChecker::visit_terminator (cognitive 58): CfgChecker::visit_terminator has cognitive complexity 58 (threshold 15). Drivers by points: if/else 49, loops 6, boolean chains 2, match/switch 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"35865a4bf0d837fc8932b4e3de087d5efac5341a6bb183aa15ff45a8fcad5e29"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::visit_projection_elem (cognitive 58): TypeChecker::visit_projection_elem has cognitive complexity 58 (threshold 15). Drivers by points: if/else 45, match/switch 11, boolean chains 2 (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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aa68fcad647a64876e89ad2e27c8582cfc5d80b18186001ee0f62f76994979"}},{"ruleId":"D2","level":"warning","message":{"text":"invariant::layout_sanity_check (cognitive 58): invariant::layout_sanity_check has cognitive complexity 58 (threshold 15). Drivers by points: if/else 38, match/switch 10, boolean chains 5, loops 5 (nesting depth added 24). Of this number, 40 points are the body\u0027s own statements and 18 belong to 2 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/layout/invariant.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6069c078b55dc5a1b8446a1b6f2ea0762c094b124848bec2d91c00d187a395"}},{"ruleId":"D2","level":"warning","message":{"text":"explicit_iter_loop::is_ref_iterable (cognitive 58): explicit_iter_loop::is_ref_iterable has cognitive complexity 58 (threshold 15). Drivers by points: if/else 45, boolean chains 11, match/switch 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":"src/tools/clippy/clippy_lints/src/loops/explicit_iter_loop.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1149fb7053d34a3222f34a1bf0a05e5780fbd82126c513229c058bb0784ddf2f"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis::expand (cognitive 58): analysis::expand has cognitive complexity 58 (threshold 15). Drivers by points: if/else 45, match/switch 6, loops 5, boolean chains 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb7af91f2ebbb2fbb0b0d7a23e078e7141ce97298fbb6971c86d7b117065e0f"}},{"ruleId":"D2","level":"warning","message":{"text":"substringMatches (cognitive 58): substringMatches has cognitive complexity 58 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"975fa662d71fffcbd6689a31dd28ee635f72a1d28dd0e82879358be30a4c747e"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgMatrix::find_issue (cognitive 57): ArgMatrix::find_issue has cognitive complexity 57 (threshold 15). Drivers by points: if/else 43, loops 9, boolean chains 3, match/switch 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/arg_matrix.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"28db3c243f456af0a3183f2986b576c3d291b816315351383c08058683ba3f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"SizeSkeleton::compute_inner (cognitive 57): SizeSkeleton::compute_inner has cognitive complexity 57 (threshold 15). Drivers by points: if/else 32, match/switch 20, boolean chains 3, loops 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"1810fae986b375f2da7b65100ce0ca4b8922193c62a6dea2ef7d8ed28b227bda"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnostics::report_result (cognitive 57): diagnostics::report_result has cognitive complexity 57 (threshold 15). Drivers by points: if/else 33, loops 12, match/switch 12 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/diagnostics.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd92fbb0b9dc105410bf2b4bfb9391cae15cc9304d1e91328276b5df69bb2a69"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::process_changes (cognitive 57): GlobalState::process_changes has cognitive complexity 57 (threshold 15). Drivers by points: if/else 45, match/switch 7, loops 3, boolean chains 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"676ecb91a224927b015e208290ce83d9243266386c1a5af47f32c3c77f54ce2e"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::switch_workspaces (cognitive 57): GlobalState::switch_workspaces has cognitive complexity 57 (threshold 15). Drivers by points: if/else 36, match/switch 10, loops 6, boolean chains 5 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"c274c58b9768ff11a390067144180895855144b3b53faf78fb8811bfeed21587"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalizedConstraintGraph::traverse (cognitive 56): LocalizedConstraintGraph::traverse has cognitive complexity 56 (threshold 15). Drivers by points: if/else 38, loops 18 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/polonius/constraints.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5caa2ed3246c2485220ef096752d61a5ce2569eb05bd1f3781fdd33285e6e53e"}},{"ruleId":"D2","level":"warning","message":{"text":"attributes::llfn_attrs_from_instance (cognitive 56): attributes::llfn_attrs_from_instance has cognitive complexity 56 (threshold 15). Drivers by points: if/else 49, boolean chains 3, loops 2, match/switch 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/attributes.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76b92074c899bd770afd2b15d237072e8545f1d3049d4fe3704b176e50ade79"}},{"ruleId":"D2","level":"warning","message":{"text":"write::produce_final_output_artifacts (cognitive 56): write::produce_final_output_artifacts has cognitive complexity 56 (threshold 15). Drivers by points: if/else 41, boolean chains 6, loops 6, match/switch 3 (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":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f257c8f75e5339685a243ca213c889126d8c2a34546cc06df701cb267630461"}},{"ruleId":"D2","level":"warning","message":{"text":"macro_rules::is_in_follow (cognitive 56): macro_rules::is_in_follow has cognitive complexity 56 (threshold 15). Drivers by points: match/switch 44, if/else 8, boolean chains 4 (nesting depth added 35). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f10c3cf8ac3acd29a0dbc1c5fc68c56f960c809b1faabf0dc9b2c5d848229fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_struct_fields (cognitive 56): Parser::parse_struct_fields has cognitive complexity 56 (threshold 15). Drivers by points: if/else 42, match/switch 7, boolean chains 6, loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":3871}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c182be52ac45d351224b74dddab3ea3114b6708b75f3cb4b3448ac8670b8abb"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::source_span_for_markdown_range_inner (cognitive 56): rustdoc::source_span_for_markdown_range_inner has cognitive complexity 56 (threshold 15). Drivers by points: if/else 44, boolean chains 7, loops 5 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/rustdoc.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"d813be87a07d8690583b6523c2311b0a4c7d28167e196a715f2632b2256b8607"}},{"ruleId":"D2","level":"warning","message":{"text":"format::format (cognitive 56): format::format has cognitive complexity 56 (threshold 15). Drivers by points: if/else 28, loops 13, match/switch 12, boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/format.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a449b9b15ab2df531da286c57c00129f8cbd0ddcd2a08b7efd72c6ad0297da06"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::check_record_expr_fields (cognitive 56): InferenceContext::check_record_expr_fields has cognitive complexity 56 (threshold 15). Drivers by points: if/else 40, loops 7, match/switch 7, boolean chains 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cdd2fb8223dd943e17fc6f13de0bb38b9c37c0ad52f32f42d049043e8c9444"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace::handle_rustc_crates (cognitive 56): workspace::handle_rustc_crates has cognitive complexity 56 (threshold 15). Drivers by points: if/else 33, loops 23 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a91f0ccee18a32a79204f8de872e6013343a4a36be1262c9ae835ae8166c80"}},{"ruleId":"D2","level":"warning","message":{"text":"check::check_impl_items_against_trait (cognitive 55): check::check_impl_items_against_trait has cognitive complexity 55 (threshold 15). Drivers by points: if/else 38, match/switch 10, boolean chains 4, loops 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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"8633e51d1b44df53824972a88fa8d04efb26b2d35c6efbdb6fd62b3ab1ea843a"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::check_unused (cognitive 55): Resolver::check_unused has cognitive complexity 55 (threshold 15). Drivers by points: if/else 29, boolean chains 11, loops 8, match/switch 7 (nesting depth added 21). Of this number, 51 points are the body\u0027s own statements and 4 belong to 2 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/check_unused.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"933dd6bff0340453476e9319d2df77f88408cc200c621643c75f9733b12d3592"}},{"ruleId":"D2","level":"warning","message":{"text":"VisitOpaqueTypes::visit_ty (cognitive 55): VisitOpaqueTypes::visit_ty has cognitive complexity 55 (threshold 15). Drivers by points: if/else 30, loops 12, match/switch 9, boolean chains 4 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/impl_trait_overcaptures.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ff75cd5c9b52ac8d206c90be92ed53d2596c104f96fd6dcc15cc8abca7b60f"}},{"ruleId":"D2","level":"warning","message":{"text":"InterPat::lower_thir_pat (cognitive 55): InterPat::lower_thir_pat has cognitive complexity 55 (threshold 15). Drivers by points: if/else 31, loops 11, match/switch 7, boolean chains 6 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/matches/match_pair.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4d054b6d814da00b1bc76c1ac85ac4fe24d90a9bffffe4d646b331bfd51cd7"}},{"ruleId":"D2","level":"warning","message":{"text":"unnecessary_to_owned::can_change_type (cognitive 55): unnecessary_to_owned::can_change_type has cognitive complexity 55 (threshold 15). Drivers by points: if/else 48, boolean chains 4, match/switch 2, loops 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc079b8d81df8e8b53af511b9d9b21c9d8b30e917dc3255163f10e0b8ee1d04"}},{"ruleId":"D2","level":"warning","message":{"text":"link::link_binary (cognitive 54): link::link_binary has cognitive complexity 54 (threshold 15). Drivers by points: if/else 40, boolean chains 6, loops 5, match/switch 3 (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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e92694545a521f263fa0d4514688bebeee211b43cce41fe4a454a3368a9b8b"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::smart_resolve_macro_path (cognitive 54): Resolver::smart_resolve_macro_path has cognitive complexity 54 (threshold 15). Drivers by points: if/else 37, boolean chains 7, match/switch 6, loops 4 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac74ae928224c2034d59d0751cca15a7d23c1126c8383ed9abd584cc85d3f691"}},{"ruleId":"D2","level":"warning","message":{"text":"IfLetRescope::probe_if_cascade (cognitive 54): IfLetRescope::probe_if_cascade has cognitive complexity 54 (threshold 15). Drivers by points: if/else 50, boolean chains 2, loops 1, match/switch 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/if_let_rescope.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc3d6e4e35edc037b062c1731d4e1f08f3142119a08464b9b5d1935c32cc381"}},{"ruleId":"D2","level":"warning","message":{"text":"NeedsDropTypes::next (cognitive 54): NeedsDropTypes::next has cognitive complexity 54 (threshold 15). Drivers by points: loops 26, if/else 19, match/switch 9 (nesting depth added 37). 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":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f20e3a5b2e6e968da16962aa3a79a2d772fd3220947cb25e6377fdff326fd4"}},{"ruleId":"D2","level":"warning","message":{"text":"html_tags::visit_item (cognitive 54): html_tags::visit_item has cognitive complexity 54 (threshold 15). Drivers by points: if/else 31, match/switch 11, boolean chains 7, loops 5 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4d00cc494bd046e86683d4c1b93570c58c2ef47817da93cfdc129c35a003de"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_pat (cognitive 54): Printer::print_pat has cognitive complexity 54 (threshold 15). Drivers by points: if/else 37, loops 12, match/switch 3, boolean chains 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0eea1692a70d5c75b7480928fbb91d22b1c6e553d74533502283a6bec60e64d"}},{"ruleId":"D2","level":"warning","message":{"text":"derive_macro::coerce_pointee_expand (cognitive 54): derive_macro::coerce_pointee_expand has cognitive complexity 54 (threshold 15). Drivers by points: if/else 36, match/switch 10, boolean chains 4, loops 4 (nesting depth added 15). Of this number, 38 points are the body\u0027s own statements and 16 belong to 4 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"df69d6f9a58010c5a5dea706ecec29f517a25bc356a0738febf3ee44154837ef"}},{"ruleId":"D2","level":"warning","message":{"text":"triagebot::check (cognitive 54): triagebot::check has cognitive complexity 54 (threshold 15). Drivers by points: if/else 39, loops 15 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/triagebot.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b361b99ad8c519f3ceb8ab807d56cac46f6ade6274e22937b19db7f16c83ff54"}},{"ruleId":"D2","level":"warning","message":{"text":"getNextElem (cognitive 54): getNextElem has cognitive complexity 54 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"db96fd50ac5b968ff6b6cfa9ad0c712ae88da3dd3c46236d73291a6ab02265ad"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_pat (cognitive 53): State::print_pat has cognitive complexity 53 (threshold 15). Drivers by points: if/else 49, match/switch 3, boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1912}}}],"partialFingerprints":{"codehealthFindingId/v1":"992c8cfa8862ea000f7b361874e64bfe3c136735f8c7e50add5f07c3feaefb38"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_rvalue_operand (cognitive 53): FunctionCx::codegen_rvalue_operand has cognitive complexity 53 (threshold 15). Drivers by points: if/else 33, match/switch 17, loops 2, boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48d353121e69edff6a07016ea150e11390a5d456be13c7fd600bd02c9d157a8"}},{"ruleId":"D2","level":"warning","message":{"text":"check::check_opaque_precise_captures (cognitive 53): check::check_opaque_precise_captures has cognitive complexity 53 (threshold 15). Drivers by points: if/else 39, match/switch 8, loops 4, boolean chains 2 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"6023d5cd78940aa2e45a5e402dd7b93de3ba3bc3bb8354124cdba09c50206cc8"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::point_at_expr_if_possible (cognitive 53): FnCtxt::point_at_expr_if_possible has cognitive complexity 53 (threshold 15). Drivers by points: if/else 30, loops 13, boolean chains 5, match/switch 5 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f9c6c16963398c27e28c514c476e007d70741bf6d3c30343f71621a37261e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::new (cognitive 53): Parser::new has cognitive complexity 53 (threshold 15). Drivers by points: if/else 47, match/switch 4, boolean chains 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ab3d255db18aa67408e28bb9b3eded651c45e71290ce38a21327f678a1f74b"}},{"ruleId":"D2","level":"warning","message":{"text":"validations::run_utf8_validation (cognitive 53): validations::run_utf8_validation has cognitive complexity 53 (threshold 15). Drivers by points: if/else 30, match/switch 11, loops 9, boolean chains 3 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/validations.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"383a703462cd09cb5db8c716d0d530a2ccc9dd65e4ee8e5cd605f829fedfaa66"}},{"ruleId":"D2","level":"warning","message":{"text":"cfg::extract_cfg_from_attrs (cognitive 53): cfg::extract_cfg_from_attrs has cognitive complexity 53 (threshold 15). Drivers by points: if/else 29, loops 19, match/switch 3, boolean chains 2 (nesting depth added 25). Of this number, 49 points are the body\u0027s own statements and 4 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/cfg.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a296b17082c4853ba2597062e4ab4a4ba76fa1318925644f61cc2ed2d714bb1"}},{"ruleId":"D2","level":"warning","message":{"text":"sse42::compare_strings (cognitive 53): sse42::compare_strings has cognitive complexity 53 (threshold 15). Drivers by points: if/else 29, loops 19, match/switch 4, boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/x86/sse42.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"771e28f89d39eef64e71c67639634875c4ab636b0e8213524943afc38848bc4e"}},{"ruleId":"D2","level":"warning","message":{"text":"format_args::parse (cognitive 53): format_args::parse has cognitive complexity 53 (threshold 15). Drivers by points: if/else 26, match/switch 25, loops 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/hir/format_args.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a0d8dbc66bf4bb27ce41027cc66b54ac0df92548982314450cc6a5e3b28564"}},{"ruleId":"D2","level":"warning","message":{"text":"borrowck::mutability_of_locals (cognitive 53): borrowck::mutability_of_locals has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18, match/switch 18, loops 16, boolean chains 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/borrowck.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"898ee394270eb8a1c662c4b51c2b3ae8170d1102bac5e357aaab41f60469ea1a"}},{"ruleId":"D2","level":"warning","message":{"text":"adjustment::hints (cognitive 53): adjustment::hints has cognitive complexity 53 (threshold 15). Drivers by points: if/else 33, boolean chains 10, match/switch 7, loops 3 (nesting depth added 13). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/adjustment.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a7e7ce960c83328d143bf66b5038b3c4fa265e6a4602dc75b874803e3f7fc7"}},{"ruleId":"D2","level":"warning","message":{"text":"matcher::match_loop (cognitive 53): matcher::match_loop has cognitive complexity 53 (threshold 15). Drivers by points: if/else 37, match/switch 8, loops 5, 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":"src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33b8c9b5f475f24c4c4d4f0ddd7183a5af4670c19c21d236084b8ee0354c319"}},{"ruleId":"D2","level":"warning","message":{"text":"FlycheckActor::run (cognitive 53): FlycheckActor::run has cognitive complexity 53 (threshold 15). Drivers by points: if/else 25, match/switch 19, loops 9 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/flycheck.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"061cacda940725031672d9bc69b3cbd005a804bd8e85d9201a301b11d7fed063"}},{"ruleId":"D2","level":"warning","message":{"text":"link::add_native_libs_from_crate (cognitive 52): link::add_native_libs_from_crate has cognitive complexity 52 (threshold 15). Drivers by points: if/else 45, boolean chains 3, match/switch 3, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3175}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4c8ba7c72dc28fd95d71540134d97199428a55ee9425494ee13bdadbc20015"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::visit_terminator (cognitive 52): Checker::visit_terminator has cognitive complexity 52 (threshold 15). Drivers by points: if/else 35, match/switch 11, boolean chains 6 (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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"7472c417d00263aee4f616c31a2f0256e84b35e4a71280f418925070748fdd6c"}},{"ruleId":"D2","level":"warning","message":{"text":"ops::build_error_for_const_call (cognitive 52): ops::build_error_for_const_call has cognitive complexity 52 (threshold 15). Drivers by points: if/else 33, match/switch 9, boolean chains 5, loops 5 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/check_consts/ops.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c473897819d6e52ecace331dc5ae165a7c7bc05f5092ff2f54113e16e5ef741c"}},{"ruleId":"D2","level":"warning","message":{"text":"unescape_error_reporting::emit_unescape_error (cognitive 52): unescape_error_reporting::emit_unescape_error has cognitive complexity 52 (threshold 15). Drivers by points: if/else 34, boolean chains 8, match/switch 6, loops 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":"compiler/rustc_parse/src/lexer/unescape_error_reporting.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dfeb9e391ce72d600ea0373eee4146650a709e9519b6f112a5ddeafd837989"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_expr_bottom (cognitive 52): Parser::parse_expr_bottom has cognitive complexity 52 (threshold 15). Drivers by points: if/else 48, boolean chains 4 (nesting depth added 5). 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb57a00aa93e0f1a431aef0b88bcaf8c940e69918595f762f28fc351d3e928d5"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformTy::fold_ty (cognitive 52): TransformTy::fold_ty has cognitive complexity 52 (threshold 15). Drivers by points: if/else 41, match/switch 9, boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c4ea84f998340e2b88ab8a896a854ac85fd58a7d7447f3b0a8bb8ab2b172e8"}},{"ruleId":"D2","level":"warning","message":{"text":"x86::compute_abi_info (cognitive 52): x86::compute_abi_info has cognitive complexity 52 (threshold 15). Drivers by points: if/else 30, match/switch 13, loops 5, boolean chains 4 (nesting depth added 28). Of this number, 40 points are the body\u0027s own statements and 12 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/x86.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f4519d8a156e4707a000e7a85032743777b40fe02e55431941b8ff0bf29758"}},{"ruleId":"D2","level":"warning","message":{"text":"CacheBuilder::fold_item (cognitive 52): CacheBuilder::fold_item has cognitive complexity 52 (threshold 15). Drivers by points: if/else 29, match/switch 9, boolean chains 8, loops 6 (nesting depth added 17). Of this number, 51 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/formats/cache.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"787f20f3d59016598fa55112fc2294cf811ea63f627620612e4ebd30c2c3570a"}},{"ruleId":"D2","level":"warning","message":{"text":"lifetimes::check_fn_inner (cognitive 52): lifetimes::check_fn_inner has cognitive complexity 52 (threshold 15). Drivers by points: if/else 29, loops 12, match/switch 6, 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":"src/tools/clippy/clippy_lints/src/lifetimes.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac223d5251b34dd82ebb617788e7f1de07c1bd927e300027a4c5236006f309d"}},{"ruleId":"D2","level":"warning","message":{"text":"transformResults (cognitive 52): transformResults has cognitive complexity 52 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2660}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ad42d75bbc8f5ad829183ebc301a30436f9f2d9336989616146c829ed8552c"}},{"ruleId":"D2","level":"warning","message":{"text":"macro_rules::compile_declarative_macro (cognitive 51): macro_rules::compile_declarative_macro has cognitive complexity 51 (threshold 15). Drivers by points: if/else 49, boolean chains 1, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9c22b5f1a62a1d7c74440403300b8a73da17b99b2fdfc80c07419b5a72eee7"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentResult::report_fully_unused (cognitive 51): AssignmentResult::report_fully_unused has cognitive complexity 51 (threshold 15). Drivers by points: if/else 46, boolean chains 4, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"df151e0c2580bfcd448877b9e8594025cfd6f45661af7b3e8f231211098de93d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_pat_with_range_pat (cognitive 51): Parser::parse_pat_with_range_pat has cognitive complexity 51 (threshold 15). Drivers by points: if/else 35, boolean chains 8, match/switch 8 (nesting depth added 9). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3100f0fb765cc46d39a8fd1210a8369134abb09d667f28f76754368dfc8a039"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::smart_resolve_path_fragment (cognitive 51): LateResolutionVisitor::smart_resolve_path_fragment has cognitive complexity 51 (threshold 15). Drivers by points: if/else 39, boolean chains 6, match/switch 6 (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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":4549}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec037e4917a4bbf491f583c249d0ffa06a8c204ca57362f082fda73055d90a5"}},{"ruleId":"D2","level":"warning","message":{"text":"libm_macros::validate (cognitive 51): libm_macros::validate has cognitive complexity 51 (threshold 15). Drivers by points: if/else 33, loops 15, boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/crates/libm-macros/src/lib.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"074f162a00ab42cc23b1189487e3abe9ac1f2f6f4fbbc609468d6cbcd81a7b1a"}},{"ruleId":"D2","level":"warning","message":{"text":"render::render_impl::doc_impl_item (cognitive 51): render::render_impl::doc_impl_item has cognitive complexity 51 (threshold 15). Drivers by points: if/else 46, boolean chains 3, match/switch 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"5333d645831ba99d5993725ba2c0fd7b8459048e9301bb06ecd1253e4f449bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"op_ref::check (cognitive 51): op_ref::check has cognitive complexity 51 (threshold 15). Drivers by points: if/else 29, boolean chains 19, match/switch 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/op_ref.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa8e6cec50656a00a1793cd4c5878231ea8a8153bdd18b9ea87faf9149d01c6"}},{"ruleId":"D2","level":"warning","message":{"text":"literal::check (cognitive 51): literal::check has cognitive complexity 51 (threshold 15). Drivers by points: match/switch 23, if/else 21, loops 4, boolean chains 3 (nesting depth added 28). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/write/literal.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f461c687de7eb8dfd6f8440e58c5291fa82dcfa00809e71d53ed9ade6d882bf"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::check_call_arguments (cognitive 51): InferenceContext::check_call_arguments has cognitive complexity 51 (threshold 15). Drivers by points: if/else 31, match/switch 15, loops 4, boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc7dc3187a523d720d06b90279a49444aa6858d468634e6dc60a427a41c0e17"}},{"ruleId":"D2","level":"warning","message":{"text":"macros::rewrite_macro_inner (cognitive 51): macros::rewrite_macro_inner has cognitive complexity 51 (threshold 15). Drivers by points: if/else 29, match/switch 15, boolean chains 7 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/macros.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"8790abe81644f7ce889ff99ae667f9b63299cfc520b19e3fc2913a456ca1f56f"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::add_move_hints (cognitive 50): MirBorrowckCtxt::add_move_hints has cognitive complexity 50 (threshold 15). Drivers by points: if/else 33, match/switch 13, boolean chains 4 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d30ec5053c78e46308fdc81060725b2e68ea46ed1a9db468bc7ea669478cd2"}},{"ruleId":"D2","level":"warning","message":{"text":"constant::mir_operand_get_const_val (cognitive 50): constant::mir_operand_get_const_val has cognitive complexity 50 (threshold 15). Drivers by points: match/switch 31, if/else 14, loops 5 (nesting depth added 38). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef3faf23fe1c47e109bfb8e5e5ac8220a803edd83d80f66be620e19db27c43c"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkingFailed::into_diag (cognitive 50): LinkingFailed::into_diag has cognitive complexity 50 (threshold 15). Drivers by points: if/else 40, loops 5, match/switch 5 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/diagnostics.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42791ca40815a9957aa85a7e1050545322a081ba9e7d82d5f8949b661a93b06"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidityVisitor::visit_value (cognitive 50): ValidityVisitor::visit_value has cognitive complexity 50 (threshold 15). Drivers by points: if/else 33, match/switch 14, boolean chains 3 (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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b461004efc94c88125f7414df285c0fd69c51c89f462f942406101267bf7d8"}},{"ruleId":"D2","level":"warning","message":{"text":"wfcheck::check_gat_where_clauses (cognitive 50): wfcheck::check_gat_where_clauses has cognitive complexity 50 (threshold 15). Drivers by points: if/else 37, loops 7, match/switch 6 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e3ae76f6a9f765834f9b442b2fa7a011c940f5018f085905d4297f31b5acd9"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_block (cognitive 50): FnCtxt::check_expr_block has cognitive complexity 50 (threshold 15). Drivers by points: if/else 46, boolean chains 3, loops 1 (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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e114b1051baadbf3f8985b69bb828cd73353fdf8aefa380fc45877dbd3102a"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_pat_ref (cognitive 50): FnCtxt::check_pat_ref has cognitive complexity 50 (threshold 15). Drivers by points: if/else 35, match/switch 8, boolean chains 7 (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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2794}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0241e23e1a78cc758d5c6c5374c9df8fe147f1f0473833c71c4e9cd3ed39f91"}},{"ruleId":"D2","level":"warning","message":{"text":"MoveDataBuilder::move_path_for (cognitive 50): MoveDataBuilder::move_path_for has cognitive complexity 50 (threshold 15). Drivers by points: if/else 26, match/switch 20, loops 4 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d75a0b9e16c70fb9daa37fc19c63086e7212bedf21b5d707f97ea4a690ea2f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_arm (cognitive 50): Parser::parse_arm has cognitive complexity 50 (threshold 15). Drivers by points: if/else 42, boolean chains 8 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":3359}}}],"partialFingerprints":{"codehealthFindingId/v1":"211adb8b21033ff8c3c732667b5c99016e4e1c7ecc8f85edb18d5d8d44d02f54"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::with_generic_param_rib (cognitive 50): LateResolutionVisitor::with_generic_param_rib has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24, match/switch 13, loops 11, boolean chains 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":3085}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b3c69b66a1cdc4826a2fd16320a5734889c4af780813b1b33da5d13b9dade3"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::compare_generics (cognitive 50): TypeErrCtxt::compare_generics has cognitive complexity 50 (threshold 15). Drivers by points: if/else 33, loops 7, match/switch 7, boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8526d7426deeb59c1929cbaef911405ca791df96a3d875a108bddc1610201a"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoTraitFinder::evaluate_nested_obligations (cognitive 50): AutoTraitFinder::evaluate_nested_obligations has cognitive complexity 50 (threshold 15). Drivers by points: if/else 32, match/switch 15, boolean chains 2, loops 1 (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":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"b515b770887681191ad5c638e5ad6be0986bc3b09c5200bf1786fbf6edf0538a"}},{"ruleId":"D2","level":"warning","message":{"text":"delegate::u128_divide_sparc (cognitive 50): delegate::u128_divide_sparc has cognitive complexity 50 (threshold 15). Drivers by points: if/else 41, loops 8, match/switch 1 (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":"library/compiler-builtins/compiler-builtins/src/int/specialized_div_rem/delegate.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe1dba1a59dedd64c47f9b8eba8688c52c1cbc804e24a8428ea46e5a856e3f3"}},{"ruleId":"D2","level":"warning","message":{"text":"fma::fma_round (cognitive 50): fma::fma_round has cognitive complexity 50 (threshold 15). Drivers by points: if/else 49, 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":"library/compiler-builtins/libm/src/math/generic/fma.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc26f83a552603e7230dc9bd2bb7436f01e4b2b1caa4e5b643e71874597fc5f6"}},{"ruleId":"D2","level":"warning","message":{"text":"TcpSocket::setsockopt (cognitive 50): TcpSocket::setsockopt has cognitive complexity 50 (threshold 15). Drivers by points: if/else 36, match/switch 13, boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78eeb1875705b206f26b55040d21d6246e5352eddaf0a66e236fc6b17291e31"}},{"ruleId":"D2","level":"warning","message":{"text":"type::complete_type_path (cognitive 50): type::complete_type_path has cognitive complexity 50 (threshold 15). Drivers by points: if/else 28, match/switch 16, loops 6 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/type.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dec92087f21eed2f70182ab73298ff947edfa2a3ebc382175f5c0196b0ecb80"}},{"ruleId":"D2","level":"warning","message":{"text":"TargetDataLayout::parse_from_llvm_datalayout_string (cognitive 49): TargetDataLayout::parse_from_llvm_datalayout_string has cognitive complexity 49 (threshold 15). Drivers by points: if/else 36, match/switch 10, boolean chains 2, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d72691efcb2619a760c6afd43225e0ec4ce6e634b12430a712cc0489533df9a"}},{"ruleId":"D2","level":"warning","message":{"text":"expr::reconstruct_format_args_template_string (cognitive 49): expr::reconstruct_format_args_template_string has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22, match/switch 22, loops 4, boolean chains 1 (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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"0122d768fde065d56bd1fe50660662304844d607be70c40f3bb11a8e20c7f7b4"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::later_use_kind (cognitive 49): MirBorrowckCtxt::later_use_kind has cognitive complexity 49 (threshold 15). Drivers by points: if/else 40, match/switch 8, boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d7196496c15d18572c4048d57d6abcdaec749b8879f16f3f70c577bbdcc21d"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_argument_types (cognitive 49): FnCtxt::check_argument_types has cognitive complexity 49 (threshold 15). Drivers by points: if/else 37, loops 6, match/switch 4, boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5bbefccfba52cb75c6ff4ffdfca07d6bc675e85bd174bbc8045498e0d54c60"}},{"ruleId":"D2","level":"warning","message":{"text":"collector::collect_items_rec (cognitive 49): collector::collect_items_rec has cognitive complexity 49 (threshold 15). Drivers by points: if/else 25, match/switch 12, loops 10, boolean chains 2 (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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5937c4490d6f487afa26243fdc3b586625d96b4b4faaba131126aebdf290d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::check_no_chained_comparison (cognitive 49): Parser::check_no_chained_comparison has cognitive complexity 49 (threshold 15). Drivers by points: if/else 35, match/switch 9, boolean chains 5 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b563c41d2971301677540225fb5f43587ed7cee24f9c1b44cbf51339b120dff"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_ty_common (cognitive 49): Parser::parse_ty_common has cognitive complexity 49 (threshold 15). Drivers by points: if/else 31, boolean chains 9, match/switch 9 (nesting depth added 8). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8cdf411fb0513cc45e18dc7c71876e5f78f4bff6ccdabe81ab311d84707da1"}},{"ruleId":"D2","level":"warning","message":{"text":"cfg::default_configuration (cognitive 49): cfg::default_configuration has cognitive complexity 49 (threshold 15). Drivers by points: if/else 43, loops 3, match/switch 2, boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/config/cfg.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d6d28de26a3ffee1b20713273281d3604a4a647a65a476e0a109515c1a3d06"}},{"ruleId":"D2","level":"warning","message":{"text":"x86::detect_features (cognitive 49): x86::detect_features has cognitive complexity 49 (threshold 15). Drivers by points: if/else 45, boolean chains 4 (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":"library/std_detect/src/detect/os/x86.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0d53c751f092ad77e94c3e5dfed018952510de5b865e79810b33417d6e5294"}},{"ruleId":"D2","level":"warning","message":{"text":"ArbitrarySourceItemOrdering::check_item (cognitive 49): ArbitrarySourceItemOrdering::check_item has cognitive complexity 49 (threshold 15). Drivers by points: if/else 35, loops 8, boolean chains 5, match/switch 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fe9d8274cf0212364eab23a1c302732ce29d875e711212ac63dfce63c64e2c"}},{"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 38, loops 8, boolean chains 2, match/switch 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/single_component_path_imports.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c12a2db86e1961292de546b04f6ede4fef71ae793e325dd8e2210d76071c9d4"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cognitive 49): EvalContextExt::emulate_foreign_item_inner has cognitive complexity 49 (threshold 15). Drivers by points: if/else 34, match/switch 13, boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"08597a2c5055660ca78a94a8d6f8a7c9393afec8964d68110e2bdbb68922bb7c"}},{"ruleId":"D2","level":"warning","message":{"text":"inline_type_alias::create_replacement (cognitive 49): inline_type_alias::create_replacement has cognitive complexity 49 (threshold 15). Drivers by points: if/else 41, loops 4, boolean chains 2, match/switch 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_type_alias.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9343fdcf0a57fd8e7b38bbd6bd0a76ffdad3d8cec8c42dbc62c53dff36855a"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_variable::extract_variable (cognitive 49): extract_variable::extract_variable has cognitive complexity 49 (threshold 15). Drivers by points: if/else 31, match/switch 14, boolean chains 3, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_variable.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ed6cfbe570a63bc1f5262b3075f40e1e703693fbdf829eb62b1c187a0f7dac"}},{"ruleId":"D2","level":"warning","message":{"text":"unicode_table_generator::load_data (cognitive 49): unicode_table_generator::load_data has cognitive complexity 49 (threshold 15). Drivers by points: if/else 35, loops 8, boolean chains 3, match/switch 3 (nesting depth added 16). Of this number, 46 points are the body\u0027s own statements and 3 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/unicode-table-generator/src/main.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"572636774671faa92326de2bd2d8013eedbb48c82205c29d465834bc6bf52161"}},{"ruleId":"D2","level":"warning","message":{"text":"valueCheck (cognitive 49): valueCheck has cognitive complexity 49 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6e1471cc1133e05612bb637c6bddfe9697ed97aea233f33c8601dd50ffb866"}},{"ruleId":"D2","level":"warning","message":{"text":"substringMatches (cognitive 49): substringMatches has cognitive complexity 49 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2447}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba1dbca5288dc9498511c2b4f382f461e483edc529b524b9a53e71481ae277a"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::visit_scopes (cognitive 48): Resolver::visit_scopes has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 24, if/else 14, boolean chains 6, loops 4 (nesting depth added 23). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"da194b8ebd85c40c8fe8545ee7a3d26f9fa0e2843133cb4b8d9e5d08162f09b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::visit_path (cognitive 48): Checker::visit_path has cognitive complexity 48 (threshold 15). Drivers by points: if/else 37, match/switch 8, loops 3 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f97e41a2caebb702bf09a51436d7da523ef52ddfb56de3a2589f7d2177a690"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::suggest_introducing_lifetime_filtered (cognitive 48): LateResolutionVisitor::suggest_introducing_lifetime_filtered has cognitive complexity 48 (threshold 15). Drivers by points: if/else 35, loops 6, boolean chains 5, match/switch 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"733528a69adc6dcc4d26428070ddc506284f5b01720fedd196a82e49fcdc5ec2"}},{"ruleId":"D2","level":"warning","message":{"text":"map_clone::check (cognitive 48): map_clone::check has cognitive complexity 48 (threshold 15). Drivers by points: if/else 34, match/switch 9, 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":"src/tools/clippy/clippy_lints/src/methods/map_clone.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c4150549d331d5e1c4130dc6f3e6d0e1c5d90ffffedba484f8ff04d8c1e2fd"}},{"ruleId":"D2","level":"warning","message":{"text":"unwrap_expect_used::check (cognitive 48): unwrap_expect_used::check has cognitive complexity 48 (threshold 15). Drivers by points: if/else 37, boolean chains 6, loops 4, match/switch 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unwrap_expect_used.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee6557b93c53ce69086923ead7e0af131a30a25f83d3f9c2214eb85aff3dcb8"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportMap::collect_import_map (cognitive 48): ImportMap::collect_import_map has cognitive complexity 48 (threshold 15). Drivers by points: if/else 22, match/switch 20, loops 6 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/import_map.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dea0baf577f03f3b62382a2bd1dbd2c29820aa8f5c9c1146a3cb5e4cab049d"}},{"ruleId":"D2","level":"warning","message":{"text":"TyLoweringContext::lower_dyn_trait (cognitive 48): TyLoweringContext::lower_dyn_trait has cognitive complexity 48 (threshold 15). Drivers by points: if/else 31, match/switch 11, loops 4, boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"70869d6f5d669488052e6ddecc30618e95d7ced9ee106ece1e39edb34eebc4d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Scip::run (cognitive 48): Scip::run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 31, match/switch 9, loops 6, boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/scip.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3541981878843aa2210cd26a0b25e480425dfe4a879de6272be000ec33f1dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"CharClasses::next (cognitive 48): CharClasses::next has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 29, if/else 16, boolean chains 3 (nesting depth added 22). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9c3b723fce22d803cabf028313d494c9cd78cf8783fdeb5857568935ddcd3e"}},{"ruleId":"D2","level":"warning","message":{"text":"FmtVisitor::close_block (cognitive 48): FmtVisitor::close_block has cognitive complexity 48 (threshold 15). Drivers by points: if/else 24, match/switch 17, boolean chains 6, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/visitor.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"651a4e06858c57c6981b004df00b39af6e422c8da84e7717426db49353f8f02c"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::describe_place_with_options (cognitive 47): MirBorrowckCtxt::describe_place_with_options has cognitive complexity 47 (threshold 15). Drivers by points: if/else 39, match/switch 7, loops 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5111633c0ea3b309f25d3c775bacdf4197f094550007505299c5d6fe47c97e"}},{"ruleId":"D2","level":"warning","message":{"text":"write::llvm_optimize (cognitive 47): write::llvm_optimize has cognitive complexity 47 (threshold 15). Drivers by points: if/else 34, boolean chains 6, loops 4, match/switch 3 (nesting depth added 11). Of this number, 40 points are the body\u0027s own statements and 7 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a1fb000fa6a9e92ef95a220b080b8158d8e70aae0f13580d26a2122839519c"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_rvalue (cognitive 47): FunctionCx::codegen_rvalue has cognitive complexity 47 (threshold 15). Drivers by points: if/else 37, match/switch 5, boolean chains 3, loops 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b0e0f0f453d750efe285ac7c4012faed67e680f6a99e580025d8ae500e74af"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagCtxtInner::emit_diagnostic (cognitive 47): DiagCtxtInner::emit_diagnostic has cognitive complexity 47 (threshold 15). Drivers by points: if/else 43, boolean chains 3, match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/lib.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b04301548af5a522706124884dd71e841103661352d63b49365ba67a625f2e"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::cmp (cognitive 47): TypeErrCtxt::cmp has cognitive complexity 47 (threshold 15). Drivers by points: if/else 40, match/switch 3, boolean chains 2, loops 2 (nesting depth added 19). Of this number, 41 points are the body\u0027s own statements and 6 belong to 2 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"29058aed08fc43219ed10ad3faa5ba6ea56459cffc73ee27c7d265e66ab8d96a"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepRejectCtxt::types_may_unify_inner (cognitive 47): DeepRejectCtxt::types_may_unify_inner has cognitive complexity 47 (threshold 15). Drivers by points: match/switch 30, boolean chains 14, if/else 3 (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":"compiler/rustc_type_ir/src/fast_reject.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"9565d399351ccb46ddacf4722b141a1a21791eb4055b847d385c0751970287e6"}},{"ruleId":"D2","level":"warning","message":{"text":"jn::jn (cognitive 47): jn::jn has cognitive complexity 47 (threshold 15). Drivers by points: if/else 27, loops 16, match/switch 3, 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":"library/compiler-builtins/libm/src/math/jn.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8550b15f4e74f5c11e63e1821f200d7b6f09d27ae9c0bd91043200ef7e2fd90e"}},{"ruleId":"D2","level":"warning","message":{"text":"inline::build_impl (cognitive 47): inline::build_impl has cognitive complexity 47 (threshold 15). Drivers by points: if/else 28, boolean chains 9, match/switch 8, 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":"src/librustdoc/clean/inline.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d31195f24d5c370000c4ee61b1b3359bbe6e7bbb6e5fd0adbccc2f43c1f844"}},{"ruleId":"D2","level":"warning","message":{"text":"assign_op_pattern::check (cognitive 47): assign_op_pattern::check has cognitive complexity 47 (threshold 15). Drivers by points: if/else 37, boolean chains 6, match/switch 4 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/assign_op_pattern.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a09d24d1c61bcbdab5de61c4427135f289c6069d1a26fa57da99d0af0a6cb3a"}},{"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 30, loops 10, match/switch 7 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0933bbedca85747ed72530fc1ca4f3f6d49b0e52d4ac76af05a82c7942b4b8"}},{"ruleId":"D2","level":"warning","message":{"text":"unwrap_return_type::unwrap_return_type (cognitive 47): unwrap_return_type::unwrap_return_type has cognitive complexity 47 (threshold 15). Drivers by points: if/else 30, match/switch 12, boolean chains 4, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/unwrap_return_type.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e878880445fab4df07ae7906dbf43f455ade0218d2ff21e626d18ec77ba9205"}},{"ruleId":"D2","level":"warning","message":{"text":"syntax_bridge::convert_tokens (cognitive 47): syntax_bridge::convert_tokens has cognitive complexity 47 (threshold 15). Drivers by points: match/switch 24, if/else 11, loops 11, boolean chains 1 (nesting depth added 31). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"19795e67780a297f9a58f60860e30ae76a868b943b698618f01854e78138aa48"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 47): constructor has cognitive complexity 47 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b662f76a1c67de822b4e93f11b1368bf90ad90801515e8b9bd438d8024e1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"intersection (cognitive 47): intersection has cognitive complexity 47 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"21eb5598431aad9786bd0840fa56e398636a110ef2484c88cb63e6edb7af0347"}},{"ruleId":"D2","level":"warning","message":{"text":"check_cfg::unexpected_cfg_name (cognitive 46): check_cfg::unexpected_cfg_name has cognitive complexity 46 (threshold 15). Drivers by points: if/else 39, boolean chains 5, match/switch 2 (nesting depth added 12). Of this number, 43 points are the body\u0027s own statements and 3 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/check_cfg.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc85606886b37b43036660b1ce02928bff04fb70e1f9564fa01037a9bf21369"}},{"ruleId":"D2","level":"warning","message":{"text":"generics::lower_generic_args (cognitive 46): generics::lower_generic_args has cognitive complexity 46 (threshold 15). Drivers by points: if/else 27, loops 11, match/switch 7, boolean chains 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"13da0f12593806a5529de405186cff93f5556903387152c19642c921f42c71d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::throw_unresolved_import_error (cognitive 46): Resolver::throw_unresolved_import_error has cognitive complexity 46 (threshold 15). Drivers by points: if/else 31, loops 6, match/switch 6, boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ad2d457d42a00dc8701a8f2f5342ef0192f218b61c427c6d1a5244230eafee"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::construct_generic_bound_failure (cognitive 46): TypeErrCtxt::construct_generic_bound_failure has cognitive complexity 46 (threshold 15). Drivers by points: if/else 22, match/switch 17, boolean chains 6, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"f716e3492e85fded5b67205a3a7b09766c546b7f9f3ab28f57e74cd4f0782f95"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::report_fulfillment_errors (cognitive 46): TypeErrCtxt::report_fulfillment_errors has cognitive complexity 46 (threshold 15). Drivers by points: if/else 31, loops 11, boolean chains 2, match/switch 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d2e14771f4d89a359f297024c5271f13aae886443275ee6b9972d6666096a5"}},{"ruleId":"D2","level":"warning","message":{"text":"div::div (cognitive 46): div::div has cognitive complexity 46 (threshold 15). Drivers by points: if/else 37, boolean chains 5, loops 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/compiler-builtins/src/float/div.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f01bcbab935d0b105b95cc4f81af05d7cad33959aeec3848fefda83603d673"}},{"ruleId":"D2","level":"warning","message":{"text":"TagParser::extract_opening_tag (cognitive 46): TagParser::extract_opening_tag has cognitive complexity 46 (threshold 15). Drivers by points: if/else 36, boolean chains 6, loops 2, match/switch 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"3704f57d310b157c90a784d47ebf8ce986a985d0030a3cf8ce23b869051c30ac"}},{"ruleId":"D2","level":"warning","message":{"text":"print_item::compare_names (cognitive 46): print_item::compare_names has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 20, if/else 16, loops 9, boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":2193}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfe05506cd3a3c327bf0cb75b5685b06b5ddf698e0e5e60524a2664278ef8fb"}},{"ruleId":"D2","level":"warning","message":{"text":"print_item::render_struct_fields (cognitive 46): print_item::render_struct_fields has cognitive complexity 46 (threshold 15). Drivers by points: if/else 34, loops 5, match/switch 5, boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"010ef0d1773e7b94a7dbabb78a0148ea105028a7dbfac55eb8a78957ea6d710a"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::record_resolved_import (cognitive 46): DefCollector::record_resolved_import has cognitive complexity 46 (threshold 15). Drivers by points: if/else 29, match/switch 16, boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fb937add401d2262410f21efa5555bad73e1ce5880452ed02d196ee02d8407"}},{"ruleId":"D2","level":"warning","message":{"text":"Ctx::transform_path_ (cognitive 46): Ctx::transform_path_ has cognitive complexity 46 (threshold 15). Drivers by points: if/else 36, boolean chains 5, match/switch 5 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/path_transform.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e9ed60eb09381313a3867e5db392c26cc4509202e6c76c29ffb4571025aef7"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalysisStats::run_body_lowering (cognitive 46): AnalysisStats::run_body_lowering has cognitive complexity 46 (threshold 15). Drivers by points: if/else 33, match/switch 10, loops 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebab29824a740433cc8a5c62d0557f2ca3ccf54f0b6c9b14b6e0ec1b79e2ea90"}},{"ruleId":"D2","level":"warning","message":{"text":"global_asm::codegen_global_asm_inner (cognitive 45): global_asm::codegen_global_asm_inner has cognitive complexity 45 (threshold 15). Drivers by points: if/else 30, match/switch 14, loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/global_asm.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8ce2db229e0717648ed5d3d30552ed484dde9522492f3fb350e862e0d59414"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::eval_intrinsic (cognitive 45): InterpCx::eval_intrinsic has cognitive complexity 45 (threshold 15). Drivers by points: if/else 29, match/switch 14, boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/intrinsics.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"280a195ac5e7ff91521611c4a93788aea3d323fd4dacc70bbeecb1a172b11242"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::analyze_closure (cognitive 45): FnCtxt::analyze_closure has cognitive complexity 45 (threshold 15). Drivers by points: if/else 31, loops 9, match/switch 4, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8def1cf51c9a805cdbabb8c4e5f0c24e3dad5aebf7ad3f0efa0b0e48ff98ab9a"}},{"ruleId":"D2","level":"warning","message":{"text":"pretty::write_scope_tree (cognitive 45): pretty::write_scope_tree has cognitive complexity 45 (threshold 15). Drivers by points: if/else 36, loops 8, 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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"9634e8142f885cc683485a9f00c5b369e62041b93f1974cdd04e003128b69b2b"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_item_kind (cognitive 45): Parser::parse_item_kind has cognitive complexity 45 (threshold 15). Drivers by points: if/else 35, boolean chains 10 (nesting depth added 5). 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc36daeca45e7d5059e398ccac34c4da158df44011d589f46e6e7bee7de718f"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_elided_lifetimes_in_path (cognitive 45): LateResolutionVisitor::resolve_elided_lifetimes_in_path has cognitive complexity 45 (threshold 15). Drivers by points: loops 22, if/else 14, match/switch 7, boolean chains 2 (nesting depth added 25). 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f2fd41764a046ed76d9d268c66c7a873ce400ebcd49e98b598f4e2afe4d4f3"}},{"ruleId":"D2","level":"warning","message":{"text":"mips64::classify_arg (cognitive 45): mips64::classify_arg has cognitive complexity 45 (threshold 15). Drivers by points: if/else 33, loops 10, match/switch 2 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/mips64.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd8a947f204ad01a7b0aa41120a052f9d4c25c47f83efd97b645b311fe541cb"}},{"ruleId":"D2","level":"warning","message":{"text":"SolverDelegate::compute_goal_fast_path (cognitive 45): SolverDelegate::compute_goal_fast_path has cognitive complexity 45 (threshold 15). Drivers by points: if/else 36, match/switch 6, 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":"compiler/rustc_trait_selection/src/solve/delegate.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6165c22d8bf942a6d84a299fc1da7e4f1a6c850aa247327881047395037ae80"}},{"ruleId":"D2","level":"warning","message":{"text":"ranges::check_possible_range_contains (cognitive 45): ranges::check_possible_range_contains has cognitive complexity 45 (threshold 15). Drivers by points: if/else 40, 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":"src/tools/clippy/clippy_lints/src/ranges.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"50938b84503090ae7f5b1a84c16911d870c63cca7ad35dbaf3ec7a479c509981"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cognitive 45): EvalContextExt::emulate_foreign_item_inner has cognitive complexity 45 (threshold 15). Drivers by points: if/else 36, match/switch 8, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0028ca2cd35d5a06b290390a28e7bc048e9f3f3024a5845e76092f7001c264"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolCollector::collect_from_module (cognitive 45): SymbolCollector::collect_from_module has cognitive complexity 45 (threshold 15). Drivers by points: match/switch 16, if/else 14, loops 10, boolean chains 5 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/symbols.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"242ce229383f06afabd4cc981498adc35c9a1f48bffc1cd33a682afc962cbd40"}},{"ruleId":"D2","level":"warning","message":{"text":"ItemScope::push_res_with_import (cognitive 45): ItemScope::push_res_with_import has cognitive complexity 45 (threshold 15). Drivers by points: if/else 28, match/switch 14, boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dec0689de95ed5c024c142a8e391298d7834cc7eaf95687ec0534cc4c49902"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::apply_change_with_sink (cognitive 45): Config::apply_change_with_sink has cognitive complexity 45 (threshold 15). Drivers by points: if/else 21, match/switch 17, loops 5, boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf25077f95cc8261ff5f543eaa8895761df1f59e0dce268ef5f8aec12dc4cc57"}},{"ruleId":"D2","level":"warning","message":{"text":"to_proto::completion_item (cognitive 45): to_proto::completion_item has cognitive complexity 45 (threshold 15). Drivers by points: if/else 38, boolean chains 5, loops 2 (nesting depth added 9). Of this number, 43 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"63edc2786cdc7ed329e29e16a206aee04c619ce8953cd239cc82e4bcfffd618c"}},{"ruleId":"D2","level":"warning","message":{"text":"GetOptsOptions::from_matches (cognitive 45): GetOptsOptions::from_matches has cognitive complexity 45 (threshold 15). Drivers by points: if/else 41, match/switch 3, boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/bin/main.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"a866dadd4fe4e8caf493adf0b68e6563ffbbdee976e94332f052f2c03153163e"}},{"ruleId":"D2","level":"warning","message":{"text":"AttributeParser::parse_attribute_list (cognitive 44): AttributeParser::parse_attribute_list has cognitive complexity 44 (threshold 15). Drivers by points: if/else 35, boolean chains 4, loops 3, match/switch 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/interface.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"8802c241358da7c9b071400440f935be8855ad2c8e240f02fcfa0bca029919e0"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::compute_per_local_var_debug_info (cognitive 44): FunctionCx::compute_per_local_var_debug_info has cognitive complexity 44 (threshold 15). Drivers by points: if/else 33, match/switch 8, boolean chains 2, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad040928262d50331620e9c9b3b2817b60f7c1275ee52fa06443af0edcd38f9"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_invalid_callee (cognitive 44): FnCtxt::report_invalid_callee has cognitive complexity 44 (threshold 15). Drivers by points: if/else 23, match/switch 12, boolean chains 7, loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c97439f004f9b7d90b2fc6fdb64cacc2f4ce9c6ba1c23c1ac44028e301a5062"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_tupled_arguments (cognitive 44): FnCtxt::check_tupled_arguments has cognitive complexity 44 (threshold 15). Drivers by points: if/else 40, 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"213c2fdd77f3f23815187eb5ebed3f9dcc2a2c98e2c136f8e831b677fd61db4b"}},{"ruleId":"D2","level":"warning","message":{"text":"CrateError::report (cognitive 44): CrateError::report has cognitive complexity 44 (threshold 15). Drivers by points: loops 22, if/else 19, match/switch 3 (nesting depth added 23). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5fa928f1526ec1b7685676bc43d5348037592cfed2fc9405704512adeccddb"}},{"ruleId":"D2","level":"warning","message":{"text":"pretty::write_allocation_bytes (cognitive 44): pretty::write_allocation_bytes has cognitive complexity 44 (threshold 15). Drivers by points: if/else 28, loops 13, boolean chains 3 (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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1750}}}],"partialFingerprints":{"codehealthFindingId/v1":"397b2f8fd0b01a2d233e38da40daefd299762f214aa64de0c98ffd8e874c5cca"}},{"ruleId":"D2","level":"warning","message":{"text":"ref_prop::compute_replacement (cognitive 44): ref_prop::compute_replacement has cognitive complexity 44 (threshold 15). Drivers by points: if/else 33, boolean chains 6, loops 3, match/switch 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":"compiler/rustc_mir_transform/src/ref_prop.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67a031be3f56928fbe43a64c3d5814a4f5b5392da8ede5bb1bbb0165dedcc2d"}},{"ruleId":"D2","level":"warning","message":{"text":"pass_manager::run_passes_inner (cognitive 44): pass_manager::run_passes_inner has cognitive complexity 44 (threshold 15). Drivers by points: if/else 35, loops 5, boolean chains 4 (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":"compiler/rustc_mir_transform/src/pass_manager.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df9e0550346b762d08be044e6756c6376d4c0e0b213670a7a2c0afb44370d6b"}},{"ruleId":"D2","level":"warning","message":{"text":"NiceRegionError::report_trait_placeholder_mismatch (cognitive 44): NiceRegionError::report_trait_placeholder_mismatch has cognitive complexity 44 (threshold 15). Drivers by points: if/else 33, boolean chains 8, match/switch 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0a7fc95b3494bea790c0d097c5eaad50984bf56157e687bb1c752bbac3589b"}},{"ruleId":"D2","level":"warning","message":{"text":"region::suggest_precise_capturing (cognitive 44): region::suggest_precise_capturing has cognitive complexity 44 (threshold 15). Drivers by points: if/else 27, match/switch 9, loops 8 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d227245bc7066091ed34ce46cfc84cb4b7e678b844049429d07994b52d9f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"AtHwcap::cache (cognitive 44): AtHwcap::cache has cognitive complexity 44 (threshold 15). Drivers by points: boolean chains 42, if/else 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std_detect/src/detect/os/linux/aarch64.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ba74584681da5f40932dee225f8c7cf712b55dbecf639e20030e6adc47c4c8"}},{"ruleId":"D2","level":"warning","message":{"text":"render::render_impl (cognitive 44): render::render_impl has cognitive complexity 44 (threshold 15). Drivers by points: if/else 78, boolean chains 10, loops 8, match/switch 5 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"568f465ca60f2307aa9f7768f1cece8017da6bfc403fbf1808c840232db41566"}},{"ruleId":"D2","level":"warning","message":{"text":"clean::first_non_private (cognitive 44): clean::first_non_private has cognitive complexity 44 (threshold 15). Drivers by points: if/else 30, loops 9, boolean chains 4, match/switch 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"263f98972c470bc1192cb4a721c60d9f3183f3baef0e96d94eb4ec9a008279c8"}},{"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 35, boolean chains 5, loops 3, 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":"src/tools/clippy/clippy_lints/src/default.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cc843239bfb8c6c47c4e1a4d7f715dfabba8aeb8fd2c773ea74fe9110daf79"}},{"ruleId":"D2","level":"warning","message":{"text":"unnecessary_cast::check (cognitive 44): unnecessary_cast::check has cognitive complexity 44 (threshold 15). Drivers by points: if/else 23, boolean chains 15, match/switch 6 (nesting depth added 11). Of this number, 43 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e4d486186f7e3e5f4f98156beba2f4c2d6e1110fc20579a114604f70edd6f1"}},{"ruleId":"D2","level":"warning","message":{"text":"path::substs_from_args_and_bindings (cognitive 44): path::substs_from_args_and_bindings has cognitive complexity 44 (threshold 15). Drivers by points: if/else 25, loops 10, match/switch 9 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e6b257c3f0563965f2454063d19533565c9c615ef209cbd4bd5e237df36196"}},{"ruleId":"D2","level":"warning","message":{"text":"display::render_const_scalar_inner (cognitive 44): display::render_const_scalar_inner has cognitive complexity 44 (threshold 15). Drivers by points: if/else 24, match/switch 13, loops 7 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/display.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb9c864c5ee53c3565dbce3548b1c53751539f8520baf1510d86eab9b590815"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_trait_fn_body::gen_partial_eq (cognitive 44): gen_trait_fn_body::gen_partial_eq has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19, loops 16, match/switch 9 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2fdb700ad6b81b7ce134b3311b6672af0080f4bd86ee5e3a6d4eb96f62353a"}},{"ruleId":"D2","level":"warning","message":{"text":"add_missing_match_arms::add_missing_match_arms (cognitive 44): add_missing_match_arms::add_missing_match_arms has cognitive complexity 44 (threshold 15). Drivers by points: if/else 32, boolean chains 6, match/switch 4, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_match_arms.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6f450392cd2687ac9cb79424c91bc290a2f80c5647781742621ed0134cbfcc"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_closure_to_fn::convert_closure_to_fn (cognitive 44): convert_closure_to_fn::convert_closure_to_fn has cognitive complexity 44 (threshold 15). Drivers by points: if/else 28, match/switch 8, boolean chains 4, loops 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a869f958f04b059018b8a91da150a0fcf26b2e2e66d1c6d2f2676114b125d43"}},{"ruleId":"D2","level":"warning","message":{"text":"to_parser_input::to_parser_input (cognitive 44): to_parser_input::to_parser_input has cognitive complexity 44 (threshold 15). Drivers by points: match/switch 25, if/else 16, boolean chains 2, loops 1 (nesting depth added 28). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax-bridge/src/to_parser_input.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47a54fcb613d722ed69ce38bb2411699cc750166be542f87e3f29c8168d023f"}},{"ruleId":"D2","level":"warning","message":{"text":"features::collect_lang_features_in (cognitive 44): features::collect_lang_features_in has cognitive complexity 44 (threshold 15). Drivers by points: if/else 29, match/switch 12, boolean chains 2, 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":"src/tools/tidy/src/features.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce32cf7d1bbfe05cf9a68f13cbf473e2dcb47d0f0f8899e0a2f345bb11221e03"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 44): (anonymous) has cognitive complexity 44 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2809}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76c215d834b7d58fcdf1b3f9349abf5b52154298df84508579a381cc1788679"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_method_error (cognitive 43): FnCtxt::report_method_error has cognitive complexity 43 (threshold 15). Drivers by points: if/else 33, loops 5, match/switch 4, boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c84617b84accb284751ffbc2c4ff5b2d4aecb6ddc9ad3f7a73ec6603a62388"}},{"ruleId":"D2","level":"warning","message":{"text":"UnusedParens::check_ty (cognitive 43): UnusedParens::check_ty has cognitive complexity 43 (threshold 15). Drivers by points: if/else 26, match/switch 8, boolean chains 7, loops 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":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"234956fa8dbd658b69cbebb5a4027933e8a528bdee2d448af90f8e6f7e26943f"}},{"ruleId":"D2","level":"warning","message":{"text":"typetree::typetree_from_ty_impl_inner (cognitive 43): typetree::typetree_from_ty_impl_inner has cognitive complexity 43 (threshold 15). Drivers by points: if/else 26, loops 14, match/switch 3 (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":"compiler/rustc_middle/src/ty/typetree.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a675da7ef5d00658cfd9f740543cd10ca1d077fdea5ded8b3db1441b8ea6e951"}},{"ruleId":"D2","level":"warning","message":{"text":"LowerIntrinsics::run_pass (cognitive 43): LowerIntrinsics::run_pass has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 23, if/else 17, boolean chains 2, loops 1 (nesting depth added 27). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/lower_intrinsics.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dff373ec761c9fa646da3e5ea1048d87b78247bb5b681008669d9c95f1d1682"}},{"ruleId":"D2","level":"warning","message":{"text":"stability::check_unused_or_stable_features (cognitive 43): stability::check_unused_or_stable_features has cognitive complexity 43 (threshold 15). Drivers by points: if/else 27, loops 11, boolean chains 5 (nesting depth added 18). Of this number, 29 points are the body\u0027s own statements and 14 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7c200777447e6df9c153c8e981da5096d76a893adae81538feaa2732ce93a5"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::build_reduced_graph_for_use_tree (cognitive 43): DefCollector::build_reduced_graph_for_use_tree has cognitive complexity 43 (threshold 15). Drivers by points: if/else 26, boolean chains 11, match/switch 4, loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"7398187818f90faee161c0088c93f0d75fe6638441997b1cec84250b3d155ea2"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::candidate_from_obligation_no_cache (cognitive 43): SelectionContext::candidate_from_obligation_no_cache has cognitive complexity 43 (threshold 15). Drivers by points: if/else 37, loops 4, boolean chains 1, match/switch 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"3107d9ae5c64b19bf7009bc4de69dd154c35db34f0323dda3b7a144b74002a5c"}},{"ruleId":"D2","level":"warning","message":{"text":"backtrace::_print_fmt (cognitive 43): backtrace::_print_fmt has cognitive complexity 43 (threshold 15). Drivers by points: if/else 39, boolean chains 4 (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":"library/std/src/sys/backtrace.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1331425561e13c246d1af03fc81d99ed2acf3796d5b4471fd3cc050e5d8b0202"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_verify::functions (cognitive 43): stdarch_verify::functions has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18, loops 13, match/switch 8, boolean chains 4 (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":"library/stdarch/crates/stdarch-verify/src/lib.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58e3b048b42a1958683a8e7d4a45e4c90e1525bde6f11ed933520643a238423"}},{"ruleId":"D2","level":"warning","message":{"text":"Cargo::configure_linker (cognitive 43): Cargo::configure_linker has cognitive complexity 43 (threshold 15). Drivers by points: if/else 31, match/switch 5, boolean chains 4, loops 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":"src/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfab29dc563f239038f16e6b943106bb3e9cd2e72e45386118a36f6d500baed3"}},{"ruleId":"D2","level":"warning","message":{"text":"auto_trait::clean_region_outlives_constraints (cognitive 43): auto_trait::clean_region_outlives_constraints has cognitive complexity 43 (threshold 15). Drivers by points: if/else 29, loops 7, match/switch 7 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/auto_trait.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeee7ae59e8e12dd01bcc4815ccb48181f0d065854ee1ba47b3095353005d788"}},{"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 29, match/switch 9, boolean chains 5 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"7735f3c78de2579fa370d76bf6549e8095abfdc0f84df15f3cfa316c19d3ac38"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenStream::from_str (cognitive 43): TokenStream::from_str has cognitive complexity 43 (threshold 15). Drivers by points: if/else 39, match/switch 2, boolean chains 1, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a439b19167afed4fdc062aa5353d5170666b000a5109aca134a9621e8bf4e0a9"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineAssemblyGenerator::allocate_registers (cognitive 42): InlineAssemblyGenerator::allocate_registers has cognitive complexity 42 (threshold 15). Drivers by points: if/else 24, loops 12, match/switch 6 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2796e375843c9555eb26708c9db41e6b7e520468759939a7b0fcbd36b75629be"}},{"ruleId":"D2","level":"warning","message":{"text":"write::codegen (cognitive 42): write::codegen has cognitive complexity 42 (threshold 15). Drivers by points: if/else 37, boolean chains 4, match/switch 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":"compiler/rustc_codegen_gcc/src/back/write.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2dc5888dbeb50316e79f36a4dfe1c95eaa3ed2ffbbcb501fc3ab05d934cf25"}},{"ruleId":"D2","level":"warning","message":{"text":"target_features::from_target_feature_attr (cognitive 42): target_features::from_target_feature_attr has cognitive complexity 42 (threshold 15). Drivers by points: if/else 33, loops 4, boolean chains 3, match/switch 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":"compiler/rustc_codegen_ssa/src/target_features.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b884a4bdcf07dd2075e1616d2b8157be8a8418c279f3c6f6ac56bfbcabdc07"}},{"ruleId":"D2","level":"warning","message":{"text":"quoted::parse_tree (cognitive 42): quoted::parse_tree has cognitive complexity 42 (threshold 15). Drivers by points: if/else 27, match/switch 14, boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/quoted.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe9150cfcdbf44d060afeead1204e6f8d55051906b3ed440231c2ee55557c56"}},{"ruleId":"D2","level":"warning","message":{"text":"compare_impl_item::check_number_of_early_bound_regions (cognitive 42): compare_impl_item::check_number_of_early_bound_regions has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19, loops 14, match/switch 7, boolean chains 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a446f56e6bc4d1139d14c4f955103d932d5b65eb8ca9b54d01c2ca2ea01e43ff"}},{"ruleId":"D2","level":"warning","message":{"text":"type_of::type_of (cognitive 42): type_of::type_of has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 24, if/else 17, boolean chains 1 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/type_of.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41858c44bf56370e6fd4e43a29d09744ba37aa1b8d7f4f0066a921ed25d5526"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::expected_found_str_term (cognitive 42): TypeErrCtxt::expected_found_str_term has cognitive complexity 42 (threshold 15). Drivers by points: if/else 39, boolean chains 2, match/switch 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":2365}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3bb362ad0ee347db013c2c765d707110b20784014528f5dc26efcb035e0e90"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::report_host_effect_error (cognitive 42): TypeErrCtxt::report_host_effect_error has cognitive complexity 42 (threshold 15). Drivers by points: if/else 24, loops 9, match/switch 6, boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da19b2cd48ac645a5211dc828857e8a015b6fb37af9944df6fef2624c144e16"}},{"ruleId":"D2","level":"warning","message":{"text":"decimal_seq::parse_decimal_seq (cognitive 42): decimal_seq::parse_decimal_seq has cognitive complexity 42 (threshold 15). Drivers by points: if/else 30, loops 9, boolean chains 3 (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":"library/core/src/num/imp/dec2flt/decimal_seq.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aff981d3cc9df84821c200cb7b9c9fa5ea839a02806f2c1dfaffd3a1c294ac3"}},{"ruleId":"D2","level":"warning","message":{"text":"assert_instr_macro::assert_instr (cognitive 42): assert_instr_macro::assert_instr has cognitive complexity 42 (threshold 15). Drivers by points: if/else 29, match/switch 9, boolean chains 2, loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/assert-instr-macro/src/lib.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17f6838bbafffeef3a59802679745df177a56e35849bbb7e3ab1ad70a1c13ce"}},{"ruleId":"D2","level":"warning","message":{"text":"NewWithoutDefault::check_item (cognitive 42): NewWithoutDefault::check_item has cognitive complexity 42 (threshold 15). Drivers by points: if/else 27, loops 12, boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/new_without_default.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"32db64e6b0aa4b124197500366fa98aa911997888cd8546aba5fdcb4d3df14a8"}},{"ruleId":"D2","level":"warning","message":{"text":"needless_collect::check (cognitive 42): needless_collect::check has cognitive complexity 42 (threshold 15). Drivers by points: if/else 29, boolean chains 6, match/switch 4, loops 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c743b69ed7ec44a753a2d7dab32e9e9b63aecb70bc37a310174d0c534db7033"}},{"ruleId":"D2","level":"warning","message":{"text":"lower::generic_predicates (cognitive 42): lower::generic_predicates has cognitive complexity 42 (threshold 15). Drivers by points: if/else 31, loops 6, match/switch 4, boolean chains 1 (nesting depth added 22). Of this number, 40 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":2533}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be13f902110eaec6fc7b7d8091d73910f66d7bc0645957ecbb0203fb9d5d03c"}},{"ruleId":"D2","level":"warning","message":{"text":"use_::complete_use_path (cognitive 42): use_::complete_use_path has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23, match/switch 9, loops 7, boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/use_.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bec9b22ea843735ad8a3fb258380e436167897b271ea783748ff347880f1f21"}},{"ruleId":"D2","level":"warning","message":{"text":"expr::format_expr (cognitive 42): expr::format_expr has cognitive complexity 42 (threshold 15). Drivers by points: if/else 33, match/switch 8, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/expr.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed43b8d1ce409d83dd88238f79c8f499c92ce189ec3abc2d9622af61be54027"}},{"ruleId":"D2","level":"warning","message":{"text":"Ty::ty_and_layout_pointee_info_at (cognitive 41): Ty::ty_and_layout_pointee_info_at has cognitive complexity 41 (threshold 15). Drivers by points: if/else 27, boolean chains 6, match/switch 5, loops 3 (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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eaa83f51cb75d9891c3bd599c948b7b6da84861718ff1eaedfc3dda9345d3ac"}},{"ruleId":"D2","level":"warning","message":{"text":"GccLinker::export_symbols (cognitive 41): GccLinker::export_symbols has cognitive complexity 41 (threshold 15). Drivers by points: if/else 28, loops 11, boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba4d2ad73c869ae93c512284ffd7e9eb93df5ded68383eb0137908d92a32f52"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnostics::emit_frag_parse_err (cognitive 41): diagnostics::emit_frag_parse_err has cognitive complexity 41 (threshold 15). Drivers by points: if/else 27, loops 10, match/switch 3, boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/diagnostics.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f0ab0fd06a3ca24b179d0f69cf00cb80c81a1e3d0159e366d6a8f69b4dda60"}},{"ruleId":"D2","level":"warning","message":{"text":"WrongNumberOfGenericArgs::suggest_removing_args_or_generics (cognitive 41): WrongNumberOfGenericArgs::suggest_removing_args_or_generics has cognitive complexity 41 (threshold 15). Drivers by points: if/else 32, match/switch 5, boolean chains 2, loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9858beb294f879d4cdc24ea184b51105dcf68e8dc46e278d12bae046fd5c48a"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::note_source_of_type_mismatch_constraint (cognitive 41): FnCtxt::note_source_of_type_mismatch_constraint has cognitive complexity 41 (threshold 15). Drivers by points: if/else 30, loops 4, match/switch 4, boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"3395ab18f3fd0004889a9cf55a860da6d0df4f39ec010322a5fd831e6ece5f59"}},{"ruleId":"D2","level":"warning","message":{"text":"dependency_format::verify_ok (cognitive 41): dependency_format::verify_ok has cognitive complexity 41 (threshold 15). Drivers by points: if/else 32, loops 7, boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/dependency_format.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c70dff11994e84319fcba4771a2c15d38ecf5950a8d4e9fb4201485274f690"}},{"ruleId":"D2","level":"warning","message":{"text":"VnState::eval_to_const_inner (cognitive 41): VnState::eval_to_const_inner has cognitive complexity 41 (threshold 15). Drivers by points: if/else 25, match/switch 9, loops 4, boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9d8917cb7de7146747449dc452a64b2b8ea542f821d213de60b262ea8c30fe"}},{"ruleId":"D2","level":"warning","message":{"text":"dead::lint_dead_codes (cognitive 41): dead::lint_dead_codes has cognitive complexity 41 (threshold 15). Drivers by points: if/else 29, loops 8, boolean chains 4 (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":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"617f04a6cfd82753336f5c63e1bb72d24b10d833a64a238fc6e0d1bb9330348a"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_lifetime (cognitive 41): LateResolutionVisitor::resolve_lifetime has cognitive complexity 41 (threshold 15). Drivers by points: if/else 28, match/switch 11, boolean chains 1, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"76eb720381fcba12c343eedc0fdb1725031d6bc71101f8ee5ca42faed65f5e31"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_anonymous_lifetime (cognitive 41): LateResolutionVisitor::resolve_anonymous_lifetime has cognitive complexity 41 (threshold 15). Drivers by points: if/else 36, boolean chains 2, match/switch 2, 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5a088dcc55bd2cb484bd2cf12b09be7b521b08f9516dfe3db87f42bc866ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"add::add (cognitive 41): add::add has cognitive complexity 41 (threshold 15). Drivers by points: if/else 40, 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":"library/compiler-builtins/compiler-builtins/src/float/add.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4b6b2f6159e006397b603edd2b26fef03762b819cf418ca2cfdfc56638cc71"}},{"ruleId":"D2","level":"warning","message":{"text":"lgamma_r::lgamma_r (cognitive 41): lgamma_r::lgamma_r has cognitive complexity 41 (threshold 15). Drivers by points: if/else 37, boolean chains 2, match/switch 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/lgamma_r.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bb3e759bfb9aecedf1040cc7ccc9228e5e68d867e43a1ab3d36291c820a8aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Module::get_usages_and_record_fields (cognitive 41): Module::get_usages_and_record_fields has cognitive complexity 41 (threshold 15). Drivers by points: if/else 28, match/switch 12, loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_module.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a51d6a79cf14bdbda7c93630236ab9e114ef59f0c2ebdb0969202fad3734ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Definition::search_scope (cognitive 41): Definition::search_scope has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 27, if/else 13, boolean chains 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"95be8f1e23e27ffbb323ab794b42acbbb5ba8ddfe794fcf696a4b788e97749d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter::extend_literal (cognitive 41): Converter::extend_literal has cognitive complexity 41 (threshold 15). Drivers by points: if/else 40, match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/lexed_str.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e962702d7ffe180238285b874a0fda368e5e1e67411cd6cd6b244f2256a5e1"}},{"ruleId":"D2","level":"warning","message":{"text":"matches::rewrite_match_body (cognitive 41): matches::rewrite_match_body has cognitive complexity 41 (threshold 15). Drivers by points: if/else 27, boolean chains 9, match/switch 5 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/matches.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5805e3d2709f794e190dc0d5dac5a773a64e9c479d2ba425fe3bc39ff0bf78"}},{"ruleId":"D2","level":"warning","message":{"text":"getItemsBefore (cognitive 41): getItemsBefore has cognitive complexity 41 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"be00ee8ce182bf6298f35ad251f75acd5feabc4ee287e75d7d46fb13c4579d8a"}},{"ruleId":"D2","level":"warning","message":{"text":"getIdentEndPosition (cognitive 41): getIdentEndPosition has cognitive complexity 41 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a9bfae97c07e43589b88cc74a83ba3815328b795591aa99bcacbea4f259f1b"}},{"ruleId":"D2","level":"warning","message":{"text":"UnwindContext::add_function (cognitive 40): UnwindContext::add_function has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 16, if/else 13, loops 10, boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/debuginfo/unwind.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8582e6e9b4b1d814fd663a88afaf566841c901cf25c23cc7d90806dc13be51e9"}},{"ruleId":"D2","level":"warning","message":{"text":"abi::codegen_fn_prelude (cognitive 40): abi::codegen_fn_prelude has cognitive complexity 40 (threshold 15). Drivers by points: if/else 28, loops 7, match/switch 4, boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7eae3d9a3254d75ce52027959395a7f8fc6d50a864701a3db07a67cf5089e7"}},{"ruleId":"D2","level":"warning","message":{"text":"abi::codegen_terminator_call (cognitive 40): abi::codegen_terminator_call has cognitive complexity 40 (threshold 15). Drivers by points: if/else 47, match/switch 11, loops 3, boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d187ca053cb24e49d4dd9cda0b7daa6cbd5569511b457cfcc062d3c1f9e0261"}},{"ruleId":"D2","level":"warning","message":{"text":"asm::reg_to_llvm (cognitive 40): asm::reg_to_llvm has cognitive complexity 40 (threshold 15). Drivers by points: if/else 24, match/switch 15, 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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7637c771aa80907b1ded2e7ac83a9e8f77ed3742c87c69f179fce15328b4fb"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_argument (cognitive 40): FunctionCx::codegen_argument has cognitive complexity 40 (threshold 15). Drivers by points: if/else 21, match/switch 16, 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd191396e99b59a659a2284bd0582ad7542a2a8a58805cbb99e5406fa51719c7"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_scalar_binop (cognitive 40): FunctionCx::codegen_scalar_binop has cognitive complexity 40 (threshold 15). Drivers by points: if/else 39, 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":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbafc2d7975f2460cb5e6c5eb0efcd720b8d15c1b3aa3e01210c0ceed6bddf87"}},{"ruleId":"D2","level":"warning","message":{"text":"compare_impl_item::compare_number_of_generics (cognitive 40): compare_impl_item::compare_number_of_generics has cognitive complexity 40 (threshold 15). Drivers by points: if/else 24, loops 8, match/switch 8 (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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bf1021f30b45ef24a6f508b6478e58013bb8901b4ec5c04c416b8e62eeebdb"}},{"ruleId":"D2","level":"warning","message":{"text":"check::bounds_from_generic_clauses (cognitive 40): check::bounds_from_generic_clauses has cognitive complexity 40 (threshold 15). Drivers by points: if/else 27, loops 7, boolean chains 3, match/switch 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/mod.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c1150d068cce225145a08fdad0c3d2cb07c25e53f7ba14fcb6d22e817411fe"}},{"ruleId":"D2","level":"warning","message":{"text":"builtin::infringing_fields_error (cognitive 40): builtin::infringing_fields_error has cognitive complexity 40 (threshold 15). Drivers by points: if/else 25, loops 8, match/switch 6, boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"8695c7147f360a310bd55dec5393946a02ad36396f54f4fca49b64436fb040a8"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_failed_method_call_on_range_end (cognitive 40): FnCtxt::report_failed_method_call_on_range_end has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20, match/switch 18, loops 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ea3930fd8689e5c1537b0a92ca62d1c076f97696c7b5d8b4e10ef3727a1536"}},{"ruleId":"D2","level":"warning","message":{"text":"SubdiagnosticVariant::from_attr (cognitive 40): SubdiagnosticVariant::from_attr has cognitive complexity 40 (threshold 15). Drivers by points: if/else 32, match/switch 7, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/diagnostics/utils.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5016247b1fff3283ea3f7fdebf343e2712165c8f71a039916864781af9855b"}},{"ruleId":"D2","level":"warning","message":{"text":"Validator::validate_rvalue (cognitive 40): Validator::validate_rvalue has cognitive complexity 40 (threshold 15). Drivers by points: if/else 30, match/switch 5, boolean chains 3, loops 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":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df9de2b79b0604317bdd62f0798b18ddf7952b4b3ed92d343489d6bd9958cd6"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::cook_lexer_literal (cognitive 40): Lexer::cook_lexer_literal has cognitive complexity 40 (threshold 15). Drivers by points: if/else 33, loops 3, match/switch 3, 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":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"3805b68b98fb36941d169ed1c955764d9246e5cb11f7774ccc67a4f5945e4f8c"}},{"ruleId":"D2","level":"warning","message":{"text":"lgammaf_r::lgammaf_r (cognitive 40): lgammaf_r::lgammaf_r has cognitive complexity 40 (threshold 15). Drivers by points: if/else 37, match/switch 2, 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":"library/compiler-builtins/libm/src/math/lgammaf_r.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f59e13fd589cc75b098065035add31dac63ec0735099666a122e0b41997ea4"}},{"ruleId":"D2","level":"warning","message":{"text":"dragon::format_exact (cognitive 40): dragon::format_exact has cognitive complexity 40 (threshold 15). Drivers by points: if/else 31, loops 6, boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/imp/flt2dec/strategy/dragon.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc903f57dc0c98ad46448c2d37f940e163fcf5f6420771f85941e1356b0c6c5e"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::render_item (cognitive 40): Context::render_item has cognitive complexity 40 (threshold 15). Drivers by points: if/else 26, loops 7, boolean chains 4, match/switch 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/context.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14da7c43ec75a86c22b75782b405c06300a2e46b192f5500860a309f759e930"}},{"ruleId":"D2","level":"warning","message":{"text":"SerializedSearchIndex::sort (cognitive 40): SerializedSearchIndex::sort has cognitive complexity 40 (threshold 15). Drivers by points: loops 25, if/else 9, match/switch 6 (nesting depth added 22). Of this number, 20 points are the body\u0027s own statements and 20 belong to one function item declared inside it. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1481ec46ceefd5759f6716e91895026fbac0de2f16076bc298e07bc388fb09"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseCxImpl::parse_lint_src_file (cognitive 40): ParseCxImpl::parse_lint_src_file has cognitive complexity 40 (threshold 15). Drivers by points: if/else 28, loops 8, boolean chains 2, match/switch 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_dev/src/parse.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"16108c47240560502f843106d644ec22e2f831e783338a485a8b652fa07bb584"}},{"ruleId":"D2","level":"warning","message":{"text":"useless_attribute::check (cognitive 40): useless_attribute::check has cognitive complexity 40 (threshold 15). Drivers by points: if/else 27, boolean chains 5, loops 4, match/switch 4 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/attrs/useless_attribute.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b325d1a0cad796ad2aa22bb0e21d4c1136e7df954460477760991b4bf7c1d674"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_x86_sse42_intrinsic (cognitive 40): EvalContextExt::emulate_x86_sse42_intrinsic has cognitive complexity 40 (threshold 15). Drivers by points: if/else 31, match/switch 5, loops 3, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/x86/sse42.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5b0cf3a2a1113766ee32d7b1c2cb0f75ede38a47c7f3381bd806ba07891461"}},{"ruleId":"D2","level":"warning","message":{"text":"attrs::parse_repr_tt (cognitive 40): attrs::parse_repr_tt has cognitive complexity 40 (threshold 15). Drivers by points: if/else 21, match/switch 16, boolean chains 2, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ff72edc550d720d7350095384b02fa0a1f5c425718a598538bddadf7456cb1"}},{"ruleId":"D2","level":"warning","message":{"text":"prime_caches::parallel_prime_caches (cognitive 40): prime_caches::parallel_prime_caches has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17, loops 14, match/switch 8, 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":"src/tools/rust-analyzer/crates/ide-db/src/prime_caches.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"beef407c2a5fefa9b5f6c5cd4f8e5db091673df383924533556e791ad997fc68"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::handle_task (cognitive 40): GlobalState::handle_task has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 21, if/else 19 (nesting depth added 24). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8965842a90d3e1e90b2ecf6bdb0030fb913f78158106d4fdd22deb0e0c4ba1"}},{"ruleId":"D2","level":"warning","message":{"text":"union (cognitive 40): union has cognitive complexity 40 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"6644abd838296592961848a95daf0dbf76975c18b9fc0d075b1d4daeac482388"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnostic::parse_directive_items (cognitive 39): diagnostic::parse_directive_items has cognitive complexity 39 (threshold 15). Drivers by points: if/else 25, match/switch 10, loops 4 (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":"compiler/rustc_attr_parsing/src/attributes/diagnostic/mod.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db8f4740479f1d3bb7e7ee3b9530e4363b98e6747c07ebcaf8e80cfcb3bcbab"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::suggest_map_index_mut_alternatives (cognitive 39): MirBorrowckCtxt::suggest_map_index_mut_alternatives has cognitive complexity 39 (threshold 15). Drivers by points: if/else 26, match/switch 5, boolean chains 4, loops 4 (nesting depth added 19). Of this number, 32 points are the body\u0027s own statements and 7 belong to 2 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"520d30a9ae71908b299bd64f832c71965e6d3896bc6cedcf1f7fac369f495c33"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminatorCodegenHelper::do_call (cognitive 39): TerminatorCodegenHelper::do_call has cognitive complexity 39 (threshold 15). Drivers by points: if/else 29, loops 6, boolean chains 3, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b8d48393cb56e900bfd70204bb4e4b7a4ffeb028623b57204408061a262979"}},{"ruleId":"D2","level":"warning","message":{"text":"symbol_export::exported_generic_symbols_provider_local (cognitive 39): symbol_export::exported_generic_symbols_provider_local has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24, match/switch 9, boolean chains 4, loops 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":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc54139dd520caee0d16386d23a2650a977a98931ddc12f39ffadaf2d107230"}},{"ruleId":"D2","level":"warning","message":{"text":"CoerceMany::coerce_inner (cognitive 39): CoerceMany::coerce_inner has cognitive complexity 39 (threshold 15). Drivers by points: if/else 34, match/switch 3, 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e4a7eadaa5f997f8a90ca2bb30c8e23a64b096cf757cb6aa352ceb644eb328"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_missing_return_type (cognitive 39): FnCtxt::suggest_missing_return_type has cognitive complexity 39 (threshold 15). Drivers by points: if/else 36, boolean chains 2, 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0f4bec73c9019c817f3d541fd5dfd79b47a4db2de55a5061e267258ce5b2e8"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_failed_method_call_on_numerical_infer_var (cognitive 39): FnCtxt::report_failed_method_call_on_numerical_infer_var has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14, match/switch 12, loops 10, boolean chains 3 (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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2984}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc26dd0f1fe4575c7ae6f8ccfd73c66577d84cf4bea1239d5574d7ed31163a1"}},{"ruleId":"D2","level":"warning","message":{"text":"foreign_modules::structurally_same_type_impl (cognitive 39): foreign_modules::structurally_same_type_impl has cognitive complexity 39 (threshold 15). Drivers by points: if/else 29, boolean chains 7, match/switch 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/foreign_modules.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5934d5a6423777175e964d373ebf194d9f5520f22620d00c7053c9d02250e633"}},{"ruleId":"D2","level":"warning","message":{"text":"EncodeContext::encode_mir (cognitive 39): EncodeContext::encode_mir has cognitive complexity 39 (threshold 15). Drivers by points: if/else 32, boolean chains 4, loops 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"077ecc29ee62ba9198abcbb2b635b529b49231dc08b2d62c5f00e13b85e92f07"}},{"ruleId":"D2","level":"warning","message":{"text":"CondChecker::visit_expr (cognitive 39): CondChecker::visit_expr has cognitive complexity 39 (threshold 15). Drivers by points: if/else 22, match/switch 14, boolean chains 3 (nesting depth added 23). Of this number, 32 points are the body\u0027s own statements and 7 belong to 2 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":4351}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9ea416286574e81e74d0a4cab0453b8fe0b17450b24182bf6598c9eaba83c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_expr_assoc_rest_with (cognitive 39): Parser::parse_expr_assoc_rest_with has cognitive complexity 39 (threshold 15). Drivers by points: if/else 26, boolean chains 6, match/switch 6, 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff3232c17f197009ee39cf92120d632a32ac9ce9455f2aef4bcd204cab4f029"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_path_segment (cognitive 39): Parser::parse_path_segment has cognitive complexity 39 (threshold 15). Drivers by points: if/else 27, boolean chains 9, match/switch 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":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c591c3db1ad99e83a36e24c6abb91259c7fd6048f6d45750e028f8d07148f69"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::suggest_using_enum_variant (cognitive 39): LateResolutionVisitor::suggest_using_enum_variant has cognitive complexity 39 (threshold 15). Drivers by points: if/else 26, match/switch 11, boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3138}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4d2173e7af8161635ae3191a54148db64a8baeb1170a4b71a551069026740a"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_fn_params (cognitive 39): LateResolutionVisitor::resolve_fn_params has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24, match/switch 11, boolean chains 2, loops 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2488}}}],"partialFingerprints":{"codehealthFindingId/v1":"d345c254cc8f96f3a5c9d45781a4e94e9a211ea9b1f28bcbce098e38aaf164be"}},{"ruleId":"D2","level":"warning","message":{"text":"AddLifetimeParamsSuggestion::add_to_diag (cognitive 39): AddLifetimeParamsSuggestion::add_to_diag has cognitive complexity 39 (threshold 15). Drivers by points: if/else 25, loops 7, match/switch 4, boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/diagnostics.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd97deb0b54d0a5416fef877eb8b7274cd61b7d2b4c57dc462e2e8d4a9e1927f"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::cmp_fn_sig (cognitive 39): TypeErrCtxt::cmp_fn_sig has cognitive complexity 39 (threshold 15). Drivers by points: if/else 29, loops 6, boolean chains 2, match/switch 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ddc58f5b74d050f554969b5beb9e281f01aedb3e1ab4da0b07e157d962f0e2"}},{"ruleId":"D2","level":"warning","message":{"text":"remquof::remquof (cognitive 39): remquof::remquof has cognitive complexity 39 (threshold 15). Drivers by points: if/else 25, loops 9, boolean chains 5 (nesting depth added 10). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/remquof.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaecff914f0bcce4f67807627d6b7d3caba1e3e029aa389cfeece311ee1bdaf"}},{"ruleId":"D2","level":"warning","message":{"text":"remquo::remquo (cognitive 39): remquo::remquo has cognitive complexity 39 (threshold 15). Drivers by points: if/else 25, loops 9, boolean chains 5 (nesting depth added 10). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/remquo.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5115e4ae0f533cc8d06437bd8009b68d3f1f3e2747429025aa404d8f2a73ab24"}},{"ruleId":"D2","level":"warning","message":{"text":"Intrinsic::generate_big_endian (cognitive 39): Intrinsic::generate_big_endian has cognitive complexity 39 (threshold 15). Drivers by points: if/else 29, loops 8, boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedbf7b456967441475791ec4abc0c480d16946a4ddf8b74eaa1c414a08098a6"}},{"ruleId":"D2","level":"warning","message":{"text":"collect_trait_impls::collect_trait_impls (cognitive 39): collect_trait_impls::collect_trait_impls has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17, loops 13, match/switch 8, boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_trait_impls.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca6a2f47c22995692488805c0968f70bd8d9161ece15d417378b69a15d9bc0d"}},{"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 30, match/switch 8, boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/utils.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2197567ded1eb33ea7f97ab7616276959b87eba1b7c00525267abe01b39c70ce"}},{"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 15, loops 12, match/switch 9, boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/types/mod.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b804301d8e8bc1cb4c793a49e6d64f842c44d591e9b38a5132314373db575b"}},{"ruleId":"D2","level":"warning","message":{"text":"search_is_some::check (cognitive 39): search_is_some::check has cognitive complexity 39 (threshold 15). Drivers by points: if/else 34, match/switch 3, 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":"src/tools/clippy/clippy_lints/src/methods/search_is_some.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcf94eef2b4c3d58413aa4735cfece1cc8c72e789b048aed6c823b2f6b35844"}},{"ruleId":"D2","level":"warning","message":{"text":"needless_return::check_final_expr (cognitive 39): needless_return::check_final_expr has cognitive complexity 39 (threshold 15). Drivers by points: if/else 23, match/switch 10, boolean chains 4, loops 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/returns/needless_return.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a420ea6f9fdf5f1ea9075356eaa87dc7e650ef347f230974048057fa5ad0873"}},{"ruleId":"D2","level":"warning","message":{"text":"transmute_undefined_repr::check (cognitive 39): transmute_undefined_repr::check has cognitive complexity 39 (threshold 15). Drivers by points: if/else 32, boolean chains 4, match/switch 2, 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":"src/tools/clippy/clippy_lints/src/transmute/transmute_undefined_repr.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c929ce620cd69fc03c98b26143d1877a404d332b34140e710f09e0b83f4cdce"}},{"ruleId":"D2","level":"warning","message":{"text":"ModCollector::collect (cognitive 39): ModCollector::collect has cognitive complexity 39 (threshold 15). Drivers by points: if/else 27, match/switch 6, loops 4, boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1879}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4bc0d9dd81bf5ab2e943808a3871dc0ea13cdd12173b132d3cfc16212bc701"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_ref_pat (cognitive 39): InferenceContext::infer_ref_pat has cognitive complexity 39 (threshold 15). Drivers by points: if/else 29, boolean chains 5, match/switch 5 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"675c0711df159fcb35dea9ebcdfcf1cd08f1af349a9a24bd955c1fc67a5e07be"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::place_addr_and_ty_and_metadata (cognitive 39): Evaluator::place_addr_and_ty_and_metadata has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 27, if/else 11, loops 1 (nesting depth added 25). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bab84862d761a8d948ea2e3ab8239df53351ec32793cb69e9d6ff405ed98109"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::interpret_mir (cognitive 39): Evaluator::interpret_mir has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15, match/switch 15, loops 9 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"67376975e8171572e1bd4496d4c5a6f31662f871b8d48ff7cd929d7396717626"}},{"ruleId":"D2","level":"warning","message":{"text":"closing_brace::hints (cognitive 39): closing_brace::hints has cognitive complexity 39 (threshold 15). Drivers by points: if/else 27, match/switch 9, boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/closing_brace.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5e64010cbccb3e3ddd362f9f497f749c24ff066e4eab4aadffcb251869a791"}},{"ruleId":"D2","level":"warning","message":{"text":"Module::process_def_in_sel (cognitive 39): Module::process_def_in_sel has cognitive complexity 39 (threshold 15). Drivers by points: if/else 23, boolean chains 11, loops 3, match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_module.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"996a24cfcfab80481add23f078f5f04c7cadcbdbdb7a97e0d31b6efcb1c0eb1e"}},{"ruleId":"D2","level":"warning","message":{"text":"rename::source_edit_from_def (cognitive 39): rename::source_edit_from_def has cognitive complexity 39 (threshold 15). Drivers by points: if/else 25, match/switch 8, loops 4, boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/rename.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3dfa2e7fb2d6d58351da95d25c7727a84e85f66959f3658cd99bde8c14f5ae"}},{"ruleId":"D2","level":"warning","message":{"text":"atom::parse_asm_expr (cognitive 39): atom::parse_asm_expr has cognitive complexity 39 (threshold 15). Drivers by points: if/else 34, boolean chains 4, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"720720b1834f66983b8e25803c3346a1eb5c1ece20e1edfb3f841151732afb47"}},{"ruleId":"D2","level":"warning","message":{"text":"Sysroot::load_workspace (cognitive 39): Sysroot::load_workspace has cognitive complexity 39 (threshold 15). Drivers by points: if/else 25, loops 11, match/switch 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/sysroot.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"2015d5a69e6d503a3f6b406401a8fee1d7cdafbc7ab8c7f17b26501bffb08c47"}},{"ruleId":"D2","level":"warning","message":{"text":"writeFn (cognitive 39): writeFn has cognitive complexity 39 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2504}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b26ec4e77528cd8645ec591d34534443ba8ed7926c807cbdd72b188556b5463"}},{"ruleId":"D2","level":"warning","message":{"text":"unifyFunctionTypeIsMatchCandidate (cognitive 39): unifyFunctionTypeIsMatchCandidate has cognitive complexity 39 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3524}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d223b3cb9f12f52f8ad075855067acab217d775fd66e9f1136e576b581ece20"}},{"ruleId":"D2","level":"warning","message":{"text":"cast::clif_int_or_float_cast (cognitive 38): cast::clif_int_or_float_cast has cognitive complexity 38 (threshold 15). Drivers by points: if/else 26, boolean chains 7, match/switch 5 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/cast.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5167b899ba55ca95f3a1fc2ec7a05b336b353f89d1ac2e495dbef065ceddf48f"}},{"ruleId":"D2","level":"warning","message":{"text":"constant::codegen_const_value (cognitive 38): constant::codegen_const_value has cognitive complexity 38 (threshold 15). Drivers by points: if/else 28, match/switch 10 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5e2b9b75964db0a88e10c2a680961502b413562a431192a4a791b1cb8ee361"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::load_operand (cognitive 38): Builder::load_operand has cognitive complexity 38 (threshold 15). Drivers by points: if/else 36, boolean chains 1, match/switch 1 (nesting depth added 16). Of this number, 28 points are the body\u0027s own statements and 10 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfb0a0fb064583119243f8ee99d2c4143fc40f7e43be5755f7b905784f7190b"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::debug_introduce_local (cognitive 38): FunctionCx::debug_introduce_local has cognitive complexity 38 (threshold 15). Drivers by points: if/else 22, match/switch 9, boolean chains 6, 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":"compiler/rustc_codegen_ssa/src/mir/debuginfo.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa6e1a400c42b49cce753f977465f16cf2f4b164f8b110bdd55300284dbfec7"}},{"ruleId":"D2","level":"warning","message":{"text":"compare_impl_item::compare_number_of_method_arguments (cognitive 38): compare_impl_item::compare_number_of_method_arguments has cognitive complexity 38 (threshold 15). Drivers by points: if/else 35, match/switch 3 (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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e4dff5e0ff67fe08088d4367d3588aa82941274ee4f039a2c940dd279fef41"}},{"ruleId":"D2","level":"warning","message":{"text":"generics_of::generics_of (cognitive 38): generics_of::generics_of has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20, match/switch 12, loops 4, 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":"compiler/rustc_hir_analysis/src/collect/generics_of.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6498c24333b210a694d4d29b0d189e1eb7a317d9cd241993f82786a8bc1711d5"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::maybe_push_ambiguity (cognitive 38): Resolver::maybe_push_ambiguity has cognitive complexity 38 (threshold 15). Drivers by points: if/else 21, boolean chains 15, match/switch 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a86f6f98cf821bdcee79981686e40d32a5b2396a909b353f5b8e7b973b94a05"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplacementVisitor::visit_statement (cognitive 38): ReplacementVisitor::visit_statement has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19, loops 15, match/switch 3, boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/sroa.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31cbf9c6145eaa092a69e54161ac2c010507d1c1de22f285ac45d28715fa0f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::lex_token_tree_open_delim (cognitive 38): Lexer::lex_token_tree_open_delim has cognitive complexity 38 (threshold 15). Drivers by points: if/else 32, loops 4, 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":"compiler/rustc_parse/src/lexer/tokentrees.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1641ddbf93e7113b48b2d0657731e7bff64dd2788bcd120191175557c8f882e1"}},{"ruleId":"D2","level":"warning","message":{"text":"check_unused::calc_unused_spans (cognitive 38): check_unused::calc_unused_spans has cognitive complexity 38 (threshold 15). Drivers by points: if/else 28, boolean chains 4, match/switch 4, loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/check_unused.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e91559323698bc46070629cf40b9711adf030bbb7659165f3424ae0a6927fee"}},{"ruleId":"D2","level":"warning","message":{"text":"abi::arg_attrs_for_rust_scalar (cognitive 38): abi::arg_attrs_for_rust_scalar has cognitive complexity 38 (threshold 15). Drivers by points: if/else 23, match/switch 10, boolean chains 5 (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":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72bdb6dbf957abbb18b59351f89d62fbf1fc85e071bddbf05a874da6b3dfafa"}},{"ruleId":"D2","level":"warning","message":{"text":"rem_pio2::rem_pio2 (cognitive 38): rem_pio2::rem_pio2 has cognitive complexity 38 (threshold 15). Drivers by points: if/else 35, loops 2, boolean chains 1 (nesting depth added 14). Of this number, 35 points are the body\u0027s own statements and 3 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/rem_pio2.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4400af17ec408a6f7cdb2623521f279b8012b1778cd0fe6b5f2d067397ad08f3"}},{"ruleId":"D2","level":"warning","message":{"text":"cbrt::cbrt_round (cognitive 38): cbrt::cbrt_round has cognitive complexity 38 (threshold 15). Drivers by points: if/else 30, boolean chains 4, loops 4 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/cbrt.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"123ef411b97a73c29f59c6dcdac3859735e8fcf6608ebafd8312dee1308ca82d"}},{"ruleId":"D2","level":"warning","message":{"text":"jnf::jnf (cognitive 38): jnf::jnf has cognitive complexity 38 (threshold 15). Drivers by points: if/else 23, loops 14, 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":"library/compiler-builtins/libm/src/math/jnf.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2613d3ccb9130ea2c005c05e98d9bac11f3e686c2e0e9daf25bd33e3f4eb227"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::fmt (cognitive 38): Command::fmt has cognitive complexity 38 (threshold 15). Drivers by points: if/else 31, loops 7 (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":"library/std/src/sys/process/unix/common.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"51905b63d1f27805eaeb46dfabaded7f8b7a6142fec2c334df90e7be7ed49241"}},{"ruleId":"D2","level":"warning","message":{"text":"compile::run_cargo (cognitive 38): compile::run_cargo has cognitive complexity 38 (threshold 15). Drivers by points: if/else 23, match/switch 8, boolean chains 4, loops 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":2624}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e076b5bbe55b5863385d307760436c45ae4bf7aaa59d8c5ffb3643d8c64dd53"}},{"ruleId":"D2","level":"warning","message":{"text":"RustdocVisitor::visit_item_inner (cognitive 38): RustdocVisitor::visit_item_inner has cognitive complexity 38 (threshold 15). Drivers by points: if/else 25, match/switch 5, boolean chains 4, loops 4 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/visit_ast.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcab16df1b0779b14815a947c0cd5b27b275688b42ab14139a16a14a2eaeaaa"}},{"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 22, match/switch 11, boolean chains 3, loops 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/unused_peekable.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c4642b0d74ceea8cbde62395d848283ced1889a75aacfeadf9b4458a29ea66"}},{"ruleId":"D2","level":"warning","message":{"text":"manual_utils::check_with (cognitive 38): manual_utils::check_with has cognitive complexity 38 (threshold 15). Drivers by points: if/else 24, boolean chains 7, match/switch 7 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/manual_utils.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"771f4e36565bd1b37b8c8efd980e2f1c5cb8fdcc667f95ec2849772f76f0f2d3"}},{"ruleId":"D2","level":"warning","message":{"text":"directives::ignore_llvm (cognitive 38): directives::ignore_llvm has cognitive complexity 38 (threshold 15). Drivers by points: if/else 36, boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/directives.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e9cec111d77217ce641b091335dc8aacb2f6b0a6eea081181464bb6a62c54e"}},{"ruleId":"D2","level":"warning","message":{"text":"attrs::match_attr_flags (cognitive 38): attrs::match_attr_flags has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 31, if/else 5, boolean chains 2 (nesting depth added 23). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cc1b6aa0dc7f6cdca470b9956e368471971a69082a22787f1d7ccebeaf647c"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_mut_expr_without_adjust (cognitive 38): InferenceContext::infer_mut_expr_without_adjust has cognitive complexity 38 (threshold 15). Drivers by points: if/else 26, match/switch 8, loops 4 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/mutability.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46080a4a3b9fc72f39751320df039ddab1443d224253546d74ca4234803f3d5"}},{"ruleId":"D2","level":"warning","message":{"text":"lifetime::hints_ (cognitive 38): lifetime::hints_ has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18, match/switch 13, boolean chains 6, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/lifetime.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6817a54d4963eb243e4e647bc2faf7f2c73458067f05320cd4c3d9b19c429408"}},{"ruleId":"D2","level":"warning","message":{"text":"highlight::highlight_name_ref (cognitive 38): highlight::highlight_name_ref has cognitive complexity 38 (threshold 15). Drivers by points: if/else 28, match/switch 8, boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"3880c521864993f4940458ff365beb5518ffd65d131caaa630460ea959d4b806"}},{"ruleId":"D2","level":"warning","message":{"text":"insert_use::guess_granularity_from_scope (cognitive 38): insert_use::guess_granularity_from_scope has cognitive complexity 38 (threshold 15). Drivers by points: if/else 29, boolean chains 6, match/switch 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/insert_use.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39d9c4eb72733e82b6358c13dcb5d6cb783d5f67da9f808d5553039a97f8576"}},{"ruleId":"D2","level":"warning","message":{"text":"to_proto::code_lens (cognitive 38): to_proto::code_lens has cognitive complexity 38 (threshold 15). Drivers by points: if/else 29, match/switch 6, boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b53b9aaa267b1d1b760b1853f527f94695f3e14582024823f4eea4d84c435f7"}},{"ruleId":"D2","level":"warning","message":{"text":"request::handle_runnables (cognitive 38): request::handle_runnables has cognitive complexity 38 (threshold 15). Drivers by points: if/else 28, boolean chains 6, loops 3, match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9e0d4e53810261bd75ce4b5dac17f5a879e3b57d1376d3bc9d468950bbd23b"}},{"ruleId":"D2","level":"warning","message":{"text":"prettify_macro_expansion::prettify_macro_expansion (cognitive 38): prettify_macro_expansion::prettify_macro_expansion has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16, match/switch 12, boolean chains 7, loops 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax-bridge/src/prettify_macro_expansion.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a2468c89f4f501231ef072049ce517c5cb4060fe3cd1366aaba552e7a4d078"}},{"ruleId":"D2","level":"warning","message":{"text":"buildItemSearchType (cognitive 38): buildItemSearchType has cognitive complexity 38 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"05907d754b80364c30789b63eef50f11169bab79cfa2c969917976a95f76f261"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_item (cognitive 37): State::print_item has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20, loops 7, boolean chains 5, match/switch 5 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb7e6dc34134fefddd19188fa41e041b6b9276ed7a219005e63d2a69f244394"}},{"ruleId":"D2","level":"warning","message":{"text":"ArArchiveBuilder::build_inner (cognitive 37): ArArchiveBuilder::build_inner has cognitive complexity 37 (threshold 15). Drivers by points: if/else 21, match/switch 10, boolean chains 3, loops 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":"compiler/rustc_codegen_ssa/src/back/archive.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee772b33e5306eb00f97aee4a518d3e78b92fdefe858a35aba89362d03f8659"}},{"ruleId":"D2","level":"warning","message":{"text":"OperandRef::codegen_get_discr (cognitive 37): OperandRef::codegen_get_discr has cognitive complexity 37 (threshold 15). Drivers by points: if/else 28, match/switch 7, boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb824c5539965ad76465555a298ce06da7059bfe675a030bbe3bd175c2f8ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"CompileTimeMachine::call_intrinsic (cognitive 37): CompileTimeMachine::call_intrinsic has cognitive complexity 37 (threshold 15). Drivers by points: if/else 25, match/switch 10, 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":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44edb731a0b914193725412ed79cfeba665b810a4017ab8befaeee1c95eb59c"}},{"ruleId":"D2","level":"warning","message":{"text":"orphan::orphan_check_impl (cognitive 37): orphan::orphan_check_impl has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 17, if/else 16, loops 4 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/orphan.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e838c365b633288bcb80d4a0c5b177c861309a45848881215bd0a0bcce6343c6"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_offset_of (cognitive 37): FnCtxt::check_expr_offset_of has cognitive complexity 37 (threshold 15). Drivers by points: if/else 33, match/switch 2, boolean chains 1, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":3792}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80ae4f97e8fd3b561c91aa7b48b0cce60803ada8e73d48182a2507ec2cc6330"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::note_candidates_on_method_error (cognitive 37): FnCtxt::note_candidates_on_method_error has cognitive complexity 37 (threshold 15). Drivers by points: if/else 27, match/switch 6, boolean chains 3, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2443}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ff56982288a6d7430893722398023e5c4aabcd21d98c341777462fbc41aac5"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_binop_fulfillment_errors (cognitive 37): FnCtxt::report_binop_fulfillment_errors has cognitive complexity 37 (threshold 15). Drivers by points: if/else 26, loops 4, match/switch 4, boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c1b315708a24787c673cc7359bd3ccfd9cb4f17a6eb938184779f356483067"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeStats::print_type_sizes (cognitive 37): CodeStats::print_type_sizes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22, match/switch 8, loops 6, boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/code_stats.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3da932c40449c2eae78cadaa9975f547323eba4a0d1f873669d3f6764480688"}},{"ruleId":"D2","level":"warning","message":{"text":"options::build_options (cognitive 37): options::build_options has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20, match/switch 16, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/options.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29b8cf644cdb3af7f5ac2b10e7b148e7204e5f174d6cdad49baa24a00096baa"}},{"ruleId":"D2","level":"warning","message":{"text":"TwoWaySearcher::next (cognitive 37): TwoWaySearcher::next has cognitive complexity 37 (threshold 15). Drivers by points: if/else 29, loops 5, match/switch 2, boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/pattern.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"845ea656ad32622268349a6b44edfff85d7c2e27c45f748cafb37853fc40f480"}},{"ruleId":"D2","level":"warning","message":{"text":"TwoWaySearcher::next_back (cognitive 37): TwoWaySearcher::next_back has cognitive complexity 37 (threshold 15). Drivers by points: if/else 29, loops 5, match/switch 2, boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/pattern.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"851aac692c660310c9dc47c8571147dccf261b4f5393b5011814390b02fd89b5"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::posix_spawn (cognitive 37): Command::posix_spawn has cognitive complexity 37 (threshold 15). Drivers by points: if/else 25, match/switch 7, boolean chains 4, loops 1 (nesting depth added 10). Of this number, 29 points are the body\u0027s own statements and 8 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2a896eaab9507c51f8d589732cf72c37b12cd4c105f87ac018d5c13c011848"}},{"ruleId":"D2","level":"warning","message":{"text":"HirCollector::visit_testable (cognitive 37): HirCollector::visit_testable has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22, loops 7, match/switch 6, boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest/rust.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7af0d6cae11bd09d08604a16c4a919cd5c3a1d10755b32e11072e27fef7293e"}},{"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 19, match/switch 11, 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":"src/tools/clippy/clippy_lints/src/pass_by_ref_or_value.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1099dd87930b085389cf9db833ea1bdb0bb062df3e7bbeab7babf1e3a2fe25"}},{"ruleId":"D2","level":"warning","message":{"text":"let_unit_value::check (cognitive 37): let_unit_value::check has cognitive complexity 37 (threshold 15). Drivers by points: if/else 26, boolean chains 7, match/switch 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/unit_types/let_unit_value.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5382f8d7fe25b5d42140b60c41bc5a3cbc9a8f7526eae67b4250489f7fa79621"}},{"ruleId":"D2","level":"warning","message":{"text":"implicit_saturating_sub::check_with_condition (cognitive 37): implicit_saturating_sub::check_with_condition has cognitive complexity 37 (threshold 15). Drivers by points: if/else 29, boolean chains 6, match/switch 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":"src/tools/clippy/clippy_lints/src/implicit_saturating_sub.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ccbc4d17bc06ed117fae68c838863e186f88f01766f7e92693c5a44800098b"}},{"ruleId":"D2","level":"warning","message":{"text":"iter_overeager_cloned::check (cognitive 37): iter_overeager_cloned::check has cognitive complexity 37 (threshold 15). Drivers by points: if/else 28, match/switch 7, boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/iter_overeager_cloned.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c642d2a573817ca4a01a1b0afd996687f74725d6bb06bfa7718d26f3ec7d336"}},{"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 4, match/switch 4 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b5879c1dffb52f3c14524c259abb2c8ed9575126883ca211b151235b3cc159"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprCollector::collect_pat (cognitive 37): ExprCollector::collect_pat has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16, loops 10, match/switch 10, 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":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":2730}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa93871f825d19a132df5074d6f4e82a866d35361c4eaba71751c5b43d1f2a7"}},{"ruleId":"D2","level":"warning","message":{"text":"implicit_drop::hints (cognitive 37): implicit_drop::hints has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 24, if/else 12, loops 1 (nesting depth added 25). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/implicit_drop.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48a5ed8de34641088db1907d1d0dfb7716a17e2904372ae65df56a5b5ead522"}},{"ruleId":"D2","level":"warning","message":{"text":"add_turbo_fish::add_turbo_fish (cognitive 37): add_turbo_fish::add_turbo_fish has cognitive complexity 37 (threshold 15). Drivers by points: if/else 28, match/switch 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_turbo_fish.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f118991e59430f540e86d524b8856550cd8014184150d4868abd19550fe3ad12"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceBuildScripts::build_command (cognitive 37): WorkspaceBuildScripts::build_command has cognitive complexity 37 (threshold 15). Drivers by points: if/else 30, match/switch 7 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"409fe7e972674f70c03a018eff2c62a363d72edebb17f0a61513e28408bd0e56"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::current_status (cognitive 37): GlobalState::current_status has cognitive complexity 37 (threshold 15). Drivers by points: if/else 30, match/switch 3, boolean chains 2, loops 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d84cbf2b3a3ab423668385b3fb919af1b1f70f4922f60afec99773b5f4898f8"}},{"ruleId":"D2","level":"warning","message":{"text":"flycheck_to_proto::map_rust_diagnostic_to_lsp (cognitive 37): flycheck_to_proto::map_rust_diagnostic_to_lsp has cognitive complexity 37 (threshold 15). Drivers by points: if/else 23, loops 7, match/switch 5, boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/diagnostics/flycheck_to_proto.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"396b53d381b9087cd91f034b20a0abebf42850ded8f43a82ec74b758d5eaccc5"}},{"ruleId":"D2","level":"warning","message":{"text":"TtTreeSink::token (cognitive 37): TtTreeSink::token has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 22, if/else 11, loops 3, boolean chains 1 (nesting depth added 22). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"74055379d3a917c401c83d562587f243ad32ee793fa252ff2bda1ca479367eae"}},{"ruleId":"D2","level":"warning","message":{"text":"items::format_trait (cognitive 37): items::format_trait has cognitive complexity 37 (threshold 15). Drivers by points: if/else 24, boolean chains 6, match/switch 5, 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":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25b17aa7ce23d2b364b300bb593f3d1b444bff3c0916fa42b941b680ef40081"}},{"ruleId":"D2","level":"warning","message":{"text":"macros::parse_macro_args (cognitive 37): macros::parse_macro_args has cognitive complexity 37 (threshold 15). Drivers by points: if/else 25, match/switch 9, loops 2, boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/parse/macros/mod.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb194d317863f6318ab205a3a05e6bac100019656b2837e6dc81e8da554357f"}},{"ruleId":"D2","level":"warning","message":{"text":"types::join_bounds_inner (cognitive 37): types::join_bounds_inner has cognitive complexity 37 (threshold 15). Drivers by points: if/else 23, match/switch 8, boolean chains 6 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/types.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99fea0bd02e53e220c90aee8264002ea425bad66e9a69af57dab649e49809ad"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::visit_terminator (cognitive 36): TypeChecker::visit_terminator has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20, match/switch 13, loops 2, 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"7652b07912e0b911b9684deb999afbaa192c38e4e6edb57ceea3bed9b4eb4098"}},{"ruleId":"D2","level":"warning","message":{"text":"Format::translate (cognitive 36): Format::translate has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18, match/switch 16, boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format_foreign.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5661f0eb0e6b7a3bc1f07078f5c9c95ad54469065cd4da6e979addda07098da8"}},{"ruleId":"D2","level":"warning","message":{"text":"format::report_invalid_references (cognitive 36): format::report_invalid_references has cognitive complexity 36 (threshold 15). Drivers by points: if/else 26, loops 4, boolean chains 3, match/switch 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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bead6f175b073b370e1f51ace4f1d1e5dc0c781a4c2553bfcb3a457d9537088"}},{"ruleId":"D2","level":"warning","message":{"text":"constant::define_all_allocs (cognitive 36): constant::define_all_allocs has cognitive complexity 36 (threshold 15). Drivers by points: if/else 24, match/switch 8, loops 3, boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/constant.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdec43441efd7d97c97e1e57530c80ba372d5054232fbfd3aca0d2d555a416c6"}},{"ruleId":"D2","level":"warning","message":{"text":"autodiff::match_args_from_caller_to_enzyme (cognitive 36): autodiff::match_args_from_caller_to_enzyme has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22, loops 9, match/switch 5 (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":"compiler/rustc_codegen_llvm/src/builder/autodiff.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df9c6bcb4ec10a7836875f0331f86d0cc76cf907cdc6413e2e2e300006dba2e"}},{"ruleId":"D2","level":"warning","message":{"text":"check::check_transparent (cognitive 36): check::check_transparent has cognitive complexity 36 (threshold 15). Drivers by points: if/else 24, match/switch 6, boolean chains 4, loops 2 (nesting depth added 13). Of this number, 23 points are the body\u0027s own statements and 13 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bac420466f5a98df2186db3fb7fc04ef1290f267a9822e32dee3a2463f8fe2"}},{"ruleId":"D2","level":"warning","message":{"text":"errors::generics_args_err_extend (cognitive 36): errors::generics_args_err_extend has cognitive complexity 36 (threshold 15). Drivers by points: if/else 24, match/switch 6, loops 4, 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":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"759eac8977377cf6b04fd91e321a2bb68e02287a67b13d17db2c1f60728d03ce"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::perform_2229_migration_analysis (cognitive 36): FnCtxt::perform_2229_migration_analysis has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19, match/switch 11, loops 6 (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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"1846772a93ef0af9a9ac89294f9c43480dd86666b0ced27dd149cdfa17087b38"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::finalize_macro_resolutions (cognitive 36): Resolver::finalize_macro_resolutions has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 15, if/else 14, loops 5, boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ac4cf5f61707792e1152de4aa357325b7ce614890d920f7dfaf78c0d11ef3f"}},{"ruleId":"D2","level":"warning","message":{"text":"liveness::find_self_assignments (cognitive 36): liveness::find_self_assignments has cognitive complexity 36 (threshold 15). Drivers by points: if/else 28, loops 3, match/switch 3, boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a2a792d59fad090d68c64c72dc51fd93df35e847b2fd2818d2dfca14862fad"}},{"ruleId":"D2","level":"warning","message":{"text":"stability::stability_implications (cognitive 36): stability::stability_implications has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19, loops 15, boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"94daea269258dd9e49c97030c833106d74610111183d0b469904c1f4d920d915"}},{"ruleId":"D2","level":"warning","message":{"text":"project::assemble_candidates_from_impls (cognitive 36): project::assemble_candidates_from_impls has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17, match/switch 16, boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"472b3f8428a9f6d36966946e85411deeac70be4ab9c3afd27d3106b3679d1514"}},{"ruleId":"D2","level":"warning","message":{"text":"Sysroot::run (cognitive 36): Sysroot::run has cognitive complexity 36 (threshold 15). Drivers by points: if/else 29, loops 4, 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":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"962d3c51e41708b13ae0c771e0182dc0f949e99d692dbff8c3b165a605c4a28b"}},{"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 22, loops 7, boolean chains 4, match/switch 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/booleans.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81a3f95519aa0238bb6f7a26f8cce686172c6d57c35a9860103787724d09f60"}},{"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 21, loops 12, boolean chains 2, match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/default_numeric_fallback.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09ba023214205edb0bf8e9202e39b8486876bd6a905569cdd9a46f2ac4a86e1"}},{"ruleId":"D2","level":"warning","message":{"text":"option_if_let_else::try_get_option_occurrence (cognitive 36): option_if_let_else::try_get_option_occurrence has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18, match/switch 12, 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":"src/tools/clippy/clippy_lints/src/option_if_let_else.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eea59744931c39d7161cf652196ea4dcf9a48c406e8f364b94cc6c00ddfaad1"}},{"ruleId":"D2","level":"warning","message":{"text":"match_wild_err_arm::check (cognitive 36): match_wild_err_arm::check has cognitive complexity 36 (threshold 15). Drivers by points: if/else 26, loops 8, 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":"src/tools/clippy/clippy_lints/src/matches/match_wild_err_arm.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a454698696ae2cfc209964d73587cbd0fa3109b90d22ffec51b898918416c81"}},{"ruleId":"D2","level":"warning","message":{"text":"Pat::hir_fmt (cognitive 36): Pat::hir_fmt has cognitive complexity 36 (threshold 15). Drivers by points: if/else 23, match/switch 11, boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/diagnostics/match_check.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f6427faea6bd0c07909efd1b670e240b6b908c211d909221a5ad55106f7c98"}},{"ruleId":"D2","level":"warning","message":{"text":"lower::resolve_type_param_assoc_type_shorthand (cognitive 36): lower::resolve_type_param_assoc_type_shorthand has cognitive complexity 36 (threshold 15). Drivers by points: if/else 24, match/switch 7, loops 3, boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb260c91bbd0a80a8d385de2e980f7743b2ae652fa8b2b6edbaad3afdfdbb6d"}},{"ruleId":"D2","level":"warning","message":{"text":"apply_demorgan::apply_demorgan (cognitive 36): apply_demorgan::apply_demorgan has cognitive complexity 36 (threshold 15). Drivers by points: if/else 30, match/switch 3, loops 2, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/apply_demorgan.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc439462250d3577f5fa1162797d23aef6256bde30e7077fdb29979550d8cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"item_list::add_keywords (cognitive 36): item_list::add_keywords has cognitive complexity 36 (threshold 15). Drivers by points: if/else 28, boolean chains 8 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/item_list.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7a7658727de15e12527bcdd64d9e28d32881767a03b65d7c81fa6f90184bd4"}},{"ruleId":"D2","level":"warning","message":{"text":"comment::identify_comment (cognitive 36): comment::identify_comment has cognitive complexity 36 (threshold 15). Drivers by points: if/else 27, boolean chains 5, loops 3, match/switch 1 (nesting depth added 12). Of this number, 25 points are the body\u0027s own statements and 11 belong to 2 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"123f019f2ff554387be7d1d0897c8db3a56d0ce81ac004dfb8193549394610c1"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::add_move_error_suggestions (cognitive 35): MirBorrowckCtxt::add_move_error_suggestions has cognitive complexity 35 (threshold 15). Drivers by points: if/else 31, boolean chains 2, loops 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":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd83e5ceb1e7a2a93f57a82e7651972142d6b84ae58fd1b0e7ce5ca1d670f0e"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::note_due_to_edition_2024_opaque_capture_rules (cognitive 35): MirBorrowckCtxt::note_due_to_edition_2024_opaque_capture_rules has cognitive complexity 35 (threshold 15). Drivers by points: if/else 24, loops 8, match/switch 2, boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/opaque_types.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87ccce1d119ed487d38b7e44581970b80fa8d37166de8d4af061386550c70ec"}},{"ruleId":"D2","level":"warning","message":{"text":"TraitDef::create_derived_impl (cognitive 35): TraitDef::create_derived_impl has cognitive complexity 35 (threshold 15). Drivers by points: if/else 24, loops 5, boolean chains 4, match/switch 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":"compiler/rustc_builtin_macros/src/deriving/generic/mod.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce775927095551cbefec719f340a98f9b98591c24a833e37955f48fe9a72359"}},{"ruleId":"D2","level":"warning","message":{"text":"printf::parse_next_substitution (cognitive 35): printf::parse_next_substitution has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 19, if/else 16 (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":"compiler/rustc_builtin_macros/src/format_foreign.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"473f1680d87ba081c6bb2c670ccce53f984ca90935fbb6ee3ca7d6021a7f54f5"}},{"ruleId":"D2","level":"warning","message":{"text":"coerce_pointee::expand_deriving_coerce_pointee (cognitive 35): coerce_pointee::expand_deriving_coerce_pointee has cognitive complexity 35 (threshold 15). Drivers by points: if/else 21, loops 6, match/switch 6, 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":"compiler/rustc_builtin_macros/src/deriving/coerce_pointee.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5078ca81abba469c04f1c397409dad5d492571106d6dbb64de200156756cdb9a"}},{"ruleId":"D2","level":"warning","message":{"text":"filter_profile::main (cognitive 35): filter_profile::main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 32, boolean chains 2, 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":"compiler/rustc_codegen_cranelift/scripts/filter_profile.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1065568d93323675c3438b7a430d2b8edee14aab6bf5c96e025e7488f16c441e"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::codegen_intrinsic_call (cognitive 35): Builder::codegen_intrinsic_call has cognitive complexity 35 (threshold 15). Drivers by points: if/else 21, match/switch 14 (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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e500c861316edeb115c0bbc71a5715212d461637b57766d2ba5a30e1aa18cda5"}},{"ruleId":"D2","level":"warning","message":{"text":"errors::prohibit_assoc_item_constraint (cognitive 35): errors::prohibit_assoc_item_constraint has cognitive complexity 35 (threshold 15). Drivers by points: if/else 27, match/switch 5, boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b48c42bfe55d985dab11f507e46aa82a3032a9b8064a29f6d1487e8a40816a1"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::deduce_closure_signature_from_predicates (cognitive 35): FnCtxt::deduce_closure_signature_from_predicates has cognitive complexity 35 (threshold 15). Drivers by points: if/else 23, match/switch 9, boolean chains 2, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfff4969b6eaf829127809ad84c9afec75d018462527dbd6cde2aa2b75597bf"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_unsatisfied_ty_or_trait (cognitive 35): FnCtxt::suggest_unsatisfied_ty_or_trait has cognitive complexity 35 (threshold 15). Drivers by points: if/else 23, boolean chains 5, match/switch 4, loops 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"a651d02c40af52fc23baca421cddd76dee971809e0c7d985302441b740ccf256"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_associated_call_syntax (cognitive 35): FnCtxt::suggest_associated_call_syntax has cognitive complexity 35 (threshold 15). Drivers by points: if/else 27, match/switch 6, boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2699}}}],"partialFingerprints":{"codehealthFindingId/v1":"57310e47053f569fda4b45b733f9e03a66fbc4fac42df014c15f5776d15a0ab1"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstToPat::valtree_to_pat (cognitive 35): ConstToPat::valtree_to_pat has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17, match/switch 8, boolean chains 7, loops 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/const_to_pat.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22f2aa6b37015bd19fe5f7e47c5e2f60c453e6fd009538dc99da13e8f7dfd6c"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstAnalysis::handle_assign (cognitive 35): ConstAnalysis::handle_assign has cognitive complexity 35 (threshold 15). Drivers by points: if/else 23, match/switch 6, boolean chains 3, loops 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":"compiler/rustc_mir_transform/src/dataflow_const_prop.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1c8aa87de34aabf6f89d4c07231148af4949b798bae4d193d880aadc1efe86"}},{"ruleId":"D2","level":"warning","message":{"text":"VnState::simplify_cast (cognitive 35): VnState::simplify_cast has cognitive complexity 35 (threshold 15). Drivers by points: if/else 27, boolean chains 4, match/switch 3, 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":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03ad2bd8a46a3ff6379b589b4d7496031f1d25252cf140a7e16f653e699d26f"}},{"ruleId":"D2","level":"warning","message":{"text":"asm::parse_asm_operand (cognitive 35): asm::parse_asm_operand has cognitive complexity 35 (threshold 15). Drivers by points: if/else 35 (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":"compiler/rustc_parse/src/parser/asm.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c397e0448d3d630f3d60675266a8f926ddef4e726f9c1c76ce37de678a66079b"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_generic_params (cognitive 35): Parser::parse_generic_params has cognitive complexity 35 (threshold 15). Drivers by points: if/else 28, match/switch 5, boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/generics.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"673498d79c99b9b149fd6571dacadb65189c5ac85c5bccd0ba862454ba2fa72a"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::suggest_assoc_type_from_bounds (cognitive 35): LateResolutionVisitor::suggest_assoc_type_from_bounds has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16, loops 14, boolean chains 3, match/switch 2 (nesting depth added 11). 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb48569a0e9e0fef0510f44b40f77ee8f626b99627094296724852138f53b46"}},{"ruleId":"D2","level":"warning","message":{"text":"mul::mul (cognitive 35): mul::mul has cognitive complexity 35 (threshold 15). Drivers by points: if/else 34, 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":"library/compiler-builtins/compiler-builtins/src/float/mul.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"469b4bbc044425b6d3c6ab8b3af07b036ecdfb8485c41f7deb022884cab311d5"}},{"ruleId":"D2","level":"warning","message":{"text":"suspicious_operation_groupings::check_binops (cognitive 35): suspicious_operation_groupings::check_binops has cognitive complexity 35 (threshold 15). Drivers by points: if/else 26, loops 4, match/switch 4, 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":"src/tools/clippy/clippy_lints/src/suspicious_operation_groupings.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5581f3cf6bf04d621f2d63bfbde631b22c80eeb0d98ce1c0d32f7bb23bd66b16"}},{"ruleId":"D2","level":"warning","message":{"text":"match_wild_enum::check (cognitive 35): match_wild_enum::check has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14, match/switch 12, 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":"src/tools/clippy/clippy_lints/src/matches/match_wild_enum.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3115549c3ce5808898806930836a6a7158399710f90c5cb49e5c252b1adb475"}},{"ruleId":"D2","level":"warning","message":{"text":"while_let_on_iterator::needs_mutable_borrow (cognitive 35): while_let_on_iterator::needs_mutable_borrow has cognitive complexity 35 (threshold 15). Drivers by points: if/else 34, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/while_let_on_iterator.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6665cb9aad3162a4c4cd44e3d3cc76b5745e4df711016c5307085635dd0e4315"}},{"ruleId":"D2","level":"warning","message":{"text":"ChromeLayer::new (cognitive 35): ChromeLayer::new has cognitive complexity 35 (threshold 15). Drivers by points: if/else 29, loops 4, match/switch 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/bin/log/tracing_chrome.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6dd28bc29f82f613e71e2bff509eda9bbda97908c3004f5137a3d7d7248f35"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::try_find_coercion_lub (cognitive 35): InferenceContext::try_find_coercion_lub has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17, match/switch 12, loops 4, boolean chains 2 (nesting depth added 11). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5c165c76dcbbede93a97c13bd401f7371dc8e583640349de8333550574afdc"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::exec_simd_intrinsic (cognitive 35): Evaluator::exec_simd_intrinsic has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14, match/switch 11, loops 9, boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim/simd.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad9c14d726720b0fbce79d2dbfa398024ab72b27e4b7f2353eb598dab621f8c"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::create_memory_map::rec (cognitive 35): Evaluator::create_memory_map::rec has cognitive complexity 35 (threshold 15). Drivers by points: loops 15, match/switch 13, if/else 7 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2370}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3436db2c682e73e01dde42d6c1daf76cd35882e64c40f4e690742312765eed"}},{"ruleId":"D2","level":"warning","message":{"text":"Filler::fill_body (cognitive 35): Filler::fill_body has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 20, loops 13, if/else 2 (nesting depth added 24). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/monomorphization.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"edaab7800319148b0527c0cd3fc88bab88df1b62ef5251436740e1842f110d0e"}},{"ruleId":"D2","level":"warning","message":{"text":"borrowck::moved_out_of_ref (cognitive 35): borrowck::moved_out_of_ref has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 18, loops 10, if/else 5, boolean chains 2 (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/borrowck.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b8a7df356b887c24e1cf0b9ae402eff62fbc5f63faca3dc690bc4e6f4cd1e4"}},{"ruleId":"D2","level":"warning","message":{"text":"annotations::annotations (cognitive 35): annotations::annotations has cognitive complexity 35 (threshold 15). Drivers by points: if/else 23, boolean chains 5, match/switch 5, loops 2 (nesting depth added 11). Of this number, 29 points are the body\u0027s own statements and 6 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/annotations.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"504d4673d4ffdc1fb96fc902a9bf660a0a59f650043d2bb4a2aaa092bf0d4070"}},{"ruleId":"D2","level":"warning","message":{"text":"signature_help::signature_help_for_call (cognitive 35): signature_help::signature_help_for_call has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17, match/switch 17, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a08aed65ef6b992cb8ed4490618a9d0ca49bbfee536f5932b86a244675f571"}},{"ruleId":"D2","level":"warning","message":{"text":"view_syntax_tree::syntax_node_to_json (cognitive 35): view_syntax_tree::syntax_node_to_json has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15, match/switch 15, loops 5 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/view_syntax_tree.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f14667952ff66f5f11f4bb037621bcbb0ee5c1e40b424e387f714bdca5ed7b"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_new::generate_new (cognitive 35): generate_new::generate_new has cognitive complexity 35 (threshold 15). Drivers by points: if/else 24, match/switch 6, loops 4, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_new.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7338a371e8cbbbab70977aa11cb42f9190a7efef5fd514dabbe45b7bbd485d9"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_function::update_external_control_flow (cognitive 35): extract_function::update_external_control_flow has cognitive complexity 35 (threshold 15). Drivers by points: if/else 24, match/switch 9, boolean chains 1, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a153f41c4683a96b35cc268e159e53b2fe33668689a0b030dd2a5fa2caa629a"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::semantic_diagnostics (cognitive 35): ide_diagnostics::semantic_diagnostics has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 27, if/else 4, boolean chains 2, loops 2 (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":"src/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"1702802710e82bda398ed7ee5ab6b750d551f488e8eed98b22ee499fb2abd4b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::try_overflow_last_item (cognitive 35): Context::try_overflow_last_item has cognitive complexity 35 (threshold 15). Drivers by points: if/else 25, boolean chains 7, match/switch 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/overflow.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cf4f21019878eee9062633bd09f70cb83a040d0912b350ea408d5335c3751f"}},{"ruleId":"D2","level":"warning","message":{"text":"features::map_lib_features (cognitive 35): features::map_lib_features has cognitive complexity 35 (threshold 15). Drivers by points: if/else 23, match/switch 8, boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/features.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b9316ab7f6fc7726b5de20e8776335c5a85746380dcb8ddc7606033354827f"}},{"ruleId":"D2","level":"warning","message":{"text":"llvm_enzyme::expand_with_mode (cognitive 34): llvm_enzyme::expand_with_mode has cognitive complexity 34 (threshold 15). Drivers by points: if/else 20, match/switch 12, boolean chains 1, loops 1 (nesting depth added 11). Of this number, 33 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acb62441796935d4eb240810ac419080423a060023a7e9c72de5b936ca21643"}},{"ruleId":"D2","level":"warning","message":{"text":"linker::get_linker (cognitive 34): linker::get_linker has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19, match/switch 8, boolean chains 5, 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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4425c48e1e5493b414361e0bb1410f5b1424c64e6c076310c197e19adeee742"}},{"ruleId":"D2","level":"warning","message":{"text":"link::link_rlib (cognitive 34): link::link_rlib has cognitive complexity 34 (threshold 15). Drivers by points: if/else 24, loops 5, match/switch 4, 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2d1e5f5e06c3bb3c864622b052e647a8ce589f992d42e16f23e3fc0a40df9c"}},{"ruleId":"D2","level":"warning","message":{"text":"orphan::emit_orphan_check_error (cognitive 34): orphan::emit_orphan_check_error has cognitive complexity 34 (threshold 15). Drivers by points: if/else 23, match/switch 6, loops 4, 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":"compiler/rustc_hir_analysis/src/coherence/orphan.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"9019bc7ffd50e8918ee0403d7334648376b93f839ed1185e7069eebb7d205395"}},{"ruleId":"D2","level":"warning","message":{"text":"remove_or_use_generic::suggest_to_remove_or_use_generic (cognitive 34): remove_or_use_generic::suggest_to_remove_or_use_generic has cognitive complexity 34 (threshold 15). Drivers by points: if/else 28, boolean chains 3, 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":"compiler/rustc_hir_analysis/src/diagnostics/remove_or_use_generic.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b864f8ee650054fcf149b63de4227aa2bda187fde35c485620ea43b9b3ae01b6"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::set_not_found_span_label (cognitive 34): FnCtxt::set_not_found_span_label has cognitive complexity 34 (threshold 15). Drivers by points: if/else 23, match/switch 9, boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf991e5bcb59703651368e80c2c39f6bf491922c41210886baff0091c781e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::compute_definition_site_hidden_types (cognitive 34): FnCtxt::compute_definition_site_hidden_types has cognitive complexity 34 (threshold 15). Drivers by points: if/else 22, loops 7, match/switch 5 (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":"compiler/rustc_hir_typeck/src/opaque_types.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccf29137fee5e798a4c063a72dac69f7c17b83ce6102183afbbb2f378f22ae0"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::try_resolve_visibility (cognitive 34): Resolver::try_resolve_visibility has cognitive complexity 34 (threshold 15). Drivers by points: if/else 25, match/switch 9 (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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c9b002cf89b1d49bd46677a59742234c227261fbc60b60b04f92ea14ffcd50"}},{"ruleId":"D2","level":"warning","message":{"text":"LexicalResolver::expansion (cognitive 34): LexicalResolver::expansion has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 19, if/else 13, loops 2 (nesting depth added 22). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73bcd159be26dcc407dfd1b4d3c15cca6089db408d7176bd457401a669f5a08"}},{"ruleId":"D2","level":"warning","message":{"text":"Map::propagate_assignments (cognitive 34): Map::propagate_assignments has cognitive complexity 34 (threshold 15). Drivers by points: loops 16, if/else 10, match/switch 7, boolean chains 1 (nesting depth added 22). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/value_analysis.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff0a5c140bded326ee72e8fd3f5fc1ef10fdc5e1c4e9dd9be092e9b1fb6f05c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::collect_tokens (cognitive 34): Parser::collect_tokens has cognitive complexity 34 (threshold 15). Drivers by points: if/else 27, boolean chains 5, loops 2 (nesting depth added 6). 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":"compiler/rustc_parse/src/parser/attr_wrapper.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"db705387393b0f128ce84111998b5515585c3d98aaa4de29f8a0fb60ca6b3623"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::maybe_report_lifetime_uses (cognitive 34): LateResolutionVisitor::maybe_report_lifetime_uses has cognitive complexity 34 (threshold 15). Drivers by points: if/else 25, match/switch 8, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3637}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21774f8845269c716d8e80e13b427b93059362ad3d88ef455c8179c6169d037"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineAsmClobberAbi::parse (cognitive 34): InlineAsmClobberAbi::parse has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 22, if/else 12 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/asm/mod.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"845d3eccdc607e821faa64cf3e90db2ebfec36c93abd4fb1e627299ae5b91c63"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkerThread::wait_for_jobs (cognitive 34): WorkerThread::wait_for_jobs has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21, loops 8, match/switch 5 (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":"compiler/rustc_thread_pool/src/registry.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11a210cd9db892eae51f8e064abeb1ff80d8022c6ad309e486646349495e09a"}},{"ruleId":"D2","level":"warning","message":{"text":"WfPredicates::visit_ty (cognitive 34): WfPredicates::visit_ty has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21, loops 6, match/switch 4, 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":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7c3046da6e839b484dedb4ed274de221527b107398513953debc0a60db8385"}},{"ruleId":"D2","level":"warning","message":{"text":"expm1::expm1 (cognitive 34): expm1::expm1 has cognitive complexity 34 (threshold 15). Drivers by points: if/else 34 (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":"library/compiler-builtins/libm/src/math/expm1.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1924602f53a26382bc60582c0751faf0b47d044c574d860f730ebe8c5360d2"}},{"ruleId":"D2","level":"warning","message":{"text":"expm1f::expm1f (cognitive 34): expm1f::expm1f has cognitive complexity 34 (threshold 15). Drivers by points: if/else 34 (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":"library/compiler-builtins/libm/src/math/expm1f.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b6064f6408335f467f70e9941cd99da619e659711abdcc4e563fe47ff1bb26"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::fmt (cognitive 34): Command::fmt has cognitive complexity 34 (threshold 15). Drivers by points: if/else 27, loops 7 (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":"library/std/src/sys/process/unsupported.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a509dcd40f2cfa0a9e9fecece546ecf896692dcc437a88d2297fea0c523efe92"}},{"ruleId":"D2","level":"warning","message":{"text":"format::fmt_type (cognitive 34): format::fmt_type has cognitive complexity 34 (threshold 15). Drivers by points: if/else 22, match/switch 10, boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/format.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba92ff3d05a4d8f4bb06b487abb6852ccd7d48e45d29e9111a68b7d1e71677f0"}},{"ruleId":"D2","level":"warning","message":{"text":"string_patterns::check_manual_pattern_char_comparison (cognitive 34): string_patterns::check_manual_pattern_char_comparison has cognitive complexity 34 (threshold 15). Drivers by points: if/else 24, boolean chains 5, match/switch 5 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/string_patterns.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc083f9cc09dbf5858115c4536381e7246b7b1f2c438e24048a9cac4c2ee407"}},{"ruleId":"D2","level":"warning","message":{"text":"unnecessary_sort_by::detect_lint (cognitive 34): unnecessary_sort_by::detect_lint has cognitive complexity 34 (threshold 15). Drivers by points: if/else 29, boolean chains 5 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_sort_by.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff289842a2977e2f6fdd6b33b3fbac8e05fb50be2f265e547a78b5d159dcda94"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_aarch64_intrinsic (cognitive 34): EvalContextExt::emulate_aarch64_intrinsic has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19, loops 10, match/switch 5 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/aarch64.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1aaa99e42bb2efcacdf4c8a747c92721e96604eee3823154e34f430c105e33"}},{"ruleId":"D2","level":"warning","message":{"text":"TcpSocket::getsockopt (cognitive 34): TcpSocket::getsockopt has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18, match/switch 15, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e2c199360a74cc30a1d46a7d8565e2b43497bd26e3551abb80b9e1734708b5"}},{"ruleId":"D2","level":"warning","message":{"text":"DefMap::resolve_remaining_segments (cognitive 34): DefMap::resolve_remaining_segments has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 17, if/else 16, loops 1 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0d0d1fa4ee53aeeed25766c715b8eb5b83ba9dd8414b080ea7f2332516e1f7"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::resolve_path_in_type_ns_with_prefix_info (cognitive 34): Resolver::resolve_path_in_type_ns_with_prefix_info has cognitive complexity 34 (threshold 15). Drivers by points: if/else 23, match/switch 9, boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"55793bd023303378ade7d97ea90a1ce5b1d47a3cd003b1751142366473c63dc8"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_block (cognitive 34): InferenceContext::infer_block has cognitive complexity 34 (threshold 15). Drivers by points: if/else 31, match/switch 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf421620c4217b11b262bc6dab887576c4ab7fc5ad3826398f871e399618d0d8"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectFolders::new (cognitive 34): ProjectFolders::new has cognitive complexity 34 (threshold 15). Drivers by points: loops 18, if/else 10, match/switch 4, boolean chains 2 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/load-cargo/src/lib.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"1352f4ccfa466a4d14c275085d6ac488dc8a0bac7417334c8e19ad63e579fa10"}},{"ruleId":"D2","level":"warning","message":{"text":"ChainFormatterShared::format_last_child (cognitive 34): ChainFormatterShared::format_last_child has cognitive complexity 34 (threshold 15). Drivers by points: if/else 23, boolean chains 6, match/switch 5 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/chains.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"9935d1fe492f4c65a3fd0fbcbd150a69983f328e7adfdd103ef0c8b2dab3503c"}},{"ruleId":"D2","level":"warning","message":{"text":"unifyGenericTypes (cognitive 34): unifyGenericTypes has cognitive complexity 34 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3312}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abe513a42f1ec2bacac8fa10b5062b73f1733ca22724d03859cfee268f34675"}},{"ruleId":"D2","level":"warning","message":{"text":"register_type_impls (cognitive 34): register_type_impls has cognitive complexity 34 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"421e1b18a9523297db4348c655321965444bfeec9123ba22fc44c4a976098cbf"}},{"ruleId":"D2","level":"warning","message":{"text":"TyAndLayout::homogeneous_aggregate (cognitive 33): TyAndLayout::homogeneous_aggregate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17, match/switch 10, loops 5, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/callconv.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c909449ae7736ab22f6f2e2bce4433908ba9695291254047554464425f56a736"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::is_mutable (cognitive 33): MirBorrowckCtxt::is_mutable has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 28, if/else 4, boolean chains 1 (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":2561}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6941e3eb3ae7667a62396ee55c4aa062ff9bafc4465abe2b8a9459db577237"}},{"ruleId":"D2","level":"warning","message":{"text":"LoanInvalidationsGenerator::visit_terminator (cognitive 33): LoanInvalidationsGenerator::visit_terminator has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19, loops 10, match/switch 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":"compiler/rustc_borrowck/src/polonius/legacy/loan_invalidations.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c900d19ba66d2ce8c4555db3172e7185d05915786d87ea740d28e4b4771df26"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_switchint_terminator (cognitive 33): FunctionCx::codegen_switchint_terminator has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20, boolean chains 7, match/switch 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b19ff345078e3a45215b4d474e9d8e77806983cd4382cbdd424f7564aa0ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::codegen_statement (cognitive 33): FunctionCx::codegen_statement has cognitive complexity 33 (threshold 15). Drivers by points: if/else 28, match/switch 4, 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":"compiler/rustc_codegen_ssa/src/mir/statement.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6c41b304ec3b5749599a74101a7271843713c5db68cd41b68bc022663f58ec"}},{"ruleId":"D2","level":"warning","message":{"text":"target_features::cfg_target_feature (cognitive 33): target_features::cfg_target_feature has cognitive complexity 33 (threshold 15). Drivers by points: if/else 26, boolean chains 4, loops 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":"compiler/rustc_codegen_ssa/src/target_features.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a682bd1ee47f78f62a802fda230c417f6a847454944ee611df4fe4cd1d18ec"}},{"ruleId":"D2","level":"warning","message":{"text":"clauses_of::gather_explicit_clauses_of (cognitive 33): clauses_of::gather_explicit_clauses_of has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18, match/switch 10, loops 3, 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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ac101468ea1868d6ea5671d8a3c92528bbe9dbd45ac47803875aacad771224"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::no_such_field_err (cognitive 33): FnCtxt::no_such_field_err has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17, loops 6, boolean chains 5, match/switch 5 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f53f4a632e59e961e178bdddf01ae01c3decfbf284ca2f74b5caf3da7d37625"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_missing_break_or_return_expr (cognitive 33): FnCtxt::suggest_missing_break_or_return_expr has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19, boolean chains 6, match/switch 6, loops 2 (nesting depth added 14). Most of this is not in the body itself: 13 of the 33 points are its own statements and the rest belongs to one function item declared inside it (is_in_arm). 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":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfcc5de66d9ac4bbc1114de1de3e952fafce14320ca3bda4c53731bc06ddad5"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_unwrapping_inner_self (cognitive 33): FnCtxt::suggest_unwrapping_inner_self has cognitive complexity 33 (threshold 15). Drivers by points: if/else 24, match/switch 7, 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":3282}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fbd597a6627c2266323506538945e64da00262c7dfb8ef36e504f5dcaeddda"}},{"ruleId":"D2","level":"warning","message":{"text":"CrateLocator::find_library_crate (cognitive 33): CrateLocator::find_library_crate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15, loops 11, match/switch 6, boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ee44dc177c5bf759b2a70fb22884e457577474a69b63d0b9d911a2a9a14e33"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentResult::report_unused_assignments (cognitive 33): AssignmentResult::report_unused_assignments has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19, boolean chains 6, loops 5, match/switch 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":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9975543df6e9e930ec17c0e44275f61d952d315f58196fc4a24433d5a5b75e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::recover_missing_kw_before_item (cognitive 33): Parser::recover_missing_kw_before_item has cognitive complexity 33 (threshold 15). Drivers by points: if/else 28, boolean chains 5 (nesting depth added 6). 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d314b856c2591fa5fd2256eca9ddef8c956e25bcc44972a33f2056ad16141c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_item_impl (cognitive 33): Parser::parse_item_impl has cognitive complexity 33 (threshold 15). Drivers by points: if/else 24, boolean chains 6, match/switch 3 (nesting depth added 6). 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e723be5621e7142cf802a95633fcd765888a4ed95e17eb4074c6c47982e61b8"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::format (cognitive 33): Parser::format has cognitive complexity 33 (threshold 15). Drivers by points: if/else 33 (nesting depth added 7). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6784286bad75df5c69f1ea1d801669fe0b0a571f33da3fe232f02e192a3a735"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::lookup_typo_candidate (cognitive 33): LateResolutionVisitor::lookup_typo_candidate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 23, loops 5, match/switch 3, boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2896}}}],"partialFingerprints":{"codehealthFindingId/v1":"62da0b9e67ccbc995540dd588e8aaf42855c13f177a700f50962b838e15e6207"}},{"ruleId":"D2","level":"warning","message":{"text":"loongarch::should_use_fp_conv_helper (cognitive 33): loongarch::should_use_fp_conv_helper has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 14, if/else 13, loops 6 (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":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f654b5d759bfa0fdf825ce463aa521a4cb2d82b4dc48246bae92dca0869a7ceb"}},{"ruleId":"D2","level":"warning","message":{"text":"riscv::should_use_fp_conv_helper (cognitive 33): riscv::should_use_fp_conv_helper has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 14, if/else 13, loops 6 (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":"compiler/rustc_target/src/callconv/riscv.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d854c1f86b4ab5fae42d470ed7247134d0d77f9948a372579702ee24708934a"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoTraitFinder::map_vid_to_region (cognitive 33): AutoTraitFinder::map_vid_to_region has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20, loops 7, match/switch 6 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"682cf901d6d5e6f5d244d368c00f9a9e38e4b5bd77a6e8d9f46ed6f31b92d56a"}},{"ruleId":"D2","level":"warning","message":{"text":"linux::getrandom (cognitive 33): linux::getrandom has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20, match/switch 8, loops 5 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/random/linux.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a086b37795228bce46410701b28a842a497649b25dfccd286606bf96255075dc"}},{"ruleId":"D2","level":"warning","message":{"text":"clean::clean_middle_ty (cognitive 33): clean::clean_middle_ty has cognitive complexity 33 (threshold 15). Drivers by points: if/else 24, match/switch 9 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7716fe7414200178d1b6a989d615394a54849034d3ab57bd69f6166197a63e"}},{"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 26, boolean chains 4, loops 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/no_effect.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf17489b35c41586df8b39d43e30a35664714cbb6401c371109007cb866f7652"}},{"ruleId":"D2","level":"warning","message":{"text":"assigning_clones::build_sugg (cognitive 33): assigning_clones::build_sugg has cognitive complexity 33 (threshold 15). Drivers by points: if/else 28, match/switch 5 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/assigning_clones.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f6ad34b68a9da87b11b58fae5115948676d6f68badd5c9a44af7a62aa10662"}},{"ruleId":"D2","level":"warning","message":{"text":"lifetimes::could_use_elision (cognitive 33): lifetimes::could_use_elision has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20, loops 7, 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":"src/tools/clippy/clippy_lints/src/lifetimes.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e918bb846988c440c1ad4d5bdd61eef7d5c8e288a61a9acbcaa009da6f9d834"}},{"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 18, if/else 8, loops 5, boolean chains 2 (nesting depth added 19). Of this number, 32 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"3100f54e5213cefbaddad3a8af74c498c903e1ba2560e2b0a919edfd870e84b4"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextPrivExt::tb_reborrow (cognitive 33): EvalContextPrivExt::tb_reborrow has cognitive complexity 33 (threshold 15). Drivers by points: if/else 24, match/switch 5, loops 3, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/borrow_tracker/tree_borrows/mod.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc758526be717807825a0d8b2b21aa1bd4c03fedf62f3a9dc451cd6b6ef6897"}},{"ruleId":"D2","level":"warning","message":{"text":"join_lines::remove_newline (cognitive 33): join_lines::remove_newline has cognitive complexity 33 (threshold 15). Drivers by points: if/else 21, match/switch 8, 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":"src/tools/rust-analyzer/crates/ide/src/join_lines.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf606c9c613e35b6a63906425bab13eaad70ab82567a8b782e13b47ee12e58cc"}},{"ruleId":"D2","level":"warning","message":{"text":"Matcher::attempt_match_token_tree (cognitive 33): Matcher::attempt_match_token_tree has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16, match/switch 12, loops 4, boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-ssr/src/matching.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6774643d6de7a6fc7116b969873ffe1c0c2757447a6bd525d4ce2e3cec4160"}},{"ruleId":"D2","level":"warning","message":{"text":"atom::builtin_expr (cognitive 33): atom::builtin_expr has cognitive complexity 33 (threshold 15). Drivers by points: if/else 24, loops 5, boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7569a2d5fc7bcb311e30e69c023094502ef2ca15644f729735dce0ba4401d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::read_subtree (cognitive 33): Reader::read_subtree has cognitive complexity 33 (threshold 15). Drivers by points: if/else 22, match/switch 8, loops 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f75c9bf9ad8a81682a9a0fe9c25398d00c7568813844d8c03363feb50c95e1"}},{"ruleId":"D2","level":"warning","message":{"text":"string::break_string (cognitive 33): string::break_string has cognitive complexity 33 (threshold 15). Drivers by points: if/else 22, match/switch 6, loops 3, boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/string.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6518e419b84e1f76da5be6da702efc9e5d94f4de8824eb73212bf9017fc66b"}},{"ruleId":"D2","level":"warning","message":{"text":"innerRunTypeQuery (cognitive 33): innerRunTypeQuery has cognitive complexity 33 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":4182}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bfc6ab3c6687cb2b35e931bcf4d6c56a468b9a8dd48e867c6239ef46b6e5a7"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_assoc_item_constraint (cognitive 32): LoweringContext::lower_assoc_item_constraint has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18, match/switch 12, 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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5bc9039e3fa94bfbd69a13f3468ee4170070a7bb46043bf9072718864426ac"}},{"ruleId":"D2","level":"warning","message":{"text":"AstValidator::visit_fn (cognitive 32): AstValidator::visit_fn has cognitive complexity 32 (threshold 15). Drivers by points: if/else 21, match/switch 7, 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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cbb7c491e686920098b660b4e4e4a8ec97662a8195b4d908130287f0c285f8"}},{"ruleId":"D2","level":"warning","message":{"text":"AstValidator::visit_assoc_item (cognitive 32): AstValidator::visit_assoc_item has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17, match/switch 10, boolean chains 5 (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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"7337efccb1fcba2b6d66a5fc5525ae6f46680423a67189b61b7a546e1c5b4371"}},{"ruleId":"D2","level":"warning","message":{"text":"DeprecatedParser::convert (cognitive 32): DeprecatedParser::convert has cognitive complexity 32 (threshold 15). Drivers by points: if/else 21, match/switch 7, boolean chains 2, loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/deprecation.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3991abcfa309194d58d3ddef6ab1d3489acda27cbd1b6d703865633aa20848ef"}},{"ruleId":"D2","level":"warning","message":{"text":"places_conflict::place_projection_conflict (cognitive 32): places_conflict::place_projection_conflict has cognitive complexity 32 (threshold 15). Drivers by points: if/else 28, match/switch 3, 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":"compiler/rustc_borrowck/src/places_conflict.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"816b32e8c84debdcc6d739e1216ff7e0295174aea2bcce915e6539f4e254a399"}},{"ruleId":"D2","level":"warning","message":{"text":"va_arg::emit_va_arg (cognitive 32): va_arg::emit_va_arg has cognitive complexity 32 (threshold 15). Drivers by points: if/else 21, match/switch 7, boolean chains 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":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"319eec3b13d3129cdb430db3a5674fc3b3fd44e524e853fe2d93468cec8eaffb"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::init_stack_frame (cognitive 32): InterpCx::init_stack_frame has cognitive complexity 32 (threshold 15). Drivers by points: if/else 22, boolean chains 4, loops 4, 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":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48b37ea7fae171f0cda302ac746454dd0c4fc71197fed4a245243705e970411"}},{"ruleId":"D2","level":"warning","message":{"text":"CrateLocator::extract_one (cognitive 32): CrateLocator::extract_one has cognitive complexity 32 (threshold 15). Drivers by points: if/else 27, boolean chains 2, match/switch 2, 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":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"209ea4e2c3f68d3fbdda967316a6dc318e55979970619b11dc233cb96b5de98c"}},{"ruleId":"D2","level":"warning","message":{"text":"pretty::pretty_print_const_value_tcx (cognitive 32): pretty::pretty_print_const_value_tcx has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18, match/switch 8, loops 5, boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5bbd076946ca031903bcc04d81590acab733f8c7a7fc35061d1a1ec512b9d8"}},{"ruleId":"D2","level":"warning","message":{"text":"UnsafetyVisitor::visit_pat (cognitive 32): UnsafetyVisitor::visit_pat has cognitive complexity 32 (threshold 15). Drivers by points: if/else 21, match/switch 6, loops 5 (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":"compiler/rustc_mir_build/src/check_unsafety.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dab6eda06341276287a7dfbbeabfb7405bc32630b46bfd3725b306378c2e4c6"}},{"ruleId":"D2","level":"warning","message":{"text":"TOFinder::process_switch_int (cognitive 32): TOFinder::process_switch_int has cognitive complexity 32 (threshold 15). Drivers by points: if/else 20, loops 7, match/switch 3, boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09fda938f04f44199a015cedda4868634983a1269cbfd0b6166c734745a0d2f"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalCtxt::term_is_fully_unconstrained (cognitive 32): EvalCtxt::term_is_fully_unconstrained has cognitive complexity 32 (threshold 15). Drivers by points: if/else 22, boolean chains 7, match/switch 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d952cdd052d88919596c8939a6c6691d8b47a4f7fa0be690ad0459a2ede4eaf"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::lookup_assoc_candidate (cognitive 32): LateResolutionVisitor::lookup_assoc_candidate has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15, match/switch 12, boolean chains 3, loops 2 (nesting depth added 16). Of this number, 31 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2786}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e5dc32abc30d4d2e076df539a701dc58dd6d2f7ee10b20e7bf37f43cf42417"}},{"ruleId":"D2","level":"warning","message":{"text":"FnAbi::apply_attrs_llfn (cognitive 32): FnAbi::apply_attrs_llfn has cognitive complexity 32 (threshold 15). Drivers by points: if/else 25, match/switch 4, boolean chains 2, 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":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62609bcbc2f2dedcd3dba6f2086f56bae4e68ade021a5b8250ca4afbc294144"}},{"ruleId":"D2","level":"warning","message":{"text":"sparc64::classify (cognitive 32): sparc64::classify has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 17, if/else 11, loops 4 (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/sparc64.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"57feb222f6909c98df3092f8bdd2336b69ed012563638b3e2dd1739731542a26"}},{"ruleId":"D2","level":"warning","message":{"text":"x86_64::compute_abi_info (cognitive 32): x86_64::compute_abi_info has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18, match/switch 8, loops 4, 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":"compiler/rustc_target/src/callconv/x86_64.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b03a464dac6a9a71cda67a1db294e0a416efdccde54360536736059a4728dc"}},{"ruleId":"D2","level":"warning","message":{"text":"const_evaluatable::is_const_evaluatable (cognitive 32): const_evaluatable::is_const_evaluatable has cognitive complexity 32 (threshold 15). Drivers by points: if/else 21, match/switch 10, 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":"compiler/rustc_trait_selection/src/traits/const_evaluatable.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6589fe8f214cd50f680d9ef5eae42041b55aee964cf28f4daa006f98e0fe1877"}},{"ruleId":"D2","level":"warning","message":{"text":"instance::resolve_instance_raw (cognitive 32): instance::resolve_instance_raw has cognitive complexity 32 (threshold 15). Drivers by points: if/else 23, match/switch 8, 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":"compiler/rustc_ty_utils/src/instance.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe653831595365075843b1be14187060857280dadd46e3159c27059f10e737f"}},{"ruleId":"D2","level":"warning","message":{"text":"Utf8Chunks::next (cognitive 32): Utf8Chunks::next has cognitive complexity 32 (threshold 15). Drivers by points: if/else 20, match/switch 11, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/lossy.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c15dbdd03eb2892964bdce68d621c8dd6c3a2f598adc6f04e680708928a6580"}},{"ruleId":"D2","level":"warning","message":{"text":"scalar::generate_functions (cognitive 32): scalar::generate_functions has cognitive complexity 32 (threshold 15). Drivers by points: if/else 27, loops 3, match/switch 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":"library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a0be59f891622080b61fb3a145264a727573e3571ac730f1f8963ed759311f"}},{"ruleId":"D2","level":"warning","message":{"text":"jobs::calculate_jobs (cognitive 32): jobs::calculate_jobs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 23, loops 8, match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ci/citool/src/jobs.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef828d2a257c286e4483d1983f67f63269de2528ba095a631317ecf0e90bf12c"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkCollector::resolve_with_disambiguator (cognitive 32): LinkCollector::resolve_with_disambiguator has cognitive complexity 32 (threshold 15). Drivers by points: if/else 22, loops 5, match/switch 3, 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":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a9067e725875e42e31dd316a54a68e0d20ae63d6dc9425c7d901e072da182d"}},{"ruleId":"D2","level":"warning","message":{"text":"edit_lints::rename_update_fn (cognitive 32): edit_lints::rename_update_fn has cognitive complexity 32 (threshold 15). Drivers by points: if/else 21, boolean chains 5, match/switch 5, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_dev/src/edit_lints.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce5512577fb425ee27c6b0c3c7505a46381dc3dba8db296f1cde36ed84f506b"}},{"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 25, boolean chains 3, match/switch 3, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/arbitrary_source_item_ordering.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8ca5a5bcfc4d9a0aeec1996d626fb66d2613d1642fae284f307b8be6927e58"}},{"ruleId":"D2","level":"warning","message":{"text":"NormalizedPat::from_pat (cognitive 32): NormalizedPat::from_pat has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 29, if/else 3 (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":"src/tools/clippy/clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33c39de901bfd24084eb6ca7e2022ed4a13db3a34e0535a67c2acc697784368"}},{"ruleId":"D2","level":"warning","message":{"text":"NonCopyConst::is_non_freeze_val_borrowed (cognitive 32): NonCopyConst::is_non_freeze_val_borrowed has cognitive complexity 32 (threshold 15). Drivers by points: if/else 24, loops 5, match/switch 2, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc8fa07c15d485dad0454b71e27032bd89dffa950e2ef078bc52f578d99b911"}},{"ruleId":"D2","level":"warning","message":{"text":"StmtsChecker::visit_expr (cognitive 32): StmtsChecker::visit_expr has cognitive complexity 32 (threshold 15). Drivers by points: if/else 27, match/switch 3, boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/significant_drop_tightening.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f031cc44cdcb1621058cc728adc124afaac38b19c739fbf2d58b75ed96626ae"}},{"ruleId":"D2","level":"warning","message":{"text":"single_match::report_single_pattern (cognitive 32): single_match::report_single_pattern has cognitive complexity 32 (threshold 15). Drivers by points: if/else 21, boolean chains 6, match/switch 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/single_match.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8888436d187f82e0c4021cc5afe7562175db658c8e5441bbca9135a4770820eb"}},{"ruleId":"D2","level":"warning","message":{"text":"invalid_upcast_comparisons::upcast_comparison_bounds_err (cognitive 32): invalid_upcast_comparisons::upcast_comparison_bounds_err has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 15, if/else 15, match/switch 2 (nesting depth added 9). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/invalid_upcast_comparisons.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae21c44f2ab0c04c28bac94a935c4e1d2f6ce56b31d350ea4102da6c9674354"}},{"ruleId":"D2","level":"warning","message":{"text":"implicit_return::lint_implicit_returns (cognitive 32): implicit_return::lint_implicit_returns has cognitive complexity 32 (threshold 15). Drivers by points: if/else 27, boolean chains 2, loops 2, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/implicit_return.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f442859c2e933cf64328ee374363dfc6bc99adc76027856d46989dc07355745e"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::compare_output (cognitive 32): TestCx::compare_output has cognitive complexity 32 (threshold 15). Drivers by points: if/else 28, boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":2715}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c337df2e80805c29f2d73e5d6be8e45eb7f2e42bbf2c0dda1124c7290d8919a"}},{"ruleId":"D2","level":"warning","message":{"text":"Node::trim_clone (cognitive 32): Node::trim_clone has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19, loops 8, boolean chains 4, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/generate-copyright/src/main.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b562e44f2b91e57c8bb63cb6ae635ee441e29df73bdb3fe3986b4f3fa01e930"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceToDefCtx::container_to_def (cognitive 32): SourceToDefCtx::container_to_def has cognitive complexity 32 (threshold 15). Drivers by points: if/else 26, match/switch 4, boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30e287931e1007aed2a6a2797b6648d53e60cac01e4b96f0b6ee08f6ac4a104"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprCollector::maybe_collect_expr_as_pat (cognitive 32): ExprCollector::maybe_collect_expr_as_pat has cognitive complexity 32 (threshold 15). Drivers by points: if/else 20, match/switch 11, boolean chains 1 (nesting depth added 14). Of this number, 19 points are the body\u0027s own statements and 13 belong to 3 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e53a01b76923cd46dfe5ba530227d7dd99dac751fe99db822e42c96c3e9bd99"}},{"ruleId":"D2","level":"warning","message":{"text":"highlight::punctuation (cognitive 32): highlight::punctuation has cognitive complexity 32 (threshold 15). Drivers by points: if/else 22, match/switch 7, boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11b71363c9b020a11e15b28e929a04e227d5310493b1be5cfd622ef46b94be3"}},{"ruleId":"D2","level":"warning","message":{"text":"hover::hover_offset (cognitive 32): hover::hover_offset has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19, boolean chains 7, match/switch 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/hover.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"66254a5dc2c24b0138c57535972e20599d5f8e239db24da67951f35f2009e5e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::read_tokenstream (cognitive 32): Reader::read_tokenstream has cognitive complexity 32 (threshold 15). Drivers by points: if/else 23, match/switch 8, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6a6e780b00325612a68f4ab72d21f24306dd97411ea7ed8ce5729fdc04f2c3"}},{"ruleId":"D2","level":"warning","message":{"text":"ModResolver::find_external_module (cognitive 32): ModResolver::find_external_module has cognitive complexity 32 (threshold 15). Drivers by points: if/else 24, match/switch 8 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/modules.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"495bf2845c4cfb54063bfb44878c92b839d07f0840cadd84a7a0a5e590c0eb1f"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::visit_const_operand (cognitive 31): TypeChecker::visit_const_operand has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21, match/switch 9, boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0749e2bc5c7ba1c6a447c3f3d3d836c562eb4f70177d54fd5cd9b27ec8b784"}},{"ruleId":"D2","level":"warning","message":{"text":"concat_bytes::expand_concat_bytes (cognitive 31): concat_bytes::expand_concat_bytes has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15, loops 9, match/switch 6, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/concat_bytes.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70e24c4c9cbf7eb3c2654c2f3876191c9ed408c35b37b2ea5b013d762619d3e"}},{"ruleId":"D2","level":"warning","message":{"text":"codegen_f16_f128::codegen_cast (cognitive 31): codegen_f16_f128::codegen_cast has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21, boolean chains 5, match/switch 5 (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":"compiler/rustc_codegen_cranelift/src/codegen_f16_f128.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3afb756ae095e6ad92798625548f7ab4e80988328ce6b1de106cf183de08980"}},{"ruleId":"D2","level":"warning","message":{"text":"autodiff::adjust_activity_to_abi (cognitive 31): autodiff::adjust_activity_to_abi has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 15, if/else 14, loops 2 (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/builder/autodiff.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5b79f55aa255ca2e6fa7d1760fe3c9f687dfdd01d883efd4fadd9f5071da31"}},{"ruleId":"D2","level":"warning","message":{"text":"write::codegen (cognitive 31): write::codegen has cognitive complexity 31 (threshold 15). Drivers by points: if/else 25, boolean chains 3, match/switch 3 (nesting depth added 12). Of this number, 29 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed56d789a070a3180c368300f156dca457e62a688b94b2859b85daf57ab212ce"}},{"ruleId":"D2","level":"warning","message":{"text":"raw_dylib::create_elf_raw_dylib_stub (cognitive 31): raw_dylib::create_elf_raw_dylib_stub has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19, loops 7, match/switch 5 (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":"compiler/rustc_codegen_ssa/src/back/link/raw_dylib.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f98b95f395a38d653060778f6981d67f8f403336cc10cd0851e1219f2f8a7a7"}},{"ruleId":"D2","level":"warning","message":{"text":"link::report_linker_output (cognitive 31): link::report_linker_output has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21, boolean chains 8, loops 2 (nesting depth added 5). Of this number, 28 points are the body\u0027s own statements and 3 belong to one function item declared inside it. 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ec8e557ecde931ac4f276afb4b28b56dca82e945cb5f2d9c48c635cacda7d9"}},{"ruleId":"D2","level":"warning","message":{"text":"builtin::visit_implementation_of_dispatch_from_dyn (cognitive 31): builtin::visit_implementation_of_dispatch_from_dyn has cognitive complexity 31 (threshold 15). Drivers by points: if/else 26, boolean chains 4, 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":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1dc5308ca52883c06b38210208d27d6b04a22a217aad986cbf3bb273740853"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::emit_err_pat_wrong_number_of_fields (cognitive 31): FnCtxt::emit_err_pat_wrong_number_of_fields has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16, match/switch 11, boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"387bd14ad5aa0aed03b32dbdb81092f2b5603a1b6c567b7418f43e73f45a3a12"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::resolve_ident_in_module (cognitive 31): Resolver::resolve_ident_in_module has cognitive complexity 31 (threshold 15). Drivers by points: if/else 23, match/switch 5, 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"5056abdbd3ccc24a07bad671085dbfc63b5cd4e2bc1fc3c3cb9a60a8f3baf12f"}},{"ruleId":"D2","level":"warning","message":{"text":"passes::write_out_deps (cognitive 31): passes::write_out_deps has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21, loops 7, match/switch 3 (nesting depth added 10). Of this number, 30 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8c136e06498c2872f3d1fb04808c3da513f6c798301dea0cee988abb22c5c7"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeLimits::check_expr (cognitive 31): TypeLimits::check_expr has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 16, if/else 8, boolean chains 7 (nesting depth added 9). Most of this is not in the body itself: 9 of the 31 points are its own statements and the rest belongs to 4 function items declared inside it (check_limits, is_valid, rev_binop, \u2026). 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":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69e928452d001c4ecdabd42b9293ca52d9e7840ac16bc66abea17e4841c3aec"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::process_command_line (cognitive 31): Collector::process_command_line has cognitive complexity 31 (threshold 15). Drivers by points: if/else 23, match/switch 4, boolean chains 2, loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/native_libs.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6c05a9c4f974b3006460a6d32db1f2717727d3c8305fa3c587af10c1503b79"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::suggest_adding_generic_parameter (cognitive 31): LateResolutionVisitor::suggest_adding_generic_parameter has cognitive complexity 31 (threshold 15). Drivers by points: if/else 23, match/switch 5, 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3508}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c4c6a1c5da277a108c00217c85129370f8f05852a6e78a67646971381ef0f1"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::try_conversion_context (cognitive 31): TypeErrCtxt::try_conversion_context has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18, boolean chains 9, loops 2, 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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2cd308d4ddd568ad63a1e11c98e15ed6494b8cf3eb0e8a01ee6a496e7f7556"}},{"ruleId":"D2","level":"warning","message":{"text":"traits::try_evaluate_const (cognitive 31): traits::try_evaluate_const has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17, match/switch 11, boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/mod.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"607a5d3eacd5457d37d7997153641360989b27dbffe467f9694e7164bb91ec9e"}},{"ruleId":"D2","level":"warning","message":{"text":"read::default_read_to_end (cognitive 31): read::default_read_to_end has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18, match/switch 5, boolean chains 4, loops 4 (nesting depth added 13). Of this number, 28 points are the body\u0027s own statements and 3 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/io/read.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcedaaca0eb8af9e1517efde07d10704bbe0df3b6fe134c3882405c57e57033"}},{"ruleId":"D2","level":"warning","message":{"text":"quote::quote (cognitive 31): quote::quote has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12, loops 9, match/switch 9, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/proc_macro/src/quote.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fadceeaa8689f89308d53d8ee821774ee47ccb3db57b3180e45817ff04e889"}},{"ruleId":"D2","level":"warning","message":{"text":"clean::maybe_expand_private_type_alias (cognitive 31): clean::maybe_expand_private_type_alias has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21, match/switch 8, boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c90332c31d515420c8a74223519c50329415823569dc6e6e88625c25cb188e"}},{"ruleId":"D2","level":"warning","message":{"text":"ItemNameRepetitions::check_item (cognitive 31): ItemNameRepetitions::check_item has cognitive complexity 31 (threshold 15). Drivers by points: if/else 22, boolean chains 8, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/item_name_repetitions.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"7621fab2205220b6ff08327e262a05ed601f85e25d0d36ddbf2d4289812ca9fd"}},{"ruleId":"D2","level":"warning","message":{"text":"NonCopyConst::is_non_freeze_init_borrowed (cognitive 31): NonCopyConst::is_non_freeze_init_borrowed has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 15, if/else 9, boolean chains 4, loops 3 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2df148318b6247bed6aa0fba8338e50f0866fe6e3dd3391daa5dfc30e89b69"}},{"ruleId":"D2","level":"warning","message":{"text":"collapsible_match::check_arm (cognitive 31): collapsible_match::check_arm has cognitive complexity 31 (threshold 15). Drivers by points: if/else 24, match/switch 4, boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/collapsible_match.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e105d5a096149bc2b160b343ea1f4195294bc71c6715d957d89a33dc3f0da7c"}},{"ruleId":"D2","level":"warning","message":{"text":"useless_asref::check (cognitive 31): useless_asref::check has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21, boolean chains 6, match/switch 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/useless_asref.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f30da6a7a4a90b488f74904b81e3867c30a2140078f92aefa7afbb4e6af7699"}},{"ruleId":"D2","level":"warning","message":{"text":"radians::check (cognitive 31): radians::check has cognitive complexity 31 (threshold 15). Drivers by points: if/else 22, boolean chains 9 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/floating_point_arithmetic/radians.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44606dc4451cc01bfa5bbe9571920d8cf468bd34b841fba4ada38a9d5fce0fc"}},{"ruleId":"D2","level":"warning","message":{"text":"setup::setup (cognitive 31): setup::setup has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21, boolean chains 5, match/switch 3, loops 2 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/cargo-miri/src/setup.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdeedf2f9db2aca35519c994ae7719b5ecf8847a87349818fbd9c2379088f72b"}},{"ruleId":"D2","level":"warning","message":{"text":"Cli::run_cli_loop (cognitive 31): Cli::run_cli_loop has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14, match/switch 11, loops 6 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/priroda/src/main.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"a092c37b6aee3526a200c9b678863e8782a61b4beaf753f0aaf24b0710c4e24b"}},{"ruleId":"D2","level":"warning","message":{"text":"ChildListener::next (cognitive 31): ChildListener::next has cognitive complexity 31 (threshold 15). Drivers by points: if/else 22, match/switch 8, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/native_lib/trace/parent.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7a3f9a2b329e387bd3a55e0f141125059030a7617e38ef7379447517150f6f"}},{"ruleId":"D2","level":"warning","message":{"text":"display::write_function (cognitive 31): display::write_function has cognitive complexity 31 (threshold 15). Drivers by points: if/else 22, match/switch 7, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae89278d8ffa9a64cd84df354429ee13a0a169bf15cd80aa80d072c8c6dd1c06"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::push_res_and_update_glob_vis (cognitive 31): DefCollector::push_res_and_update_glob_vis has cognitive complexity 31 (threshold 15). Drivers by points: if/else 22, boolean chains 9 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"edafe63161b9fc456a6e21f07b7c21e5eb4475e81116a94cb38418c5de72aa0d"}},{"ruleId":"D2","level":"warning","message":{"text":"UnsafeVisitor::walk_expr (cognitive 31): UnsafeVisitor::walk_expr has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19, match/switch 8, boolean chains 2, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/diagnostics/unsafe_check.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfae063d8a6a8b5c41430cc72bfab7b2528141184911cde9da3d1cee17427cf"}},{"ruleId":"D2","level":"warning","message":{"text":"MirEvalError::pretty_print (cognitive 31): MirEvalError::pretty_print has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 28, loops 3 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6010d39d1076ee69f67b984ba930ba87269c06d7656130ae7c06e1f0283da00"}},{"ruleId":"D2","level":"warning","message":{"text":"function::add_call_parens (cognitive 31): function::add_call_parens has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18, match/switch 12, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/render/function.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6a8f4af4cf4bd52c7618abdbe54f3b561e4ee694e6c8eb2a12a5b4fcb2d265"}},{"ruleId":"D2","level":"warning","message":{"text":"items::opt_item (cognitive 31): items::opt_item has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14, boolean chains 13, match/switch 4 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/items.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f51e33912394ca816ff0118855eb45bc4a9754e0d2ce1f48a5684a10b45d68"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutCalculator::layout_of_union (cognitive 30): LayoutCalculator::layout_of_union has cognitive complexity 30 (threshold 15). Drivers by points: if/else 26, match/switch 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d3675bedb4631fd9fe6fbb92987d8bcbafbc7db62da59a889153d87dbc80cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Pat::rewrite_result (cognitive 30): Pat::rewrite_result has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19, match/switch 11 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/patterns.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"654c5fbb1535fa81ba32e89b48a1d933cf1f94c3cfd6bb01541cd1ae67825d9c"}},{"ruleId":"D2","level":"warning","message":{"text":"target_features::parse_rust_feature_list (cognitive 30): target_features::parse_rust_feature_list has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19, loops 11 (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":"compiler/rustc_codegen_ssa/src/target_features.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0606342d5954fb7ccf298a832c8a712cb5247404595a1dfbad756997e05d5c15"}},{"ruleId":"D2","level":"warning","message":{"text":"transcribe::transcribe_sequence (cognitive 30): transcribe::transcribe_sequence has cognitive complexity 30 (threshold 15). Drivers by points: if/else 24, loops 4, boolean chains 1, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/transcribe.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8969ede07bb73d445d2caa4751ba7d5e2f518adf654763e766ef670d8431e2b"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::blame_specific_part_of_expr_corresponding_to_generic_param (cognitive 30): FnCtxt::blame_specific_part_of_expr_corresponding_to_generic_param has cognitive complexity 30 (threshold 15). Drivers by points: if/else 26, match/switch 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":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d587605bf806663248744798c76e7741cc05827496eec9656b2151828fa67a"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::find_cfg_stripped (cognitive 30): Resolver::find_cfg_stripped has cognitive complexity 30 (threshold 15). Drivers by points: if/else 22, loops 4, boolean chains 2, match/switch 2 (nesting depth added 15). Most of this is not in the body itself: 13 of the 30 points are its own statements and the rest belongs to one function item declared inside it (comes_from_same_module_for_glob). 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":3564}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede0d3dd30c1520d875e9e3ad8db007566c1327a13269f2550138e0f939d733e"}},{"ruleId":"D2","level":"warning","message":{"text":"lint::emit_lint_base::emit_lint_base_impl (cognitive 30): lint::emit_lint_base::emit_lint_base_impl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17, boolean chains 6, loops 4, match/switch 3 (nesting depth added 6). 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":"compiler/rustc_middle/src/lint.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a53e4474011d06cad13191946eb76543f7b5c5bde79876ce5a27c36158d23a"}},{"ruleId":"D2","level":"warning","message":{"text":"AssignmentResult::find_dead_assignments (cognitive 30): AssignmentResult::find_dead_assignments has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15, match/switch 8, loops 7 (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":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"06947c8340e09cab77e9de225e67dc6eed61eb7c87344b5e72ed4d78d64bbb4f"}},{"ruleId":"D2","level":"warning","message":{"text":"partitioning::internalize_symbols (cognitive 30): partitioning::internalize_symbols has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18, loops 8, match/switch 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":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c514f0ed6fb4b04ba9e6a694526fd34753e6c513012d16ef5673963a82388f4"}},{"ruleId":"D2","level":"warning","message":{"text":"OrphanChecker::visit_ty (cognitive 30): OrphanChecker::visit_ty has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19, match/switch 11 (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":"compiler/rustc_next_trait_solver/src/coherence.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"035578f9426f4f7361f174ef062222d2d5f2aa86a89ec380644a4690afd35daa"}},{"ruleId":"D2","level":"warning","message":{"text":"structural_traits::extract_tupled_inputs_and_output_from_callable (cognitive 30): structural_traits::extract_tupled_inputs_and_output_from_callable has cognitive complexity 30 (threshold 15). Drivers by points: if/else 24, boolean chains 3, match/switch 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f934f73e9250409a0912071d998255da4c04a13e29abd13705ecb14a804bbf5a"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::expected_ident_found (cognitive 30): Parser::expected_ident_found has cognitive complexity 30 (threshold 15). Drivers by points: if/else 22, boolean chains 5, match/switch 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1abec059522d0928a1aa3480374137ebc190b0b841032bddafc0bd712dee122"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_param_general (cognitive 30): Parser::parse_param_general has cognitive complexity 30 (threshold 15). Drivers by points: if/else 24, boolean chains 4, match/switch 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":3420}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8fd6be633b9ec9b603f2376a7f5973288b0dc542cb6a161374797215a71a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::maybe_augment_stashed_expr_in_pats_with_suggestions (cognitive 30): Parser::maybe_augment_stashed_expr_in_pats_with_suggestions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19, match/switch 10, 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":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a458ed98bc03ca94ddaa2fa1246d659c3061b73a68401729e3d6085957e146"}},{"ruleId":"D2","level":"warning","message":{"text":"ReachableContext::propagate_node (cognitive 30): ReachableContext::propagate_node has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19, match/switch 10, 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":"compiler/rustc_passes/src/reachable.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c654de963d306a31cfdab6ee25f9ec4be400d3781741ead55bdd526108e2240b"}},{"ruleId":"D2","level":"warning","message":{"text":"usefulness::compute_exhaustiveness_and_usefulness (cognitive 30): usefulness::compute_exhaustiveness_and_usefulness has cognitive complexity 30 (threshold 15). Drivers by points: if/else 21, loops 5, 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":"compiler/rustc_pattern_analysis/src/usefulness.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a7bb1887680a316ff77d0d33ce1cd0f75dd55c8cc0c75b72f16cb5a55f270b"}},{"ruleId":"D2","level":"warning","message":{"text":"loongarch::classify_arg (cognitive 30): loongarch::classify_arg has cognitive complexity 30 (threshold 15). Drivers by points: if/else 24, match/switch 4, 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":"compiler/rustc_target/src/callconv/loongarch.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c70536cda97bf81de842e1e2f55894cbac50ecb4d7e064c1af73435fa60ece"}},{"ruleId":"D2","level":"warning","message":{"text":"riscv::classify_arg (cognitive 30): riscv::classify_arg has cognitive complexity 30 (threshold 15). Drivers by points: if/else 24, match/switch 4, 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":"compiler/rustc_target/src/callconv/riscv.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e9afce74f21bca358a5c40ec3d43fc242ea5c296753c98fd7ffe93c49e3194"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::assemble_candidates_from_auto_impls (cognitive 30): SelectionContext::assemble_candidates_from_auto_impls has cognitive complexity 30 (threshold 15). Drivers by points: if/else 23, match/switch 6, 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":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c27e72775fd5fc80e5cb13cc4ed1b32639fb136aeb4b7d55243185ebe5aa977"}},{"ruleId":"D2","level":"warning","message":{"text":"dyn_compatibility::virtual_call_violations_for_method (cognitive 30): dyn_compatibility::virtual_call_violations_for_method has cognitive complexity 30 (threshold 15). Drivers by points: if/else 27, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e8681fa941e1e077d5a1e98e22c80a45f9b09e4d708b8a261d110d3d40b7ca"}},{"ruleId":"D2","level":"warning","message":{"text":"MaybeTransmutableQuery::answer_impl (cognitive 30): MaybeTransmutableQuery::answer_impl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 24, match/switch 4, 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":"compiler/rustc_transmute/src/maybe_transmutable/mod.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3164781a09d8258cf852a5f8cb917385c929528160b35212c11b0f94a148aa9"}},{"ruleId":"D2","level":"warning","message":{"text":"Zip::next_back (cognitive 30): Zip::next_back has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15, loops 10, boolean chains 5 (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":"library/core/src/iter/adapters/zip.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c9ddda2efe68cddd9b8f65cf52a4290034297ea6346299f7e4368c086902d8"}},{"ruleId":"D2","level":"warning","message":{"text":"hvx::generate_functions (cognitive 30): hvx::generate_functions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 27, loops 2, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"257ef0b5e17b07c201a926bb77fd335d7e6457e1754f6c43a37e41b131740267"}},{"ruleId":"D2","level":"warning","message":{"text":"cc_detect::default_compiler (cognitive 30): cc_detect::default_compiler has cognitive complexity 30 (threshold 15). Drivers by points: if/else 24, match/switch 5, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/utils/cc_detect.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c3e7d86908d8e4906831b362611a7709b8b6e8887abfc7b66fcf3eae1bb7a2"}},{"ruleId":"D2","level":"warning","message":{"text":"markdown::rust_code_blocks (cognitive 30): markdown::rust_code_blocks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17, match/switch 7, loops 5, 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":"src/librustdoc/html/markdown.rs"},"region":{"startLine":2023}}}],"partialFingerprints":{"codehealthFindingId/v1":"1987ede300fec535968860c49631e8ffa2094886213a94dfecc838d4cabb2b19"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor::match_impl (cognitive 30): Cursor::match_impl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10, loops 10, match/switch 10 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_dev/src/parse/cursor.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89917f8aa9f7f0ddd8614c909ed905ea1b7e8ff215333cadd5493bc88b976c2"}},{"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 13, match/switch 11, loops 4, boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/inherent_impl.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"238c53da782a7dd61d24722e4100cdf90cf172a794069603cc8535072a4bdb9e"}},{"ruleId":"D2","level":"warning","message":{"text":"doc_suspicious_footnotes::check (cognitive 30): doc_suspicious_footnotes::check has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17, match/switch 8, loops 3, 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":"src/tools/clippy/clippy_lints/src/doc/doc_suspicious_footnotes.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8fa35aa4189db2fa95f77c16bc0ba2a4a43f6b019c14e05b57e2ce903abb43"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::load_compare_outputs (cognitive 30): TestCx::load_compare_outputs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 27, match/switch 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":2328}}}],"partialFingerprints":{"codehealthFindingId/v1":"022eb94cf8fcf6496b75eb30a4a7506cba46c43e4737ab92bf8372119a610d0b"}},{"ruleId":"D2","level":"warning","message":{"text":"needs::handle_needs (cognitive 30): needs::handle_needs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 25, loops 4, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/directives/needs.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"81594c03f56eca0becaaf92e44fe52d22eb0285468a5c34074d117f3fabcb0a4"}},{"ruleId":"D2","level":"warning","message":{"text":"phases::phase_cargo_miri (cognitive 30): phases::phase_cargo_miri has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18, boolean chains 6, match/switch 4, loops 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/cargo-miri/src/phases.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4333f114a600bdd7f024676da1115b2a584d580a5713a2ace7543374be5d51"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::deduce_closure_signature_from_predicates (cognitive 30): InferenceContext::deduce_closure_signature_from_predicates has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19, match/switch 9, boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad83aeedd4d5b8aa45e81b267ba337761bbdc9bf0a2fdadd6e37558045d571a1"}},{"ruleId":"D2","level":"warning","message":{"text":"ProbeContext::consider_probe (cognitive 30): ProbeContext::consider_probe has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20, match/switch 8, boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b5b2e906bab71cc58e0f3c0c209c56a91c3ab1fcd886455ee2552d9fbdfc3a"}},{"ruleId":"D2","level":"warning","message":{"text":"rename::transform_method_call_into_assoc_fn (cognitive 30): rename::transform_method_call_into_assoc_fn has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 14, if/else 9, loops 6, boolean chains 1 (nesting depth added 19). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0eb2a965ba246d1badf0ccf34811e97b9fa41ca971d811c11c1e28f60ec3f78"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_bool_to_enum::replace_usages (cognitive 30): convert_bool_to_enum::replace_usages has cognitive complexity 30 (threshold 15). Drivers by points: if/else 26, match/switch 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_to_enum.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc6d4a55ef5f194637beff1ab05ead080c4c238be325a554e2126bcb1319a5b"}},{"ruleId":"D2","level":"warning","message":{"text":"format_string_exprs::parse_format_exprs (cognitive 30): format_string_exprs::parse_format_exprs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 25, boolean chains 2, match/switch 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/format_string_exprs.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37f335a51866c9b6aa7e9a023db142b246a542869d83ef975d2b65f2d4b33b5"}},{"ruleId":"D2","level":"warning","message":{"text":"request::run_rustfmt (cognitive 30): request::run_rustfmt has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18, boolean chains 6, match/switch 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":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":2407}}}],"partialFingerprints":{"codehealthFindingId/v1":"9374ba071a759c7f6753c0e1c81d8b66473d87dc6e91d0e6c0b7af7a8c7f48b8"}},{"ruleId":"D2","level":"warning","message":{"text":"AstIdMap::from_source (cognitive 30): AstIdMap::from_source has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15, match/switch 7, boolean chains 4, loops 4 (nesting depth added 15). Of this number, 29 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/span/src/ast_id.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b774f48087931895611e18f6e5bde3d8d028b909b97b2288578d295748b2a95"}},{"ruleId":"D2","level":"warning","message":{"text":"UseTree::normalize (cognitive 30): UseTree::normalize has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20, match/switch 5, loops 3, boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/imports.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e1b8f12417d4aa74804ea0844c3348734d4c8a30b807531831b8fde2ef8130"}},{"ruleId":"D2","level":"warning","message":{"text":"parseInput (cognitive 30): parseInput has cognitive complexity 30 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb0c5ab797ddbae79b17f5592f58c78d96a38a39ceb1928e3464e6056b5d5cd"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_path_segment (cognitive 29): LoweringContext::lower_path_segment has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14, match/switch 12, boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/path.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa772d5a4bad3d42bf14ba3e50787f67f17e9c8a58ce7bf880ee064a121ec0c"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_inline_asm (cognitive 29): State::print_inline_asm has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17, match/switch 11, 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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b386e4a1d5f582740eb565e5ed034ebdd4d542b7ae7b99c0cac69a754c3b74f"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintState::print_comment (cognitive 29): PrintState::print_comment has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18, loops 8, match/switch 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f125ffc0aa57e740a93ce482622a42474248f6f21a1cbc2f27831b9d213ca3d"}},{"ruleId":"D2","level":"warning","message":{"text":"check_cfg::unexpected_cfg_value (cognitive 29): check_cfg::unexpected_cfg_value has cognitive complexity 29 (threshold 15). Drivers by points: if/else 24, boolean chains 5 (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":"compiler/rustc_attr_parsing/src/check_cfg.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f82136a02f5ec0b3718d9eddd04be4f400a79283b3324d6812bc84431c5e24"}},{"ruleId":"D2","level":"warning","message":{"text":"debug::show_substructure (cognitive 29): debug::show_substructure has cognitive complexity 29 (threshold 15). Drivers by points: if/else 23, loops 4, match/switch 2 (nesting depth added 10). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/deriving/debug.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7e7440fa659a0b97ff4845cff2ac8f3954a2ea982556650c57a032735ed25a"}},{"ruleId":"D2","level":"warning","message":{"text":"utils::split_args (cognitive 29): utils::split_args has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21, loops 7, 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":"compiler/rustc_codegen_gcc/build_system/src/utils.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"081ccff659c4dac71a9a9354cd9858d74cc23ba6d05da322bd9feb659cc780f0"}},{"ruleId":"D2","level":"warning","message":{"text":"callee::get_fn (cognitive 29): callee::get_fn has cognitive complexity 29 (threshold 15). Drivers by points: if/else 22, boolean chains 7 (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":"compiler/rustc_codegen_llvm/src/callee.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e5ae3ff21473a5857c5091d99e8886ac59cad7e7edeba99d866c4bc733fb6e"}},{"ruleId":"D2","level":"warning","message":{"text":"mir::arg_local_refs (cognitive 29): mir::arg_local_refs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18, match/switch 7, boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c38ffc6f521c436b93c4318e0312ca382560fd6dda535db4ef83fc877bd35a5"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnostics::failed_to_match_macro (cognitive 29): diagnostics::failed_to_match_macro has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19, boolean chains 5, loops 3, match/switch 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":"compiler/rustc_expand/src/mbe/diagnostics.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0349d1a9b9183e5cbad96e712a8043735e1fdbacc59fa440e0955362f7527212"}},{"ruleId":"D2","level":"warning","message":{"text":"config::features (cognitive 29): config::features has cognitive complexity 29 (threshold 15). Drivers by points: if/else 26, loops 2, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/config.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"252713f97662c210fa52de9508bc0118ad68561ad6eb7061c57a7f83ba17ae16"}},{"ruleId":"D2","level":"warning","message":{"text":"check::check_packed (cognitive 29): check::check_packed has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21, loops 7, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e41a6da60e6e2dd63e93fcf154e7c3f372f4cc83c4fed0e9ce46ada52b601a8"}},{"ruleId":"D2","level":"warning","message":{"text":"wfcheck::check_type_defn (cognitive 29): wfcheck::check_type_defn has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16, boolean chains 5, loops 5, match/switch 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ffca9800144a8a66e2ecf760722a0fc0e72a7b8598febb7efec34c927f8be1"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_item (cognitive 29): State::print_item has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18, loops 6, match/switch 5 (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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff352b7c3a0abe9c50e8ad78ca5bec4556ffcfd8a1268799a8db6094f7175cf1"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_break (cognitive 29): FnCtxt::check_expr_break has cognitive complexity 29 (threshold 15). Drivers by points: if/else 25, match/switch 3, 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c2da1081b0c7694dba1b489f7f431e4c8f8c9b14b62ab6ed61d6329b9778aa"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::borrow_pat_suggestion (cognitive 29): FnCtxt::borrow_pat_suggestion has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16, match/switch 7, boolean chains 3, loops 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f013a28c8de9e7eb261d0d0a24e8cf276a8d540a9ad04aa86a36b25e631721fb"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_struct_pat_fields (cognitive 29): FnCtxt::check_struct_pat_fields has cognitive complexity 29 (threshold 15). Drivers by points: if/else 22, boolean chains 3, match/switch 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"f909eba885eca72ff5d6a67bb91d586fd477291b26e617b0baeded38f6c181ba"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::compute_min_captures (cognitive 29): FnCtxt::compute_min_captures has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 13, if/else 9, loops 7 (nesting depth added 16). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"0119ab11e4fb0617e514bcbb20395c61ade1b255ff71d775fd38a23b1d83cdf9"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineAsmCtxt::check_asm_operand_type (cognitive 29): InlineAsmCtxt::check_asm_operand_type has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21, match/switch 4, boolean chains 2, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a2d931cb71d69c199752f71f5f2dc7d55f45f40d0b54aecf5977a9fbb38256"}},{"ruleId":"D2","level":"warning","message":{"text":"LintStore::check_lint_name (cognitive 29): LintStore::check_lint_name has cognitive complexity 29 (threshold 15). Drivers by points: if/else 20, match/switch 8, 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":"compiler/rustc_lint/src/context.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9c774a029139f482eb87f4635e86c4d0a3b6ed6615c560a8636381b2d92950"}},{"ruleId":"D2","level":"warning","message":{"text":"ImproperCTypesVisitor::visit_type (cognitive 29): ImproperCTypesVisitor::visit_type has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16, match/switch 7, boolean chains 4, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff8ef5068f159d6777a755d691575573e732c62927aab62fd30c58a946c41af"}},{"ruleId":"D2","level":"warning","message":{"text":"UndefinedBehaviorInfo::fmt (cognitive 29): UndefinedBehaviorInfo::fmt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 27, match/switch 2 (nesting depth added 12). Of this number, 26 points are the body\u0027s own statements and 3 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/interpret/error.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"391611d54cf4c0b5a32057be82a923f3a7a1d408b8072e5882a42f561e5261cd"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstInt::fmt (cognitive 29): ConstInt::fmt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15, match/switch 14 (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":"compiler/rustc_middle/src/ty/consts/int.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d314a3cfc39df301c1cbfbf5503399d6b82af8db637c1385700c95161f51c0"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyPrinter::pretty_print_const_valtree (cognitive 29): PrettyPrinter::pretty_print_const_valtree has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15, match/switch 8, loops 4, 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1505610feac3e7ce82591542e4bd0ab58d472f50145b4c176d55241bb001811"}},{"ruleId":"D2","level":"warning","message":{"text":"FmtPrinter::name_all_regions (cognitive 29): FmtPrinter::name_all_regions has cognitive complexity 29 (threshold 15). Drivers by points: if/else 23, boolean chains 3, loops 3 (nesting depth added 9). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2785}}}],"partialFingerprints":{"codehealthFindingId/v1":"883df830c53c5e2038f303de3819659b305de47297907a04481d38de248459f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parameter_without_type (cognitive 29): Parser::parameter_without_type has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14, boolean chains 7, match/switch 5, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":2237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3aa5ffcafb4a6c42ab82fc06902e764c9954297459dcda60c675593fafc51d6"}},{"ruleId":"D2","level":"warning","message":{"text":"FnAbi::adjust_for_rust_abi (cognitive 29): FnAbi::adjust_for_rust_abi has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21, boolean chains 4, match/switch 3, 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":"compiler/rustc_target/src/callconv/mod.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc76cda418a7bcba1537990795e182cafbcafe4b6a7b6ff50189838b07952e9"}},{"ruleId":"D2","level":"warning","message":{"text":"grisu::max_pow10_no_more_than (cognitive 29): grisu::max_pow10_no_more_than has cognitive complexity 29 (threshold 15). Drivers by points: if/else 29 (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":"library/core/src/num/imp/flt2dec/strategy/grisu.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2f02e0f14551c631f9695dee79991ef29a23c772cfc3c5188cedfe98c8d4ba"}},{"ruleId":"D2","level":"warning","message":{"text":"UdpSocket::send_to (cognitive 29): UdpSocket::send_to has cognitive complexity 29 (threshold 15). Drivers by points: if/else 20, loops 5, match/switch 3, 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":"library/std/src/sys/net/connection/xous/udp.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb67350b59d119b7c73c1d4215c5ac3cce50210776b33df81e4783147cb0b3e"}},{"ruleId":"D2","level":"warning","message":{"text":"intrinsic::create_tokens (cognitive 29): intrinsic::create_tokens has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18, loops 6, match/switch 3, 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":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"940025d2a059ecc86ad1c7efc01db39f180c4dbd19986abe6352ffb46178ba04"}},{"ruleId":"D2","level":"warning","message":{"text":"scalar::parse_prototype (cognitive 29): scalar::parse_prototype has cognitive complexity 29 (threshold 15). Drivers by points: if/else 26, loops 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":"library/stdarch/crates/stdarch-gen-hexagon/src/scalar.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"345c649db074b677ed8613a11a10e2c0d8907597bf3d42a015634a76ca590ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"cli_paths::match_paths_to_steps_and_run (cognitive 29): cli_paths::match_paths_to_steps_and_run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16, loops 8, boolean chains 4, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/cli_paths.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f71559b897a59c73198ed5eca3aafc7efc39d9d43ef1a7d41c4e2c6f1391482"}},{"ruleId":"D2","level":"warning","message":{"text":"TagIterator::parse_outside_attribute_block (cognitive 29): TagIterator::parse_outside_attribute_block has cognitive complexity 29 (threshold 15). Drivers by points: if/else 24, boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b2774453ad6e1ef1d1a6de106dc57dadd5b7d8e2fddea02c2be98eded0d2e9"}},{"ruleId":"D2","level":"warning","message":{"text":"match_same_arms::check (cognitive 29): match_same_arms::check has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18, 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":"src/tools/clippy/clippy_lints/src/matches/match_same_arms.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f9ad9f13e30fe8486ef97a18fd19a99f1473cec6c9bbb05e724f08e589b6ae"}},{"ruleId":"D2","level":"warning","message":{"text":"manual_let_else::replace_in_pattern (cognitive 29): manual_let_else::replace_in_pattern has cognitive complexity 29 (threshold 15). Drivers by points: if/else 25, match/switch 3, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/manual_let_else.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f511fd66b0b946ccca1c5b9c87f96be2bce15d3d8174382bd8d6082ea7664b"}},{"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 20, boolean chains 7, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1861d1afc7420302d5cf5e6b04e9f1785da94e339f4b3b4e9a5931dfa01e7f6"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::run_codegen_units_test (cognitive 29): TestCx::run_codegen_units_test has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19, loops 8, boolean chains 2 (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 9 belong to 3 function items declared inside it. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/codegen_units.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b232bf589a1fa561f5bdce34b469817cc4954ede690795a616b0d53afa84de0d"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::run_rmake_test (cognitive 29): TestCx::run_rmake_test has cognitive complexity 29 (threshold 15). Drivers by points: if/else 27, boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/run_make.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8397cd7934d41793712dcaceca2577e939fba290730c99256bbb6d368ca04745"}},{"ruleId":"D2","level":"warning","message":{"text":"directives::ignore_gdb (cognitive 29): directives::ignore_gdb has cognitive complexity 29 (threshold 15). Drivers by points: if/else 26, boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/directives.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"868472f0e0769f67578e52148198fa9605242c159cc6f6e0f5d0cfe87e5c26b1"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::seed_with_top_level (cognitive 29): DefCollector::seed_with_top_level has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15, match/switch 9, boolean chains 3, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3b03b59788f77ebe9ac29497a96e53a60c60a9ffb97841b4513b6fb2e68d15"}},{"ruleId":"D2","level":"warning","message":{"text":"pretty::print_generic_params (cognitive 29): pretty::print_generic_params has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21, loops 4, match/switch 4 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae024acd1d7668060d63bba5eb16e8c37f526f46b11081ce681d9b95a9a7edbd"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::compute_min_captures (cognitive 29): InferenceContext::compute_min_captures has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 13, if/else 9, loops 7 (nesting depth added 16). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"7042e1389a7316707e24780a2f826ff264ae4c643a0543b35750fe81cfb9743e"}},{"ruleId":"D2","level":"warning","message":{"text":"borrowck::partially_moved (cognitive 29): borrowck::partially_moved has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 18, loops 8, if/else 2, boolean chains 1 (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":"src/tools/rust-analyzer/crates/hir-ty/src/mir/borrowck.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bae8759e524ac6f12385580da7169a388afaf300b11af99a7b6f6c965c5345"}},{"ruleId":"D2","level":"warning","message":{"text":"render::literal (cognitive 29): render::literal has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 16, if/else 13 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a70b1c6715d017364a0cc0562fd2a5995c0a01c994e9f0187eaec7c2a41976f"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_module::extract_module (cognitive 29): extract_module::extract_module has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19, loops 8, 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_module.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbb11c89cb37e1df05443b135a7afd391893570f71124a17bfe85bc03194ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_closure_to_fn::compute_closure_type_params (cognitive 29): convert_closure_to_fn::compute_closure_type_params has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17, loops 11, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ea6064bad20468d344535f7222d111b35d4af22071deb41b0bd370c3c9fd36"}},{"ruleId":"D2","level":"warning","message":{"text":"merge_imports::recursive_normalize (cognitive 29): merge_imports::recursive_normalize has cognitive complexity 29 (threshold 15). Drivers by points: if/else 24, loops 4, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c5ebeea42fd24896d296edc10ed210a22d9d0358347d5c8617b7fb7ccb24e8"}},{"ruleId":"D2","level":"warning","message":{"text":"unlinked_file::fixes (cognitive 29): unlinked_file::fixes has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 11, if/else 10, loops 7, boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unlinked_file.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"574ae8ac53b890d71b1586e06544fd4c416349efd48fbc39dd2b50bd8d67c38e"}},{"ruleId":"D2","level":"warning","message":{"text":"missing_fields::fixes (cognitive 29): missing_fields::fixes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21, loops 4, match/switch 3, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/missing_fields.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6056679ff38f2f66854e8132d1086d204bddfb650384e7e127b821d72a64bee1"}},{"ruleId":"D2","level":"warning","message":{"text":"env::cargo_config_env (cognitive 29): env::cargo_config_env has cognitive complexity 29 (threshold 15). Drivers by points: if/else 26, match/switch 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/env.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"768a3c8b38d915c9656bef21cd7256c8ee5774e34ae341e617a7df75f7b5b628"}},{"ruleId":"D2","level":"warning","message":{"text":"items::format_impl (cognitive 29): items::format_impl has cognitive complexity 29 (threshold 15). Drivers by points: if/else 20, boolean chains 5, match/switch 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":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"9163d6ccfe17f5255e258a15ab6f1076741b8b268e4e6e8f89df3d66cf43c795"}},{"ruleId":"D2","level":"warning","message":{"text":"register_implementors (cognitive 29): register_implementors has cognitive complexity 29 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"957f01dd1796b601b7611e20dd5e499d51fe4930dc030c74a4d5d940207c116d"}},{"ruleId":"D2","level":"warning","message":{"text":"Attribute::rewrite_result (cognitive 28): Attribute::rewrite_result has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14, match/switch 12, 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":"src/tools/rustfmt/src/attr.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"30277ca77aa7412941d8a476d00aa29415310c4721c0866406de7fd0484fb1d3"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkParser::extend (cognitive 28): LinkParser::extend has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18, match/switch 6, loops 3, 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":"compiler/rustc_attr_parsing/src/attributes/link_attrs.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a91d24af474e80dc6174292f481e6fd26affd635a9d48caa43a15dbda18e5e9"}},{"ruleId":"D2","level":"warning","message":{"text":"format::report_missing_placeholders (cognitive 28): format::report_missing_placeholders has cognitive complexity 28 (threshold 15). Drivers by points: if/else 22, boolean chains 3, match/switch 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"8caaa491ca67ccbd28877c7e798306437151cdc8014e734a09f4f04ac1877912"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::dbg_scope_fn (cognitive 28): Builder::dbg_scope_fn has cognitive complexity 28 (threshold 15). Drivers by points: if/else 23, boolean chains 3, match/switch 2 (nesting depth added 5). Most of this is not in the body itself: 8 of the 28 points are its own statements and the rest belongs to 3 function items declared inside it (get_containing_scope, get_function_signature, get_template_parameters). 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":"compiler/rustc_codegen_llvm/src/debuginfo/mod.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"12486b38df02dccd3ed5895a753922887b4dd4f8e8ee33aeb709a80da99624af"}},{"ruleId":"D2","level":"warning","message":{"text":"link::link_staticlib (cognitive 28): link::link_staticlib has cognitive complexity 28 (threshold 15). Drivers by points: if/else 21, boolean chains 4, loops 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa7571a9afa6b0d7f2f21314b315bbaf7fde28bfb7342254db4df9ae703c2f4"}},{"ruleId":"D2","level":"warning","message":{"text":"link::exec_linker (cognitive 28): link::exec_linker has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11, match/switch 8, loops 7, boolean chains 2 (nesting depth added 11). Of this number, 22 points are the body\u0027s own statements and 6 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c55bc8b959fb13ddd22bfee0efd37d78df7aa024ff6f68220f522880f41ac8"}},{"ruleId":"D2","level":"warning","message":{"text":"link::linker_with_args (cognitive 28): link::linker_with_args has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17, loops 10, 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2725}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fa79c488f7ab7396942beae031041c3ecec89e1fbc0b0617ed0237638a03bf"}},{"ruleId":"D2","level":"warning","message":{"text":"emitter::detect_confusion_type (cognitive 28): emitter::detect_confusion_type has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20, boolean chains 4, loops 2, match/switch 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":"compiler/rustc_errors/src/emitter.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67f72d6bc07a11d63f24752f3ede3d67b248a13c8baf2de3fd917879e81367e"}},{"ruleId":"D2","level":"warning","message":{"text":"variance::variance_of_opaque (cognitive 28): variance::variance_of_opaque has cognitive complexity 28 (threshold 15). Drivers by points: loops 12, if/else 8, match/switch 6, 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":"compiler/rustc_hir_analysis/src/variance/mod.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a9bb49dec35778517396db3884061f926ece75b518fb6ae50b59ed08a33954"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprUseVisitor::walk_captures (cognitive 28): ExprUseVisitor::walk_captures has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14, loops 7, match/switch 7 (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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"172eb0d61840e0cf3ae3704a6747a385d795ea3a5e90d569c2ccea57c7143792"}},{"ruleId":"D2","level":"warning","message":{"text":"SubdiagnosticDeriveVariantBuilder::into_tokens (cognitive 28): SubdiagnosticDeriveVariantBuilder::into_tokens has cognitive complexity 28 (threshold 15). Drivers by points: if/else 23, boolean chains 2, match/switch 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/diagnostics/subdiagnostic.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"338b00639570bf18163e2f29fd49a6442dba3a54ebd88591cb7594985cd18181"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnostics::suggest_changing_unsized_bound (cognitive 28): diagnostics::suggest_changing_unsized_bound has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18, loops 9, 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":"compiler/rustc_middle/src/ty/diagnostics.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db05a7d3d1993383ed0ed89c00f8be83745dd697133bd7d3980ba7ac65eef9d"}},{"ruleId":"D2","level":"warning","message":{"text":"DropCtxt::open_drop_for_multivariant (cognitive 28): DropCtxt::open_drop_for_multivariant has cognitive complexity 28 (threshold 15). Drivers by points: if/else 27, 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":"compiler/rustc_mir_transform/src/elaborate_drop.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"3381612a6d24be91a9f9ae9abcfed85f3a8ce5cef522f4c0ca451b8c5c7c41ef"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionItemRefChecker::check_bound_args (cognitive 28): FunctionItemRefChecker::check_bound_args has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20, loops 8 (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":"compiler/rustc_mir_transform/src/function_item_references.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e2acddb6ee19bb54aa8ad43894ac09e69c89c4bb77c39c29028dba4c6d2bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"dest_prop::save_as_intervals (cognitive 28): dest_prop::save_as_intervals has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13, match/switch 10, loops 5 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/dest_prop.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de92c182e6d93a99d1d929cf7b67e3c1847ce62d97660c681986da1d294cc85"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalCtxt::merge_trait_candidates (cognitive 28): EvalCtxt::merge_trait_candidates has cognitive complexity 28 (threshold 15). Drivers by points: if/else 22, loops 3, match/switch 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/trait_goals.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67f66f24bde4277e2c186f7d20866f2385c1067742ba11292ec452edb3a525a"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::detect_missing_binding_available_from_pattern (cognitive 28): LateResolutionVisitor::detect_missing_binding_available_from_pattern has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14, loops 13, boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0db08f68f2f0817d776289f954cb86e652397ac2aafe7e6f11a175f499cee2"}},{"ruleId":"D2","level":"warning","message":{"text":"effects::evaluate_host_effect_from_conditionally_const_item_bounds (cognitive 28): effects::evaluate_host_effect_from_conditionally_const_item_bounds has cognitive complexity 28 (threshold 15). Drivers by points: if/else 24, loops 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/effects.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"041ae26d5c3747a395a8069ea9889d0b87115154ba357486fa35b2e60769ebb0"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchGraph::rebase_provisional_cache_entries (cognitive 28): SearchGraph::rebase_provisional_cache_entries has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15, loops 11, match/switch 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":"compiler/rustc_type_ir/src/search_graph/mod.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e35e0816f5cc0a78ff3be658abb177e7010349ff3cd507bb2d5708e7bfd13e0"}},{"ruleId":"D2","level":"warning","message":{"text":"region_constraint::rewrite_type_outlives_constraints_in_universe_for_eager_placeholder_handling (cognitive 28): region_constraint::rewrite_type_outlives_constraints_in_universe_for_eager_placeholder_handling has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17, match/switch 6, loops 3, boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"615ec6ec475976d1624a7a46f667768634bfe1f7e799ae54fdd757d2698c762e"}},{"ruleId":"D2","level":"warning","message":{"text":"tanf::tanf (cognitive 28): tanf::tanf has cognitive complexity 28 (threshold 15). Drivers by points: if/else 28 (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":"library/compiler-builtins/libm/src/math/tanf.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e85f00d56a53b50b38f8747b02f7a214456b7509a99c3e69982c73826014409"}},{"ruleId":"D2","level":"warning","message":{"text":"print_item::item_variants (cognitive 28): print_item::item_variants has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17, match/switch 6, loops 4, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2881f64ff0db12dc2492a7412c98d7d7debbf04683d3f4a9a4977dcb8a5a34e"}},{"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 19, boolean chains 5, match/switch 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/float_literal.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b04da10d1d846febcd5e3f3384902b85d05002519702f10474db18fa986b830"}},{"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 19, boolean chains 5, loops 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/format_args.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"62641507672b310606c677d34c80041f649f3cc13c40124fd2b0866953e2a6af"}},{"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 22, loops 3, match/switch 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/macro_use.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e73b03cc7800cd40eb31200c62cca6523c98b5fcb58d1a10239e79ffc3dcb18"}},{"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 15, 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":"src/tools/clippy/clippy_lints/src/tuple_array_conversions.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3a70d21d356f1da7ad42de6522f6b2455a2cd0655588566d5462a81e1592b5"}},{"ruleId":"D2","level":"warning","message":{"text":"str_splitn::parse_iter_usage (cognitive 28): str_splitn::parse_iter_usage has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20, match/switch 5, boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/str_splitn.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff30fad30ffe4d1ccc436f3858cf950f718687ee342f2cfde2fbda17655378e"}},{"ruleId":"D2","level":"warning","message":{"text":"paths::local_item_child_by_name (cognitive 28): paths::local_item_child_by_name has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20, match/switch 6, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/paths.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3cd37bbec06dd422d53b2d8582063849bf530427bcc17e3c57da3fa475a6f1"}},{"ruleId":"D2","level":"warning","message":{"text":"json::push_actual_errors (cognitive 28): json::push_actual_errors has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13, loops 13, 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":"src/tools/compiletest/src/json.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c80cdacf9d7ee1d48ff0e1bfcd40f361e3c491682e5c88d97b2b1d938abf1a"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_type_ref (cognitive 28): Printer::print_type_ref has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19, match/switch 5, loops 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f063521b095d7c97ce595de19a4bcacc92910077edf839929f19703d02b3bbb"}},{"ruleId":"D2","level":"warning","message":{"text":"SolverContext::compute_goal_fast_path (cognitive 28): SolverContext::compute_goal_fast_path has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20, match/switch 6, boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/solver.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b28371eb68b133f5605d1e7be7ce40151ae2af31cf8d2b93562489ea83ad8eb"}},{"ruleId":"D2","level":"warning","message":{"text":"param_name::hints (cognitive 28): param_name::hints has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18, match/switch 9, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/param_name.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f467802bf0f4ab9c6670e34db75237a4e91cf579e416370be0d8d26b1dbc16"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis::analyze (cognitive 28): analysis::analyze has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20, boolean chains 7, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee33f11c4b3b380d557e8bd65003c647ea294d67e546bd38e2d2a4e8de44ed9"}},{"ruleId":"D2","level":"warning","message":{"text":"version_sort::version_sort (cognitive 28): version_sort::version_sort has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 14, if/else 11, boolean chains 2, loops 1 (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":"src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"8204d4fcdd48eb1e9fa7edc78fb5b663043811fa073a98eedd3fa05642f3cf46"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::compute_priming_scope (cognitive 28): GlobalState::compute_priming_scope has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17, loops 9, match/switch 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"a534b3426e5156249958b054222ee69b390f08e08f90ac74e6f698f81d0bfc44"}},{"ruleId":"D2","level":"warning","message":{"text":"sort::version_sort (cognitive 28): sort::version_sort has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 14, if/else 11, boolean chains 2, loops 1 (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":"src/tools/rustfmt/src/sort.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6317bc6f360c0a8a6f1153d33f255cecf53b72dc2558fea2f84cf8b6aa38cb"}},{"ruleId":"D2","level":"warning","message":{"text":"string::rewrite_string (cognitive 28): string::rewrite_string has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19, loops 4, boolean chains 3, match/switch 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/string.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a13b40645bfac23fc1374a2b65618ca49c66a7e25041b8e579c8a162773977"}},{"ruleId":"D2","level":"warning","message":{"text":"x_version::check (cognitive 28): x_version::check has cognitive complexity 28 (threshold 15). Drivers by points: if/else 24, loops 2, boolean chains 1, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/x_version.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"646ee7ee342236ef7f0bea4ccc795cad02bef617e795a346b295a3932f6d0f35"}},{"ruleId":"D2","level":"warning","message":{"text":"Local::rewrite_result (cognitive 27): Local::rewrite_result has cognitive complexity 27 (threshold 15). Drivers by points: if/else 24, boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"534cd48426a39d32342221941a790eff5cf95cbe25c5144f3479cc9a500bc185"}},{"ruleId":"D2","level":"warning","message":{"text":"Ty::ty_and_layout_field::field_ty_or_layout (cognitive 27): Ty::ty_and_layout_field::field_ty_or_layout has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17, match/switch 8, 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":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a41af7bcf6076e0a0c2f7c000424ca268ddff50cd51dac4727dee372840baa8"}},{"ruleId":"D2","level":"warning","message":{"text":"comments::beautify_doc_string::get_horizontal_trim (cognitive 27): comments::beautify_doc_string::get_horizontal_trim has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16, loops 7, boolean chains 3, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/util/comments.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"965e17b5d8059a40d22974cbcaa3ff5f284c87933a78fcde74821c917f5cab9f"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_qpath (cognitive 27): LoweringContext::lower_qpath has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18, match/switch 6, boolean chains 2, loops 1 (nesting depth added 6). 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":"compiler/rustc_ast_lowering/src/path.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"003afc4bcd8feb89351f4129f2044eaa59c03ebd32da4c7d1fa6d067e7ad9f02"}},{"ruleId":"D2","level":"warning","message":{"text":"AstValidator::visit_generics (cognitive 27): AstValidator::visit_generics has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12, match/switch 9, loops 6 (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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec90cf00c41b5699f123f2043198cc87cc01a0f8f4a035fb5707b39b5a345225"}},{"ruleId":"D2","level":"warning","message":{"text":"feature_gate::check_crate (cognitive 27): feature_gate::check_crate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15, loops 8, 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":"compiler/rustc_ast_passes/src/feature_gate.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be141450291be63ac6b4d46835a64b2daaaaf5ad4fbce9f29a38d74af941764"}},{"ruleId":"D2","level":"warning","message":{"text":"DocParser::parse_auto_cfg_values (cognitive 27): DocParser::parse_auto_cfg_values has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19, match/switch 5, boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"563fa915a930a549be5151ecff4c0a6df0c7b58d04be78e9261f7b7eb8c30c68"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::point_at_binding_outside_closure (cognitive 27): MirBorrowckCtxt::point_at_binding_outside_closure has cognitive complexity 27 (threshold 15). Drivers by points: if/else 25, boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f54a496d88b5e533f6fa8e38a273fc02df46a370697c259106c3ffe029887c2"}},{"ruleId":"D2","level":"warning","message":{"text":"mutability_errors::suggest_ampmut (cognitive 27): mutability_errors::suggest_ampmut has cognitive complexity 27 (threshold 15). Drivers by points: if/else 20, boolean chains 5, match/switch 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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f2559af2dd951ef015138fd30c06f8c74859c00edc1d709d4587bc8c4033bb"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigInfo::setup (cognitive 27): ConfigInfo::setup has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, match/switch 5, boolean chains 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":"compiler/rustc_codegen_gcc/build_system/src/config.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"7564cf3130977b63ab24dfb449a40c15c31f446c674dbc743570bdc1c6ecb74f"}},{"ruleId":"D2","level":"warning","message":{"text":"llvm_aarch64::codegen_aarch64_llvm_intrinsic_call (cognitive 27): llvm_aarch64::codegen_aarch64_llvm_intrinsic_call has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 15, loops 10, boolean chains 2 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf1da94e8d95cc43c7446b66c5262b400abf599358cc9ae58bd10f10af331bc"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenCx::codegen_global_asm (cognitive 27): CodegenCx::codegen_global_asm has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 14, if/else 8, loops 4, boolean chains 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a7c0571a739fb7d017da5ac43bca58c4b34f58291dc4db67b8b53e1c3477a4"}},{"ruleId":"D2","level":"warning","message":{"text":"metadata::elf_e_flags (cognitive 27): metadata::elf_e_flags has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14, match/switch 11, 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":"compiler/rustc_codegen_ssa/src/back/metadata.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b00c915ace909cc09e3e75adf79b0cb24ea97cf8d53bc47ec27ccd0924d2eaf"}},{"ruleId":"D2","level":"warning","message":{"text":"write::do_thin_lto (cognitive 27): write::do_thin_lto has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12, match/switch 8, loops 5, boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"1148d03e87d951409c03bf5ca3b70a2700bfaaaa25125c0ca4a80f9a5b7206a9"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::read_discriminant (cognitive 27): InterpCx::read_discriminant has cognitive complexity 27 (threshold 15). Drivers by points: if/else 20, match/switch 6, 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":"compiler/rustc_const_eval/src/interpret/discriminant.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81410a83279f53925edbcd3122b37f53d89c1094710906b3a8b0b4108f1a8d6"}},{"ruleId":"D2","level":"warning","message":{"text":"intern::intern_const_alloc_recursive (cognitive 27): intern::intern_const_alloc_recursive has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, boolean chains 4, loops 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":"compiler/rustc_const_eval/src/interpret/intern.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed6ee0e9193ebfbe5c3f373d2b4ec51f6c03f335031f3075344d156e26f5aca"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroExpander::fully_expand_fragment (cognitive 27): MacroExpander::fully_expand_fragment has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15, match/switch 7, loops 4, 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":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb338fc2ba9d8423d850433e21d3ec39e63d99190e34e8947bdb2e02acf8d93a"}},{"ruleId":"D2","level":"warning","message":{"text":"generics::check_generic_arg_count (cognitive 27): generics::check_generic_arg_count has cognitive complexity 27 (threshold 15). Drivers by points: if/else 22, boolean chains 4, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b005aaa8e8fb29bbcecb742a84c1c21213c024e7b8ab827f7e3a0a8bb614555f"}},{"ruleId":"D2","level":"warning","message":{"text":"impl_wf_check::enforce_impl_lifetime_params_are_constrained (cognitive 27): impl_wf_check::enforce_impl_lifetime_params_are_constrained has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18, loops 5, match/switch 3, boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/impl_wf_check.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23301ac03739f8c11b7a7ceb1950fc909b27d47202ec97cccfbf6279ad75813"}},{"ruleId":"D2","level":"warning","message":{"text":"refine::check_refining_return_position_impl_trait_in_trait (cognitive 27): refine::check_refining_return_position_impl_trait_in_trait has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18, loops 5, 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":"compiler/rustc_hir_analysis/src/check/compare_impl_item/refine.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a30caf4b527cfb8fb798acaf77b40765582a9d497d99a3f1219afd7cfa7de6a"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::try_find_coercion_lub (cognitive 27): FnCtxt::try_find_coercion_lub has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13, match/switch 9, loops 3, 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7385c2ca370c850ca781e6b7493db7f6a8ee5d3157c7992f4e36540d73725765"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_use_shadowed_binding_with_method (cognitive 27): FnCtxt::suggest_use_shadowed_binding_with_method has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19, boolean chains 7, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"528f119a997dde3e2c552aba33b47eabd79c8c0e5c045e0fbb98a52dce7b9f24"}},{"ruleId":"D2","level":"warning","message":{"text":"fs::garbage_collect_session_directories (cognitive 27): fs::garbage_collect_session_directories has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, loops 3, match/switch 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":"compiler/rustc_incremental/src/persist/fs.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"80be80a4977b93c25f3f5ced58eda3eb73776fb9c500557aa66e803b35b8ab92"}},{"ruleId":"D2","level":"warning","message":{"text":"DerefChecker::visit_place (cognitive 27): DerefChecker::visit_place has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, loops 4, boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/deref_separator.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed47108da1ba99154ebc042b21ce462f807eb7107cb14f1d55c02882276094ac"}},{"ruleId":"D2","level":"warning","message":{"text":"inline::resolve_callsite (cognitive 27): inline::resolve_callsite has cognitive complexity 27 (threshold 15). Drivers by points: if/else 26, boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"076fc6b3451095e59c196e049f89bea21a52c0f4206c75b6bc88613190529ff4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_where_clause_common (cognitive 27): Parser::parse_where_clause_common has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18, match/switch 5, loops 3, 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":"compiler/rustc_parse/src/parser/generics.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc402bcaf8bed063e6efb91495a67f3f5ddf616761059bf9d0b110aa8567411"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_generic_arg (cognitive 27): Parser::parse_generic_arg has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16, match/switch 6, 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":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d4d9b0bd2d2436ce6145d330c7ba51504132454190b680ec0276cd73c73917"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::next (cognitive 27): Parser::next has cognitive complexity 27 (threshold 15). Drivers by points: if/else 25, match/switch 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9aa7b4aec38c7229fe37e322602d3584f5f97f63065e235e72ee65c82c8f194"}},{"ruleId":"D2","level":"warning","message":{"text":"MissingStabilityAnnotations::check_compatible_stability (cognitive 27): MissingStabilityAnnotations::check_compatible_stability has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17, boolean chains 7, match/switch 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"823f31be00f14e2da60e2670be83215e70fdaccc73d3cbaf449c63d66e2bb419"}},{"ruleId":"D2","level":"warning","message":{"text":"print::write_struct_like (cognitive 27): print::write_struct_like has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16, boolean chains 5, loops 5, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/rustc/print.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"701d81b007b4c84387a6b9f3a604c2e781067185c69f32ef42ffb03b4900ca41"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::process_macro_use_imports (cognitive 27): DefCollector::process_macro_use_imports has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, boolean chains 2, loops 2, match/switch 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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dfa490a8635ad8588ad147f91c0ccc704f98393117254ea9c6c0bc63b98246"}},{"ruleId":"D2","level":"warning","message":{"text":"transform::transform_instance (cognitive 27): transform::transform_instance has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 14, if/else 10, boolean chains 3 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/transform.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"385a98ecf5e59e407d585bb9ef10395f58d6ca831935379614c98f79baee889c"}},{"ruleId":"D2","level":"warning","message":{"text":"V0SymbolMangler::print_type (cognitive 27): V0SymbolMangler::print_type has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16, match/switch 7, loops 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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"790819eddbd142b94db5b1cb1f5604c0257829da70ee79c2b36eb7029a926f98"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::consider_returning_binding_diag (cognitive 27): TypeErrCtxt::consider_returning_binding_diag has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15, boolean chains 4, loops 4, match/switch 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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c5c993bc666a64481ef0c1cfd05ab932556579b9373c55994625809c0c82e4"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::report_not_const_evaluatable_error (cognitive 27): TypeErrCtxt::report_not_const_evaluatable_error has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, boolean chains 3, match/switch 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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":3810}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c85c91ea173cdc372ab65fe9b26101b231e1114274eae90b66a2574d32542e"}},{"ruleId":"D2","level":"warning","message":{"text":"traits::report_dyn_incompatibility (cognitive 27): traits::report_dyn_incompatibility has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14, loops 8, match/switch 3, 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":"compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"402f362e7ab5eb8f7c4456c296a99ab03a2f1fa2ee7d19a36265b52ffd307505"}},{"ruleId":"D2","level":"warning","message":{"text":"misc::type_allowed_to_implement_const_param_ty (cognitive 27): misc::type_allowed_to_implement_const_param_ty has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16, match/switch 6, loops 4, 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":"compiler/rustc_trait_selection/src/traits/misc.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f000a112262cb6a1d928141f98093d9a478a8d8421d1da18e61743f2bb9f7f16"}},{"ruleId":"D2","level":"warning","message":{"text":"OpaqueTypeCollector::visit_ty (cognitive 27): OpaqueTypeCollector::visit_ty has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, loops 4, boolean chains 1, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/opaque_types.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73764a53f286dadcbec02b869d343d32e36a1e0a1b1a9650d294bd379e7f9ad"}},{"ruleId":"D2","level":"warning","message":{"text":"BufWriter::write_vectored (cognitive 27): BufWriter::write_vectored has cognitive complexity 27 (threshold 15). Drivers by points: if/else 22, loops 4, 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":"library/alloc/src/io/buffered/bufwriter.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc31cd4a59f5fc6a2cfc378f7041a99e1bdaa6e16e1170204b3eba58200aad3d"}},{"ruleId":"D2","level":"warning","message":{"text":"sincosf::sincosf (cognitive 27): sincosf::sincosf has cognitive complexity 27 (threshold 15). Drivers by points: if/else 26, 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":"library/compiler-builtins/libm/src/math/sincosf.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"24db2d82b05b21e9d8f2e8595b99a5a13aeca8bd045cd9e25bd8cc26d66491e6"}},{"ruleId":"D2","level":"warning","message":{"text":"atan2f::atan2f (cognitive 27): atan2f::atan2f has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17, match/switch 7, boolean chains 3 (nesting depth added 6). 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":"library/compiler-builtins/libm/src/math/atan2f.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd7ecdd8d4f8997f215003ba47c0d79f9ce5e0caaf0e43190fb488ef5cdf258"}},{"ruleId":"D2","level":"warning","message":{"text":"atan2::atan2 (cognitive 27): atan2::atan2 has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17, match/switch 7, boolean chains 3 (nesting depth added 6). 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":"library/compiler-builtins/libm/src/math/atan2.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28331e6869f48cb1557e705a87ecf941abaae247cab26612353f211c71655fa"}},{"ruleId":"D2","level":"warning","message":{"text":"Channel::start_recv (cognitive 27): Channel::start_recv has cognitive complexity 27 (threshold 15). Drivers by points: if/else 24, match/switch 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/mpmc/list.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"462ca28bfe8ed550977ea7a9e95026fa7d5acab0f7ad746782bb15c06f95acdc"}},{"ruleId":"D2","level":"warning","message":{"text":"Libunwind::run (cognitive 27): Libunwind::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, loops 4, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6cf917bc531b9bd190343bec44682bf726a96cc81e820ffc789087ff28160c"}},{"ruleId":"D2","level":"warning","message":{"text":"dist::maybe_install_llvm (cognitive 27): dist::maybe_install_llvm has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19, match/switch 4, boolean chains 2, loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":2471}}}],"partialFingerprints":{"codehealthFindingId/v1":"860ffefd6302ea23b4f60d6e6a55cf0823158561f69b2f03334141c0aeb873b7"}},{"ruleId":"D2","level":"warning","message":{"text":"compile::copy_self_contained_objects (cognitive 27): compile::copy_self_contained_objects has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13, loops 13, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d3954cb79e0ccaed2ff0d9f7e30cb95769b21e39c02131a78faa2239892e9e"}},{"ruleId":"D2","level":"warning","message":{"text":"DocTestBuilder::generate_unique_doctest (cognitive 27): DocTestBuilder::generate_unique_doctest has cognitive complexity 27 (threshold 15). Drivers by points: if/else 24, boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest/make.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80776fd6f713d050f38db8dae46e3b418ebc54631bff71fbb2ce4c3e4e97965"}},{"ruleId":"D2","level":"warning","message":{"text":"Stripper::fold_item (cognitive 27): Stripper::fold_item has cognitive complexity 27 (threshold 15). Drivers by points: if/else 22, boolean chains 3, match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/strip_hidden.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f061fcde20c94504578c449891e52b7d287706334e885bd759ac0e0e57477006"}},{"ruleId":"D2","level":"warning","message":{"text":"redundant_explicit_links::check_redundant_explicit_link (cognitive 27): redundant_explicit_links::check_redundant_explicit_link has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, match/switch 4, boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/redundant_explicit_links.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b7eca18044dbbb36f87875667bb71709d6c65a6008286044bb525f25112240"}},{"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 14, boolean chains 8, loops 4, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cafe64a0d8701e712cf0af3289b716259718584d739013ee57cff0a15b37df0"}},{"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 12, match/switch 8, boolean chains 7 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/filter_map.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2eb37b919b3399fb95a6f9c4b0d4b32e99b8704a306e98499de130ef27009d0"}},{"ruleId":"D2","level":"warning","message":{"text":"NeedlessLateInit::check_if_or_match (cognitive 27): NeedlessLateInit::check_if_or_match has cognitive complexity 27 (threshold 15). Drivers by points: if/else 22, loops 3, boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_late_init.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5785eb2d608597375422c7a55a82b757664fdfe2c91d4f22cb2102f1602d1904"}},{"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 18, match/switch 7, boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/zombie_processes.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe3aacffe33655539b35ef79e8e168b5cac707ec761fb18dbaade5b9ffe8a73"}},{"ruleId":"D2","level":"warning","message":{"text":"manual_div_ceil::check (cognitive 27): manual_div_ceil::check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16, boolean chains 9, 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":"src/tools/clippy/clippy_lints/src/operators/manual_div_ceil.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"53803347d9bb040b49518560ae52e7a8d6d11471d9e44167c0f7d358d61e1465"}},{"ruleId":"D2","level":"warning","message":{"text":"unnecessary_cast::walk_receiver_path_step (cognitive 27): unnecessary_cast::walk_receiver_path_step has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17, boolean chains 7, match/switch 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e70610189b637e16bcdab45df3259a531e6ffc1dcac7962ae9caaf753b70a54"}},{"ruleId":"D2","level":"warning","message":{"text":"undocumented_unsafe_blocks::text_has_safety_comment (cognitive 27): undocumented_unsafe_blocks::text_has_safety_comment has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13, boolean chains 6, match/switch 5, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"f929bc6b8fd32794bee9f3a69e816a8cc5cd009433bb6362b39d7f7410eed917"}},{"ruleId":"D2","level":"warning","message":{"text":"too_many_lines::check_fn (cognitive 27): too_many_lines::check_fn has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, boolean chains 3, loops 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/functions/too_many_lines.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbe85c5f7c7d31231fb287fafe3e8d2b87a8b9eb82f42102b58067148b7d35d"}},{"ruleId":"D2","level":"warning","message":{"text":"same_item_push::check (cognitive 27): same_item_push::check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14, match/switch 10, 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 declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/same_item_push.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"55da8b902d2caa23a998256ae2f2b0f2080edbe5aabd4c17343b58e7f43780d0"}},{"ruleId":"D2","level":"warning","message":{"text":"branches_sharing_code::scan_block_for_eq (cognitive 27): branches_sharing_code::scan_block_for_eq has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17, loops 5, match/switch 3, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/ifs/branches_sharing_code.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"9620dc6a00ba151935aacb60fe87c49fe3d3833ca6acb89344bfbece1e7570a7"}},{"ruleId":"D2","level":"warning","message":{"text":"unnecessary_lazy_eval::check (cognitive 27): unnecessary_lazy_eval::check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, boolean chains 3, match/switch 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_lazy_eval.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"241f061b8d175944b0356cf8ca82330078626c5ed5a21d1270e280c21e01a22d"}},{"ruleId":"D2","level":"warning","message":{"text":"unnecessary_iter_cloned::check_for_loop_iter (cognitive 27): unnecessary_iter_cloned::check_for_loop_iter has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17, boolean chains 4, loops 3, match/switch 3 (nesting depth added 11). Of this number, 18 points are the body\u0027s own statements and 9 belong to 2 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_iter_cloned.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78d2873fbfd73144f4bcc20f1e89ecd5b5f367b4a5fe17491b571407eb639b1"}},{"ruleId":"D2","level":"warning","message":{"text":"option_as_ref_deref::check (cognitive 27): option_as_ref_deref::check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16, boolean chains 8, match/switch 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/option_as_ref_deref.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcd3748dfd5fc9eb5684eb6f0970c37332ab6de4a7ecc8f17dec10a81a68c3f"}},{"ruleId":"D2","level":"warning","message":{"text":"bit_mask::check (cognitive 27): bit_mask::check has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 15, if/else 8, 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":"src/tools/clippy/clippy_lints/src/operators/bit_mask.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb07c7b1138b13dc49bbb26e2e7ca0f064603f6c379aade71285ee90380aefc7"}},{"ruleId":"D2","level":"warning","message":{"text":"ast_utils::eq_expr (cognitive 27): 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":"src/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac89cab34132f45b7d4a97d670637170e3b3961ed84f115f41366a8bc6d25138"}},{"ruleId":"D2","level":"warning","message":{"text":"sync::futex (cognitive 27): sync::futex has cognitive complexity 27 (threshold 15). Drivers by points: if/else 24, 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":"src/tools/miri/src/shims/unix/linux_like/sync.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2c39fb5a45c7eb0368f17aadd0f562954f738ce9f4b8202b25016801f3e43c"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::patch_addresses (cognitive 27): Evaluator::patch_addresses has cognitive complexity 27 (threshold 15). Drivers by points: loops 11, match/switch 10, if/else 6 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"277920baea9a03f4f0a31a04e674e136a132d1df2779c7e90b548756a2f1a0c5"}},{"ruleId":"D2","level":"warning","message":{"text":"Generalizer::tys (cognitive 27): Generalizer::tys has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16, match/switch 10, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf108cf3adbea7066124dab55eb3c940079890b01355fb2061a706e954658bbd"}},{"ruleId":"D2","level":"warning","message":{"text":"render::render_memory_layout (cognitive 27): render::render_memory_layout has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14, match/switch 10, boolean chains 3 (nesting depth added 8). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a9cecc9d46680339c24a2adb3fff35d444d7c5d9fb8f3d49c00166c6c17e4d"}},{"ruleId":"D2","level":"warning","message":{"text":"bind_pat::hints (cognitive 27): bind_pat::hints has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19, boolean chains 5, 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":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/bind_pat.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"084f887165bfe0f68fb43f7f858279a9dc59f18dd3b7c3725094e9ef5a88ce93"}},{"ruleId":"D2","level":"warning","message":{"text":"signature_help::signature_help (cognitive 27): signature_help::signature_help has cognitive complexity 27 (threshold 15). Drivers by points: if/else 23, match/switch 2, boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f410beeffd74f2f5ee88ef536a74c82474911c729c7426d6417680b47ba0f2"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_documentation_template::introduction_builder (cognitive 27): generate_documentation_template::introduction_builder has cognitive complexity 27 (threshold 15). Drivers by points: if/else 23, boolean chains 2, match/switch 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_documentation_template.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed65c4ce55470db94a4185bd7daef28076a6b5f1f263ef03208e328a21ebb64"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_delegate_methods::generate_delegate_methods (cognitive 27): generate_delegate_methods::generate_delegate_methods has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15, match/switch 8, boolean chains 2, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_methods.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c78f56fb536e1766d2f742cb62abad98fb364b15c42074eb1de4a75e7acbca"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_function::extract_function (cognitive 27): extract_function::extract_function has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, match/switch 4, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae271c332dd61ecee84d95e04b7992beb76314ae24263150d26363e127116f1"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionRelevance::score (cognitive 27): CompletionRelevance::score has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21, match/switch 6 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/item.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"328da09908b739e0237f939e0b5908dbd16fed2da7f015fc1791955745bc063b"}},{"ruleId":"D2","level":"warning","message":{"text":"pattern::complete_pattern_path (cognitive 27): pattern::complete_pattern_path has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 15, if/else 9, loops 3 (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":"src/tools/rust-analyzer/crates/ide-completion/src/completions/pattern.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6c0af23cb9fa573f9c41062480c8686fb5854f13da7df5a2ceaf31c3e8bb74"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::subtree (cognitive 27): Writer::subtree has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17, match/switch 9, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2642bc95a2b52b4e237e18a40e424fa9f3f009bd89f46171f570aaaa4cab08"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace::project_json_to_crate_graph (cognitive 27): workspace::project_json_to_crate_graph has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19, loops 4, boolean chains 2, match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f088e807030ec2b4ab7e754a67a52e4620d9843d1701e308d329f179068e0a"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlFlow::rewrite_cond (cognitive 27): ControlFlow::rewrite_cond has cognitive complexity 27 (threshold 15). Drivers by points: if/else 20, boolean chains 6, match/switch 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/expr.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebaf866ba61e3f4ca417ae14491577914b9057fd951c0726b9a8557960b5505"}},{"ruleId":"D2","level":"warning","message":{"text":"comment::combine_strs_with_missing_comments (cognitive 27): comment::combine_strs_with_missing_comments has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19, boolean chains 8 (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":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cc61c1fd81128319c176a65c977bcba79352503e15083214b7a1f766186cfc"}},{"ruleId":"D2","level":"warning","message":{"text":"main::format (cognitive 27): main::format has cognitive complexity 27 (threshold 15). Drivers by points: if/else 23, boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/bin/main.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb72c0c5b7194ac7828990607cf07088e01ee55de6c032e3f2a7ee3b04b06f9"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc_templates::check (cognitive 27): rustdoc_templates::check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19, loops 4, boolean chains 2, match/switch 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/rustdoc_templates.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f1e1594e4a1e53937d2fb255d5c7a810eeaef1b8cdef89da415f352a76dc50"}},{"ruleId":"D2","level":"warning","message":{"text":"coroutine::coroutine_saved_local_eligibility (cognitive 26): coroutine::coroutine_saved_local_eligibility has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12, loops 10, match/switch 3, 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":"compiler/rustc_abi/src/layout/coroutine.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6af47cce6a0c5c7ebbfbfdbb14d23b92a7952e1cb339eab2962f50738abd38c"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_expr_mut (cognitive 26): LoweringContext::lower_expr_mut has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15, match/switch 8, loops 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":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"de17445dd7c18d0b36c549687ebc7652ebe7a2ecbec5b2abe447e1ee589b33bd"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_variant_data (cognitive 26): LoweringContext::lower_variant_data has cognitive complexity 26 (threshold 15). Drivers by points: if/else 20, loops 5, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"4976fcf576e861ff9acac6bff7d3d0584ccb108c4aeb3b76e3e0fd31d922fe6c"}},{"ruleId":"D2","level":"warning","message":{"text":"state::gather_comments (cognitive 26): state::gather_comments has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15, match/switch 6, loops 5 (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":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"0023e4ddd62751fc16702009b900619fc166c536a63c5e91f05bca077c794324"}},{"ruleId":"D2","level":"warning","message":{"text":"cfg::eval_config_entry (cognitive 26): cfg::eval_config_entry has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21, loops 4, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/cfg.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfe4f83bf04eecd3575682ec14168d51a5db52627998178798e11f602a831d4"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::add_static_impl_trait_suggestion (cognitive 26): MirBorrowckCtxt::add_static_impl_trait_suggestion has cognitive complexity 26 (threshold 15). Drivers by points: if/else 22, loops 2, match/switch 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0051891dbaff155ae9cb104ea303d591a80c69354633c7365281de96c349e5d"}},{"ruleId":"D2","level":"warning","message":{"text":"RegionInferenceContext::find_constraint_path_between_regions_inner (cognitive 26): RegionInferenceContext::find_constraint_path_between_regions_inner has cognitive complexity 26 (threshold 15). Drivers by points: loops 10, match/switch 8, if/else 7, 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":"compiler/rustc_borrowck/src/region_infer/mod.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ef598bc54b6669dc3900dbee6c1cb79c315853b865ef4e6223e511a99a8367"}},{"ruleId":"D2","level":"warning","message":{"text":"value_and_place::assert_assignable (cognitive 26): value_and_place::assert_assignable has cognitive complexity 26 (threshold 15). Drivers by points: loops 14, match/switch 11, if/else 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a8ba1b742c5a24db2001608785454da6f371dfede17d020f30dce67f6bca3e"}},{"ruleId":"D2","level":"warning","message":{"text":"asm::modifier_to_gcc (cognitive 26): asm::modifier_to_gcc has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, match/switch 7 (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":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d70cb102f2a6aa35c39ce642dc9174b7d7631f8fcc14f94854f52e24dcb32f9"}},{"ruleId":"D2","level":"warning","message":{"text":"abi::get_attrs (cognitive 26): abi::get_attrs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, loops 5, boolean chains 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/abi.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae96353167be00296939593560ea0175404177503b1c6f8e1be58b549429655"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidityVisitor::try_visit_primitive (cognitive 26): ValidityVisitor::try_visit_primitive has cognitive complexity 26 (threshold 15). Drivers by points: if/else 24, boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dcfa17e3a14a9ce591f7ed02cfa0c49739c64e8bf8a1634e960b388d4fd992"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::probe_op (cognitive 26): FnCtxt::probe_op has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13, match/switch 9, 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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"f297275dc8ff71fc83f6584243aeea71a07ba010e04e5ad652493cfb2d9d1734"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_method_not_found_because_of_unsatisfied_bounds (cognitive 26): FnCtxt::suggest_method_not_found_because_of_unsatisfied_bounds has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16, match/switch 5, boolean chains 3, loops 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9374f7935bb9f0fdcf82a01aa121cf2a07bd6a7e340386f9fc21c1e6511bdff"}},{"ruleId":"D2","level":"warning","message":{"text":"ProbeContext::pick_all_method (cognitive 26): ProbeContext::pick_all_method has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21, loops 4, boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"947fabe88ee0e71c6fb112ddc66ce71a34e7ebdacba23137e706f9b55c74d7f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::report_conflict (cognitive 26): Resolver::report_conflict has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 11, boolean chains 10, if/else 5 (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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e39d01d2a381c0bccdeba01b710f19852d4c4c7bd44bbcf91eb54759aa8fd2"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::unresolved_macro_suggestions (cognitive 26): Resolver::unresolved_macro_suggestions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14, match/switch 6, boolean chains 5, loops 1 (nesting depth added 6). 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":1912}}}],"partialFingerprints":{"codehealthFindingId/v1":"402e2fb967176628f16b251507f9a15c2a2862c0508ad29b363a964229add63b"}},{"ruleId":"D2","level":"warning","message":{"text":"InferCtxt::instantiate_var (cognitive 26): InferCtxt::instantiate_var has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17, match/switch 9 (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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0627bf4e3aa60b351129567366a99c89cfa637ef0a0b1b52f92f874f1c78a7c1"}},{"ruleId":"D2","level":"warning","message":{"text":"PanicMessageNotLiteral::into_diag (cognitive 26): PanicMessageNotLiteral::into_diag has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21, boolean chains 5 (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":"compiler/rustc_lint/src/non_fmt_panic.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"395587919952995a3c826f5bd79964e947625e4591b36017b4c150660a8b3829"}},{"ruleId":"D2","level":"warning","message":{"text":"CStore::report_target_modifiers_extended (cognitive 26): CStore::report_target_modifiers_extended has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, match/switch 6, 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":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ca5c0596afac0433c72e05c93fa72c8bb80e42216950cc6229f2832d8970b3"}},{"ruleId":"D2","level":"warning","message":{"text":"visit::walk_expr (cognitive 26): visit::walk_expr has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12, loops 10, match/switch 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":"compiler/rustc_middle/src/thir/visit.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffc4e16422760c2371daa7339c1fef60df6b12f708abbd40c871dd5c2956fbb"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::as_rvalue (cognitive 26): Builder::as_rvalue has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14, match/switch 8, boolean chains 2, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/expr/as_rvalue.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e6c5e2270442075dee22a7afd5eda63c3c4157c65d2557aea7aa18f197bfe5"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::choose_bucket_for_candidate (cognitive 26): Builder::choose_bucket_for_candidate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 20, match/switch 5, 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":"compiler/rustc_mir_build/src/builder/matches/buckets.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"36447e67809cfa3fe467a09befb97b35705cd063c1156700bae275c96149486e"}},{"ruleId":"D2","level":"warning","message":{"text":"ThirPrinter::print_pat_kind (cognitive 26): ThirPrinter::print_pat_kind has cognitive complexity 26 (threshold 15). Drivers by points: loops 15, if/else 10, match/switch 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33f93c7190397d39c386401999cd40d2c09d79ef50c7cf5f6bcc31199d186c4"}},{"ruleId":"D2","level":"warning","message":{"text":"AddCallGuards::run_pass (cognitive 26): AddCallGuards::run_pass has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9, loops 9, boolean chains 4, match/switch 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":"compiler/rustc_mir_transform/src/add_call_guards.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf5ace5b7e7fe1a45094756b667cdd546fca4abb8edd760e22b99b8932be6e2"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::visit_statement (cognitive 26): TypeChecker::visit_statement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 24, boolean chains 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d65c044f4b0e42a3fe3cc042f6a23d9cc66d2bea524e4efd501a0056cf758a"}},{"ruleId":"D2","level":"warning","message":{"text":"layout::check_must_not_suspend_ty (cognitive 26): layout::check_must_not_suspend_ty has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18, loops 6, boolean chains 1, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/coroutine/layout.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0366b51f6041d630f39ffffe293cdc901c1225b966d073e7c769f3f9c551ff"}},{"ruleId":"D2","level":"warning","message":{"text":"inline::inline_call (cognitive 26): inline::inline_call has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18, loops 6, match/switch 2 (nesting depth added 7). Of this number, 23 points are the body\u0027s own statements and 3 belong to one function item declared inside it. 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"359ccc0c5f1c8c3d054cfb7e1d51df48aec048b857b3aae788948dee350ce041"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_outer_attributes (cognitive 26): Parser::parse_outer_attributes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21, match/switch 4, 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":"compiler/rustc_parse/src/parser/attr.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2c3a8de0c20d6645fdc082249389c14177b52a3000c6ee2639efc4517b2ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"V0SymbolMangler::print_const (cognitive 26): V0SymbolMangler::print_const has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 10, loops 9, if/else 7 (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":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc2971c176c7adef425068885808a81e912570409e7b2319ad0b2caf549c13e"}},{"ruleId":"D2","level":"warning","message":{"text":"AmdgpuInlineAsmReg::parse (cognitive 26): AmdgpuInlineAsmReg::parse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 26 (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":"compiler/rustc_target/src/asm/amdgpu.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"91375b6c225083ae256b8adf84e4669916c119f7a411b857ddff0b0d625fbf64"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::report_concrete_failure (cognitive 26): TypeErrCtxt::report_concrete_failure has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14, match/switch 5, boolean chains 4, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d58bf8ee1e9d92dc0d986ff3c49955ba438c16a0ab9c21aa0e4a60ad0ad1cf"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::should_suggest_as_ref_kind (cognitive 26): TypeErrCtxt::should_suggest_as_ref_kind has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 11, if/else 10, loops 4, 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":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91376279e7d794f1a324f852088441ee5b8ba177bc66e43ee5f4f56437cb3d7"}},{"ruleId":"D2","level":"warning","message":{"text":"abi::fn_sig_for_fn_abi (cognitive 26): abi::fn_sig_for_fn_abi has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21, match/switch 5 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/abi.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"822a17346c319991ae19c9c8c73d029b17c512c53fae9ddd86e2f0b0bd43a28a"}},{"ruleId":"D2","level":"warning","message":{"text":"grisu::format_exact_opt (cognitive 26): grisu::format_exact_opt has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, boolean chains 5, loops 2 (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 12 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/imp/flt2dec/strategy/grisu.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"171a5a7534d5c585851732af570184900992f059b6ea57c4c5f5477f834c7834"}},{"ruleId":"D2","level":"warning","message":{"text":"fmt::write (cognitive 26): fmt::write has cognitive complexity 26 (threshold 15). Drivers by points: if/else 25, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/mod.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d33d74042948809d6c67e54a21530782b5feb286157e8f2d403905466380f7"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::do_exec (cognitive 26): Command::do_exec has cognitive complexity 26 (threshold 15). Drivers by points: if/else 25, 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":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f450c6490133edd46802414836342fcec22f7ee59e32a4e2ad55f5b65592bfc7"}},{"ruleId":"D2","level":"warning","message":{"text":"windows::enable (cognitive 26): windows::enable has cognitive complexity 26 (threshold 15). Drivers by points: if/else 23, match/switch 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/thread_local/guard/windows.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"421cf32637326b9a8acaaedf0c7b6cf50805d0f79354ce293e2d9ec9eeb7935d"}},{"ruleId":"D2","level":"warning","message":{"text":"eh::find_eh_action (cognitive 26): eh::find_eh_action has cognitive complexity 26 (threshold 15). Drivers by points: if/else 20, loops 4, match/switch 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":"library/std/src/sys/personality/dwarf/eh.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5a1b47e291acb3ccde3b8d4bd9aea39ab60580c887d7a701f30746ac9f4ba3"}},{"ruleId":"D2","level":"warning","message":{"text":"hvx::generate_extern_block (cognitive 26): hvx::generate_extern_block has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, loops 6, 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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c24d915c56167571e03a9fd199add3bf63a963100fbe86be14a5cdc21b1a01"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolBuild::run (cognitive 26): ToolBuild::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16, match/switch 6, 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":"src/bootstrap/src/core/build_steps/tool.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a533a814605de73cdb9be3a0b789ce1847f3a5489b5c5c90c6f0c49530bc82"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexItemFunctionType::write_to_string_without_param_names (cognitive 26): IndexItemFunctionType::write_to_string_without_param_names has cognitive complexity 26 (threshold 15). Drivers by points: loops 12, if/else 6, boolean chains 4, match/switch 4 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"757881e86a5c4539fc4011fc0fdb002ec6f3acfd13006b525d8a561eb473a7db"}},{"ruleId":"D2","level":"warning","message":{"text":"ImplStripper::fold_item (cognitive 26): ImplStripper::fold_item has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17, boolean chains 6, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/stripper.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"991724628cd147f061a98fea9bf06c420da59f488d9a0b403e28c28d073cd33d"}},{"ruleId":"D2","level":"warning","message":{"text":"FindCalls::visit_expr (cognitive 26): FindCalls::visit_expr has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14, match/switch 12 (nesting depth added 10). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/scrape_examples.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1150ff04c099ae4ed6f2623b74cca35ddf651070420ccf5e3f0b83259943a107"}},{"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 16, loops 8, boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_late_init.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfe0b1500191681bef9ea8a108c22669b60fad8f2f436d8c9c960bd61409634"}},{"ruleId":"D2","level":"warning","message":{"text":"doc_paragraphs_missing_punctuation::is_missing_punctuation (cognitive 26): doc_paragraphs_missing_punctuation::is_missing_punctuation has cognitive complexity 26 (threshold 15). Drivers by points: if/else 20, boolean chains 3, match/switch 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/doc/doc_paragraphs_missing_punctuation.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb3bfcc259533a465a90dcfd5b932495f303668a99d4c6bd306c2010d2a67dd"}},{"ruleId":"D2","level":"warning","message":{"text":"map_identity::check (cognitive 26): map_identity::check has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21, boolean chains 5 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/map_identity.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"642fc0fdc665f2040c65b1401d9c943d07d7e993a5a151a73f1ee7bdd2acd5db"}},{"ruleId":"D2","level":"warning","message":{"text":"misnamed_getters::check_fn (cognitive 26): misnamed_getters::check_fn has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, boolean chains 3, loops 3, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/functions/misnamed_getters.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8333bb529166558cf2ae733da43ec4392235edfa09ddad35447855013fa38415"}},{"ruleId":"D2","level":"warning","message":{"text":"match_bool::check (cognitive 26): match_bool::check has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18, match/switch 7, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/match_bool.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1fc5f469bc3fbe0c76a3f7a27ba3177f5336e05e6d7f10e3885be83b64a205"}},{"ruleId":"D2","level":"warning","message":{"text":"ptr_arg::check_fn_args (cognitive 26): ptr_arg::check_fn_args has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12, match/switch 10, 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":"src/tools/clippy/clippy_lints/src/ptr/ptr_arg.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0dbee419cc6bf95107ec1f842efac349086de66fadbbdf0116e0a81b70445b1"}},{"ruleId":"D2","level":"warning","message":{"text":"ptr_arg::check_ptr_arg_usage (cognitive 26): ptr_arg::check_ptr_arg_usage has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, 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":"src/tools/clippy/clippy_lints/src/ptr/ptr_arg.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"116ed77eafc65771e78ab0cffb4d777e9fe34d78e745978f4c45de39a72eb3fd"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::lookup_exported_symbol (cognitive 26): EvalContextExt::lookup_exported_symbol has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, match/switch 6, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/foreign_items.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce02dda8a1b8d73f154962b90d79161323af53ed2be72c0c5517d0cc0bfa363"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::epoll_ctl (cognitive 26): EvalContextExt::epoll_ctl has cognitive complexity 26 (threshold 15). Drivers by points: if/else 25, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/linux_like/epoll.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"68145634e199c184ce63e01cadde0f658053766af6005a11ab78fed08f049450"}},{"ruleId":"D2","level":"warning","message":{"text":"lower::lower_body (cognitive 26): lower::lower_body has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, match/switch 3, boolean chains 2, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"50748c72d6a1e68aa3eae033c2dd6a990a04cf82875213a7e573d7308e29b7c8"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprUseVisitor::walk_expr (cognitive 26): ExprUseVisitor::walk_expr has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16, loops 6, match/switch 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":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa41c9beba01831f00439f498212a75352e4b2b6878e4b6c406ef4f415a585d2"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::resolve_value_path_inner (cognitive 26): InferenceContext::resolve_value_path_inner has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13, match/switch 13 (nesting depth added 14). Of this number, 25 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/path.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef10ada7aa3878897739a97405dc2838f817767f987a38e16c3f1db71a9eefb"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::resolve_all (cognitive 26): InferenceContext::resolve_all has cognitive complexity 26 (threshold 15). Drivers by points: loops 25, if/else 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08b9a51d39c2a7cb3a32c27025ed257ef82ce1eed9a1880b88383a1d394e1ab"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBody::walk_places (cognitive 26): MirBody::walk_places has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 18, loops 8 (nesting depth added 17). Of this number, 25 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6f93da30de6b439da1d31797ab4e5bc1f7bb4f09674a450d31a32051077cd5"}},{"ruleId":"D2","level":"warning","message":{"text":"moniker::def_to_non_local_moniker (cognitive 26): moniker::def_to_non_local_moniker has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15, match/switch 10, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/moniker.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"440de61d70c11c76f60aaf52f72a2f16b74fea2fb4f2bd6a0d181aa191620cbf"}},{"ruleId":"D2","level":"warning","message":{"text":"wrap_return_type::wrap_return_type (cognitive 26): wrap_return_type::wrap_return_type has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12, match/switch 8, boolean chains 3, loops 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/wrap_return_type.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e54b8c10883e0f4c489b80f24881c5e252b9008a3ea7a0f2d2301ff95dab54"}},{"ruleId":"D2","level":"warning","message":{"text":"NameRefClass::classify (cognitive 26): NameRefClass::classify has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12, match/switch 11, boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/defs.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"956998c20dc45a9b843b208bf610a1aa530ea22823bc19fd4fe481d06836e83d"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportScope::find_insert_use_container (cognitive 26): ImportScope::find_insert_use_container has cognitive complexity 26 (threshold 15). Drivers by points: if/else 24, boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/insert_use.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a008827023d6e9dfa6e4580bcc2312fcc308365bfb0c2404b8cb74aa15245e0b"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntaxEditor::add_generic_param (cognitive 26): SyntaxEditor::add_generic_param has cognitive complexity 26 (threshold 15). Drivers by points: if/else 25, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edits.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3901db7b80425dc305c69425c167e07d89a7d8ac4aec81c5eecc1054f0ce9f1d"}},{"ruleId":"D2","level":"warning","message":{"text":"validation::validate_literal (cognitive 26): validation::validate_literal has cognitive complexity 26 (threshold 15). Drivers by points: if/else 20, boolean chains 5, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"187b9fb08dd4d8b063dea26617ab5553a9b2c175c4204f6fa7615937bfc80b0b"}},{"ruleId":"D2","level":"warning","message":{"text":"deps::check_permitted_dependencies (cognitive 26): deps::check_permitted_dependencies has cognitive complexity 26 (threshold 15). Drivers by points: if/else 22, loops 3, boolean chains 1 (nesting depth added 10). Of this number, 22 points are the body\u0027s own statements and 4 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/deps.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70b2dcc4fd26ace15e7d83fe91ec9198f01066acaaa05aeca1ab7e2a4ed6495"}},{"ruleId":"D2","level":"warning","message":{"text":"runSearch (cognitive 26): runSearch has cognitive complexity 26 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88ac95d73eac58ca51844b30bc45b199f8173f0d0ff80cd674ba128d1c3111f"}},{"ruleId":"D2","level":"warning","message":{"text":"createQueryElement (cognitive 26): createQueryElement has cognitive complexity 26 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"51baa04cd27b04244c077b653618ad1eac0a7a4e66e4c5777851bdd98e639704"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_use_tree (cognitive 25): State::print_use_tree has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20, loops 3, boolean chains 1, 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":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00d5361e3aa91bffc99ebbd7bcd1bf7b2ca95afc83a652ea40168a2febc4f44"}},{"ruleId":"D2","level":"warning","message":{"text":"DocParser::parse_auto_cfg (cognitive 25): DocParser::parse_auto_cfg has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 12, loops 8, if/else 5 (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":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0fd8f4493e59a650e2522b39dfd60bfff28ae3c1ae31a07d6101eb0b81a233"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::suggest_static_lifetime_for_gat_from_hrtb (cognitive 25): MirBorrowckCtxt::suggest_static_lifetime_for_gat_from_hrtb has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, loops 7, 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":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a72f2d471a18653ecb0b6caed745eb2d06a43ab391d7c8e9af3ba28d5a9064"}},{"ruleId":"D2","level":"warning","message":{"text":"format::parse_args (cognitive 25): format::parse_args has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18, match/switch 6, 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":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c92399ddcbcce4d457ef8895823508668999aa2462a44f932b503c55dcdbf6c"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::count_zeroes_nonzero (cognitive 25): Builder::count_zeroes_nonzero has cognitive complexity 25 (threshold 15). Drivers by points: if/else 24, boolean chains 1 (nesting depth added 5). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function item declared inside it. 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":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a6a4c83add89f96eba805fe2b8af364abd74466becc75ca72da2035ec74a16"}},{"ruleId":"D2","level":"warning","message":{"text":"link::add_order_independent_options (cognitive 25): link::add_order_independent_options has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20, boolean chains 5 (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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":3018}}}],"partialFingerprints":{"codehealthFindingId/v1":"84760f9bc8254f61f990f42171c61b66196a5b8d9d8892b006f288a6996191e2"}},{"ruleId":"D2","level":"warning","message":{"text":"Highlighter::highlight_rustc_lexer (cognitive 25): Highlighter::highlight_rustc_lexer has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19, match/switch 5, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_driver_impl/src/highlighter.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f6784315ee807524d2c6627947b663edf569919ca4895c18030163dd856ddc"}},{"ruleId":"D2","level":"warning","message":{"text":"CoerceMany::report_return_mismatched_types (cognitive 25): CoerceMany::report_return_mismatched_types has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18, boolean chains 7 (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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1972}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99d019e3cf7483d918190c1fc0d7503cf4c2ba20ea1ac54e4af5a4f91303578"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_unknown_field (cognitive 25): FnCtxt::report_unknown_field has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14, match/switch 10, 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":2541}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69171b19519fbf68636a724836d62b62eec0876a27faf8a55133169f89a1e56"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::detect_derive_attribute (cognitive 25): Resolver::detect_derive_attribute has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14, match/switch 7, loops 3, 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"c865ced475739bb181c31aee8ce30463eb931e187e7eca054646abfae01e3138"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::resolve_ident_in_module_globs_unadjusted (cognitive 25): Resolver::resolve_ident_in_module_globs_unadjusted has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17, match/switch 6, 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e5f6c5dd2f5f662762e08178b2469904cda34fa880e919ca85318bfbc3cbfc"}},{"ruleId":"D2","level":"warning","message":{"text":"Generalizer::tys (cognitive 25): Generalizer::tys has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, match/switch 8, 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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6425bb649d76272bc582e06074504f019020e442db2ccd0660042a23903f37d"}},{"ruleId":"D2","level":"warning","message":{"text":"NonLocalDefinitions::check_item (cognitive 25): NonLocalDefinitions::check_item has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, boolean chains 6, loops 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/non_local_def.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa3bd1f25da61c00959b8d2b885727a918a951183492a4d3b6dd13f3036c969"}},{"ruleId":"D2","level":"warning","message":{"text":"must_use::is_ty_must_use (cognitive 25): must_use::is_ty_must_use has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19, boolean chains 3, match/switch 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/unused/must_use.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f30e5540e1729fc0db75f4d1bc85a269927cdca7764dcf4a8ab04e4e948828"}},{"ruleId":"D2","level":"warning","message":{"text":"cstore_impl::provide (cognitive 25): cstore_impl::provide has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, loops 5, boolean chains 2, match/switch 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":"compiler/rustc_metadata/src/rmeta/decoder/cstore_impl.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7363b08e8d53ea1eea2d0d6aa28e18ca67c9d6c37a18998e20704227d5fecb"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyPrinter::pretty_print_dyn_existential (cognitive 25): PrettyPrinter::pretty_print_dyn_existential has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21, boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8819e6172a692a57448a49e0f259ae1ccad8193f27970589084ca1d14f1474f"}},{"ruleId":"D2","level":"warning","message":{"text":"pretty::for_each_def (cognitive 25): pretty::for_each_def has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14, loops 5, match/switch 5, 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":3468}}}],"partialFingerprints":{"codehealthFindingId/v1":"9950152564928055b8cee695759ab1ed22dc48aa102d7e39c38942c0b93f1091"}},{"ruleId":"D2","level":"warning","message":{"text":"scope::build_scope_drops (cognitive 25): scope::build_scope_drops has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21, match/switch 2, boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":1804}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bebf4584abd6bd6b9e9b619e0f10c9981a8494e2ee995a3fc5b54578b4e1b63"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstPropagator::visit_terminator (cognitive 25): ConstPropagator::visit_terminator has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19, loops 3, boolean chains 2, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c69547e65a0382894c960f85dc785dcc0ec69b2b82c8aac4937adc326ff22d5"}},{"ruleId":"D2","level":"warning","message":{"text":"DropsReachable::visit (cognitive 25): DropsReachable::visit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17, boolean chains 4, match/switch 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/lint_tail_expr_drop_order.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f79a8cbbe7fb91c015c387ef445349789940c30d70a2f070c074676896a9ef3"}},{"ruleId":"D2","level":"warning","message":{"text":"CfgChecker::check_cleanup_control_flow (cognitive 25): CfgChecker::check_cleanup_control_flow has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13, loops 8, match/switch 3, 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":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"517c97b9957ebae84c2b7f3dcbeae77e8b917c82fe51eb3c5dbc5a82bc2cf253"}},{"ruleId":"D2","level":"warning","message":{"text":"partitioning::merge_codegen_units (cognitive 25): partitioning::merge_codegen_units has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, loops 8, 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":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dd950faf6648af11924d8213dcd5fd91ac314fa419eb3974e850e198323c70"}},{"ruleId":"D2","level":"warning","message":{"text":"partitioning::debug_dump (cognitive 25): partitioning::debug_dump has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18, loops 7 (nesting depth added 10). Of this number, 18 points are the body\u0027s own statements and 7 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75eaa2ceab2de5c2163c3f4b812a8507036802c1af58d16058d69888066689f"}},{"ruleId":"D2","level":"warning","message":{"text":"asm::parse_asm_args (cognitive 25): asm::parse_asm_args has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20, match/switch 3, boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/asm.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"073ef89e502b211fe9334993caa75bc0376b586eb14de14b0103d4e8a0ec2b2f"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnostics::report_suspicious_mismatch_block (cognitive 25): diagnostics::report_suspicious_mismatch_block has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, loops 7, boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/diagnostics.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"233b3cb243e661c86cdb435996bc6a11d4c5e09863e65aad30822dcfbe51b308"}},{"ruleId":"D2","level":"warning","message":{"text":"dead::maybe_record_as_seed (cognitive 25): dead::maybe_record_as_seed has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, match/switch 4, loops 3, boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"044003b41857e5447ee433e4f8a7478f6b24e208b02303acc3518b5607512fc4"}},{"ruleId":"D2","level":"warning","message":{"text":"RustcPatCtxt::lower_pat (cognitive 25): RustcPatCtxt::lower_pat has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 22, if/else 3 (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":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bf857c4891289667fc0f31b034a51b822613baf3e7a3502f91168c7938a96c"}},{"ruleId":"D2","level":"warning","message":{"text":"x86_win32::compute_abi_info (cognitive 25): x86_win32::compute_abi_info has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, boolean chains 4, match/switch 4, 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":"compiler/rustc_target/src/callconv/x86_win32.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0672d7d61c8a28fb8010192f4ded9f344074186889dfb361ce1472c73ca6d09d"}},{"ruleId":"D2","level":"warning","message":{"text":"FulfillmentCtxt::try_evaluate_obligations (cognitive 25): FulfillmentCtxt::try_evaluate_obligations has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14, match/switch 6, loops 3, 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":"compiler/rustc_trait_selection/src/solve/fulfill.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b389c67527384ee7fdc04a2256fc723fef07613777df4c7a6ebe08501e521249"}},{"ruleId":"D2","level":"warning","message":{"text":"FreeRegionsVisitor::visit_ty (cognitive 25): FreeRegionsVisitor::visit_ty has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10, loops 8, match/switch 7 (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":"compiler/rustc_trait_selection/src/traits/outlives_for_liveness.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae143f56463757d550910ec7b60ee068b4bc656ced5ea1e0c97402978a8ead35"}},{"ruleId":"D2","level":"warning","message":{"text":"misc::all_fields_implement_trait (cognitive 25): misc::all_fields_implement_trait has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18, loops 3, match/switch 3, 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":"compiler/rustc_trait_selection/src/traits/misc.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b24f13219000bfa4ff2717d1a9a34e960cb16456726ba093b829c5183eaabdc"}},{"ruleId":"D2","level":"warning","message":{"text":"call_kind::call_kind (cognitive 25): call_kind::call_kind has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18, boolean chains 6, 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":"compiler/rustc_trait_selection/src/error_reporting/traits/call_kind.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"239754570e97018d6fceb7fe02fac3c80379aa19e790991ed03af326ba758a6a"}},{"ruleId":"D2","level":"warning","message":{"text":"sig_types::walk_types (cognitive 25): sig_types::walk_types has cognitive complexity 25 (threshold 15). Drivers by points: loops 15, if/else 7, match/switch 3 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/sig_types.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f5c971c66ad98dce6422a2e325a5748723a398a97dee6199b8d05edab8f62f"}},{"ruleId":"D2","level":"warning","message":{"text":"sinf::sinf (cognitive 25): sinf::sinf has cognitive complexity 25 (threshold 15). Drivers by points: if/else 24, 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":"library/compiler-builtins/libm/src/math/sinf.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"152dbad35d1ff4b441c72100b97584c0c0aced043cf9395623c21b2e0376378d"}},{"ruleId":"D2","level":"warning","message":{"text":"slow::parse_long_mantissa (cognitive 25): slow::parse_long_mantissa has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18, loops 3, match/switch 3, 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":"library/core/src/num/imp/dec2flt/slow.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f12f1d0ef760aab50bac644284daaad1edcfc92e2b40a472939525646d3e35"}},{"ruleId":"D2","level":"warning","message":{"text":"Socket::connect_timeout (cognitive 25): Socket::connect_timeout has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20, match/switch 3, boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/unix.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"161b9084e4cccb69ae80836d850febe80a80266b1ad34f086a10597bfc50f360"}},{"ruleId":"D2","level":"warning","message":{"text":"windows_prefix::parse_prefix (cognitive 25): windows_prefix::parse_prefix has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21, 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":"library/std/src/sys/path/windows_prefix.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"da368450e409c4893bc540f178bb366012be7c00b20259bce6a354bb44f5dedb"}},{"ruleId":"D2","level":"warning","message":{"text":"hvx::parse_compound_expr (cognitive 25): hvx::parse_compound_expr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20, boolean chains 5 (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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb21a54b306ae52e0416787b0918a7479294d2905e24233a978176dbe5eb00a"}},{"ruleId":"D2","level":"warning","message":{"text":"DeferredCommand::finish_process (cognitive 25): DeferredCommand::finish_process has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17, match/switch 8 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/utils/exec.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb5b6bdcf0d6b9f9bea3ff72dcef4622ea6e23fc4e8f19d814eb20ef826a988"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkReplacerInner::handle_event (cognitive 25): LinkReplacerInner::handle_event has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20, boolean chains 4, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bb952b60869ae6bf78de1f262fecbfc28f22eb3a881c1350097aeb89441615"}},{"ruleId":"D2","level":"warning","message":{"text":"TagParser::extract_tags (cognitive 25): TagParser::extract_tags has cognitive complexity 25 (threshold 15). Drivers by points: if/else 22, boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b004c9a6a9e1022221021c0ecb2e390df07c2d1eeecb197e13e8030152e77fe"}},{"ruleId":"D2","level":"warning","message":{"text":"print_item::render_enum_fields (cognitive 25): print_item::render_enum_fields has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13, match/switch 7, boolean chains 3, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":1685}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4d14af580b9964a8a5539f39d7238411fe970412b0c1abc32b212d984aea3f"}},{"ruleId":"D2","level":"warning","message":{"text":"SuggestContext::recurse (cognitive 25): SuggestContext::recurse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18, loops 4, match/switch 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/booleans.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c434e7ba2d1a490d8e32a7721d39c3ad6982d0465f7d0dbc3a026090cd108a"}},{"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 11, match/switch 7, boolean chains 5, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/only_used_in_recursion.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fc500c7576c880970b5b1fe9ed5d46419396cecb86b8833aa4f330a00f409c"}},{"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 18, boolean chains 4, match/switch 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/unnecessary_wraps.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c965415f40e24a4eaa3124e371f42b1b8030b16102d66dd4e0e7c44a987543"}},{"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 16, match/switch 5, 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":"src/tools/clippy/clippy_lints/src/useless_vec.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"80aafd79b85c4dde816f5ab9d1351503c1ee18726e055ab293c5c6922174cf98"}},{"ruleId":"D2","level":"warning","message":{"text":"manual_saturating_arithmetic::is_min_or_max (cognitive 25): manual_saturating_arithmetic::is_min_or_max has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, boolean chains 5, match/switch 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":"src/tools/clippy/clippy_lints/src/methods/manual_saturating_arithmetic.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11b8b75cd4bbb3e0cbc2ac3d53ac435a4f18d5f938ebbf021a88a7c305b529a"}},{"ruleId":"D2","level":"warning","message":{"text":"single_match::check (cognitive 25): single_match::check has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20, boolean chains 5 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/single_match.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f1c4e3b892ef7d3ca7b49dd92befadfcc1fc4cd553f52415a40209e8f501be"}},{"ruleId":"D2","level":"warning","message":{"text":"unnecessary_map_or::check (cognitive 25): unnecessary_map_or::check has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14, boolean chains 6, match/switch 5 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_map_or.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43b47d8d28fe45b74989d61bde3e6f07b7456c4e07ea6c89e750fd01be1f2d3"}},{"ruleId":"D2","level":"warning","message":{"text":"open_options::get_open_options (cognitive 25): open_options::get_open_options has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15, match/switch 6, 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":"src/tools/clippy/clippy_lints/src/methods/open_options.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c647f2af682dd9c6828cbc5d0b845aa93b94013dba074893de40e531233e4d"}},{"ruleId":"D2","level":"warning","message":{"text":"or_fun_call::check (cognitive 25): or_fun_call::check has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17, boolean chains 4, match/switch 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/or_fun_call.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"813f1f420dc300ac910f21a240b68d8be8ac90e3ad32676ce446c98f72692b94"}},{"ruleId":"D2","level":"warning","message":{"text":"never_loop::never_loop_expr (cognitive 25): never_loop::never_loop_expr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15, match/switch 8, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/never_loop.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99670e3f95874bae065776669471be96085062753861195bcd4328840daab76"}},{"ruleId":"D2","level":"warning","message":{"text":"no_effect::reduce_expression (cognitive 25): no_effect::reduce_expression has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13, match/switch 10, boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/no_effect.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d76a5864c41409177094c7290bb45bcc396056bc34e4ff1679278f697260808"}},{"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 15, loops 8, boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints_internal/src/almost_standard_lint_formulation.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2771b6e6417ddbcbd42d12f086d65ef868f67e1b864c0b2c60457cd96562a9"}},{"ruleId":"D2","level":"warning","message":{"text":"type_certainty::path_segment_certainty (cognitive 25): type_certainty::path_segment_certainty has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20, match/switch 3, boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/ty/type_certainty/mod.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c033c9449085deb6df8fb9cc630f6ab53a6012ef49b8c469a5b68b978cc0b4ee"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextPrivExt::sb_reborrow (cognitive 25): EvalContextPrivExt::sb_reborrow has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21, 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":"src/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"4838770b438c0939a2790e0236a270153a36a670952afa51847d31de457c51f4"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::_umtx_op (cognitive 25): EvalContextExt::_umtx_op has cognitive complexity 25 (threshold 15). Drivers by points: if/else 22, boolean chains 2, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/freebsd/sync.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef19fcaec0cc9ab0b673a49f25bd98ca8cc6257ccc55cd09af727cf32c99dd7"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnostics::report_msg (cognitive 25): diagnostics::report_msg has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17, loops 6, boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/diagnostics.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5470304aabea24cd32baa92b5401ed4e5f87a1939cfbc1b95c44530db35eb18"}},{"ruleId":"D2","level":"warning","message":{"text":"tactics::data_constructor (cognitive 25): tactics::data_constructor has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20, boolean chains 4, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8380d5d5c32ed22a7905b2548b8f5fd4707fbc63d3630a27295fb73f2d05f43"}},{"ruleId":"D2","level":"warning","message":{"text":"display::write_generic_params_or_args (cognitive 25): display::write_generic_params_or_args has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17, boolean chains 3, match/switch 3, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c77814da5ed9af55e6d5667ec2016d983fce07aa71e60f38ac22b80bd7fd9a"}},{"ruleId":"D2","level":"warning","message":{"text":"find_path::find_path_for_module (cognitive 25): find_path::find_path_for_module has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19, boolean chains 3, loops 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/find_path.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b82823d8d901d5254ff8f08cc20db13930125c7e67064a1827771c3bb84237"}},{"ruleId":"D2","level":"warning","message":{"text":"find_path::find_local_import_locations (cognitive 25): find_path::find_local_import_locations has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17, loops 3, match/switch 3, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/find_path.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e936ecc26c4a1db3a25f809b9c9bd61a2aad61893c8b37e3c03decbde5550a"}},{"ruleId":"D2","level":"warning","message":{"text":"eager::eager_macro_recur (cognitive 25): eager::eager_macro_recur has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 17, if/else 7, loops 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/eager.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5158cf76f9e85a4337be3c23c0e7c13c0dd4ba8381a1dd302587a090e838c023"}},{"ruleId":"D2","level":"warning","message":{"text":"Coerce::coerce_from_fn_item (cognitive 25): Coerce::coerce_from_fn_item has cognitive complexity 25 (threshold 15). Drivers by points: if/else 22, boolean chains 2, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e36127f18e9d76851a1bab506d37d50d93fbdb6b5843356d759d2f93c130bee"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_pat_inner (cognitive 25): InferenceContext::infer_pat_inner has cognitive complexity 25 (threshold 15). Drivers by points: loops 8, match/switch 7, if/else 6, boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2df8184eb4967b4c3cac615b37a1f1765f1733c77a7770f5b6a146ca3b7fb23"}},{"ruleId":"D2","level":"warning","message":{"text":"MirLowerCtx::lower_block_to_place (cognitive 25): MirLowerCtx::lower_block_to_place has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18, match/switch 6, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"753e9318cb1e5826e612100fefcfbf62e59fb7707d4876c57ab470a29392ffab"}},{"ruleId":"D2","level":"warning","message":{"text":"AdtDef::new (cognitive 25): AdtDef::new has cognitive complexity 25 (threshold 15). Drivers by points: if/else 24, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f38ecab733470d76ac59de2fc804e7cee91190540ac37165956878160e0d9e9"}},{"ruleId":"D2","level":"warning","message":{"text":"borrowck::ever_initialized_map::dfs (cognitive 25): borrowck::ever_initialized_map::dfs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13, match/switch 5, boolean chains 4, loops 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/borrowck.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cf5852fccbb202fbe212d5846a8caf36a844a0106b60e999095e92dd5fa3fe"}},{"ruleId":"D2","level":"warning","message":{"text":"display::render_const_scalar_from_valtree_inner (cognitive 25): display::render_const_scalar_from_valtree_inner has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, match/switch 5, loops 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":"src/tools/rust-analyzer/crates/hir-ty/src/display.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f319ff2025c21b1cf44167c059cc56fc16835f9afb3596ed2313909f314140"}},{"ruleId":"D2","level":"warning","message":{"text":"remove_dbg::compute_dbg_replacement (cognitive 25): remove_dbg::compute_dbg_replacement has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12, match/switch 8, boolean chains 5 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/remove_dbg.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e3365cc1870d8e8591cecd7acb8edf8b16388576ea3deef4521637a3b20b35"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_type_alias::collect_used_generics (cognitive 25): extract_type_alias::collect_used_generics has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14, match/switch 9, boolean chains 2 (nesting depth added 11). Of this number, 24 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_type_alias.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefac9484b51305206dd5279aeff5b8f1a9501db5d38e79fce00a40b04fad07a"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_expressions_from_format_string::extract_expressions_from_format_string (cognitive 25): extract_expressions_from_format_string::extract_expressions_from_format_string has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13, match/switch 9, loops 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_expressions_from_format_string.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"31aaab694e4d8d82a300b9f9b20abc2dcaef13c9b4d818241df5c65a7551ca8e"}},{"ruleId":"D2","level":"warning","message":{"text":"node_ext::walk_patterns_in_expr (cognitive 25): node_ext::walk_patterns_in_expr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15, match/switch 8, 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":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"160d495a09c206c7fd4b8232bfa46877be80dda975179a3a7b0179b04d57eee7"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceBuildScripts::rustc_crates (cognitive 25): WorkspaceBuildScripts::rustc_crates has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12, match/switch 9, loops 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":"src/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e66e87bb23ccad8bf3b394ce297e09e8348e103fef8b22df0d994627f51e40"}},{"ruleId":"D2","level":"warning","message":{"text":"FlycheckActor::check_command (cognitive 25): FlycheckActor::check_command has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14, match/switch 10, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/flycheck.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa53a1c38b0ae122834c6fb7ea285a9a16fe31c66663b2fcec94284b779e66b"}},{"ruleId":"D2","level":"warning","message":{"text":"FmtVisitor::visit_item (cognitive 25): FmtVisitor::visit_item has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18, match/switch 7 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/visitor.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"5356b3c8fd35057798a7f0333673f272f245fb9cd42c79aba616abf37b0b4d0f"}},{"ruleId":"D2","level":"warning","message":{"text":"deps::check_license_exceptions (cognitive 25): deps::check_license_exceptions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14, match/switch 5, loops 4, boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/deps.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9abd84b9471ff81980b01128930746ff2b5abe7298afca0bb9d0815e9731033"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::add_moved_or_invoked_closure_note (cognitive 24): MirBorrowckCtxt::add_moved_or_invoked_closure_note has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15, match/switch 6, boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95e91889dd41a1a610778072bd64efc94e396d5901139511a2bdc50e0da6045"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::append_binding_error (cognitive 24): MirBorrowckCtxt::append_binding_error has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, loops 4, boolean chains 2, 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":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87496d9d0f859fb6f38791dd0fb1466149c81c4bb0f66127678f45b551e25d3"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::consume_rvalue (cognitive 24): MirBorrowckCtxt::consume_rvalue has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10, match/switch 9, loops 5 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"454ab4100153a9e3442e14da53db0da4c70b128dc75d22cebb6f0865eb4be0d7"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenCx::get_static_inner (cognitive 24): CodegenCx::get_static_inner has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20, 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":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6c575671457579b1ead948f7249117ca24670e3b80fc0b152d8f32be6e2c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"base::compile_codegen_unit::module_codegen (cognitive 24): base::compile_codegen_unit::module_codegen has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, loops 6, boolean chains 2 (nesting depth added 5). 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":"compiler/rustc_codegen_llvm/src/base.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"068bc3362631339b392fc3f8e88183a98680a438e42e87643723c3e95e090b69"}},{"ruleId":"D2","level":"warning","message":{"text":"va_arg::emit_powerpc_va_arg (cognitive 24): va_arg::emit_powerpc_va_arg has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13, boolean chains 7, match/switch 3, 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":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c439148c4c59ae69970981b16fabac0b2cfcb31aa8777595599020f0a043b06"}},{"ruleId":"D2","level":"warning","message":{"text":"CrateInfo::new (cognitive 24): CrateInfo::new has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12, match/switch 8, boolean chains 3, 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":"compiler/rustc_codegen_ssa/src/base.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa4a86c9adaea7b377e60398d82b938467954954be7d591648db5bae87181af"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::visit_rvalue (cognitive 24): Checker::visit_rvalue has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, boolean chains 5, match/switch 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":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e4f13b2574915734c3d2ac8b9da086802987fd71e1f0e953228f24bb149527"}},{"ruleId":"D2","level":"warning","message":{"text":"TriColorDepthFirstSearch::run_from (cognitive 24): TriColorDepthFirstSearch::run_from has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18, loops 4, match/switch 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":"compiler/rustc_data_structures/src/graph/iterate/mod.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fefa0bba2be4ae6309c50691a7fe68190d91c7094a7e155dcdb70c32b9a5d5"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_driver_impl::run_compiler (cognitive 24): rustc_driver_impl::run_compiler has cognitive complexity 24 (threshold 15). Drivers by points: if/else 22, 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":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb0fc3f49f703d2d87137585594203e4a04b897853504997213790bfd139a32"}},{"ruleId":"D2","level":"warning","message":{"text":"InvocationCollector::flat_map_node (cognitive 24): InvocationCollector::flat_map_node has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 15, loops 6, if/else 3 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":2323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d812de03ae61642080160fd508d24359c67c9e6d2f76066898813bd2a267f1cd"}},{"ruleId":"D2","level":"warning","message":{"text":"transcribe::transcribe (cognitive 24): transcribe::transcribe has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19, match/switch 4, 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":"compiler/rustc_expand/src/mbe/transcribe.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e33d1755e397ed3a73a4f086ce9bb6c382ee40f0d8996205813e783d3c1c7c"}},{"ruleId":"D2","level":"warning","message":{"text":"WrongNumberOfGenericArgs::get_lifetime_args_suggestions_from_param_names (cognitive 24): WrongNumberOfGenericArgs::get_lifetime_args_suggestions_from_param_names has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18, boolean chains 4, loops 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0479ba04b43852bb4538249e91f261dc25bd5518e97e5f0ca4af65b95014d0"}},{"ruleId":"D2","level":"warning","message":{"text":"generics::generic_arg_mismatch_err (cognitive 24): generics::generic_arg_mismatch_err has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18, boolean chains 3, match/switch 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/generics.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ded167f6de41a63d92b0b30a2aa144269133f286d01af76097934219042034"}},{"ruleId":"D2","level":"warning","message":{"text":"wfcheck::check_where_clauses (cognitive 24): wfcheck::check_where_clauses has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, match/switch 4, boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c505324ac64607f9f2e8182c923aaa9ec495b61beaf73e047fcdcf4ffe542de2"}},{"ruleId":"D2","level":"warning","message":{"text":"entry::check_main_fn_ty (cognitive 24): entry::check_main_fn_ty has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19, match/switch 3, boolean chains 2 (nesting depth added 3). Of this number, 13 points are the body\u0027s own statements and 11 belong to 5 function items declared inside it. 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":"compiler/rustc_hir_analysis/src/check/entry.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0faab8491ad4677c32c6e20500cf36ec6f4a3a145c374ac297340d9db121c7"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_expr (cognitive 24): State::print_expr has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, loops 5, match/switch 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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"18eb83383c818e7f28e718bf8a0e6d1bb572e1f16820061e842f2f9cbe5ccf10"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_index (cognitive 24): FnCtxt::check_expr_index has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, loops 3, boolean chains 2, match/switch 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":3439}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4ef9a540f48eae5cd95a53d2626bd738e627b1b055b96122526d05356c18ee"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::confusable_method_name (cognitive 24): FnCtxt::confusable_method_name has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, loops 5, 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a95ee7c40b6394a5e965823c639ccb30c311e21831b7d8db13a66d5376793b5"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::note_unmet_impls_on_type (cognitive 24): FnCtxt::note_unmet_impls_on_type has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, match/switch 4, loops 2, boolean chains 1 (nesting depth added 5). 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":3473}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d3bcdfe1f6da47b2a8763473bad15c10d42453509fe629aa48f2e443b6136e"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::convert_place_derefs_to_mutable (cognitive 24): FnCtxt::convert_place_derefs_to_mutable has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15, loops 5, boolean chains 2, match/switch 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":"compiler/rustc_hir_typeck/src/place_op.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"193af35ef0bced3a0c67317f8ff38e7a8ce3638c9cf00b645a4755746d75e857"}},{"ruleId":"D2","level":"warning","message":{"text":"types::repr_nullable_ptr (cognitive 24): types::repr_nullable_ptr has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14, match/switch 9, 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":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f861aeaba97a768f03b2e798a2364ecab47c9337d3979eebc3508893060145"}},{"ruleId":"D2","level":"warning","message":{"text":"CStore::inject_allocator_crate (cognitive 24): CStore::inject_allocator_crate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12, match/switch 8, boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"88740190012eac29b7224de578379bee36c7f7dfa63e581141f545c00eba97bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::build_dll_import (cognitive 24): Collector::build_dll_import has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, match/switch 5, boolean chains 2 (nesting depth added 6). 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":"compiler/rustc_metadata/src/native_libs.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93f9a10569ade0c3109b1d8ddfefd2297e7c87e1e15795cf51771b15a707733"}},{"ruleId":"D2","level":"warning","message":{"text":"CostChecker::visit_terminator (cognitive 24): CostChecker::visit_terminator has cognitive complexity 24 (threshold 15). Drivers by points: if/else 21, boolean chains 2, 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":"compiler/rustc_mir_transform/src/cost_checker.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e60cf27a3d95b3a017b8c2a286c6bec102b50cf5bae91c50fc181c53c0040a"}},{"ruleId":"D2","level":"warning","message":{"text":"dead_store_elimination::eliminate (cognitive 24): dead_store_elimination::eliminate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14, loops 8, 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":"compiler/rustc_mir_transform/src/dead_store_elimination.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc5141c72bf8f80b1dd2397c166c7cab51b99bf1e8e43bf07dc22a0407bb083"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkSymbolVisitor::visit_node (cognitive 24): MarkSymbolVisitor::visit_node has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13, match/switch 6, loops 3, boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd2487f2a3a99fd163305f68ac06049e618a173a23cafb1f3d17cbb43a89ce8"}},{"ruleId":"D2","level":"warning","message":{"text":"Slice::split (cognitive 24): Slice::split has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 11, if/else 8, loops 4, boolean chains 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/constructor.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8085cc1e0e3588068d54ce247830fcdab853aa9774573d49bf741c3e6097fe5"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::err_code_special_cases (cognitive 24): LateResolutionVisitor::err_code_special_cases has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, loops 7 (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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dabbcc259e07f887abc8be6709bf408fba00ea7e392e6cc445f3e5cd42ea15"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::visit_generic_params (cognitive 24): LateResolutionVisitor::visit_generic_params has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12, loops 8, match/switch 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"463e152839b206c9e4d74680527f162babd15cf3536180918018dfa6710ce323"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::future_proof_import (cognitive 24): LateResolutionVisitor::future_proof_import has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14, match/switch 5, loops 4, 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"457e9bc27968b12f2da0b600b7ea08a5993252e1a457051c9c810486f487dd02"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_item (cognitive 24): LateResolutionVisitor::resolve_item has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, boolean chains 4, match/switch 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":2824}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8eaca69fc7699f14c9ad14ace3ac58551f81d83e28dd2d7e9f5bb16ee63761c"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_expr (cognitive 24): LateResolutionVisitor::resolve_expr has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10, loops 9, match/switch 5 (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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c74e4a6c96dfacbed620d38793734d24035f48abe5227ff091c66582913f71"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_doc_links (cognitive 24): LateResolutionVisitor::resolve_doc_links has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10, loops 10, boolean chains 3, 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":5447}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d96ea8d19252fa8ee88cdaab69726d1459d0aa45a9729a4cca553a72dcb4643"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::strip_generics_from_path (cognitive 24): rustdoc::strip_generics_from_path has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14, loops 5, match/switch 5 (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":"compiler/rustc_resolve/src/rustdoc.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ece11c84dfb6eafb95b89f441321fac4a7ea0855d9abed57fea4c37da9dcde"}},{"ruleId":"D2","level":"warning","message":{"text":"DescriptionCtx::new (cognitive 24): DescriptionCtx::new has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19, match/switch 4, 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":"compiler/rustc_trait_selection/src/diagnostics/note_and_explain.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5cf5c56277a12fe41d8e307c0362c237086009035d3d771eb6e80274676a63"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::assemble_candidates_for_unsizing (cognitive 24): SelectionContext::assemble_candidates_for_unsizing has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, boolean chains 3, loops 3, 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":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd98c7ab84e36f747e6ad8e49cea619e1e986492fa1157d06d08f0dd334bab55"}},{"ruleId":"D2","level":"warning","message":{"text":"traits::to_pretty_impl_header (cognitive 24): traits::to_pretty_impl_header has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20, loops 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":"compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00bcc1d80758ae82fa1fdeff38e09ba91c006ca77b7db356b90dbaacd4dd513"}},{"ruleId":"D2","level":"warning","message":{"text":"dropck_outlives::compute_dropck_outlives_with_errors (cognitive 24): dropck_outlives::compute_dropck_outlives_with_errors has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14, match/switch 7, loops 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":"compiler/rustc_trait_selection/src/traits/query/dropck_outlives.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"920ff0cceeff36f6ecd99fa2712717df0e4b5cb387ecb286c9fab4b11949f5e4"}},{"ruleId":"D2","level":"warning","message":{"text":"hex_float::parse_hex (cognitive 24): hex_float::parse_hex has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15, match/switch 7, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/support/hex_float.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"42eee7858531a38a1a490094d58e267d4d6681ffa140ba2a6c12d407c793b0ae"}},{"ruleId":"D2","level":"warning","message":{"text":"atanf::atanf (cognitive 24): atanf::atanf has cognitive complexity 24 (threshold 15). Drivers by points: if/else 24 (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":"library/compiler-builtins/libm/src/math/atanf.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1ff278a601518b66d882ea07c103b4df749792cb02709200eac9d9193d6853"}},{"ruleId":"D2","level":"warning","message":{"text":"scalbn::scalbn (cognitive 24): scalbn::scalbn has cognitive complexity 24 (threshold 15). Drivers by points: if/else 24 (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":"library/compiler-builtins/libm/src/math/generic/scalbn.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e8949e043395c6a454d0c87b98de9a518ad23c3118ccbf36e39b0735b02782"}},{"ruleId":"D2","level":"warning","message":{"text":"atan::atan (cognitive 24): atan::atan has cognitive complexity 24 (threshold 15). Drivers by points: if/else 24 (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":"library/compiler-builtins/libm/src/math/atan.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d368e6bcf9e60e7455c1282085d5be6caa1f456d7514ddd0e8c9507462c4734"}},{"ruleId":"D2","level":"warning","message":{"text":"Intrinsic::defer_to_existing_llvm_link (cognitive 24): Intrinsic::defer_to_existing_llvm_link has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, match/switch 7 (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":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6be8e17ec74c72d92714b36fe995445a53ae3e2361c3d5ee02a348d3c41b87f"}},{"ruleId":"D2","level":"warning","message":{"text":"compile::std_cargo (cognitive 24): compile::std_cargo has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19, boolean chains 3, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"056de630b02b9ebd914f66693bbadeb73248bb5331d742f04e7688472ae4c0eb"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeBlocks::next (cognitive 24): CodeBlocks::next has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20, match/switch 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"007df6cd2fa8bf1568ebbe09034a0eb6f525f55f37a4d1db3abff2a1ee6d4da6"}},{"ruleId":"D2","level":"warning","message":{"text":"clean::clean_ty_generics_inner (cognitive 24): clean::clean_ty_generics_inner has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, loops 4, match/switch 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a53a932f20ea924d38134187f27902c7f704e6d94012f296ee5d01c25925191"}},{"ruleId":"D2","level":"warning","message":{"text":"main::main (cognitive 24): main::main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13, match/switch 11 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_dev/src/main.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"866a107759f206dca6ea20dbf2e019bd284659298d62a06ed92eab950101bcf7"}},{"ruleId":"D2","level":"warning","message":{"text":"LargeStackFrames::check_fn (cognitive 24): LargeStackFrames::check_fn has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18, boolean chains 4, match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/large_stack_frames.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b41c5441779822c3e36218d51f91010b8584519a0945a8cf5fd9224fc9e6af"}},{"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 19, boolean chains 3, 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":"src/tools/clippy/clippy_lints/src/loops/mod.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"9001a6f91db69a78bee0619c501481cb0677b6ce68ba94fcf145b22780e0f90f"}},{"ruleId":"D2","level":"warning","message":{"text":"VarVisitor::check (cognitive 24): VarVisitor::check has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20, match/switch 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/needless_range_loop.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45171b35e3922941b4f6a3fa51555e636a9a579dacb87460a5e0614131cf9fc"}},{"ruleId":"D2","level":"warning","message":{"text":"IdentVisitor::visit_id (cognitive 24): IdentVisitor::visit_id has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19, 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":"src/tools/clippy/clippy_lints/src/min_ident_chars.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e559489174ceed0ee2ab2a7367f7a4074b0a297fdc1a0e90d22792db990e2e"}},{"ruleId":"D2","level":"warning","message":{"text":"UnwrappableVariablesVisitor::visit_expr (cognitive 24): UnwrappableVariablesVisitor::visit_expr has cognitive complexity 24 (threshold 15). Drivers by points: if/else 23, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/unwrap.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e209a8c5ae81c0009265ad4d7d9c23c7b5e3d6e0513a2d50b96cc89c6f145f6"}},{"ruleId":"D2","level":"warning","message":{"text":"unit_return_expecting_ord::get_args_to_check (cognitive 24): unit_return_expecting_ord::get_args_to_check has cognitive complexity 24 (threshold 15). Drivers by points: if/else 21, loops 2, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/unit_return_expecting_ord.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6850696695545b37aab6717af3767fdfd8354b2b74a9e85935016cf60f6179"}},{"ruleId":"D2","level":"warning","message":{"text":"unneeded_field_pattern::check (cognitive 24): unneeded_field_pattern::check has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18, loops 5, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/misc_early/unneeded_field_pattern.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5415079250022a26f30ac4f4c0364313f76f93843f47f229e076398288d44d03"}},{"ruleId":"D2","level":"warning","message":{"text":"unnecessary_filter_map::check (cognitive 24): unnecessary_filter_map::check has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, match/switch 5, boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_filter_map.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4978732393d280ca7f1cfbeae509e55a8f94e67234d554c2704cc3d9e6c9d50f"}},{"ruleId":"D2","level":"warning","message":{"text":"unnecessary_literal_unwrap::check (cognitive 24): unnecessary_literal_unwrap::check has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18, match/switch 4, 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":"src/tools/clippy/clippy_lints/src/methods/unnecessary_literal_unwrap.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40d6c912ca933aec98ccf628f574657c1d24b78e4c5b7c9b0c253ac98f49549"}},{"ruleId":"D2","level":"warning","message":{"text":"eager_or_lazy::expr_eagerness (cognitive 24): eager_or_lazy::expr_eagerness has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12, boolean chains 6, match/switch 6 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8000cfb44ef12adc9c22f141548a5cee01bf98fd447f150d8413d6166bf35c8"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::check_mir_dump (cognitive 24): TestCx::check_mir_dump has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19, loops 5 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/mir_opt.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4910514ae9abc71e2fc400a94cee956377a0c30d2692173fec73ee199aa4d7c6"}},{"ruleId":"D2","level":"warning","message":{"text":"compute_diff::make_diff (cognitive 24): compute_diff::make_diff has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13, loops 7, boolean chains 2, match/switch 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/compute_diff.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3acf9c6858f0e415cc3c9c8542bda4b1b3f41eb28b3b099b46d976aa96feb0"}},{"ruleId":"D2","level":"warning","message":{"text":"Checker::check_url (cognitive 24): Checker::check_url has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13, match/switch 7, boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/linkchecker/main.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"00919388786ca3624c6eb7283e610bd7a65481f3dc076c1057c49f020d422ce3"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayRepr::print (cognitive 24): DisplayRepr::print has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, loops 8 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 9 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/borrow_tracker/tree_borrows/diagnostics.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"649aa9006bfc91cd3f47e0ea07f8e653953b3f6b7283e5f73b7d3be7cc38d115"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::open (cognitive 24): EvalContextExt::open has cognitive complexity 24 (threshold 15). Drivers by points: if/else 23, boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f156d46db304905376b5fe4d1555244876af9309a465d37c6b2fd83f4105555"}},{"ruleId":"D2","level":"warning","message":{"text":"display::write_variants (cognitive 24): display::write_variants has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19, match/switch 3, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ffd70aad34b0d286dcb7f0b90703e408d0b77f7fba78a2615b1ca67e59b577"}},{"ruleId":"D2","level":"warning","message":{"text":"ItemScope::dump (cognitive 24): ItemScope::dump has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10, match/switch 9, loops 4, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"7729757345727c3575be3d4bc8f47f5aaf8300a274a6e82a2488c813d0d3a994"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::rename_will_conflict_with_renamed (cognitive 24): Resolver::rename_will_conflict_with_renamed has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, loops 4, match/switch 2, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"642151e2c301573468c3a95ecad17e1fd8efe24c7a497d6b2c0924ed04636646"}},{"ruleId":"D2","level":"warning","message":{"text":"pretty::print_where_clauses (cognitive 24): pretty::print_where_clauses has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14, loops 7, match/switch 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"94677cd9afcadbba60b6fe5ce70ae558905bde132ac2b4e3f4779b2a79e9644a"}},{"ruleId":"D2","level":"warning","message":{"text":"fn_macro::concat_expand (cognitive 24): fn_macro::concat_expand has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 12, if/else 6, boolean chains 5, loops 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"618bc586e011f632896c02a953c4091163bd60568d8632e363971a2db9fcb11d"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_mut_expr (cognitive 24): InferenceContext::infer_mut_expr has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 12, if/else 10, loops 2 (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":"src/tools/rust-analyzer/crates/hir-ty/src/infer/mutability.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7443ec2deea7567189dbc2fba07c3fd919579a75669abc011fc0593049ed270d"}},{"ruleId":"D2","level":"warning","message":{"text":"file_structure::structure_node (cognitive 24): file_structure::structure_node has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20, match/switch 3, loops 1 (nesting depth added 10). Of this number, 17 points are the body\u0027s own statements and 7 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/file_structure.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dd6c5ec7db1778bd53b10e2b7b48aeff8c17447ab0ec3dcc1a4ec4fe268370"}},{"ruleId":"D2","level":"warning","message":{"text":"goto_definition::goto_definition (cognitive 24): goto_definition::goto_definition has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, boolean chains 3, match/switch 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/goto_definition.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a7f533d9367e98185d22f2c64232a5091b1d1bd767ed59d933fc709ef17081"}},{"ruleId":"D2","level":"warning","message":{"text":"wrap_unwrap_cfg_attr::attempt_get_derive (cognitive 24): wrap_unwrap_cfg_attr::attempt_get_derive has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12, boolean chains 5, loops 4, match/switch 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/wrap_unwrap_cfg_attr.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f508d392ab5991ab8e1b0806897957d06352cede4d2b06b7bf84b3a348b5ad"}},{"ruleId":"D2","level":"warning","message":{"text":"rename::source_edit_from_name_ref (cognitive 24): rename::source_edit_from_name_ref has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18, match/switch 4, boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/rename.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac404054f38166884044f693ac21032ae91b5dc886539b7df23787fabfeac902"}},{"ruleId":"D2","level":"warning","message":{"text":"cfg_if::parse_cfg_if_inner (cognitive 24): cfg_if::parse_cfg_if_inner has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, loops 3, match/switch 3, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/parse/macros/cfg_if.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ea1469bfe8af12adb71b63813edf286d006c8aac706d1c61e2d36b3a67bfed"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_diff::make_diff (cognitive 24): rustfmt_diff::make_diff has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13, loops 7, boolean chains 2, match/switch 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/rustfmt_diff.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"87af06eea8e166518dc02ebb7c43276aa6c719e1306a3a04a5a898141e8f2cd3"}},{"ruleId":"D2","level":"warning","message":{"text":"features::check (cognitive 24): features::check has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12, boolean chains 5, match/switch 4, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/features.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2dd8b48938ab61ba835332693451a0889e5890be82345f7446543ce5fae9e9"}},{"ruleId":"D2","level":"warning","message":{"text":"getRow (cognitive 24): getRow has cognitive complexity 24 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ee7dc4872720a3ed942b45110d8419d846fe06f9d1d9ba77f88fba9ae89e67"}},{"ruleId":"D2","level":"warning","message":{"text":"FindOpaqueRegion::visit_ty (cognitive 23): FindOpaqueRegion::visit_ty has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, loops 6, 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":"compiler/rustc_borrowck/src/diagnostics/opaque_types.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a03f4b094166869c765fc3bd81a98364c31c199bb6ab680ede26c794c559d92"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::visit_after_early_terminator_effect (cognitive 23): MirBorrowckCtxt::visit_after_early_terminator_effect has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, loops 6, match/switch 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5fae7332ede51e497a71b2c55c1ebd3e113ca3dcf549b6f53840bb80fd51d7"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::check_movable_place (cognitive 23): MirBorrowckCtxt::check_movable_place has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 14, if/else 8, 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc11499f7ccce6afa3233abb53f432b4e01aa42cf2a2e6ed79734a436fcbf4f"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::check_iscleanup (cognitive 23): TypeChecker::check_iscleanup has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, loops 4, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2082}}}],"partialFingerprints":{"codehealthFindingId/v1":"19078c2963b45b58aeda2a0cab45f0e12faad0a1728730d2bc0d8a7423d36149"}},{"ruleId":"D2","level":"warning","message":{"text":"legacy::emit_move_facts (cognitive 23): legacy::emit_move_facts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, loops 7, match/switch 2, 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":"compiler/rustc_borrowck/src/polonius/legacy/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1322c24564c2993b431d939e04c5032324946a32ceadbdd5ffd4431725038e77"}},{"ruleId":"D2","level":"warning","message":{"text":"attributes::instrument_function_attr (cognitive 23): attributes::instrument_function_attr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12, match/switch 11 (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":"compiler/rustc_codegen_llvm/src/attributes.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f942045ae4448fe2a59c9268bac8d647a936200507856739189c29b091c14b"}},{"ruleId":"D2","level":"warning","message":{"text":"mir::codegen_mir (cognitive 23): mir::codegen_mir has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, boolean chains 3, loops 3, match/switch 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"51655604599df9fbeb0406878c6d32f40d5103109a9172374ed90f0c1a372121"}},{"ruleId":"D2","level":"warning","message":{"text":"symbol_export::upstream_monomorphizations_provider (cognitive 23): symbol_export::upstream_monomorphizations_provider has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14, match/switch 6, loops 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fce775710fd9c9e39c33c8605d65ee9320b49ae0ef840144323d6d826cc69f"}},{"ruleId":"D2","level":"warning","message":{"text":"link::print_native_static_libs (cognitive 23): link::print_native_static_libs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 19, match/switch 2, boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"1290b2c7f0958b22b97d3b7372eb6b3c31262bf2ca714f4e33ff4cd7110e66ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Emitter::render_multispan_macro_backtrace (cognitive 23): Emitter::render_multispan_macro_backtrace has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14, loops 4, match/switch 4, 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":"compiler/rustc_errors/src/emitter.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f4b78b66b1a5c4dfb1fda22a8d60f71437db1d35225ae260c8861d2d83ec89"}},{"ruleId":"D2","level":"warning","message":{"text":"type_of::infer_placeholder_type (cognitive 23): type_of::infer_placeholder_type has cognitive complexity 23 (threshold 15). Drivers by points: if/else 22, boolean chains 1 (nesting depth added 5). 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":"compiler/rustc_hir_analysis/src/collect/type_of.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"63aa0901246ac3d1b73bd0b51b5e229adbd60e1839bc32efaa52e677e2ff7a82"}},{"ruleId":"D2","level":"warning","message":{"text":"builtin::coerce_shared_info (cognitive 23): builtin::coerce_shared_info has cognitive complexity 23 (threshold 15). Drivers by points: if/else 19, boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6c420d473662afb49b977ff1a63b9937c5f0638d8a25a6ed3293863c9c9b08"}},{"ruleId":"D2","level":"warning","message":{"text":"region::resolve_local::record_rvalue_scope_if_borrow_expr (cognitive 23): region::resolve_local::record_rvalue_scope_if_borrow_expr has cognitive complexity 23 (threshold 15). Drivers by points: loops 11, if/else 9, boolean chains 2, match/switch 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/region.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"659d7d7acc2f515c51838cef94d3cd6811e708570f56001b233faf69587a6ae7"}},{"ruleId":"D2","level":"warning","message":{"text":"CastCheck::do_check (cognitive 23): CastCheck::do_check has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11, match/switch 11, 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":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f0ceb9f305ef08cd55e3338a17fb6d6969e4657a99afe3a5078be4d9b12bbd"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCallDiagCtxt::check_wrap_args_in_tuple (cognitive 23): FnCallDiagCtxt::check_wrap_args_in_tuple has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, loops 3, 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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c34b4623758522023a33104238f13b50da3d4b2e8dfcb5bea3137401a2b1c26"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::annotate_expected_due_to_let_ty (cognitive 23): FnCtxt::annotate_expected_due_to_let_ty has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12, match/switch 7, boolean chains 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":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"142dde98d39cb0e7eb2f34751a2b730719d9196d407fc139916078dfcb866336"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_calling_boxed_future_when_appropriate (cognitive 23): FnCtxt::suggest_calling_boxed_future_when_appropriate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11, match/switch 9, boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"394be64b8f2f318b32b70e664ab063cbf85777165390600eafc44fd23c90418d"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_user_unop (cognitive 23): FnCtxt::check_user_unop has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, match/switch 4, loops 3, 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":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b439db6c3d0176c8a05bc6e4cb28d09b49775ff3a57d9ddd66d85ba0f034ba"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_pat_inner (cognitive 23): FnCtxt::check_pat_inner has cognitive complexity 23 (threshold 15). Drivers by points: loops 8, match/switch 7, boolean chains 5, if/else 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"877a0b21afc5de758d4e1fabd1895295f4fdb932832a398c0c9269b912050c64"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_pat_ident (cognitive 23): FnCtxt::check_pat_ident has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14, match/switch 5, 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf798f075e9f7788d3c63bd82ee37c6586769ba7de0cd8a804c38ce42a355b75"}},{"ruleId":"D2","level":"warning","message":{"text":"WritebackCx::fix_scalar_builtin_expr (cognitive 23): WritebackCx::fix_scalar_builtin_expr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, boolean chains 2, 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":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8966511b875590cf3f3fd4576a10aba7a93274c9c28529a207f12d3cced3180"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_typeck::report_unexpected_variant_res (cognitive 23): rustc_hir_typeck::report_unexpected_variant_res has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, match/switch 4, 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":"compiler/rustc_hir_typeck/src/lib.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac47d398e3f6b738e779efa0233facc52867b7925b28c31a10f2a47be7402896"}},{"ruleId":"D2","level":"warning","message":{"text":"literal::lint_uint_literal (cognitive 23): literal::lint_uint_literal has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, match/switch 4, 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":"compiler/rustc_lint/src/types/literal.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"1771dd738e339dc492ebde9673ac067d694e3d03767228301798bdbd6f01b306"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::default_print_def_path (cognitive 23): Printer::default_print_def_path has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, 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":"compiler/rustc_middle/src/ty/print/mod.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8f2b5e386c7032ef3f3f0fcda9ec340f1f1b4188b2a898970ae4089f18c679"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyPrinter::try_print_visible_def_path_recur (cognitive 23): PrettyPrinter::try_print_visible_def_path_recur has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14, match/switch 7, 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0607321c2234e70cd525665832fe1b278f947fbfd821a5c21ee0b137feb695"}},{"ruleId":"D2","level":"warning","message":{"text":"significant_drop_order::true_significant_drop_ty (cognitive 23): significant_drop_order::true_significant_drop_ty has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14, match/switch 5, boolean chains 2, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/significant_drop_order.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae05330ac03e171b8ebcb39f68d1e4f5dc5e187cad969361b5b378956ddad91e"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::build_exit_tree (cognitive 23): Builder::build_exit_tree has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11, match/switch 6, loops 4, 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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fcdb3cbfef7e7c51ee9e2aa3a6a4b37e7bcd3271deca7f697b9ddb24ad3a94"}},{"ruleId":"D2","level":"warning","message":{"text":"TailCallCkVisitor::check_tail_call (cognitive 23): TailCallCkVisitor::check_tail_call has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/check_tail_calls.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1228c50ce1af968afa200ab751f1e221ce97596637b5d03c89d950124aaf38b"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstToPat::alias_to_pat (cognitive 23): ConstToPat::alias_to_pat has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14, match/switch 5, boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/const_to_pat.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"944671969ad0725e105227d019bc5a5665acd5c483fddfab6ecb115075361c73"}},{"ruleId":"D2","level":"warning","message":{"text":"AbortUnwindingCalls::run_pass (cognitive 23): AbortUnwindingCalls::run_pass has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12, match/switch 6, 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":"compiler/rustc_mir_transform/src/abort_unwinding_calls.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17521f9613d11f3723bc06c71dc63111e5f2a6f7bf7f8f5edc628a521b72580"}},{"ruleId":"D2","level":"warning","message":{"text":"VnState::project (cognitive 23): VnState::project has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, match/switch 5, boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b176cb008d25857f5ff0f848df58a1369853b884217feef8c0608aadd2e7b2"}},{"ruleId":"D2","level":"warning","message":{"text":"NormalInliner::check_callee_mir_body (cognitive 23): NormalInliner::check_callee_mir_body has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f02f9bffca6817b2c3ce6d15cc6cdd66bd519ba999a3290b04eba6ddc3784a"}},{"ruleId":"D2","level":"warning","message":{"text":"CfgSimplifier::simplify (cognitive 23): CfgSimplifier::simplify has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, loops 10 (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":"compiler/rustc_mir_transform/src/simplify.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9fc9618f0092cadc00ddc73cda25e5d195f06721a489f9a1dc7b1229ef0679"}},{"ruleId":"D2","level":"warning","message":{"text":"UnreachableEnumBranching::run_pass (cognitive 23): UnreachableEnumBranching::run_pass has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16, loops 5, 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":"compiler/rustc_mir_transform/src/unreachable_enum_branching.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb0594ecd8d23d07aa5d83e24a4006e9009e7ea4b65d2963856a03de9264fc0"}},{"ruleId":"D2","level":"warning","message":{"text":"shim::build_call_shim (cognitive 23): shim::build_call_shim has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16, match/switch 7 (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":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac9cf8cff7d7f2359ebac674f3b76e8ffe2c1d7950b77ae2ee77a461ba31c5d"}},{"ruleId":"D2","level":"warning","message":{"text":"partitioning::mono_item_visibility (cognitive 23): partitioning::mono_item_visibility has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16, boolean chains 5, match/switch 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":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"494a32af2a0ca58d6f8437e6abed33838542ede641d293e8cf7841ed1c33cbd3"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalCtxt::evaluate_goal_raw (cognitive 23): EvalCtxt::evaluate_goal_raw has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11, match/switch 10, 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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed38299fe02bbd459e6ba39dc609215030303a99eccfbc0ffc675db117d660c4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_parse::new_parser_from_file (cognitive 23): rustc_parse::new_parser_from_file has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, match/switch 4, 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":"compiler/rustc_parse/src/lib.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb642bc6ee6a1dd421fef17266b71c2cdeee7c25b49bfc3a8f813b6293fbc10"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_floating_field_access (cognitive 23): Parser::parse_floating_field_access has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 11, if/else 8, loops 3, boolean chains 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c4b9bdcb3ed0bb60c352547dc27c8aeb338ad0b4d8b67854bdbeea38ed0269"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_if_after_cond (cognitive 23): Parser::parse_if_after_cond has cognitive complexity 23 (threshold 15). Drivers by points: if/else 21, boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":2699}}}],"partialFingerprints":{"codehealthFindingId/v1":"c409485f452fe29bf12f09172bbcda2168eb7a3111ac65aa1df77e61596dbc98"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_trait_bound (cognitive 23): Parser::parse_trait_bound has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14, match/switch 5, boolean chains 4 (nesting depth added 5). 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":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac355024da803e62b316eec1f609c0a2f4153b1fe3fa1b07682d827bd20b913"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::compute_and_check_or_pat_binding_map (cognitive 23): LateResolutionVisitor::compute_and_check_or_pat_binding_map has cognitive complexity 23 (threshold 15). Drivers by points: loops 10, if/else 9, match/switch 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":4061}}}],"partialFingerprints":{"codehealthFindingId/v1":"2386296f68b47ebe0268fe9ab6cee0aab77bd70d37487b09509f0f63de2d628c"}},{"ruleId":"D2","level":"warning","message":{"text":"utils::extra_compiler_flags (cognitive 23): utils::extra_compiler_flags has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, match/switch 4, 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":"compiler/rustc_session/src/utils.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"368f15d566df35d8b8a658c536767ee8e4d6ee2132ce4aa2d60d3f6bcb51cf6b"}},{"ruleId":"D2","level":"warning","message":{"text":"FnAbi::adjust_for_foreign_abi (cognitive 23): FnAbi::adjust_for_foreign_abi has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, match/switch 5, 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":"compiler/rustc_target/src/callconv/mod.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b242cbcf02bba7ebb9b2007a70fd7316a7488b8feedf7048a60c18e87aa4874"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::report_projection_error (cognitive 23): TypeErrCtxt::report_projection_error has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, match/switch 5, 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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"650777c1a45febe1427abf434cb792eb8f2f59e82f82b75593fad9378b79bbb0"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::maybe_detailed_projection_msg (cognitive 23): TypeErrCtxt::maybe_detailed_projection_msg has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11, match/switch 11, 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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9400d1d6475d1eb3cf29892efe2931f6e41ffe8dccc9645d3c3e329fa0104b"}},{"ruleId":"D2","level":"warning","message":{"text":"region_constraint::evaluate_solver_constraint (cognitive 23): region_constraint::evaluate_solver_constraint has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, loops 4, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb60b40d4fb28ca11f46bdf0a2d70a3877a44b0987b9b68969181bba84336d76"}},{"ruleId":"D2","level":"warning","message":{"text":"cosf::cosf (cognitive 23): cosf::cosf has cognitive complexity 23 (threshold 15). Drivers by points: if/else 22, 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":"library/compiler-builtins/libm/src/math/cosf.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fc4e30c41c11f88fede82efcb3b4a6ad30b78acd6d6c1eccbe53371d82cdf8"}},{"ruleId":"D2","level":"warning","message":{"text":"log1pf::log1pf (cognitive 23): log1pf::log1pf has cognitive complexity 23 (threshold 15). Drivers by points: if/else 22, 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":"library/compiler-builtins/libm/src/math/log1pf.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"029679eca02c6f7f445470bb5bf4b64dec002b7af3090bd884be1924f0b63373"}},{"ruleId":"D2","level":"warning","message":{"text":"log1p::log1p (cognitive 23): log1p::log1p has cognitive complexity 23 (threshold 15). Drivers by points: if/else 22, 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":"library/compiler-builtins/libm/src/math/log1p.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d89c3ce8f350139c83d44478f476ea74f78647f9cdf5ed730f74aaeae6c68e"}},{"ruleId":"D2","level":"warning","message":{"text":"fn_suffix::make_neon_suffix (cognitive 23): fn_suffix::make_neon_suffix has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, match/switch 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":"library/stdarch/crates/stdarch-gen-arm/src/fn_suffix.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7689f12f89c5c3da54c274cc8a10846aeef9febf79f516b7039b786577003f4d"}},{"ruleId":"D2","level":"warning","message":{"text":"Build::llvm_filecheck (cognitive 23): Build::llvm_filecheck has cognitive complexity 23 (threshold 15). Drivers by points: if/else 22, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/lib.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dc8733567104ae6282227aef5af494649b53f52e56b4c0975e29523630b543"}},{"ruleId":"D2","level":"warning","message":{"text":"sembr::lengthen_lines (cognitive 23): sembr::lengthen_lines has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doc/rustc-dev-guide/ci/sembr/src/main.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"152ce82d3fcdc2231a648df943b5487758e3de8cc641941b15416946f5bdd6cb"}},{"ruleId":"D2","level":"warning","message":{"text":"Display::fmt (cognitive 23): Display::fmt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12, match/switch 11 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/cfg.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0e7682faf7a978fc2a344f839561b515bc84fd3260abb2a5707a5e515638c3"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkCollector::resolve_ambiguities (cognitive 23): LinkCollector::resolve_ambiguities has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14, match/switch 6, loops 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf96e3793d000c1d93554452038f98b740c3c0698c48ce6991d040022cec4d6"}},{"ruleId":"D2","level":"warning","message":{"text":"format::primitive_link_fragment (cognitive 23): format::primitive_link_fragment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14, match/switch 5, loops 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/format.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced5e9fa30a62203ff3105d30217558f042e9a4da777e0ab1afa42dbeba063df"}},{"ruleId":"D2","level":"warning","message":{"text":"sidebar::sidebar_deref_methods (cognitive 23): sidebar::sidebar_deref_methods has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, boolean chains 5, match/switch 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/sidebar.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5e78a1b8353ab54333e66428649d59ff5e3f221aef0f948c29a358a13422b7"}},{"ruleId":"D2","level":"warning","message":{"text":"doctest::run_tests (cognitive 23): doctest::run_tests has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, loops 5, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"928df2fee7009c34bf68de93815468df733cf2c7c02eddfbfa85e54dda71b655"}},{"ruleId":"D2","level":"warning","message":{"text":"DecimalLiteralRepresentation::do_lint (cognitive 23): DecimalLiteralRepresentation::do_lint has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 14, if/else 9 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/literal_representation.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3f2344f4a0f655dea0119bed289847fc650fc2aab7b83ffc5de7364a2dd4db"}},{"ruleId":"D2","level":"warning","message":{"text":"MissingConstForFn::check_fn (cognitive 23): MissingConstForFn::check_fn has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, boolean chains 6, 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":"src/tools/clippy/clippy_lints/src/missing_const_for_fn.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"98383e1daf451b34aacf4f50154c09fe22926218ed2ee6dbe468dfc46a196a9a"}},{"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 13, boolean chains 4, loops 4, 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":"src/tools/clippy/clippy_lints/src/non_canonical_impls.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"616134382024846e9c72d495eac9ffbcb7c505614c1492b0574e7c46ec4af9ed"}},{"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 9, loops 8, match/switch 4, boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/non_send_fields_in_send_ty.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0824be97c1dbe4190726fe5ad14e7adf7e02a0eda189ac216ffbb81836c2326e"}},{"ruleId":"D2","level":"warning","message":{"text":"WildcardImports::check_item (cognitive 23): WildcardImports::check_item has cognitive complexity 23 (threshold 15). Drivers by points: if/else 19, 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":"src/tools/clippy/clippy_lints/src/wildcard_imports.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"131c4f9155d688acb463e63b088d283d4c57ef6eda87265279264e43bad7b629"}},{"ruleId":"D2","level":"warning","message":{"text":"infinite_iter::complete_infinite_iter (cognitive 23): infinite_iter::complete_infinite_iter has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, loops 4, boolean chains 3, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/infinite_iter.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb59e2136a6cf6d91f48b123cb6f7fa86f61cf0c46b8cca30b8ccfb7154887d1"}},{"ruleId":"D2","level":"warning","message":{"text":"chunks_exact_to_as_chunks::check (cognitive 23): chunks_exact_to_as_chunks::check has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16, boolean chains 4, match/switch 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/chunks_exact_to_as_chunks.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc30ef450acab4694faaa5dc961281ffce3c42fda3fbedf8e0fef7662b1d667a"}},{"ruleId":"D2","level":"warning","message":{"text":"transmute_ptr_to_ref::check (cognitive 23): transmute_ptr_to_ref::check has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, match/switch 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/transmute/transmute_ptr_to_ref.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff6fba82773a763f8c8a2359a0a6fc7a09b63eada8c51d55208f10ab901f13c"}},{"ruleId":"D2","level":"warning","message":{"text":"redundant_pattern_match::find_method_and_type (cognitive 23): redundant_pattern_match::find_method_and_type has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, boolean chains 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/redundant_pattern_match.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3570d3ab4d68fc003eb2ee0af41b665353126b532885c7aa7075fe9008b96e"}},{"ruleId":"D2","level":"warning","message":{"text":"SpanlessHash::hash_pat (cognitive 23): SpanlessHash::hash_pat has cognitive complexity 23 (threshold 15). Drivers by points: loops 12, if/else 10, match/switch 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a1b8847b51b850409c39ef1f4e45a617adea150a70003950ceb3528b9f066d"}},{"ruleId":"D2","level":"warning","message":{"text":"ty::contains_ty_adt_constructor_opaque::contains_ty_adt_constructor_opaque_inner (cognitive 23): ty::contains_ty_adt_constructor_opaque::contains_ty_adt_constructor_opaque_inner has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14, match/switch 5, loops 3, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/ty/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e950f125a441696b3cf264fe3de8abbdddc72dcafe67fb86257c76b9512651"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::run_debuginfo_gdb_test (cognitive 23): TestCx::run_debuginfo_gdb_test has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14, loops 6, match/switch 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest/debuginfo.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c7398c805cc4a2b294f461062579cb3150345ecebc9380674c1237603f174f"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::show_diff (cognitive 23): TestCx::show_diff has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, loops 7, match/switch 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":2840}}}],"partialFingerprints":{"codehealthFindingId/v1":"f727c2f9e81a8b9fe5ae7b2a48c4c72a1069b05a3a57012668b1d1c441b29b1b"}},{"ruleId":"D2","level":"warning","message":{"text":"NewPermission::new (cognitive 23): NewPermission::new has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, boolean chains 6, 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":"src/tools/miri/src/borrow_tracker/tree_borrows/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"586b2f6618fb6a206a0fb8ef518dc2d02475bcdd0933ab795c4dbd6ac6b94031"}},{"ruleId":"D2","level":"warning","message":{"text":"DedupRangeMap::iter_mut (cognitive 23): DedupRangeMap::iter_mut has cognitive complexity 23 (threshold 15). Drivers by points: if/else 20, loops 2, boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/data_structures/dedup_range_map.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b18c26c20f6ace48afbf5e1fefab2e9c02bfa41f39a5fe7bb0b0889ccbfe33"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_x86_bmi_intrinsic (cognitive 23): EvalContextExt::emulate_x86_bmi_intrinsic has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, loops 4, boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/x86/bmi.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae757c554c6c765456b511f845b4904c0a33b1a9ecaf0df237c59067d1d5ebc"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::gen_source_code (cognitive 23): Expr::gen_source_code has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 17, if/else 6 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/term_search/expr.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"12db936cf152ec1fa3c1b40b415cddd68b54ec4b347d7133db0fdd0689685f99"}},{"ruleId":"D2","level":"warning","message":{"text":"lang_item::crate_lang_items (cognitive 23): lang_item::crate_lang_items has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 11, loops 8, if/else 4 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/lang_item.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"876c55948484282436fc4a3d0ad8df7c32e7ac5bb9bb7bfb2b0af3b82bce371d"}},{"ruleId":"D2","level":"warning","message":{"text":"lower::mir_body_for_closure_query (cognitive 23): lower::mir_body_for_closure_query has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, match/switch 7, loops 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":2112}}}],"partialFingerprints":{"codehealthFindingId/v1":"43158e5cd45a30631629d8b88dee143fd5dc8dd477d8d02519418626fc3491a1"}},{"ruleId":"D2","level":"warning","message":{"text":"rename::transform_assoc_fn_into_method_call (cognitive 23): rename::transform_assoc_fn_into_method_call has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 11, if/else 6, loops 6 (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":"src/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"26eea40f996df777ae336e9395372dba5678269ce575ce5197127fe1d0237fdb"}},{"ruleId":"D2","level":"warning","message":{"text":"highlight::highlight_name_ref_by_syntax (cognitive 23): highlight::highlight_name_ref_by_syntax has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 13, if/else 10 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5cb542ae9b37c05177068f10db032c05b170a35f4c844dd380486a3b20c53e"}},{"ruleId":"D2","level":"warning","message":{"text":"remove_unused_imports::remove_unused_imports (cognitive 23): remove_unused_imports::remove_unused_imports has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10, match/switch 9, loops 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/remove_unused_imports.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3857bf18a50b47e76f8dae228006aceb5caeb75b33b5ea5754bcffc4380825a2"}},{"ruleId":"D2","level":"warning","message":{"text":"merge_match_arms::get_arm_types::recurse (cognitive 23): merge_match_arms::get_arm_types::recurse has cognitive complexity 23 (threshold 15). Drivers by points: loops 13, if/else 7, match/switch 2, boolean chains 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/merge_match_arms.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6b98f41fa8990ca690bb8a5ddd20408eedae3ea16a9d95b345a7b4b5a9038e"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_function::make_body (cognitive 23): extract_function::make_body has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 23 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5c6420ae8a0c636b129694d2fb33470b2fe5151a8bf881ec825e33dd316b55"}},{"ruleId":"D2","level":"warning","message":{"text":"merge_imports::recursive_merge (cognitive 23): merge_imports::recursive_merge has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, match/switch 6, boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"76915c7d1f059347a307ca6ba113f7466f790b270a657c4ac3b75f504a80f7e1"}},{"ruleId":"D2","level":"warning","message":{"text":"tree_diff::diff::go (cognitive 23): tree_diff::diff::go has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, match/switch 6, loops 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/tree_diff.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5979fe43ee4ae5857399471ca8aa2167244b59baaa49256d303614eb9abf8d58"}},{"ruleId":"D2","level":"warning","message":{"text":"params::param (cognitive 23): params::param has cognitive complexity 23 (threshold 15). Drivers by points: if/else 19, boolean chains 3, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/params.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e426938db3972065eee49c76d03bbee77e504c4260b350992f9e1ccb9b029fd9"}},{"ruleId":"D2","level":"warning","message":{"text":"paths::path_segment (cognitive 23): paths::path_segment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 19, match/switch 3, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/paths.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c420e8e1ac2da979bcd33fe6a2258e3334b3323fc85878a8229e908f863ef0"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceBuildScripts::run_command (cognitive 23): WorkspaceBuildScripts::run_command has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, match/switch 7, loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5053c87a6d1cf2021bc5698f3b3c714dd03aa3a7398688e4d97072452d6ea5f"}},{"ruleId":"D2","level":"warning","message":{"text":"to_proto::merge_text_and_snippet_edits (cognitive 23): to_proto::merge_text_and_snippet_edits has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14, loops 9 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0429d656f373bff9fbcfb68aa9ed1c3df11e2bed18ad896bfff9e70e78758d60"}},{"ruleId":"D2","level":"warning","message":{"text":"tt::transform_tt (cognitive 23): tt::transform_tt has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 10, if/else 7, loops 6 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/tt/src/lib.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"542026be54dc12fef43089e31822a8955a7514ff6bf99d39a6c258854c416db0"}},{"ruleId":"D2","level":"warning","message":{"text":"NotifyActor::load_entry (cognitive 23): NotifyActor::load_entry has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16, boolean chains 4, loops 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":"src/tools/rust-analyzer/crates/vfs-notify/src/lib.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a543918ef4cd647dd5f069d3075f0c1d0c347d68e02e5e2d3d26734ca7ffb8dc"}},{"ruleId":"D2","level":"warning","message":{"text":"UseTree::from_ast (cognitive 23): UseTree::from_ast has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, boolean chains 4, match/switch 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/imports.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75dea7ca41320326598daf144bf5a5b2038da52509f846a29e97af3738260de"}},{"ruleId":"D2","level":"warning","message":{"text":"matches::rewrite_match (cognitive 23): matches::rewrite_match has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, match/switch 4, boolean chains 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/matches.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb2b342640b8dc92202b2a30e95538b56fa3c32624412ff988c12bf73dde795"}},{"ruleId":"D2","level":"warning","message":{"text":"items::format_struct_struct (cognitive 23): items::format_struct_struct has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18, boolean chains 4, match/switch 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7434431043f52549471aeda257ec83db4d90e1d2a3810c735bfe91b62cf7f9"}},{"ruleId":"D2","level":"warning","message":{"text":"addNextResultToOutput (cognitive 23): addNextResultToOutput has cognitive complexity 23 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":4965}}}],"partialFingerprints":{"codehealthFindingId/v1":"32614fb0386d7932338a1e4c4b408d7503bfcd8c61fc1f484785d2c3a09ddf1c"}},{"ruleId":"D2","level":"warning","message":{"text":"comments::beautify_doc_string (cognitive 22): comments::beautify_doc_string has cognitive complexity 22 (threshold 15). Drivers by points: if/else 37, loops 10, boolean chains 7, match/switch 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/util/comments.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e114652db84ea20bdf87d01911dc9381d7634f57865f57690e1d4eee8c918bb1"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::show_mutating_upvar (cognitive 22): MirBorrowckCtxt::show_mutating_upvar has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14, match/switch 5, loops 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d58362d4e5b639895df3909f2a0cfd98c02cbc73df48d4e8207cb0268f51442"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::propagate_closure_used_mut_upvar (cognitive 22): MirBorrowckCtxt::propagate_closure_used_mut_upvar has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, match/switch 9, 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":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"942e77e0343b67768509a2ce9367d88974c52c848c343970612c203c1a281575"}},{"ruleId":"D2","level":"warning","message":{"text":"CollectProcMacros::visit_item (cognitive 22): CollectProcMacros::visit_item has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/proc_macro_harness.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a8ac8d87841446ea3bb5ec15d2d65f1db04bb5daec11501f2310740580e1d5"}},{"ruleId":"D2","level":"warning","message":{"text":"format::report_redundant_format_arguments (cognitive 22): format::report_redundant_format_arguments has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, loops 6 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5eb0bf3127873d5d7ceaaa300670938d84f07dad2691e5d787e3d80d8cfb96"}},{"ruleId":"D2","level":"warning","message":{"text":"abi::codegen_terminator_call::adjust_call_for_c_variadic (cognitive 22): abi::codegen_terminator_call::adjust_call_for_c_variadic has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, boolean chains 1, loops 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd91f2639e1a077b28b3ff7f56f2ad9ac5f9529042ea28cf4a0aa2a1155be85"}},{"ruleId":"D2","level":"warning","message":{"text":"discriminant::codegen_get_discriminant (cognitive 22): discriminant::codegen_get_discriminant has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 12, if/else 10 (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":"compiler/rustc_codegen_cranelift/src/discriminant.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"322905e17bf8cdefc63d24dc8e321579dd94c9ec32dbb5d0ae9d5a5a2e1e2c77"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenCx::declare_fn (cognitive 22): CodegenCx::declare_fn has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, loops 6 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/declare.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6494970fe767c49f6742c04ba3d707df59b3df930157c4ef262b8be25031b746"}},{"ruleId":"D2","level":"warning","message":{"text":"base::compile_codegen_unit::module_codegen (cognitive 22): base::compile_codegen_unit::module_codegen has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, loops 3, match/switch 2, boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/base.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"821571283e99297080d1a16783abfa05221d450bc95b3caaf6b84b07faae4e9d"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::codegen_llvm_intrinsic_call (cognitive 22): Builder::codegen_llvm_intrinsic_call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, loops 3, match/switch 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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee2d89565dda3ede87a0814fdc68d7e0b08e2b1544089da8a07da0e7533fb35"}},{"ruleId":"D2","level":"warning","message":{"text":"asm::modifier_to_llvm (cognitive 22): asm::modifier_to_llvm has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, match/switch 7 (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":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"995c0ba2e0f682f8de243b1bebf280f89e43851b44db547dfca3f32e6247c2f9"}},{"ruleId":"D2","level":"warning","message":{"text":"write::optimize (cognitive 22): write::optimize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17, boolean chains 3, 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":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5eb68d0f68c6e46f939220c07831685d6b555b923374dd2c59ec1304c56950"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::clear_variant_dependent_padding (cognitive 22): FunctionCx::clear_variant_dependent_padding has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11, loops 9, 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a862156c9f693278b057c2980d89894c15f9f0dd53e0d607e38125ded0d04f6"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionCx::retag_operand (cognitive 22): FunctionCx::retag_operand has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14, match/switch 5, loops 2, 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":"compiler/rustc_codegen_ssa/src/mir/retag.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fe6caaedf9431d90903a50f293cc6e4637b63def98dd703a3f044178e66f13"}},{"ruleId":"D2","level":"warning","message":{"text":"symbol_edit::macho_edit_impl (cognitive 22): symbol_edit::macho_edit_impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17, loops 3, 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":"compiler/rustc_codegen_ssa/src/back/symbol_edit.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"e124f85fe3f6bb3a63640dc8e04272d374f2d394719cbcca26520122e59c9162"}},{"ruleId":"D2","level":"warning","message":{"text":"dominators::dominators_impl (cognitive 22): dominators::dominators_impl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, loops 10 (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":"compiler/rustc_data_structures/src/graph/dominators/mod.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e77b4ee86e9bb11c0459fb5ffa456b374b393f3d3a234522f053d4026edb810"}},{"ruleId":"D2","level":"warning","message":{"text":"TtParser::match_one (cognitive 22): TtParser::match_one has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17, match/switch 3, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/macro_parser.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"857c42a231cbe639dccfaa65b64d5e038ec762d839950d2d884b5ec06b698de5"}},{"ruleId":"D2","level":"warning","message":{"text":"clauses_of::explicit_clauses_of (cognitive 22): clauses_of::explicit_clauses_of has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14, match/switch 6, 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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"002844676bece2f3f0b80da6f874fad606fe8f839fa9728cf7b55cd367e4c551"}},{"ruleId":"D2","level":"warning","message":{"text":"clauses_of::assert_only_contains_clauses_from (cognitive 22): clauses_of::assert_only_contains_clauses_from has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 13, loops 8, if/else 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b82e51bb976ed9b19b3ed3219f01a0ed42e2e97921884b32e946c2e1c4d220"}},{"ruleId":"D2","level":"warning","message":{"text":"check::fn_sig_suggestion (cognitive 22): check::fn_sig_suggestion has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14, match/switch 6, boolean chains 2 (nesting depth added 5). 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":"compiler/rustc_hir_analysis/src/check/mod.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"6774ba134c3f77705c205b3a9cbffa5c40cae3b985e4c6d49cf632255319c9e5"}},{"ruleId":"D2","level":"warning","message":{"text":"builtin::coerce_unsized_info (cognitive 22): builtin::coerce_unsized_info has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00482688fc68f7a6123c78130be1ddf593317c7251d006c30502b7a6aa4ff40"}},{"ruleId":"D2","level":"warning","message":{"text":"collect::check_enum_variant_types (cognitive 22): collect::check_enum_variant_types has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17, loops 3, 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":"compiler/rustc_hir_analysis/src/collect.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefa3ff6caaaf54c6c7fd8366550124b3a6ad0cb8318b555ac921c006e142803"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_inline_asm (cognitive 22): State::print_inline_asm has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13, match/switch 9 (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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"392d67030dcf56875c553546bc78e692a94047eaa6a319aad0f5e3db5ac63cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::ambiguity_diagnostic (cognitive 22): Resolver::ambiguity_diagnostic has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, boolean chains 7 (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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"84da8a2faef9a60ad17965c9626bca8a88c815e9d4cfcfa2e107273a838e13fb"}},{"ruleId":"D2","level":"warning","message":{"text":"load::load_dep_graph (cognitive 22): load::load_dep_graph has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17, loops 3, boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_incremental/src/persist/load.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"927ff35b76eb0de11be4fb8c06e7300552a4ea5c5ded41d7e06a1bfd3f10eab0"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet::insert_range (cognitive 22): IntervalSet::insert_range has cognitive complexity 22 (threshold 15). Drivers by points: if/else 22 (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":"compiler/rustc_index/src/interval.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c004d50523e0247d3f60d81fced7e107364fd6bf0746bc9704f20b5dc3ab46f"}},{"ruleId":"D2","level":"warning","message":{"text":"LexicalResolver::collect_error_for_expanding_node (cognitive 22): LexicalResolver::collect_error_for_expanding_node has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, loops 4, boolean chains 1, match/switch 1 (nesting depth added 9). Of this number, 21 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2afa92d84e7b4b0447f49526dd05276009d9122934f31445f91c963bda46ca"}},{"ruleId":"D2","level":"warning","message":{"text":"UnusedDelimLint::is_expr_delims_necessary (cognitive 22): UnusedDelimLint::is_expr_delims_necessary has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10, match/switch 8, loops 3, 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":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83031c4cea054357c5bec9e6b3af39cc9b56ab50f78567b648cda95e21a7165"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminatorKind::fmt_head (cognitive 22): TerminatorKind::fmt_head has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, loops 6, match/switch 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":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"186c7bfff0ed4abbb8e3446b8a4b96ea66a2ff8205b773f84f531825247b28ae"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectedUserTypesNode::build_user_type_projections (cognitive 22): ProjectedUserTypesNode::build_user_type_projections has cognitive complexity 22 (threshold 15). Drivers by points: loops 19, match/switch 2, if/else 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":"compiler/rustc_mir_build/src/builder/matches/user_ty.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"003bb6d52e744441451a60a45046d18ec2cf4a4fbc87591a5c98294288316260"}},{"ruleId":"D2","level":"warning","message":{"text":"RangeSet::visit_terminator (cognitive 22): RangeSet::visit_terminator has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14, loops 4, boolean chains 3, 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":"compiler/rustc_mir_transform/src/ssa_range_prop.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"034a3ccefaa96c965f3f0eed78ad0d593763469a25a2fac3a36388d937bc01dd"}},{"ruleId":"D2","level":"warning","message":{"text":"promote_consts::promote_candidates (cognitive 22): promote_consts::promote_candidates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, loops 3, boolean chains 2, 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":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0292fdb81e4cf4e84ef69f49aeff9b356fdfa3fe605503c8ada6b73db26e6fb"}},{"ruleId":"D2","level":"warning","message":{"text":"inline::try_inlining (cognitive 22): inline::try_inlining has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, loops 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f585a6c716c1db83ac679ba82382dd814908cfedc2faedf4856ac948f7dea4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::recover_stmt_ (cognitive 22): Parser::recover_stmt_ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, boolean chains 4, match/switch 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":2142}}}],"partialFingerprints":{"codehealthFindingId/v1":"91541fe93d87203c6ef3a3e0e1a681a9de2567ac53443796e1d3ae4be9f9c1d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_angle_arg (cognitive 22): Parser::parse_angle_arg has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14, boolean chains 4, match/switch 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":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aee399cfc3116d3c1d9ba3e7f97c7b1d1d66ebcde2d928c1a97f5671fbdccb5"}},{"ruleId":"D2","level":"warning","message":{"text":"RustcPatCtxt::ctors_for_ty (cognitive 22): RustcPatCtxt::ctors_for_ty has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, boolean chains 3, loops 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d6f4e8b47f62babfa56fa2e5c2a9b029e036d7d6527f4305d60ba412822142"}},{"ruleId":"D2","level":"warning","message":{"text":"handle_cycle_error::layout_of (cognitive 22): handle_cycle_error::layout_of has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_query_impl/src/handle_cycle_error.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a7da9ad3af916a20db985ceb73d0eefd72906688a8c957b63a543793b86ac4"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::suggest_self_value (cognitive 22): LateResolutionVisitor::suggest_self_value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 21, 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05adf9638708ac0da2ae7bb861f6cc02e17929dd55f8c1ec72e4d3ab4086d45"}},{"ruleId":"D2","level":"warning","message":{"text":"encode::encode_ty (cognitive 22): encode::encode_ty has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14, match/switch 5, loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_sanitizers/src/cfi/typeid/itanium_cxx_abi/encode.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09a7cfee6d9bfca291e0161cfa762f54124afd8bc041a767d5e039a97b9cee8"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceMap::span_wrapped_by_angle_or_parentheses (cognitive 22): SourceMap::span_wrapped_by_angle_or_parentheses has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, loops 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":"compiler/rustc_span/src/source_map.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"774dd0e18f8b559872bafad103678f6c8f0f9452a488581440c789aa6559c9d4"}},{"ruleId":"D2","level":"warning","message":{"text":"NiceRegionError::explain_actual_impl_that_was_found (cognitive 22): NiceRegionError::explain_actual_impl_that_was_found has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, match/switch 5, 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":"compiler/rustc_trait_selection/src/error_reporting/infer/nice_region_error/placeholder_error.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b489c162c3caac54d0ffa27a5ae6298a76c38bd3435e1ed5fb501f445df935c"}},{"ruleId":"D2","level":"warning","message":{"text":"UdpSocket::recv_inner (cognitive 22): UdpSocket::recv_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/xous/udp.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae83c6ce782f58babdf26cf5984b44db18e3dffeb51afd70058e7ae142e4183"}},{"ruleId":"D2","level":"warning","message":{"text":"windows::parse_lp_cmd_line (cognitive 22): windows::parse_lp_cmd_line has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10, match/switch 7, boolean chains 3, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/args/windows.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccdab931f7be7649df9fc81e718dc364c6b24721530f6cd6a892a89c4427b3e"}},{"ruleId":"D2","level":"warning","message":{"text":"windows::append_bat_arg (cognitive 22): windows::append_bat_arg has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, boolean chains 5, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/args/windows.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"451efbafdf06759770a5c3e2db2aa775298a97a7392addb217b9e5128c21e709"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::maybe_download_ci_llvm (cognitive 22): Config::maybe_download_ci_llvm has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, loops 6, match/switch 3, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/download.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67649b87d4b64d46992876f499ff1e419ca96f226fc77cfc42887b2dd7488d5"}},{"ruleId":"D2","level":"warning","message":{"text":"main::main (cognitive 22): main::main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, boolean chains 3, loops 3 (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":"src/bootstrap/src/bin/main.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"21393e42323c27990635c1076fb37d3c5c2236854188e24d2e8077560ec00142"}},{"ruleId":"D2","level":"warning","message":{"text":"LangString::parse (cognitive 22): LangString::parse has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 8, if/else 8, match/switch 5, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa6f0ff14c235789bfaefc6dfe9aff0a24af71e53b342225e4019d0b663e6a3"}},{"ruleId":"D2","level":"warning","message":{"text":"RustdocVisitor::maybe_inline_local (cognitive 22): RustdocVisitor::maybe_inline_local has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 9, loops 2, match/switch 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/visit_ast.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"269de0df6da5518eb2ed57f28ed8e56295b070184f138927eb0a56151914e5b5"}},{"ruleId":"D2","level":"warning","message":{"text":"markdown::find_codes (cognitive 22): markdown::find_codes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11, match/switch 5, loops 4, boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b062a77fa2a19c7c820b6ccd7fb56b9d437263313526a36c15ca302f6518d67"}},{"ruleId":"D2","level":"warning","message":{"text":"format::href_with_root_path (cognitive 22): format::href_with_root_path has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, match/switch 2, 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":"src/librustdoc/html/format.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fc96efeaaf5af7ef48482262193d45343954ced46356af0e19f09eea661414"}},{"ruleId":"D2","level":"warning","message":{"text":"render::repr_attribute (cognitive 22): render::repr_attribute has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, boolean chains 5, match/switch 5 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb2808b9468e6a4688783e6b7841cb6ccc1f282952dd992b1392615b6bc61e3"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::main_args (cognitive 22): rustdoc::main_args has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11, loops 5, match/switch 5, boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/lib.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"6827f9301829f91c5aa3a1bb5524e3749031ff9b5bab61b5b46a2e184d471f7b"}},{"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 20, boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/large_enum_variant.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf7429723b4d0ebdde6f2eeedace7c4efd119e215805c73f9ea9cb7b7d17752"}},{"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 14, boolean chains 4, loops 3, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_pass_by_ref_mut.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"611a4cb2ab5b179a7e981adefd42ac3bdea3a4adb50a38b566cee0a619ade9e0"}},{"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 14, boolean chains 5, match/switch 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/non_expressive_names.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f219e0324af23d7c14478469e03220add1ad930a017b625114110547bcab4376"}},{"ruleId":"D2","level":"warning","message":{"text":"needless_type_cast::is_cast_in_generic_context (cognitive 22): needless_type_cast::is_cast_in_generic_context has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, match/switch 5, 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":"src/tools/clippy/clippy_lints/src/casts/needless_type_cast.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"420ce0a89b01e017a61f50643d9ad96fb121402e48015c14a4081d9217dcba6c"}},{"ruleId":"D2","level":"warning","message":{"text":"undocumented_unsafe_blocks::check_has_safety_comment (cognitive 22): undocumented_unsafe_blocks::check_has_safety_comment has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, boolean chains 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d55298482add4ca7bc3e45701618d91a335c8ef8a4f7ec453e57c8f6440332"}},{"ruleId":"D2","level":"warning","message":{"text":"let_if_seq::check_block_inner (cognitive 22): let_if_seq::check_block_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, match/switch 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/let_if_seq.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77bdbfddeb09c5c9e6d08f0e581bafb7650b507e4c1d89c5d2c5f0eb6d7b79e"}},{"ruleId":"D2","level":"warning","message":{"text":"shadow::find_init (cognitive 22): shadow::find_init has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 16, if/else 5, 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":"src/tools/clippy/clippy_lints/src/shadow.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"33199b8bd767609c0c1a34c238f4e9ee93e774c97e8d48c47565223285a86b16"}},{"ruleId":"D2","level":"warning","message":{"text":"markdown::check (cognitive 22): markdown::check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10, boolean chains 7, loops 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/doc/markdown.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c663f98d065871e5e4401edacf0c90699627de5045c7c1ce7ad44e9be1414f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"read_line_without_trim::check (cognitive 22): read_line_without_trim::check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17, 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":"src/tools/clippy/clippy_lints/src/methods/read_line_without_trim.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37e74cae11d85c489cd00989b9a6520a960284e6bc8586ccd8f8470748de32c"}},{"ruleId":"D2","level":"warning","message":{"text":"unit_arg::lint_unit_args (cognitive 22): unit_arg::lint_unit_args has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, 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":"src/tools/clippy/clippy_lints/src/unit_types/unit_arg.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"036eb3a609d1c5d1ea147967fd76a12d531472e4406f18a9991c131697f875fc"}},{"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 15, loops 3, match/switch 3, 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 declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/lintcheck/src/input.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"425edfa554b291879a86362815acfcfe94b53e31716b299f58fa4be8d4dd70f5"}},{"ruleId":"D2","level":"warning","message":{"text":"driver::main (cognitive 22): driver::main has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 9, match/switch 3 (nesting depth added 1). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function item declared inside it. 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/tools/clippy/src/driver.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ad3e0b25a607ad4c3fe00ea2f968b571c5032246e2cfb7c58b50209248c721"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextPrivExt::schedule (cognitive 22): EvalContextPrivExt::schedule has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, loops 2, 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":"src/tools/miri/src/concurrency/scheduler.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd7e709943fa0f0b61ae1b4692784fa2ed2af1f8fd0cd3ba78ed9a0289cbaf3"}},{"ruleId":"D2","level":"warning","message":{"text":"MainThreadState::on_main_stack_empty (cognitive 22): MainThreadState::on_main_stack_empty has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, match/switch 7 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/eval.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7eea815b3531b2cf04f0d227cfe5d8a84c37a6901fc92e7340d4c090685915a"}},{"ruleId":"D2","level":"warning","message":{"text":"foreign_items::win_get_full_path_name (cognitive 22): foreign_items::win_get_full_path_name has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, boolean chains 7, match/switch 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2294bfc0d936addb244ce158432b465ce5d46969352f575fbbe230d16f389c"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_path (cognitive 22): Printer::print_path has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, match/switch 5, loops 4, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2159ec2f4798eb3f7503a83f2b24c929cadd89808a77f0ac7496a19228af5d8"}},{"ruleId":"D2","level":"warning","message":{"text":"DefMap::resolve_path_fp_with_macro_single (cognitive 22): DefMap::resolve_path_fp_with_macro_single has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, match/switch 6, boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e854bd95ad255b6c86df1298ce0ec582891cba6c3c00f0cdb8a85f52f3159445"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::rename_will_conflict_with_another_variable (cognitive 22): Resolver::rename_will_conflict_with_another_variable has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, loops 4, match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"190f14d9cc4beb6aa47f4a9c91299b635715d26abfe19c15fd06c25eb75a5693"}},{"ruleId":"D2","level":"warning","message":{"text":"Visibility::max (cognitive 22): Visibility::max has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, match/switch 4, boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/visibility.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"922bb7c4cdb4b8b66719054829bad1a09e1bd4a6a2ba365df3f5ff9fd2265981"}},{"ruleId":"D2","level":"warning","message":{"text":"Visibility::min (cognitive 22): Visibility::min has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, match/switch 4, boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/visibility.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedd24fa46827de05772c17845650a19e942a7cb9ca3ac74e8ea09cae493ffab"}},{"ruleId":"D2","level":"warning","message":{"text":"lower::lower_function (cognitive 22): lower::lower_function has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 11, if/else 8, loops 2, boolean chains 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3509bf1cc7e0427159587055ce2d91b9c1bf335137c67b800ff1b17a3d307c"}},{"ruleId":"D2","level":"warning","message":{"text":"attrs::expand_cfg_attr_with_doc_comments (cognitive 22): attrs::expand_cfg_attr_with_doc_comments has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, loops 3, match/switch 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/attrs.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"368bd19cdfdc12546403aa6ceb5ee2deeb75ad4b87daed6c3255715f2ec962d0"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprValidator::check_for_unnecessary_else (cognitive 22): ExprValidator::check_for_unnecessary_else has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14, loops 4, match/switch 3, boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/diagnostics/expr.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c650a56369de579ea82aeeb1557257e4e0804c18ba116103a17740a98784ab"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprUseVisitor::walk_captures (cognitive 22): ExprUseVisitor::walk_captures has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8, loops 7, match/switch 7 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"9789c9adee04380bf28a1412aca139640efc8d533e8c53d0c25a00b7f68d934f"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::analyze_closure (cognitive 22): InferenceContext::analyze_closure has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13, loops 5, match/switch 3, boolean chains 1 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"e387588a186240107dea72fee7953a628b11efa36cf2bd0de1961fd86c7aa4e6"}},{"ruleId":"D2","level":"warning","message":{"text":"TraitImpls::collect_def_map::collect (cognitive 22): TraitImpls::collect_def_map::collect has cognitive complexity 22 (threshold 15). Drivers by points: loops 10, if/else 6, match/switch 6 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc7245cfdc5ecb5a27bf3a18467af109fe9565a10ca90b7e337e1d048a1c711"}},{"ruleId":"D2","level":"warning","message":{"text":"FulfillmentCtxt::try_evaluate_obligations (cognitive 22): FulfillmentCtxt::try_evaluate_obligations has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11, match/switch 8, loops 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/fulfill.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cfb526014bc442b988e9dee5c6371d10bc934325cf0371f8da71b3e2f808f4"}},{"ruleId":"D2","level":"warning","message":{"text":"highlight_related::highlight_branch_exit_points (cognitive 22): highlight_related::highlight_branch_exit_points has cognitive complexity 22 (threshold 15). Drivers by points: loops 12, if/else 5, match/switch 5 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/highlight_related.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ba02d98e4d488de27e83fa44487914389bf0d46f16706d2bb97043f2bb4b28"}},{"ruleId":"D2","level":"warning","message":{"text":"moniker::def_to_kind (cognitive 22): moniker::def_to_kind has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, match/switch 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/moniker.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e81c7430794e8e66f7606e4d66e5b0f8c59fd0264e11eb48f80fede9874df1"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_trait_fn_body::gen_clone_impl (cognitive 22): gen_trait_fn_body::gen_clone_impl has cognitive complexity 22 (threshold 15). Drivers by points: loops 16, match/switch 6 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddd7d3191e63a24134058d595161f0dabfbc1845f4416a4bd225ab61d1a12ce"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_trait_fn_body::gen_debug_impl (cognitive 22): gen_trait_fn_body::gen_debug_impl has cognitive complexity 22 (threshold 15). Drivers by points: loops 16, match/switch 6 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/utils/gen_trait_fn_body.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11f4a5f8976db5708490ebe1de167dcc8fa676ca65c1599cecbcea63102e559"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_closure_to_fn::handle_call (cognitive 22): convert_closure_to_fn::handle_call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18, boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_closure_to_fn.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b7fb2e94a4d89451f4a5264c715fed7250251d255fbe9dca4627891f3589ac"}},{"ruleId":"D2","level":"warning","message":{"text":"pattern::complete_pattern (cognitive 22): pattern::complete_pattern has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9, match/switch 8, boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/pattern.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d022cee6cb4f4d9e86debf32f6bc22326c51534519c8adafdab862b3ee571831"}},{"ruleId":"D2","level":"warning","message":{"text":"Query::search_maps (cognitive 22): Query::search_maps has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10, boolean chains 6, loops 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":"src/tools/rust-analyzer/crates/ide-db/src/symbol_index.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0703587edce5f8806ab346a4df89ff180046d52018e7178a146272c29cf576"}},{"ruleId":"D2","level":"warning","message":{"text":"insert_use::insert_use_with_editor_ (cognitive 22): insert_use::insert_use_with_editor_ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17, match/switch 4, 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":"src/tools/rust-analyzer/crates/ide-db/src/imports/insert_use.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfc8f12337611e8ae09d5b18032dc1d206b5edc79f265cc74bbbf3fe5a27232"}},{"ruleId":"D2","level":"warning","message":{"text":"symbol_index::resolve_path_to_modules (cognitive 22): symbol_index::resolve_path_to_modules has cognitive complexity 22 (threshold 15). Drivers by points: loops 11, if/else 10, boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/symbol_index.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe503c56af95fca517a9330d56713251176ae1cb4603e9a406c2a6d5b068db2c"}},{"ruleId":"D2","level":"warning","message":{"text":"type_mismatch::add_missing_ok_or_some (cognitive 22): type_mismatch::add_missing_ok_or_some has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/type_mismatch.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1ee9aa0487f15f16e5239dd0c5a80b3408f040b6c750af80fcc17d22f8feac"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::parse_metavar_expr (cognitive 22): parser::parse_metavar_expr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, loops 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":"src/tools/rust-analyzer/crates/mbe/src/parser.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb4caf6635d39f694f0c47e7c8bfd7f465b80e7e4461240bb27104f055b8239"}},{"ruleId":"D2","level":"warning","message":{"text":"expressions::expr_bp (cognitive 22): expressions::expr_bp has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, boolean chains 3, match/switch 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a7c824c52830c50021f1bb1f9cc680e5459afd7e5696397d871cf8850b5a14"}},{"ruleId":"D2","level":"warning","message":{"text":"CargoWorkspace::new (cognitive 22): CargoWorkspace::new has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11, loops 8, match/switch 2, boolean chains 1 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 6 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/cargo_workspace.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"392caa61c375c370150a7377d37a9ddd5dcad10c7a2d806d0c225566bcbec117"}},{"ruleId":"D2","level":"warning","message":{"text":"UseSegment::cmp (cognitive 22): UseSegment::cmp has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, match/switch 5, boolean chains 1 (nesting depth added 9). Of this number, 21 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/imports.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3dfceefb5a55675b238a2c822aba27ae4f6e7e4e745abdeffa7017031c5f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"items::rewrite_ty (cognitive 22): items::rewrite_ty has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ee862b2b02e40db29afe8a74f88b3a161c3e239814ffa3be01bcdf0834d907"}},{"ruleId":"D2","level":"warning","message":{"text":"patterns::rewrite_struct_pat (cognitive 22): patterns::rewrite_struct_pat has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/patterns.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"799f1dd60d341f8f4a58f236c46aadc75fd6e71ce806e5c29655f82f433d8ca0"}},{"ruleId":"D2","level":"warning","message":{"text":"decode (cognitive 22): decode has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":2597}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a1a1e1aa0c1856d08fb4355474f1604cff93ccdcc39eaf4bd2f326a9537efc"}},{"ruleId":"D2","level":"warning","message":{"text":"checkPath (cognitive 22): checkPath has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3855}}}],"partialFingerprints":{"codehealthFindingId/v1":"1222357f9d06c18f7ee347aa9075f77b99dacfa4f56da0129d859186e34ee4d7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 22): (anonymous) has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":5452}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1d7b8075be5a5ef38a59953f9e56908d5c5f765bc01399ddd24622acb021ba"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_expr_range (cognitive 21): LoweringContext::lower_expr_range has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, match/switch 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"934eaf14737ad435cfc827c07f187058b41e06c521f545ef8bc1cbfef892545c"}},{"ruleId":"D2","level":"warning","message":{"text":"RegionInferenceContext::best_blame_constraint (cognitive 21): RegionInferenceContext::best_blame_constraint has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, boolean chains 6, 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":"compiler/rustc_borrowck/src/region_infer/mod.rs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca44f2f0643e06a9964990bf050944effd70fbb9d275da57f12517c8e1e89da2"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::visit_statement (cognitive 21): TypeChecker::visit_statement has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, match/switch 3, 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"faea3cfc8e62ddcd548cdb25bfa11366d36ac5719567bf3cf576042744590499"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::gcc_icmp (cognitive 21): Builder::gcc_icmp has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, match/switch 6, 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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ed9d40a7631a9b1c0b6597ca9ca6f43428ddeb09aaf48e372a2eaec83d2a58"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenCx::codegen_global_asm (cognitive 21): CodegenCx::codegen_global_asm has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, match/switch 9, boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f06a8495cdf488cb17f37817901c929d707489de460595948c6f91e0f46e79"}},{"ruleId":"D2","level":"warning","message":{"text":"CguReuseTracker::check_expected_reuse (cognitive 21): CguReuseTracker::check_expected_reuse has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, match/switch 4, 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":"compiler/rustc_codegen_ssa/src/assert_module_sources.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a60bb61cee6869bde35085fbfc9e2cc528c9a9f5f745fe64006cec868c3084"}},{"ruleId":"D2","level":"warning","message":{"text":"link::add_linked_symbol_object (cognitive 21): link::add_linked_symbol_object has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, boolean chains 3, match/switch 2, loops 1 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 6 belong to one function item declared inside it. 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2312}}}],"partialFingerprints":{"codehealthFindingId/v1":"685c12ac0756a077d5afec6499d7856e03b2288cb8f5bbfcfa1f4c21dfd9e79a"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::eval_rvalue_into_place (cognitive 21): InterpCx::eval_rvalue_into_place has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19, boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7029d64bc6b91378e8736ae61b340897217e683ff89ea50d528e14b9ad6f979"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::eval_terminator (cognitive 21): InterpCx::eval_terminator has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, boolean chains 3, loops 2, 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":"compiler/rustc_const_eval/src/interpret/step.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05a0ef22b06aab0af5d9c168373b856eebcbd5da9da11ae98232ed3217b6c2a"}},{"ruleId":"D2","level":"warning","message":{"text":"ObligationForest::process_obligations (cognitive 21): ObligationForest::process_obligations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, loops 7, match/switch 3, 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":"compiler/rustc_data_structures/src/obligation_forest/mod.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d13fdf44e3d398bead6dfd732ebdd2f68d01c1cdde27dbc5cdbadcd78c0fb34"}},{"ruleId":"D2","level":"warning","message":{"text":"AnnotateSnippetEmitter::unannotated_messages (cognitive 21): AnnotateSnippetEmitter::unannotated_messages has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, boolean chains 6, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/annotate_snippet_emitter_writer.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ba58a9fe1ae220418fc96af6fe1078478f438b39326433fe906126d250a477"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprUseVisitor::cat_pattern (cognitive 21): ExprUseVisitor::cat_pattern has cognitive complexity 21 (threshold 15). Drivers by points: loops 13, match/switch 6, if/else 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d4924143c2c9c4f519730a844ce3e6431ea5da7250962806ef7efcaed8753f"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::label_generic_mismatches (cognitive 21): FnCtxt::label_generic_mismatches has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"e327c8f537ae93f22010f5bf21a6314f116fafc96eedcac5be21d2296e2e0d94"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::check_for_module_export_macro (cognitive 21): Resolver::check_for_module_export_macro has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, boolean chains 3, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb88e634404dd9bcaaddbd210116595b65043701b6c450c11931e070de1214d"}},{"ruleId":"D2","level":"warning","message":{"text":"FreeRegionsVisitor::visit_ty (cognitive 21): FreeRegionsVisitor::visit_ty has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, loops 3, match/switch 3, 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":"compiler/rustc_infer/src/infer/outlives/for_liveness.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed16486b0e3b1855848a5d2979b07dfe63858b192835ff214042a97138b37dc"}},{"ruleId":"D2","level":"warning","message":{"text":"Generalizer::consts (cognitive 21): Generalizer::consts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, match/switch 3, 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":"compiler/rustc_infer/src/infer/relate/generalize.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c66f1aeef9612828f996780ece77887399706902ecffba9f1a3721b589fe15"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor::advance_token (cognitive 21): Cursor::advance_token has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9, boolean chains 5, match/switch 5, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"4828b956afce3a45dfb4cf3cac4cad12b0abf5bf7b937ae68faa54a4f5eac776"}},{"ruleId":"D2","level":"warning","message":{"text":"SubdiagnosticDeriveVariantBuilder::generate_field_code_inner_path (cognitive 21): SubdiagnosticDeriveVariantBuilder::generate_field_code_inner_path has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19, 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":"compiler/rustc_macros/src/diagnostics/subdiagnostic.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54129a4d755a459b9a82b418d7e9c94e8f7aecdccf3ad693e50cfbc38f97575"}},{"ruleId":"D2","level":"warning","message":{"text":"EncodeContext::encode_proc_macros (cognitive 21): EncodeContext::encode_proc_macros has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, loops 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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"16470dda0b504e88e55ed67d0fa8cec76d6e6a2302b24e1559f0b4b71785dae0"}},{"ruleId":"D2","level":"warning","message":{"text":"lint::explain_lint_level_source (cognitive 21): lint::explain_lint_level_source has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, match/switch 3, 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":"compiler/rustc_middle/src/lint.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e2123caaeffd0905c2dd0812fd643268e2adcf7e9af89ea0a7f02b033c66a7"}},{"ruleId":"D2","level":"warning","message":{"text":"pretty::write_allocations (cognitive 21): pretty::write_allocations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9, match/switch 8, loops 3, boolean chains 1 (nesting depth added 10). Of this number, 20 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ec955c966468de97229c2dc304dd46d9672da408d6161641f15d57452d2506"}},{"ruleId":"D2","level":"warning","message":{"text":"ThirPrinter::print_expr_kind (cognitive 21): ThirPrinter::print_expr_kind has cognitive complexity 21 (threshold 15). Drivers by points: loops 11, if/else 9, match/switch 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6506b6d66613fdf71a9b4677154d4b9d8d6eeb3d3931096be01c73244130f16e"}},{"ruleId":"D2","level":"warning","message":{"text":"ssa::compute_copy_classes (cognitive 21): ssa::compute_copy_classes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, loops 5 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/ssa.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6358f7139934965bd237aa1c437dc4ba33448ec420566b2645297e4ced772d4e"}},{"ruleId":"D2","level":"warning","message":{"text":"liveness::check_liveness (cognitive 21): liveness::check_liveness has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, loops 3, match/switch 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3db04b0d7d331997670ec8f98384015fac8f9c3f3cdc564c3a18d2c4b316bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"partitioning::collect_and_partition_mono_items (cognitive 21): partitioning::collect_and_partition_mono_items has cognitive complexity 21 (threshold 15). Drivers by points: loops 11, if/else 5, match/switch 4, boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5eb8bf8fd68eb18e70a9f7ea5d1c0cda68d5c493514146af74ed427a95b973"}},{"ruleId":"D2","level":"warning","message":{"text":"structural_traits::extract_tupled_inputs_and_output_from_async_callable (cognitive 21): structural_traits::extract_tupled_inputs_and_output_from_async_callable has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, boolean chains 2, 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":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea1037d5bbfb0e6581c378edc4990b334a7ee21ea34885e3a8216d68173bb65"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::recover_colon_colon_in_pat_typo (cognitive 21): Parser::recover_colon_colon_in_pat_typo has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 16, if/else 5 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":2735}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a67ce4cfa8f2ab76521713837ba2733bc1b255d9d9890d0d536df0049220779"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_mod (cognitive 21): Parser::parse_mod has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, loops 3, 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc60564447d9dc4c8cc6c1eef653ac44cbef3b226ad6e17159bc2c5b759f1111"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::recover_fn_trait_with_lifetime_params (cognitive 21): Parser::recover_fn_trait_with_lifetime_params has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, boolean chains 2, 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":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ff0c0be961a6293a53b9242f59dfe54ceef5c066adb56e67ca63a7d0655aeb"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckAttrVisitor::check_unused_attribute (cognitive 21): CheckAttrVisitor::check_unused_attribute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, boolean chains 5, match/switch 3 (nesting depth added 5). 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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c8045a719a17d275167ce9daf5aca06b646f7438debcd4645166010742b420"}},{"ruleId":"D2","level":"warning","message":{"text":"handle_cycle_error::find_item_ty_spans (cognitive 21): handle_cycle_error::find_item_ty_spans has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, loops 4, boolean chains 3, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_query_impl/src/handle_cycle_error.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5777e86aec06d3b67501bec4c065dc7ff25adaa64b8bf967eb2bacb6bb39d68"}},{"ruleId":"D2","level":"warning","message":{"text":"PointerAuthConfig::from_raw (cognitive 21): PointerAuthConfig::from_raw has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, match/switch 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/session.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c85f864ebcdf54890cf883578df70527bee06d0fe464b0a2d447e88db2d7b0"}},{"ruleId":"D2","level":"warning","message":{"text":"xtensa::classify_arg_ty (cognitive 21): xtensa::classify_arg_ty has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, boolean chains 3 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/xtensa.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7d949e3532147381c399e251fa9af2fe453e6e3c780ac23a3feb4db6ad4a42"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::suggest_function_pointers_impl (cognitive 21): TypeErrCtxt::suggest_function_pointers_impl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, boolean chains 3, match/switch 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"da92c7eb0104a244337dda8970005593f4485b7278a3d0061a00ae12e71e5a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"outlives_for_liveness::live_args_for_outlives_clause (cognitive 21): outlives_for_liveness::live_args_for_outlives_clause has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, match/switch 5, loops 4, 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":"compiler/rustc_trait_selection/src/traits/outlives_for_liveness.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"533f1e9e5d85c066626f6a857f8cf6b436acc7e4712985fbf4db2be8eb97c905"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnostics::impl_trait_overcapture_suggestion (cognitive 21): diagnostics::impl_trait_overcapture_suggestion has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, loops 3, match/switch 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":"compiler/rustc_trait_selection/src/diagnostics.rs"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"6097f01013e29fb7a893116b381ba3228b8f084b8d1bc8357ff361bf5c42bbd0"}},{"ruleId":"D2","level":"warning","message":{"text":"effects::evaluate_host_effect_from_item_bounds (cognitive 21): effects::evaluate_host_effect_from_item_bounds has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/effects.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d0b8cc6636b024717db95b434ccfb37a24999831fa6e1bd253a86c876f21cd"}},{"ruleId":"D2","level":"warning","message":{"text":"relate::structurally_relate_tys (cognitive 21): relate::structurally_relate_tys has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, match/switch 6, 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":"compiler/rustc_type_ir/src/relate.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7311397e402a379887f862188c8d5702269e853d72a2d3036e168749bdee9f"}},{"ruleId":"D2","level":"warning","message":{"text":"fmaf16::fmaf16 (cognitive 21): fmaf16::fmaf16 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 20, boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/fmaf16.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"104bdf6e1dce8bbaf76d370b9ef0e3d5f2387fa2877b917ec07f55e77b9bffd9"}},{"ruleId":"D2","level":"warning","message":{"text":"rotate::ptr_rotate_gcd (cognitive 21): rotate::ptr_rotate_gcd has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, loops 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":"library/core/src/slice/rotate.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77b7095f167d52f13e6e97592eeb5d26d6841b009f0b2f1c2084df59100d488"}},{"ruleId":"D2","level":"warning","message":{"text":"rotate::ptr_rotate_swap (cognitive 21): rotate::ptr_rotate_swap has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, loops 7, 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":"library/core/src/slice/rotate.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed382e941b8a1d4ad9dd2ade0c9bb4c264bcb6a8ee57780f357b3758a77b33bd"}},{"ruleId":"D2","level":"warning","message":{"text":"pattern::simd_contains (cognitive 21): pattern::simd_contains has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, loops 7, 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":"library/core/src/str/pattern.rs"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"4235ddc7e689c4369297148d4c4a53b657ac4dbee32efba7900181cfc65ab286"}},{"ruleId":"D2","level":"warning","message":{"text":"select::partition_at_index_loop (cognitive 21): select::partition_at_index_loop has cognitive complexity 21 (threshold 15). Drivers by points: if/else 20, 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":"library/core/src/slice/sort/select.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ed9544acf41e49a0e70783a31aee2d1278f685f6a77913385471805e8ebb69"}},{"ruleId":"D2","level":"warning","message":{"text":"linux::copy_regular_files (cognitive 21): linux::copy_regular_files has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, match/switch 7, boolean chains 1, loops 1 (nesting depth added 11). Of this number, 20 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/io/kernel_copy/linux.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4dac5bf624f43ae0a0f4c5241775d82ec6c570fad46af7d0e69183ffaf5e092"}},{"ruleId":"D2","level":"warning","message":{"text":"Expression::build (cognitive 21): Expression::build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, match/switch 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-arm/src/expression.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e4f67099d1354eba53634d466ccce0094da3110b57dce5be8f82f75a3d5dae"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolStateCheck::run (cognitive 21): ToolStateCheck::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/toolstate.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"255ca2cc67eff67d73c3e1e0ff7552b0a8fc6c6ad5f81f592f0e33adb0401fe3"}},{"ruleId":"D2","level":"warning","message":{"text":"SummaryLine::next (cognitive 21): SummaryLine::next has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, match/switch 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cef1e6d0900609115735c80ff620b457e4d28aa896d06a21580d3edcda6a48"}},{"ruleId":"D2","level":"warning","message":{"text":"inline::build_module_items (cognitive 21): inline::build_module_items has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/inline.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10add7de04b2148dacb37d66c5f8912d84564bf3a00aaac24501df928322100"}},{"ruleId":"D2","level":"warning","message":{"text":"collect_intra_doc_links::preprocess_link (cognitive 21): collect_intra_doc_links::preprocess_link has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, boolean chains 6, match/switch 5 (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":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"9124b6c9c4c70179bdba6d16283488cfed54eb2165644eeeb8b0854bd4dadf96"}},{"ruleId":"D2","level":"warning","message":{"text":"clean::clean_qpath (cognitive 21): clean::clean_qpath has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, match/switch 3, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":1723}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c5e932dc219a414baf1968f33e6e8f6a8c99c6938d2bf0f50ad2c991a2cd73"}},{"ruleId":"D2","level":"warning","message":{"text":"clean::clean_use_statement_inner (cognitive 21): clean::clean_use_statement_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, 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":"src/librustdoc/clean/mod.rs"},"region":{"startLine":3159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6313678a6252328830eb7b80600849beeb4bbb71b865c76d45f2c7170f886559"}},{"ruleId":"D2","level":"warning","message":{"text":"DisallowedFields::check_pat (cognitive 21): DisallowedFields::check_pat has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, loops 4, 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":"src/tools/clippy/clippy_lints/src/disallowed_fields.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a57acb318d1f52170583760d3e5d7373465ad7690372f23733aa19e3ede6ab"}},{"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 13, loops 3, match/switch 3, boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/entry.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c215e708bab684955a29e7b8c015d8e59e546e300b1862d2f8d3f11b9adf0cb"}},{"ruleId":"D2","level":"warning","message":{"text":"LiteralDigitGrouping::check_for_mistyped_suffix (cognitive 21): LiteralDigitGrouping::check_for_mistyped_suffix has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, match/switch 7, boolean chains 1 (nesting depth added 8). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/literal_representation.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f412ea6939e383a18dec49051ceac0e5d5a6bca10dcf73ad3ee63914cb3a99a8"}},{"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 15, boolean chains 4, match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/to_digit_is_some.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8f83da70c39efd558612dd8e62d9f9ad7d6cd174829a2744c30b1c1d4aa8ad"}},{"ruleId":"D2","level":"warning","message":{"text":"missing_asserts_for_indexing::report_indexes (cognitive 21): missing_asserts_for_indexing::report_indexes has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 12, if/else 4, loops 3, 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":"src/tools/clippy/clippy_lints/src/missing_asserts_for_indexing.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"40784a43eee33c69596c3498f71079be440ce74496067e713bec553c59250e89"}},{"ruleId":"D2","level":"warning","message":{"text":"question_mark::check_if_let_some_or_err_and_early_return (cognitive 21): question_mark::check_if_let_some_or_err_and_early_return has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, boolean chains 8, match/switch 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/question_mark.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"071e15f269a46e60cbccb20774ab2ffe377bbc8d77b00de8df464e5b362d705f"}},{"ruleId":"D2","level":"warning","message":{"text":"ranges::can_switch_ranges (cognitive 21): ranges::can_switch_ranges has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, boolean chains 7, match/switch 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/ranges.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d729f0174f1bc908346a6ecedea88bb443a6542115e7a705f09aa90ca96f9b"}},{"ruleId":"D2","level":"warning","message":{"text":"cmp_owned::check_op (cognitive 21): cmp_owned::check_op has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15, boolean chains 4, match/switch 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/cmp_owned.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b69717641a1434aa15dc4d1c41e52e99cfd37f9cdad2d8ce72252eccc4546f"}},{"ruleId":"D2","level":"warning","message":{"text":"needless_borrows_for_generic_args::needless_borrow_count (cognitive 21): needless_borrows_for_generic_args::needless_borrow_count has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, boolean chains 7, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_borrows_for_generic_args.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45278bf1c326f1736109a8910f6f8da57cc366017b5cd49df3e13871a1ec1b6"}},{"ruleId":"D2","level":"warning","message":{"text":"needless_borrows_for_generic_args::replace_types (cognitive 21): needless_borrows_for_generic_args::replace_types has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, boolean chains 4, loops 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":"src/tools/clippy/clippy_lints/src/needless_borrows_for_generic_args.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8c8a41526f723305fdb1601f3d61983d967cc090df4217fdc7dca0b05d3452"}},{"ruleId":"D2","level":"warning","message":{"text":"non_minimal_cfg::check_nested_cfg (cognitive 21): non_minimal_cfg::check_nested_cfg has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18, boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/attrs/non_minimal_cfg.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7446fc8a084ccf7d9ad205aa7a81edaeb403803e6b656486e676bc727ce8680b"}},{"ruleId":"D2","level":"warning","message":{"text":"unit_cmp::check (cognitive 21): unit_cmp::check has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, match/switch 6, boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/unit_types/unit_cmp.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0ca754527a3fec37f59db5b8edd08031df659e6c1fc7a71fc575e9eedbe437"}},{"ruleId":"D2","level":"warning","message":{"text":"useless_conversion::into_iter_bound (cognitive 21): useless_conversion::into_iter_bound has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19, 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":"src/tools/clippy/clippy_lints/src/useless_conversion.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9c01cbb3f2e45edcc16f9f243fef37bf66045d57cfe700173f17a971a180f5"}},{"ruleId":"D2","level":"warning","message":{"text":"PossibleBorrowerVisitor::visit_terminator (cognitive 21): PossibleBorrowerVisitor::visit_terminator has cognitive complexity 21 (threshold 15). Drivers by points: loops 10, if/else 8, match/switch 3 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/mir/possible_borrower.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3b28740d78870d7a61c5622c9774621d3dc3739cdb711b03e90e4976463a28"}},{"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 13, if/else 6, loops 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":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a455a57053233a04a046cefc3600dad6c9338461fcfe492979586a251de4327"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::is_body_identity_function (cognitive 21): clippy_utils::is_body_identity_function has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, boolean chains 3, loops 2, match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"589127b3caaccd17cfb0afd317c991989e1a00fbccd1b5b026cb58f66debc98c"}},{"ruleId":"D2","level":"warning","message":{"text":"Node::merge_groups (cognitive 21): Node::merge_groups has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, loops 4, match/switch 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":"src/tools/collect-license-metadata/src/path_tree.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"050bd795790f39ada3a49ca79fdef91f1af5a5360a659a0689414c9f642527f6"}},{"ruleId":"D2","level":"warning","message":{"text":"directives::make_test_description (cognitive 21): directives::make_test_description has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, boolean chains 2, 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":"src/tools/compiletest/src/directives.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a8d9e452ab7119872a53ee68e127ca1627cd4b71c86f196733097588892b6f"}},{"ruleId":"D2","level":"warning","message":{"text":"covfun::dump_covfun_mappings (cognitive 21): covfun::dump_covfun_mappings has cognitive complexity 21 (threshold 15). Drivers by points: loops 10, if/else 7, match/switch 4 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/coverage-dump/src/covfun.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a79d0f8c0dc2c05df818e9f136c3a2f6bd28cd01d998606cf4170f53dc8b76"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_metadata::load_important_files (cognitive 21): cargo_metadata::load_important_files has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, loops 7 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/generate-copyright/src/cargo_metadata.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a2729c44b261e5bf92d9043300c0267ff509d0347735686540d672419cf83e"}},{"ruleId":"D2","level":"warning","message":{"text":"Trait::hir_fmt (cognitive 21): Trait::hir_fmt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, match/switch 4, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"572d7c47494f892bc9899c56ca386d894610aa8dd2c09e9d7a120596897bcc7f"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprUseVisitor::cat_pattern (cognitive 21): ExprUseVisitor::cat_pattern has cognitive complexity 21 (threshold 15). Drivers by points: loops 13, match/switch 6, if/else 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"3659c61ccac6abd8391974a281ad9274e6c5df95ce12472098a58209fbe08b07"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::compute_definition_site_hidden_types (cognitive 21): InferenceContext::compute_definition_site_hidden_types has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, loops 7, match/switch 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/opaques.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f20e173871ed2b88f79975d1265f5f11c05f20521a699995db0467159e91ce"}},{"ruleId":"D2","level":"warning","message":{"text":"folding_ranges::collapse_expr (cognitive 21): folding_ranges::collapse_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, match/switch 6, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/folding_ranges.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8a9e4db2a3e2ed8417fba7508c59eb745a7782585f3f35b7cca6ff02d60f7e"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_tuple_struct_to_named_struct::process_struct_name_reference (cognitive 21): convert_tuple_struct_to_named_struct::process_struct_name_reference has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, loops 4, match/switch 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_struct_to_named_struct.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6367be7c50027686597ab3a7f77453d1c1546882da9e30f2697aff5e90ed65"}},{"ruleId":"D2","level":"warning","message":{"text":"replace_if_let_with_match::replace_if_let_with_match (cognitive 21): replace_if_let_with_match::replace_if_let_with_match has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, match/switch 5, boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_if_let_with_match.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6204d6d33f8a87f686284f0a81440248a362d9f78bc3e3397695909f68941e"}},{"ruleId":"D2","level":"warning","message":{"text":"remove_unused_imports::module_search_scope (cognitive 21): remove_unused_imports::module_search_scope has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9, loops 7, match/switch 5 (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 5 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/remove_unused_imports.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"605d998b5bae50ab473462e1de77e2e152d6a304df9416df311c86832645a28c"}},{"ruleId":"D2","level":"warning","message":{"text":"trait_impl::get_transformed_fn (cognitive 21): trait_impl::get_transformed_fn has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 12, if/else 8, boolean chains 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/item_list/trait_impl.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d32f07ede8e5d612d0cb74bed9b3870ad421f0f08d1b0b7015ed4858e49d7c"}},{"ruleId":"D2","level":"warning","message":{"text":"attribute::complete_attribute_path (cognitive 21): attribute::complete_attribute_path has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, match/switch 7, loops 3, boolean chains 1 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12e0529e5e26fa0086f41b3105184ae3886a22bee83ac4a1febf73066d852e2"}},{"ruleId":"D2","level":"warning","message":{"text":"node_ext::preorder_expr_with_ctx_checker (cognitive 21): node_ext::preorder_expr_with_ctx_checker has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, match/switch 4, boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc74b2996bc949ec0a2a99a40c003c1c6a27d015808b8c081051be00ea10798"}},{"ruleId":"D2","level":"warning","message":{"text":"BindingsBuilder::build_inner (cognitive 21): BindingsBuilder::build_inner has cognitive complexity 21 (threshold 15). Drivers by points: loops 14, if/else 5, match/switch 2 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b291ab17d631e1f62acce8acfe86b64f5167ecc623a6999c1a2d64b918c5ea"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::parse_repeat (cognitive 21): parser::parse_repeat has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 20, loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/parser.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9fe829e654a5b50398f4f003acb7a34be30e9f9da2270d5ad0dde4a089eef5"}},{"ruleId":"D2","level":"warning","message":{"text":"transcriber::expand_repeat (cognitive 21): transcriber::expand_repeat has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, loops 5, match/switch 3, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/transcriber.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd9568aff463af4ac32aa3baa0b1367c539f5c9883c6a2865a4c8fe92fa02fd"}},{"ruleId":"D2","level":"warning","message":{"text":"expressions::lhs (cognitive 21): expressions::lhs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, boolean chains 4, loops 2, 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":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"4044ec456b3c427138a398ac539df09605a212a698d859cfd1d8220748d40cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"Diagnostics::run_ (cognitive 21): Diagnostics::run_ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, loops 4, match/switch 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":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/diagnostics.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80468b2fa38200f06ad0260eba12db3fb40f26bbb14e690138328767649da9a"}},{"ruleId":"D2","level":"warning","message":{"text":"CargoOptions::apply_on_command (cognitive 21): CargoOptions::apply_on_command has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, match/switch 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/flycheck.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4114f70a400874d7455955b18e454b3b6754f129c6eb5eabbc2c4c7d447a26b9"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::handle_vfs_msg (cognitive 21): GlobalState::handle_vfs_msg has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, match/switch 5, boolean chains 3, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04a82f6f34e1f2adb530b59bdb1681e7b4cdba994c7879318895095f7c3ab4d"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter::next_token (cognitive 21): Converter::next_token has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, match/switch 6, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2476a62b3692feb9c3fd4d49ddaf9bce27a5752dea98e8ec69902fbf4f4d837"}},{"ruleId":"D2","level":"warning","message":{"text":"items::format_impl_ref_and_type (cognitive 21): items::format_impl_ref_and_type has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, match/switch 5 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca248e122df9695640727661668a7faf8edab669d257a56db2ca047ff30e03b3"}},{"ruleId":"D2","level":"warning","message":{"text":"items::format_generics (cognitive 21): items::format_generics has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, boolean chains 5 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":3342}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b7da6e6535b988b6206e0f50bb89e56d0e8ab4c2c8906d59ca0fb66b4fcfb1"}},{"ruleId":"D2","level":"warning","message":{"text":"rustfmt_nightly::format_code_block (cognitive 21): rustfmt_nightly::format_code_block has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19, loops 2 (nesting depth added 8). Of this number, 18 points are the body\u0027s own statements and 3 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/lib.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37c19c8fe329da5eac929969098543d95eb3c8d4ddfca3d6cba70de0415db56"}},{"ruleId":"D2","level":"warning","message":{"text":"imports::merge_use_trees_inner (cognitive 21): imports::merge_use_trees_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 20, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/imports.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd65a952a69dd2fb8f348f14f055cf0b1fc8e7edc3d7d36d713c8c900270f4b0"}},{"ruleId":"D2","level":"warning","message":{"text":"error_codes::check_error_codes_tests (cognitive 21): error_codes::check_error_codes_tests has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, loops 3, boolean chains 2, match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/error_codes.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"406112d3a1534d2752d0cc0081a71584f3c918cd631092b6fb3b97405ce1ce14"}},{"ruleId":"D2","level":"warning","message":{"text":"extra_checks::check (cognitive 21): extra_checks::check has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16, match/switch 3, boolean chains 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/extra_checks/mod.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"052daf1d467a89bf651b560ce2d01cfe3d6486011cad94993c9236c09f267d77"}},{"ruleId":"D2","level":"warning","message":{"text":"getTypeData (cognitive 21): getTypeData has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84176fb7883c40dbbba15594ed6a963b29f75293cde760727bd03806dd0b632"}},{"ruleId":"D2","level":"warning","message":{"text":"buildHrefAndPath (cognitive 21): buildHrefAndPath has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f97496f8e1cdcea46ac367ffcd07c8cbad2178dee8388fe86031b7458cf1c08"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_use_tree (cognitive 20): LoweringContext::lower_use_tree has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, boolean chains 4, match/switch 3, loops 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":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"62896011eda6d3230d4446a901656d3ef05c6d6d5f3a380c6a1397438a25b8b3"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_generic_arg (cognitive 20): LoweringContext::lower_generic_arg has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 10, if/else 9, boolean chains 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c5f38cae14490ef11fa1b6666f3b1933e6724c78fb685522310111e4f115bf"}},{"ruleId":"D2","level":"warning","message":{"text":"AstValidator::visit_ty_common (cognitive 20): AstValidator::visit_ty_common has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, match/switch 3, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98f4e33e1fec4fdab319dfffce3e42073b9897626c2a92538faffa76ab6398d"}},{"ruleId":"D2","level":"warning","message":{"text":"AstValidator::visit_param_bound (cognitive 20): AstValidator::visit_param_bound has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 8, if/else 7, loops 4, 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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d1519786286f05664cd59c3c7e76f8882b45dfe53354177eb1de82a0247f30"}},{"ruleId":"D2","level":"warning","message":{"text":"dump::emit_mermaid_cfg (cognitive 20): dump::emit_mermaid_cfg has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, loops 8, match/switch 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":"compiler/rustc_borrowck/src/polonius/dump.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf8a20d88cc654528c84f29ad33ac2bfdda386073e78796fa239fcae35293d5"}},{"ruleId":"D2","level":"warning","message":{"text":"values::pretty_print_region_elements (cognitive 20): values::pretty_print_region_elements has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, match/switch 2, boolean chains 1, loops 1 (nesting depth added 10). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/region_infer/values.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"59256679980e52bdb3f86a0bcdf7ba7b30608c282d5e6b8ce1e32fc458f25b3c"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineAssemblyGenerator::allocate_stack_slots (cognitive 20): InlineAssemblyGenerator::allocate_stack_slots has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, loops 6, 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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa41fd50de884bb518c9839b574a491d35da2b79dfb9a187c73b1e10ef90c9a"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::check_ptr_call (cognitive 20): Builder::check_ptr_call has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, boolean chains 4, 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":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecd89974c7af17386b4a78c4a3d6e1e557fe1f49632613e16f76a5c93855ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"consts::check_and_apply_linkage (cognitive 20): consts::check_and_apply_linkage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"caab5bfc1d7e1fa578dc7c33105457b41b0bb44d9dbedb83b5f483c23464dd6c"}},{"ruleId":"D2","level":"warning","message":{"text":"ArArchiveBuilder::add_archive (cognitive 20): ArArchiveBuilder::add_archive has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, match/switch 4, 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":"compiler/rustc_codegen_ssa/src/back/archive.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"97020f6fe4e889c057217c364ce87b277c85cc0530e7319444c767cd743f7d58"}},{"ruleId":"D2","level":"warning","message":{"text":"base::codegen_crate (cognitive 20): base::codegen_crate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, loops 4, boolean chains 2, match/switch 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/base.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b29f277b2fd30b7815e5f99e09d738e93b0aa743ff6e4dbb004a30420876cae"}},{"ruleId":"D2","level":"warning","message":{"text":"TransferFunction::visit_rvalue (cognitive 20): TransferFunction::visit_rvalue has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, boolean chains 4, 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":"compiler/rustc_const_eval/src/check_consts/resolver.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfa79aaefeb118898b69f99e39e591b463d0bd0668038c876bf959a16eddaf7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_driver_impl::install_ice_hook (cognitive 20): rustc_driver_impl::install_ice_hook has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, match/switch 7, 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":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"452fc0df7e8f7a8cac9dacddbaec2d64156f13c1ea1f23599c0450246178d6d9"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagCtxtHandle::print_error_count (cognitive 20): DiagCtxtHandle::print_error_count has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, match/switch 3, 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":"compiler/rustc_errors/src/lib.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a43e7ad7b77005236c562e10f041253d231e6f440eff3e71d5301ef38ccfe7"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_graphviz::render_opts (cognitive 20): rustc_graphviz::render_opts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_graphviz/src/lib.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e4285506b916ca94597a5c824d1b3c18fdd842f7f710ff7f506b7331b96970"}},{"ruleId":"D2","level":"warning","message":{"text":"clauses_of::const_conditions (cognitive 20): clauses_of::const_conditions has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 15, if/else 4, loops 1 (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":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86ebf3d68a33ebb0b53e205977a71a736fb8a64e3fbe34baee7fd0684afed5b"}},{"ruleId":"D2","level":"warning","message":{"text":"check::check_scalable_vector (cognitive 20): check::check_scalable_vector has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8, match/switch 8, boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c17e2483c34e975f338ecc76a5f8614a1e19a5571cac1ecc104851644039e04"}},{"ruleId":"D2","level":"warning","message":{"text":"check::detect_discriminant_duplicate (cognitive 20): check::detect_discriminant_duplicate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, loops 3, boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"512dfda5414409db8e834c37a1d7dc9cac3b508a748b72f8184bf2e2b524eb1e"}},{"ruleId":"D2","level":"warning","message":{"text":"implicit_infer::infer_predicates (cognitive 20): implicit_infer::infer_predicates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, loops 7, match/switch 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/outlives/implicit_infer.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af18c91bbaa3cdd4a320f14eea128e91f1965688c5cd53b384b30dee69e7fce"}},{"ruleId":"D2","level":"warning","message":{"text":"compare_impl_item::check_region_late_boundedness (cognitive 20): compare_impl_item::check_region_late_boundedness has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, loops 3, boolean chains 2, match/switch 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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"203ebb39912524fd55d2de5960d6552fc2896e24b6e7e2259d53f36e4da83087"}},{"ruleId":"D2","level":"warning","message":{"text":"delegation::create_mapping (cognitive 20): delegation::create_mapping has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, loops 6 (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":"compiler/rustc_hir_analysis/src/delegation.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb4abb113bdf369ddd05a438280f476f084f74162ab65684eb7a39dfc0d29b5"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprUseVisitor::walk_pat (cognitive 20): ExprUseVisitor::walk_pat has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, match/switch 5, 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"729fae2d791d30489b81462369f96cdeb4aaa779a8238f3b546d521910911b84"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_asm (cognitive 20): FnCtxt::check_expr_asm has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, match/switch 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":3708}}}],"partialFingerprints":{"codehealthFindingId/v1":"749840e962133d18b53e8da80968c827c4b217154067712dd12ef0e4e0201346"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::impl_into_iterator_should_be_iterator (cognitive 20): FnCtxt::impl_into_iterator_should_be_iterator has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, loops 4, boolean chains 2, match/switch 1 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"257aad9c6b9262471c6fa2c2b2fdef56295cbafb9dcf356d7bd88e6a2ea45095"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::emit_bad_pat_path (cognitive 20): FnCtxt::emit_bad_pat_path has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 10, if/else 9, boolean chains 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"1128c564e65c77fbbec83727765418cf13db2f5f6d5acf812a948827cf0e13e1"}},{"ruleId":"D2","level":"warning","message":{"text":"check::check_fn (cognitive 20): check::check_fn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, boolean chains 2, loops 2, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/check.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f11ccf6f6dba1edba029f6d9fb3b4854aa49829998166dbd894271fd5c9120"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_hir_typeck::typeck_with_inspect (cognitive 20): rustc_hir_typeck::typeck_with_inspect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/lib.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa09c025fb0a3812a17310741fb2349d95bac0ff532382e6477e0aea007abd5"}},{"ruleId":"D2","level":"warning","message":{"text":"InferCtxt::query_response_instantiation_guess (cognitive 20): InferCtxt::query_response_instantiation_guess has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, match/switch 4, loops 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/canonical/query_response.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b68949e86b462a98e613f674c6e6ed26c9e5cd2ce2a0c2e34dc552027d38e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor::number (cognitive 20): Cursor::number has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, match/switch 6, 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":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b06bade0727a59aeea9c4d62afb385d3d47bd0f54c0160ab28d7085e6aa157"}},{"ruleId":"D2","level":"warning","message":{"text":"ImproperCTypesVisitor::visit_indirection (cognitive 20): ImproperCTypesVisitor::visit_indirection has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, boolean chains 4, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab165d6b336e6fec7a267b7deee6daf6dfbafba74694017383c9e761b136253"}},{"ruleId":"D2","level":"warning","message":{"text":"ImproperCTypesVisitor::visit_struct_or_union (cognitive 20): ImproperCTypesVisitor::visit_struct_or_union has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, 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":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82082835ddb3a346cce9abd9615c14770b150cc158e26582d02bec9ff0896b2"}},{"ruleId":"D2","level":"warning","message":{"text":"CannotFindCrate::into_diag (cognitive 20): CannotFindCrate::into_diag has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, 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":"compiler/rustc_metadata/src/diagnostics.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"7056a78ce4494335894da6404dc2583f4f17d8b2ad280e29c6568cc413c3a90b"}},{"ruleId":"D2","level":"warning","message":{"text":"fs::encode_and_write_metadata (cognitive 20): fs::encode_and_write_metadata has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, match/switch 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/fs.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba3879e11885e1a8aee1b6c9102660d97e6503ddb3d0fda80cf932ffb9224a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Children::insert (cognitive 20): Children::insert has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, match/switch 4, boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/specialize/specialization_graph.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e45b30c70293f1edd75674465f3411303acda47712639b5436b5c52c49f81d"}},{"ruleId":"D2","level":"warning","message":{"text":"pretty::trimmed_def_paths (cognitive 20): pretty::trimmed_def_paths has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9, match/switch 6, loops 4, 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":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":3548}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada942338c87f42c24687d08e65203ecebc2070fe177ace4bf02c93770ee37b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::ast_block_stmts (cognitive 20): Builder::ast_block_stmts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, boolean chains 2, loops 2, match/switch 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":"compiler/rustc_mir_build/src/builder/block.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6304be68e0ae6813024cb16807b4089158e47359295f4df874bce216d0b39e8e"}},{"ruleId":"D2","level":"warning","message":{"text":"MoveDataBuilder::gather_terminator (cognitive 20): MoveDataBuilder::gather_terminator has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, loops 6, match/switch 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":"compiler/rustc_mir_dataflow/src/move_paths/builder.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17e4a1cfbb995a18902907279be06fe539638bfe3c24495cd63dae51aa13b9e"}},{"ruleId":"D2","level":"warning","message":{"text":"DropCtxt::open_drop_for_array (cognitive 20): DropCtxt::open_drop_for_array has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, match/switch 3, boolean chains 2, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/elaborate_drop.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f978fb8bccd0a5ff6dd25a565623f16557a973632995aae87a49173cf3d1e2d"}},{"ruleId":"D2","level":"warning","message":{"text":"TOFinder::process_assign (cognitive 20): TOFinder::process_assign has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, match/switch 5, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d9ba47c33d1939ec0bcdabbd8a0cbf6fcf0b61ffa128044ca188c5b628e973"}},{"ruleId":"D2","level":"warning","message":{"text":"Promoter::promote_temp (cognitive 20): Promoter::promote_temp has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, match/switch 6, loops 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":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"c005fff9b79b575095682fd5f0b12d9753d3c1fec58a5978fac714e75099eb88"}},{"ruleId":"D2","level":"warning","message":{"text":"SimplifyConstCondition::run_pass (cognitive 20): SimplifyConstCondition::run_pass has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9, boolean chains 5, loops 3, match/switch 3 (nesting depth added 7). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/simplify_branches.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a7c8f539c2dcf881f74265bf5c46d063bcfeb162457554ebf9d537e4d5a5ba"}},{"ruleId":"D2","level":"warning","message":{"text":"ffi_unwind_calls::has_ffi_unwind_calls (cognitive 20): ffi_unwind_calls::has_ffi_unwind_calls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, match/switch 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/ffi_unwind_calls.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa39eb3d80ef7112bae820a2ce6bc738be60385961fcb029211a15ce3505cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"jump_threading::simplify_conditions (cognitive 20): jump_threading::simplify_conditions has cognitive complexity 20 (threshold 15). Drivers by points: loops 12, if/else 5, match/switch 3 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20fa9cb80bf4204640374d7d1ad4e738530c829ef532440f76255fd879659ce"}},{"ruleId":"D2","level":"warning","message":{"text":"RootCollector::process_item (cognitive 20): RootCollector::process_item has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, match/switch 4, 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":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d6f439243430fa1b767e7482dae0351b763ebd10d3c6e9ea225d5d76bc440b"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalCtxt::try_assemble_bounds_via_registered_opaques (cognitive 20): EvalCtxt::try_assemble_bounds_via_registered_opaques has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, loops 3, match/switch 3, 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":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"a485e95639e195724c9dd8d6fe850c6b33809c886d5669140a2f32b780913e63"}},{"ruleId":"D2","level":"warning","message":{"text":"canonical::compute_query_response_instantiation_values (cognitive 20): canonical::compute_query_response_instantiation_values has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, loops 2, match/switch 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/canonical/mod.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"14047b0f02a7870518fb4af48419057356696de350cb0101b4b7dd1aa97e53a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_ty_param (cognitive 20): Parser::parse_ty_param has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, match/switch 3, 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":"compiler/rustc_parse/src/parser/generics.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac5c615b03e9c99b011a74f1696376957bf0fdf42b457041ca5d3e906b7cddd"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_item_list (cognitive 20): Parser::parse_item_list has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, boolean chains 4, 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd53525bf5f94244ce5f6dcc9ec48782e4dc4fc733d232d5ad6c8668520a584"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_enum_variant (cognitive 20): Parser::parse_enum_variant has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, match/switch 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ed5b5ab74ac6c97af8633f849ad308aeda698152a339944f171ff92a114de3"}},{"ruleId":"D2","level":"warning","message":{"text":"LanguageItemCollector::collect_item (cognitive 20): LanguageItemCollector::collect_item has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, match/switch 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/lang_items.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"676deed8cfb8df90d53e71c8720343a4f26be4df6103fa0628d3f1477e5f51b2"}},{"ruleId":"D2","level":"warning","message":{"text":"usefulness::collect_overlapping_range_endpoints (cognitive 20): usefulness::collect_overlapping_range_endpoints has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, 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":"compiler/rustc_pattern_analysis/src/usefulness.rs"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"7620af839a8e0e54432484cb73a31cccb9e8ae6cf9660c3561c4bd3156cd3e5f"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::build_reduced_graph_for_item (cognitive 20): DefCollector::build_reduced_graph_for_item has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, loops 3, 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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7538f66ba0f185886766eab8e0b13027dab2c276ef095c5344e2dfcc0d543ca"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::lookup_doc_alias_name (cognitive 20): LateResolutionVisitor::lookup_doc_alias_name has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, loops 5, 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6232e3776a8a644ea88a326556b66191f87eab8687bd0fa6c2baca00d24af02"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::resolve_qpath (cognitive 20): LateResolutionVisitor::resolve_qpath has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, match/switch 3, 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":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":4904}}}],"partialFingerprints":{"codehealthFindingId/v1":"951edc025763d8f7f0c8ad4ce8733397b405f0160509646508a55d6e3df6802e"}},{"ruleId":"D2","level":"warning","message":{"text":"x86_win64::compute_abi_info (cognitive 20): x86_win64::compute_abi_info has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, boolean chains 3, match/switch 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/x86_win64.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fe0f56d17f54782681582538bb9f4ba39d1a3491881ec7d6ff25d48865b5c6"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::type_error_additional_suggestions (cognitive 20): TypeErrCtxt::type_error_additional_suggestions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, boolean chains 4, 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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1bff4cd04f0dc2e4e5da998d2a6b31ae936c70f04b3be7d816bf43f05ccc58"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::check_on_type_error_attribute (cognitive 20): TypeErrCtxt::check_on_type_error_attribute has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, loops 6 (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":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73167d74d74c10b7eeb54fe3308b9edfa7a1a32f94e033872c81570fd69a642"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::report_region_errors (cognitive 20): TypeErrCtxt::report_region_errors has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, match/switch 3, 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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18fdffb875478671e3d4df5723c791dcf74dd8ac884b0fd45e8283ed73f2b24"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::suggest_for_all_lifetime_closure (cognitive 20): TypeErrCtxt::suggest_for_all_lifetime_closure has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"8049ec42bb19d06cee5b3dbfa03ecf5e07ab256285982c9dcf23bd0d4cb4df22"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::annotate_source_of_ambiguity (cognitive 20): TypeErrCtxt::annotate_source_of_ambiguity has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8, match/switch 6, boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e8d613831cfdba0fdbdad09ffd9b61138ec9a72551d71cb11a2b780140e701"}},{"ruleId":"D2","level":"warning","message":{"text":"AutoTraitFinder::evaluate_predicates (cognitive 20): AutoTraitFinder::evaluate_predicates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, loops 2, match/switch 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/auto_trait.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"043c104e7d89c476fc50cc044cc458db6b3edcbbeaf1d41da1106285177713fb"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::assemble_closure_candidates (cognitive 20): SelectionContext::assemble_closure_candidates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, match/switch 3, 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":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"82117ec8974329c9f84ea2ee2ff794a127eea7432bf3a0cddbf97722c0c6abb7"}},{"ruleId":"D2","level":"warning","message":{"text":"symbol_check::check_elf_exe_stack (cognitive 20): symbol_check::check_elf_exe_stack has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, loops 5, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/crates/symbol-check/src/main.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e1dca280dd6c04a2ef38ebe505877261e78596bd568d9517eab22e877e5ea2"}},{"ruleId":"D2","level":"warning","message":{"text":"sqrt::sqrt_round (cognitive 20): sqrt::sqrt_round has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, match/switch 4 (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":"library/compiler-builtins/libm/src/math/generic/sqrt.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e7179ea4ad18bc1b0d56f16424fac6f29b02cef5bcaab152a5a197348fcc2e"}},{"ruleId":"D2","level":"warning","message":{"text":"jn::yn (cognitive 20): jn::yn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, boolean chains 2, loops 2, 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":"library/compiler-builtins/libm/src/math/jn.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"be36d7d3c762f9d0ea2d2789773772c2a67c865c257aea64eea9cb0e5609f2ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Channel::start_recv (cognitive 20): Channel::start_recv has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, match/switch 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/mpmc/array.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac639c6847f547db9013b14c0efb452534f6b6328d85f95d797d64f0640cce3b"}},{"ruleId":"D2","level":"warning","message":{"text":"RwLock::lock_contended (cognitive 20): RwLock::lock_contended has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, loops 4, match/switch 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/sync/rwlock/queue.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52087faf8c20a0030eea35be7b0618f78c5f55e1d87e8c9600ef0ac20eeb716"}},{"ruleId":"D2","level":"warning","message":{"text":"RwLock::unlock_queue (cognitive 20): RwLock::unlock_queue has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, match/switch 3, boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/sync/rwlock/queue.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f77c134b72c5ad5cf0c66b82b57f709ae8b00ce00ef626b070cf61420fe3e04"}},{"ruleId":"D2","level":"warning","message":{"text":"child_pipe::child_pipe (cognitive 20): child_pipe::child_pipe has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, match/switch 3, boolean chains 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":"library/std/src/sys/process/windows/child_pipe.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bd9e387253fc48bb743f4c47e4000e190fec6defaa959342427b2b01e5e654"}},{"ruleId":"D2","level":"warning","message":{"text":"windows::append_arg (cognitive 20): windows::append_arg has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, boolean chains 2, 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":"library/std/src/sys/args/windows.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e883549bc6bd0e83ecce6c8ae32464431afeeac942a0cffe82d95d15dd69adf3"}},{"ruleId":"D2","level":"warning","message":{"text":"Wildcard::from_str (cognitive 20): Wildcard::from_str has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, 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":"library/stdarch/crates/stdarch-gen-arm/src/wildcards.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71c3167aadacfc8e7d4e1f24de3816b423ff2318a7f4324b47e9ff7546ea82a"}},{"ruleId":"D2","level":"warning","message":{"text":"Std::run (cognitive 20): Std::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, loops 3, match/switch 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/doc.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"76546e1f756a994e6a0232e2bd3d0caae6beb21b338f2cab7313146fce6b8bb7"}},{"ruleId":"D2","level":"warning","message":{"text":"Vendor::run (cognitive 20): Vendor::run has cognitive complexity 20 (threshold 15). Drivers by points: loops 9, if/else 8, match/switch 3 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/vendor.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19c2dc1feb919166b22d9421d855230bc0e86a1342642378700198330e5f8b6"}},{"ruleId":"D2","level":"warning","message":{"text":"tool::prepare_tool_cargo (cognitive 20): tool::prepare_tool_cargo has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, boolean chains 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":"src/bootstrap/src/core/build_steps/tool.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"108c0aa4387e6c73297de6d52b6ec9d4faacc0c548cdd01f0324d3b1cda099e4"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis::report_test_diffs (cognitive 20): analysis::report_test_diffs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7, loops 7, match/switch 6 (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 4 belong to 2 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ci/citool/src/analysis.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97e49d0ca110a18b7ad250b34fd80f001eb2edbdaf1c5da878e0f704c214913"}},{"ruleId":"D2","level":"warning","message":{"text":"sembr::main (cognitive 20): sembr::main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/doc/rustc-dev-guide/ci/sembr/src/main.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acb73ae915dd62e8156d0ca22a4a6a4ab2f1ad36a5d52b72eb27f2f5c1994d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Disambiguator::from_str (cognitive 20): Disambiguator::from_str has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, loops 4, match/switch 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"f119222502406bb1e4c7e792ea1b28b47d7d323824b93efcdbc7f698ee5b6a90"}},{"ruleId":"D2","level":"warning","message":{"text":"conf::lookup_conf_file (cognitive 20): conf::lookup_conf_file has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, match/switch 4, loops 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_config/src/conf.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"522b2ed39b7c23a4a2674455f9f61bfc72a7e8d8c694c35730c9141f21ac4831"}},{"ruleId":"D2","level":"warning","message":{"text":"Casts::check_expr (cognitive 20): Casts::check_expr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/mod.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae4a7c6cb609b1d5ca47b056b3ade7a9a333b899a3b5671beb9900f85facfc4"}},{"ruleId":"D2","level":"warning","message":{"text":"UselessFormat::check_expr (cognitive 20): UselessFormat::check_expr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9, match/switch 9, boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/format.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8100728e7af0af4e73616fee260f7742e918a92b51171775708605de1eb999d6"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyNumericConstants::check_item (cognitive 20): LegacyNumericConstants::check_item has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/legacy_numeric_constants.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace0712fd5540f86968683e55db6cc1cf632b0eba32719a322d05cd6d47ea280"}},{"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 11, match/switch 5, 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":"src/tools/clippy/clippy_lints/src/manual_strip.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb02fb51b03d5a75b4b72d8a95a3fbc6b757fb2a4b70d1910d525f56c623a685"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestionMark::check_manual_let_else (cognitive 20): QuestionMark::check_manual_let_else has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, boolean chains 5, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/manual_let_else.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a9b614fb85b2eb3ec089f3965ed9bb56d02c15ce16e084061713a356804e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"regex::check_regex (cognitive 20): regex::check_regex has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, match/switch 5 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/regex.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"d075064fb556c5d4d39b6ad84f796f1a2e4b8c11f2e005e361138f6d028debf9"}},{"ruleId":"D2","level":"warning","message":{"text":"ranges::check_reversed_empty_range (cognitive 20): ranges::check_reversed_empty_range has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, match/switch 7, 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 declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/ranges.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f8470fcee9dca87ad83844f20d13a76e418e42bd34ac1e5cb22d3e0007352f"}},{"ruleId":"D2","level":"warning","message":{"text":"not_unsafe_ptr_arg_deref::check_raw_ptr (cognitive 20): not_unsafe_ptr_arg_deref::check_raw_ptr has cognitive complexity 20 (threshold 15). Drivers by points: loops 9, if/else 7, match/switch 3, 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":"src/tools/clippy/clippy_lints/src/functions/not_unsafe_ptr_arg_deref.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a652963170ba896609ac42ced375177c73b6593ae1f1106d043a1e833ffb3a8"}},{"ruleId":"D2","level":"warning","message":{"text":"lint_groups_priority::check (cognitive 20): lint_groups_priority::check has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, match/switch 3, boolean chains 2, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/cargo/lint_groups_priority.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7335e78262f8bcdfe184036a42e614b7fc0c4f9586a85c6d80f24ea4cba990"}},{"ruleId":"D2","level":"warning","message":{"text":"match_like_matches::check_match (cognitive 20): match_like_matches::check_match has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, boolean chains 6, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/match_like_matches.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c4ba19817edb84d7b6df46a9e27dd513cd74cad3283c86395d20cf28fea761"}},{"ruleId":"D2","level":"warning","message":{"text":"float_cmp::check (cognitive 20): float_cmp::check has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, boolean chains 6, match/switch 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/operators/float_cmp.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"924fedc9d1b945df42bcdec8610056ca9dcd3e859c1ea319f79a68486b8b9988"}},{"ruleId":"D2","level":"warning","message":{"text":"map_with_unused_argument_over_ranges::extract_count_with_applicability (cognitive 20): map_with_unused_argument_over_ranges::extract_count_with_applicability has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, match/switch 4, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/map_with_unused_argument_over_ranges.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b9f74b0b42e05b87684b308f9571cbbb7f49204c0537fde21ccd0b7f243afd"}},{"ruleId":"D2","level":"warning","message":{"text":"while_let_on_iterator::is_expr_same_child_or_parent_field (cognitive 20): while_let_on_iterator::is_expr_same_child_or_parent_field has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9, loops 5, match/switch 4, boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/while_let_on_iterator.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"18933c7ece420f752f47340489ed02276afd0019a0183ac2c69baa2664e48c10"}},{"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 19, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints_internal/src/lint_without_lint_pass.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcef11a1ffff6ea322f56c900566e85e93b1c9e8811430d8359105186ac29fe"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstEvalCtxt::binop (cognitive 20): ConstEvalCtxt::binop has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 14, boolean chains 3, if/else 3 (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":"src/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"d818de278f9d94b4caf0ff8e170780550be5fd7dd05d5d97c92064dee11e22d1"}},{"ruleId":"D2","level":"warning","message":{"text":"clippy_utils::is_default_equivalent_call (cognitive 20): clippy_utils::is_default_equivalent_call has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 8, match/switch 3, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"efff66c8eb46164b1e0082e619f094b7a56758676e1067b478e983195daa741c"}},{"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 17, match/switch 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":2681}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7a092795d2fbc4f4f1f2bfa7b6a04f7008880f1360ae06db04cf7c4f649a56"}},{"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 16, loops 2, 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":"src/tools/clippy/lintcheck/src/main.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"322a8bc718a2847fb9ef10bb0410b952c1fbd640d02eb97ec5eaea3db3f33bd0"}},{"ruleId":"D2","level":"warning","message":{"text":"lintcheck::lintcheck (cognitive 20): lintcheck::lintcheck has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, loops 4, match/switch 1 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/lintcheck/src/main.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15befc15f6b68dc706271bd5492ec3635ae3508253f860b9511da41af678c40"}},{"ruleId":"D2","level":"warning","message":{"text":"opt_dist::execute_pipeline (cognitive 20): opt_dist::execute_pipeline has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, loops 3, boolean chains 2, match/switch 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/opt-dist/src/main.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"193f26a450bdad641828291108ae9322f833fa4c82895fd62185f188cde5bdd2"}},{"ruleId":"D2","level":"warning","message":{"text":"InactiveReason::fmt (cognitive 20): InactiveReason::fmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, match/switch 6, loops 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/cfg/src/lib.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ddc18766f0ef9d2738faca6d9b14e400272344def3169f1bad4c6b83f49676"}},{"ruleId":"D2","level":"warning","message":{"text":"source_analyzer::resolve_hir_path_ (cognitive 20): source_analyzer::resolve_hir_path_ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, match/switch 5, 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":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f20564274639695358ea33d77017338f534d1d12b61f361a96ec050b972a3a"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::update_recursive (cognitive 20): DefCollector::update_recursive has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, match/switch 8, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02697a6c0f5c7b2cbe203cf0b77a4b5d4833e333c7cf49032f6eb32a2557a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"ModCollector::collect_macro_def (cognitive 20): ModCollector::collect_macro_def has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, match/switch 4, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":2577}}}],"partialFingerprints":{"codehealthFindingId/v1":"920cb13e52c9bde5efd9c43d6a39909081589478f0b8e1cb145fbdd5ef9f1c98"}},{"ruleId":"D2","level":"warning","message":{"text":"fn_macro::cfg_select_expand (cognitive 20): fn_macro::cfg_select_expand has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, match/switch 5, boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51f4f259ee9d58466a785f9b09932644403593ca8ab12e1781cdf0792765735"}},{"ruleId":"D2","level":"warning","message":{"text":"Coerce::coerce_borrowed_pointer (cognitive 20): Coerce::coerce_borrowed_pointer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, match/switch 3, boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8020d5d2c9075ebf4e4c94bdf34f180237196f56e8bdc85bc6f418f9ba2070e"}},{"ruleId":"D2","level":"warning","message":{"text":"MirLowerCtx::lower_params_and_bindings (cognitive 20): MirLowerCtx::lower_params_and_bindings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, boolean chains 2, loops 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":1879}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd4fd05fda219eb2a0e58e86b8082835a37038dd1b7945cb1dd682d58021932"}},{"ruleId":"D2","level":"warning","message":{"text":"InferCtxt::query_response_instantiation_guess (cognitive 20): InferCtxt::query_response_instantiation_guess has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, match/switch 4, loops 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35965f2f5afb20e1135b6be53dea13f3a3f38696c15b2e22f6d7ed8e6067d12"}},{"ruleId":"D2","level":"warning","message":{"text":"util::sizedness_fast_path (cognitive 20): util::sizedness_fast_path has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, boolean chains 4, loops 3, 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":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/util.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a5a914cbee4b871ec405104be9d211172c94e0c3a0218327371b7982d65f93"}},{"ruleId":"D2","level":"warning","message":{"text":"typing::on_eq_typed (cognitive 20): typing::on_eq_typed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, boolean chains 3 (nesting depth added 1). Most of this is not in the body itself: 5 of the 20 points are its own statements and the rest belongs to 3 function items declared inside it (assign_expr, let_stmt, assign_to_eq). 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":"src/tools/rust-analyzer/crates/ide/src/typing.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"4882f01bcdd461dad202b9f36f3bf34437fe244cc5c3a8ecb20109db83aa2623"}},{"ruleId":"D2","level":"warning","message":{"text":"goto_type_definition::goto_type_definition (cognitive 20): goto_type_definition::goto_type_definition has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, match/switch 4, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/goto_type_definition.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d29a5f08c1e77ec45816e1a3756c3304b95ec51446d531be2c6db7de44e6580"}},{"ruleId":"D2","level":"warning","message":{"text":"render::try_expr (cognitive 20): render::try_expr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, boolean chains 2, 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":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"670010c7620bddf1508d5d5767e15d060cbed82bb52fe1cab89902633aeb7830"}},{"ruleId":"D2","level":"warning","message":{"text":"rename::find_definitions (cognitive 20): rename::find_definitions has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 10, if/else 9, boolean chains 1 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a615b58548c422597d88aafd37a4b18e74676c93307af2eb0d301f1b3dd9262e"}},{"ruleId":"D2","level":"warning","message":{"text":"extend_selection::try_extend_selection (cognitive 20): extend_selection::try_extend_selection has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, boolean chains 3, match/switch 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/extend_selection.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fb306d2a014c65731436cc906803642d8f12ed4e2a9a493b7f25d5b3c100a7"}},{"ruleId":"D2","level":"warning","message":{"text":"call_hierarchy::incoming_calls (cognitive 20): call_hierarchy::incoming_calls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, match/switch 5, loops 3, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/call_hierarchy.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1a96d9b363428f536e67600ebbde79ad2623bd1098d458cb330528fc61eff9"}},{"ruleId":"D2","level":"warning","message":{"text":"Anchor::from (cognitive 20): Anchor::from has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, boolean chains 3, match/switch 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_variable.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a16ff2352daaf4163ad4cd8658e72514022d6d882c8a86df8bd45340fb1065"}},{"ruleId":"D2","level":"warning","message":{"text":"move_guard::move_arm_cond_to_match_guard (cognitive 20): move_guard::move_arm_cond_to_match_guard has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, match/switch 7, boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/move_guard.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"183ba6e0131ac4fba29655a9921ac15e0b8a44489085096042833a9294b55d07"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_function::fix_param_usages (cognitive 20): extract_function::fix_param_usages has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9, loops 5, boolean chains 3, match/switch 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15e354402f37cfbf9098d45b64ba25dc2cacdb4023985775562646f0bd11089"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplacementRenderer::render_token (cognitive 20): ReplacementRenderer::render_token has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, match/switch 4, boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-ssr/src/replacing.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c533c6811c469332267c4f280048cf822d4f4e73205621e5dd6cea79cd3549"}},{"ruleId":"D2","level":"warning","message":{"text":"params::list_ (cognitive 20): params::list_ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, match/switch 5, boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/params.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4838af3f35ce83bc2faf10b1b6e3a62f6235c74148c16e2b1d714a387434887"}},{"ruleId":"D2","level":"warning","message":{"text":"notification::handle_did_save_text_document (cognitive 20): notification::handle_did_save_text_document has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, boolean chains 4, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/notification.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4f06e90a796c31ead38d102f92dd6e291b7dd80c3ea775e7e3ea3c2437632a"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::needs_parens_in_expr (cognitive 20): Expr::needs_parens_in_expr has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 7, match/switch 3 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/prec.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2dbec408246eb1f2b2ff4720f3bf08f74719c3d65e089aa1d82a772a524342"}},{"ruleId":"D2","level":"warning","message":{"text":"lints::generate_descriptor_clippy (cognitive 20): lints::generate_descriptor_clippy has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, loops 3, match/switch 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/xtask/src/codegen/lints.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f59cf914b6c765a8d23ff805682808a07aef154e911e565c0abebc24cc28b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Chain::from_ast (cognitive 20): Chain::from_ast has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, match/switch 5, boolean chains 2, loops 2 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 4 belong to 2 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/chains.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcf72a31b24be2b1caa7bdec308b122fe5d917e6ca484695d762bfa0a180e84"}},{"ruleId":"D2","level":"warning","message":{"text":"FmtVisitor::visit_stmt (cognitive 20): FmtVisitor::visit_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, 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":"src/tools/rustfmt/src/visitor.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff995b8e442fa971654ee0258373f8ae64e077c1fceed6766593ef647e1012df"}},{"ruleId":"D2","level":"warning","message":{"text":"matches::flatten_arm_body (cognitive 20): matches::flatten_arm_body has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/matches.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0afbe8876fc6a25c30d26ec9304c1848b10e59f62d247c3aa930d49d5a73fb"}},{"ruleId":"D2","level":"warning","message":{"text":"items::compute_budgets_for_params (cognitive 20): items::compute_budgets_for_params has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 10, if/else 9, boolean chains 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":2904}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dbdf2e5b65f2c41c4884ba7781bae4d4201bafc697b1e7a0da750a9d8ba18a"}},{"ruleId":"D2","level":"warning","message":{"text":"error_codes::check_error_codes_used (cognitive 20): error_codes::check_error_codes_used has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, loops 4, boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/error_codes.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04ae819df714259b351c28fe52420fb7e2e817038eaf2d384b9f5ae25c0dc6b"}},{"ruleId":"D2","level":"warning","message":{"text":"searchLev (cognitive 20): searchLev has cognitive complexity 20 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cdb076c73107b0d8337b5cdaf74d037f6c9ced6381dcdc09c4b682b85b5aa6"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_legacy_const_generics (cognitive 19): LoweringContext::lower_legacy_const_generics has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, loops 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1468e477f800f274ac0e6952dd2ed3d6694faead8dee80ac24df19cf88b2539"}},{"ruleId":"D2","level":"warning","message":{"text":"ast_validation::validate_generic_param_order (cognitive 19): ast_validation::validate_generic_param_order has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7, match/switch 7, loops 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":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d962a582cc5057230283ad153cff88ed4b52a20e68a635d481f9c88c9e684fb0"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_expr_struct (cognitive 19): State::print_expr_struct has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 2, loops 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":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0ad918fc81516a5a79a5de5cb9979975834e90b5df8d5d82a987021b33f829"}},{"ruleId":"D2","level":"warning","message":{"text":"PatchableFunctionEntryParser::convert (cognitive 19): PatchableFunctionEntryParser::convert has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, match/switch 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/codegen_attrs.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"5704bf0c9d77a34e9355502f8adcc4f8d2c5b9e8fe6b90ff79c2b940213d23b1"}},{"ruleId":"D2","level":"warning","message":{"text":"cfg_select::lint_unreachable (cognitive 19): cfg_select::lint_unreachable has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 17, loops 2 (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":"compiler/rustc_attr_parsing/src/attributes/cfg_select.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"548b35bab5a96b8a0715c71c009536d09844ae7c469989909e2d19b77486c1ec"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::expr_to_lit (cognitive 19): parser::expr_to_lit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 2, match/switch 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":"compiler/rustc_attr_parsing/src/parser.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"0294dfa4e6dbe1a4c3dfbf4ffae2a5a2e7d85c5211cce5623f46bc6790e5692b"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::explain_why_borrow_contains_point (cognitive 19): MirBorrowckCtxt::explain_why_borrow_contains_point has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"486332b85c821cd0ef66028e07ef7c7f0720ddd6cb2ab3a23b6f7a1dd106f826"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::add_borrow_suggestions (cognitive 19): MirBorrowckCtxt::add_borrow_suggestions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, boolean chains 2, 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":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b5952f1cef464b77314d50bda214aa5ea45bfc907fb55b449839768335b622"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::expected_fn_found_fn_mut_call (cognitive 19): MirBorrowckCtxt::expected_fn_found_fn_mut_call has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, match/switch 5, 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":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"6faf45bc0940bc7c0ce6014ca756ac34a32da3e5bd68d5e926c328466c5fd3bf"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::check_call_dest (cognitive 19): TypeChecker::check_call_dest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4a8c38e2041545f9b2e71265b7ac981917a463214942879f1f61f19dcca19c"}},{"ruleId":"D2","level":"warning","message":{"text":"MethodDef::expand_enum_method_body (cognitive 19): MethodDef::expand_enum_method_body has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, match/switch 4, boolean chains 3 (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":"compiler/rustc_builtin_macros/src/deriving/generic/mod.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e5c8366224526c6062610bcf6658306bc83dc34646262d5c04104225db7ecc"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigInfo::parse_argument (cognitive 19): ConfigInfo::parse_argument has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 13, if/else 6 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/build_system/src/config.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e96ddc78911fe11ef0ad8f185e4872c65ee328de63348f816a8849df7944e7"}},{"ruleId":"D2","level":"warning","message":{"text":"y::main (cognitive 19): y::main has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 11, if/else 7, loops 1 (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":"compiler/rustc_codegen_cranelift/build_system/main.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1ce6a02194f2e012a30af862fdf3d30038951d0a0a9804ef601cfd54aa110a"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_codegen_cranelift::build_isa (cognitive 19): rustc_codegen_cranelift::build_isa has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, match/switch 4 (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":"compiler/rustc_codegen_cranelift/src/lib.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8b56068227b70b335281326a4014c8fd5e0d78adfd08e78c59d4e728f1cdb1"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::shuffle_vector (cognitive 19): Builder::shuffle_vector has cognitive complexity 19 (threshold 15). Drivers by points: loops 11, if/else 8 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"7938c07c3e11afd14592c868ed8d2afa440f5dfa84cdde3c0ca44d1e169808ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::codegen_llvm_intrinsic_call (cognitive 19): Builder::codegen_llvm_intrinsic_call has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, match/switch 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"717b696b9dc5aef3ce933fe4bc325fee89c016375bac1401fad639213ef4c760"}},{"ruleId":"D2","level":"warning","message":{"text":"lto::thin_lto (cognitive 19): lto::thin_lto has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, loops 3, match/switch 2, 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":"compiler/rustc_codegen_llvm/src/back/lto.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cbee9ecc4e37afcc2f41a9c951d6dc829561dfd1779205531fb2220e29b133"}},{"ruleId":"D2","level":"warning","message":{"text":"codegen_attrs::apply_overrides (cognitive 19): codegen_attrs::apply_overrides has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, 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":"compiler/rustc_codegen_ssa/src/codegen_attrs.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf1c0cde11bfb228000b86b5553e99fc93f4c1e2780ecc4123a138f7e2dc0d7"}},{"ruleId":"D2","level":"warning","message":{"text":"raw_dylib::collate_raw_dylibs_windows (cognitive 19): raw_dylib::collate_raw_dylibs_windows has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, loops 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":"compiler/rustc_codegen_ssa/src/back/link/raw_dylib.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"758fabb378297969e0af465227710e92959edcdc68ec0266af6e4f8536246cff"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze::cleanup_kinds::propagate (cognitive 19): analyze::cleanup_kinds::propagate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, match/switch 6, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/analyze.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f85cb625ecef1e55ecffe88f7d69076c7ae7fe4b4ccb3f6a78ec5a08d5f9ca2"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpCx::mem_copy_repeatedly (cognitive 19): InterpCx::mem_copy_repeatedly has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, loops 4, 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":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf8f323df38585a5f9863b8d61c2a861b8c464207a4e6516810f4614618de87"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidityVisitor::aggregate_field_path_elem (cognitive 19): ValidityVisitor::aggregate_field_path_elem has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, match/switch 7, 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":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"02836261941b6241272e90d51ec636437113fff5111aa98099487ccd151e4076"}},{"ruleId":"D2","level":"warning","message":{"text":"check_validity_requirement::check_validity_requirement_lax (cognitive 19): check_validity_requirement::check_validity_requirement_lax has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, loops 4, match/switch 4, 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":"compiler/rustc_const_eval/src/util/check_validity_requirement.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a8671e637a36e414017f02fe3758bb771ce3e6ee604d5f0a5ff8ecb5c4507d"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_driver_impl::report_ice (cognitive 19): rustc_driver_impl::report_ice has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, match/switch 2, 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":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"83188382116b901729c822b689468e340e703b4b169cd5de03c61f6fca67e4a8"}},{"ruleId":"D2","level":"warning","message":{"text":"wfcheck::gather_gat_bounds (cognitive 19): wfcheck::gather_gat_bounds has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, loops 5, 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"413abdf6689ce0b34c03ad6d029ad6810f4ee3e024ab5b29fad7df3b12d25dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"wfcheck::check_param_wf (cognitive 19): wfcheck::check_param_wf has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 11, if/else 7, boolean chains 1 (nesting depth added 10). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f9f2d49992ca4a89acb9ea61a79677225cdc6f815f88a05cf54756282d7001"}},{"ruleId":"D2","level":"warning","message":{"text":"item_bounds::remap_gat_vars_and_recurse_into_nested_projections (cognitive 19): item_bounds::remap_gat_vars_and_recurse_into_nested_projections has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, match/switch 7, loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/item_bounds.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41777c4ea0e3420542bbe6863d900ec90ce4a10b8aa44d8687af809b91d1ee7"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprUseVisitor::walk_expr (cognitive 19): ExprUseVisitor::walk_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, loops 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":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e2e419813e5a1a716098273d4685374a5f7b31d54863300c3235405f3fc12b"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_with_expectation_and_args (cognitive 19): FnCtxt::check_expr_with_expectation_and_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, match/switch 3, 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":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf400f130952c2257a6970781d88341ce2a042532ab1a0318cb3a8b126ac50b1"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_calling_field_as_fn (cognitive 19): FnCtxt::suggest_calling_field_as_fn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, match/switch 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":2825}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a91716331f63d7015700a597a211382101d2f8230e8ad8471875a28b700ff7"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::error_inexistent_fields (cognitive 19): FnCtxt::error_inexistent_fields has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, match/switch 4, 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":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"54796eabca0db7e037ede56e93f131946b0fbf18ef599d5f8e16a0446b6571f3"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::try_index_step (cognitive 19): FnCtxt::try_index_step has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, match/switch 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/place_op.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03aea2c0e7b53504711311f66beb4ee9ac2f3bfe70f5a98145b4f7e2119f9fa"}},{"ruleId":"D2","level":"warning","message":{"text":"ProbeContext::assemble_extension_candidates_for_trait (cognitive 19): ProbeContext::assemble_extension_candidates_for_trait has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, loops 7 (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":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7135a92a4b368054cfc97afa8340edf3c189452bb399b7e1ec3db8ac1e05513"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::lookup_import_candidates (cognitive 19): Resolver::lookup_import_candidates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, match/switch 4, boolean chains 2, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":1830}}}],"partialFingerprints":{"codehealthFindingId/v1":"054a1366d1e3f2da09d6c5af0cf373cefb75334aba4eb4e090fa2866f37e479e"}},{"ruleId":"D2","level":"warning","message":{"text":"Canonicalizer::fold_ty (cognitive 19): Canonicalizer::fold_ty has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, match/switch 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":"compiler/rustc_infer/src/infer/canonical/canonicalizer.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"be32add400b408536b079cf62c8676cc7f5f74fb446268f6a7dafc3e214deabd"}},{"ruleId":"D2","level":"warning","message":{"text":"passes::configure_and_expand (cognitive 19): passes::configure_and_expand has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf2df203017542731eb0fff60f40f9761c35087b14c8882024260c0556c6568"}},{"ruleId":"D2","level":"warning","message":{"text":"passes::write_dep_info (cognitive 19): passes::write_dep_info has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, 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":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"41be04650a378189232a4630b4b4ee6846e190467b64608f7f2038faf7814d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor::frontmatter (cognitive 19): Cursor::frontmatter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, boolean chains 3, loops 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"479759098910423d66c294067a4dbabf939f76dd793182874e086fc450b22e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"types::lint_wide_pointer (cognitive 19): types::lint_wide_pointer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, 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":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed187c776a9e9b9bf693acd161c81572fbbb6a9adf690f54bfd41b6e87cd1e3"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_log::init_logger_with_additional_layer (cognitive 19): rustc_log::init_logger_with_additional_layer has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 15, if/else 4 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_log/src/lib.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"183c62dacac30245e1ed63dd27e8f80ed45ced68b1ccd2fdb6de6e0bc9e3f23f"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticDeriveVariantBuilder::generate_structure_code_for_attr (cognitive 19): DiagnosticDeriveVariantBuilder::generate_structure_code_for_attr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, match/switch 4, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/diagnostics/diagnostic_builder.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5c30a6616d1ff9f3aa641115e9c6cc0ae2576068ec5eec8d3fe60266e773d4"}},{"ruleId":"D2","level":"warning","message":{"text":"CrateLocator::find_commandline_library (cognitive 19): CrateLocator::find_commandline_library has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64a7af03553c114fdcceffcce689d9d08613569d5f56462caa726ab191996cd"}},{"ruleId":"D2","level":"warning","message":{"text":"native_libs::collect (cognitive 19): native_libs::collect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/native_libs.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90945b154db75c65736bd41fcdd7c5721b0934f98717e8ad7f3b465a3771139"}},{"ruleId":"D2","level":"warning","message":{"text":"EffectiveVisibilities::check_invariants (cognitive 19): EffectiveVisibilities::check_invariants has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, 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":"compiler/rustc_middle/src/middle/privacy.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2446dc8aa1f1378572a53997d83b06db26d38519c7fdbc9f477e34ccd0fca9a9"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminatorKind::successors_mut (cognitive 19): TerminatorKind::successors_mut has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, loops 4, 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":"compiler/rustc_middle/src/mir/terminator.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4d30dd9bbb3af315a22a2f61b497f1287721298f520bb20da695de0ddef2a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::args_and_body (cognitive 19): Builder::args_and_body has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, match/switch 4, boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe269d5f45713e234e758c1023e4108fb8138c711b98ae17e563ccecc51b29f0"}},{"ruleId":"D2","level":"warning","message":{"text":"VnState::simplify_aggregate (cognitive 19): VnState::simplify_aggregate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 3, match/switch 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2da5b7881bb896de1e0dbe8fefcc09b7912f82591e1331e542393c81758c49"}},{"ruleId":"D2","level":"warning","message":{"text":"cycle::process (cognitive 19): cycle::process has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, 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":"compiler/rustc_mir_transform/src/inline/cycle.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f0ceb0a8ec4b2c3ec26be230225f6436fe0d76cee0c1a5fa00951040641c49"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::maybe_report_guarded_str (cognitive 19): Lexer::maybe_report_guarded_str has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"841234fadff801a3a212979b118782802a0d6a0c936d6e5cb3743315a62ebe87"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_expr_dot_or_call_with (cognitive 19): Parser::parse_expr_dot_or_call_with has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, boolean chains 2, match/switch 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d315cdc4cb04bad670262551b324037633f19c5589093874ef9d54b08f28eb1"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_expr_labeled (cognitive 19): Parser::parse_expr_labeled has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, boolean chains 6 (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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dda6d655cd1e292ac25dc38b3711e59d3053fa433307c6fdc3169162237898e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::error_fn_body_not_found (cognitive 19): Parser::error_fn_body_not_found has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, match/switch 4, 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":2829}}}],"partialFingerprints":{"codehealthFindingId/v1":"42513131c5f9dabf1a74df97a21de1c465b37cb5791ce487c169e048c6e5e885"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_self_param (cognitive 19): Parser::parse_self_param has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, boolean chains 6, match/switch 4 (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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":3535}}}],"partialFingerprints":{"codehealthFindingId/v1":"226710e8a32ad24b2cd823397146c64957a0a1c4426aa68d5624a053be65c923"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::nonterminal_may_begin_with (cognitive 19): Parser::nonterminal_may_begin_with has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 15, boolean chains 4 (nesting depth added 7). Of this number, 18 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/nonterminal.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"583bda090b356789c80e1097dbd298e128c355089c7f4be7ade650c0177e9720"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckAttrVisitor::check_proc_macro (cognitive 19): CheckAttrVisitor::check_proc_macro has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, match/switch 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":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d7532103508b73fa3c1eef4d9c496a989735afc38372f3732fe2d67bf63745"}},{"ruleId":"D2","level":"warning","message":{"text":"DeadVisitor::lint_at_single_level (cognitive 19): DeadVisitor::lint_at_single_level has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, boolean chains 2, 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":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"938d469e017f011cb24fbc144eae5e9138a76568f19fd5b900cf62628d89ac0e"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::suggest_trait_and_bounds (cognitive 19): LateResolutionVisitor::suggest_trait_and_bounds has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, boolean chains 2, loops 2, 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":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"de62a4950fc73ac3d8dfd6bb9466e3a56757c6123f7098d2b2b1ad9dc59cbd0b"}},{"ruleId":"D2","level":"warning","message":{"text":"s390x::classify_arg (cognitive 19): s390x::classify_arg has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, match/switch 4, boolean chains 2 (nesting depth added 5). 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":"compiler/rustc_target/src/callconv/s390x.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2720043964c6ed56245740a884bbb42fe1e93cdce89d4eb0f387b9d7f12ec522"}},{"ruleId":"D2","level":"warning","message":{"text":"x86_64::classify_arg (cognitive 19): x86_64::classify_arg has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, loops 12, match/switch 5, 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":"compiler/rustc_target/src/callconv/x86_64.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4342af83f988113c4fbd3dfb9c171d1fe15f35da2b00be026774f7fb5db4b5"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::assemble_builtin_copy_clone_candidate (cognitive 19): SelectionContext::assemble_builtin_copy_clone_candidate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, match/switch 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3178b39cac1240d837d7a4ea8d056e4170ad6d07f5b6956d2e356c45576f9fe1"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionContext::evaluate_trait_predicate_recursively (cognitive 19): SelectionContext::evaluate_trait_predicate_recursively has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, loops 3, boolean chains 2 (nesting depth added 5). 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":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"d737a9ff283106a61322a9f145a3529b4d5cf9644bc28ff570a0d17ea22f00c5"}},{"ruleId":"D2","level":"warning","message":{"text":"outlives_for_liveness::args_known_to_outlive_opaque_params (cognitive 19): outlives_for_liveness::args_known_to_outlive_opaque_params has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6, loops 6, match/switch 6, 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":"compiler/rustc_trait_selection/src/traits/outlives_for_liveness.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68f59d22ca0cd83c0c46a2b07e96b19d467d5aa4bdf0e9c8f84dc01c0291f56"}},{"ruleId":"D2","level":"warning","message":{"text":"dyn_compatibility::dyn_compatibility_violations_for_assoc_item (cognitive 19): dyn_compatibility::dyn_compatibility_violations_for_assoc_item has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, match/switch 3, 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":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ad6e0db49532698b3cd06b93624fa41bee4688180089042632b7da955e46f6"}},{"ruleId":"D2","level":"warning","message":{"text":"needs_drop::drop_tys_helper (cognitive 19): needs_drop::drop_tys_helper has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8, match/switch 8, loops 2, boolean chains 1 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 3 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/needs_drop.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ed06c09d241e8e83e40516cfb357e5ad1f1cff2e705a00eb22279a041847a1"}},{"ruleId":"D2","level":"warning","message":{"text":"RegionConstraint::visit_with (cognitive 19): RegionConstraint::visit_with has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, loops 4, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2b7687bb9859dd7c39dc7d730363862f6307ef51631000bfd53966b9d1e6bc"}},{"ruleId":"D2","level":"warning","message":{"text":"tgamma::tgamma (cognitive 19): tgamma::tgamma has cognitive complexity 19 (threshold 15). Drivers by points: if/else 19 (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":"library/compiler-builtins/libm/src/math/tgamma.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"924005bffdb4d2d8414d3ad220b5c4cc443109d9d009768195b00765aafd5f1c"}},{"ruleId":"D2","level":"warning","message":{"text":"expf::expf (cognitive 19): expf::expf has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, 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":"library/compiler-builtins/libm/src/math/expf.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"849a67aebd16938f38cad192ea98dbd808370b6a2b5ed5512ac8ff416a0349b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Channel::start_send (cognitive 19): Channel::start_send has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, match/switch 2, 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":"library/std/src/sync/mpmc/list.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"709be590a48a3169fbee092640dedd6ded749f9324c3e40b4ad5c645a2bb4159"}},{"ruleId":"D2","level":"warning","message":{"text":"sgx::decode_error_kind (cognitive 19): sgx::decode_error_kind has cognitive complexity 19 (threshold 15). Drivers by points: if/else 19. 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":"library/std/src/sys/io/error/sgx.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fef4ac92071adc07688477800499f21c8a6419b29c76cd3ca71a0c62efedd0"}},{"ruleId":"D2","level":"warning","message":{"text":"Std::run (cognitive 19): Std::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, boolean chains 4, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9549114cc03fc093f996297c9069ea4098620beb7c6a3fee88f1874817528a0"}},{"ruleId":"D2","level":"warning","message":{"text":"LlvmTools::run (cognitive 19): LlvmTools::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, loops 5, boolean chains 2 (nesting depth added 7). Of this number, 10 points are the body\u0027s own statements and 9 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":2638}}}],"partialFingerprints":{"codehealthFindingId/v1":"169ba397bb648f38927d4fe7215a3dc7e927ac6f9f44058459b98816d27250f4"}},{"ruleId":"D2","level":"warning","message":{"text":"OmpOffload::run (cognitive 19): OmpOffload::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, loops 2, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"e019d9633824bd6b60b7192e9d0cf984e4b1fdd0f1faeabc21c8e8d011e07bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::download_rustc_commit (cognitive 19): Config::download_rustc_commit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, match/switch 4, boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/config.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1200ce11e9d58c2b53aefbd44fc24c9528ecf5fc308f10c258c533591fdcfe1"}},{"ruleId":"D2","level":"warning","message":{"text":"download::unpack (cognitive 19): download::unpack has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/download.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d59d1e1eb9a9dfdabdfcddc43ec161f5d4a5a4f3c0f601fee9a4ddcc042498f"}},{"ruleId":"D2","level":"warning","message":{"text":"compile::rustc_cargo_env (cognitive 19): compile::rustc_cargo_env has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 2, 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":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"f524b606c4af2ab3b43a27a0ceed2712e27d19ed0b02ccf0a6eb42b085532fbc"}},{"ruleId":"D2","level":"warning","message":{"text":"html_tags::extract_path_forward (cognitive 19): html_tags::extract_path_forward has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, loops 3, 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":"src/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bc12ac98ccc0ebfe60c10c9fa64e51fd7230ae1c4630aca1dba74e12c5c8d2"}},{"ruleId":"D2","level":"warning","message":{"text":"theme::parse_rules (cognitive 19): theme::parse_rules has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, loops 5, match/switch 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/theme.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5449abfc45813234fb445469107cdfa1b6fee290103cbd1d99771411b39374c4"}},{"ruleId":"D2","level":"warning","message":{"text":"doctest::run (cognitive 19): doctest::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, match/switch 5 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fc5e5224aa4f210687493de4f3b5e461e81443d44e498e849ec12e9cd14f03"}},{"ruleId":"D2","level":"warning","message":{"text":"PostExpansionEarlyAttributes::check_attribute (cognitive 19): PostExpansionEarlyAttributes::check_attribute has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 6, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/attrs/mod.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"492b8deb541650e08b4dba29f6bf778108e73abc18c834d8a2d985c910bb5ff6"}},{"ruleId":"D2","level":"warning","message":{"text":"Hir2Qmm::run (cognitive 19): Hir2Qmm::run has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 9, if/else 8, boolean chains 1, loops 1 (nesting depth added 7). Of this number, 18 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/booleans.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb16c4f44b1dd3513d1c13cfb7731941f7b7c6bd40a5959e108b8eb3f56f11d"}},{"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 16, boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/if_then_some_else_none.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fddd41d1983e27643cbb180f703f4daffb4a0a33a970325121d2e9ef11886cd"}},{"ruleId":"D2","level":"warning","message":{"text":"LiteralDigitGrouping::check_lit (cognitive 19): LiteralDigitGrouping::check_lit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, match/switch 3, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/literal_representation.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d275deb24cc6ec421fe5d02a88929fdf9d74850188f9f31345fc498dea2785"}},{"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 14, match/switch 3, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/utils.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed2b23a62b8533c28d3c76e91274d6f91a57d3069d147eb0357ae208f3f2d53"}},{"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 13, boolean chains 4, match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/module_style.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec16d6c8fcaa99a1fc20c47db5c532a5c8c6c302e037d3c619fd163ba65993ec"}},{"ruleId":"D2","level":"warning","message":{"text":"cast_possible_truncation::check (cognitive 19): cast_possible_truncation::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, match/switch 5, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c492eb71912f871944621211e6c6e65ea2f5521912419213ef975342007cb3"}},{"ruleId":"D2","level":"warning","message":{"text":"result::check_result_large_err (cognitive 19): result::check_result_large_err has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, boolean chains 3, loops 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/functions/result.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5120a9034f116b0061728bd46b42e3fc3610bf947937498b775046efd814c05c"}},{"ruleId":"D2","level":"warning","message":{"text":"feature_name::check (cognitive 19): feature_name::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, loops 3, boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/cargo/feature_name.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad156ead86f7476892c1bf5ecc627b85849daaad3f23feb7d2ea9aaad708e3a8"}},{"ruleId":"D2","level":"warning","message":{"text":"needless_continue::check_and_warn (cognitive 19): needless_continue::check_and_warn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/needless_continue.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3283ea3e130b5f2b6595a716460f33bc890af9061b6b4bef9b27dc7f611087"}},{"ruleId":"D2","level":"warning","message":{"text":"manual_memcpy::build_manual_memcpy_suggestion (cognitive 19): manual_memcpy::build_manual_memcpy_suggestion has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, boolean chains 3, match/switch 3 (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/manual_memcpy.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe994220b88e7aa0d072c09dd72780d76a4534d0fe7ec4caab016f6747e68ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"redundant_guards::check (cognitive 19): redundant_guards::check has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 9, if/else 5, boolean chains 4, loops 1 (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":"src/tools/clippy/clippy_lints/src/matches/redundant_guards.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8054d4440c934529275d2c0285de92135ada89433594cc853c4242c8075ab1"}},{"ruleId":"D2","level":"warning","message":{"text":"transmute_ref_to_ref::check (cognitive 19): transmute_ref_to_ref::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/transmute/transmute_ref_to_ref.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab4cfe9dca2914bf5655429069cc4071c278380f3767ad86fe6db81f17670c4"}},{"ruleId":"D2","level":"warning","message":{"text":"let_unit_value::expr_needs_inferred_result (cognitive 19): let_unit_value::expr_needs_inferred_result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/unit_types/let_unit_value.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"9399dd60f60a9e2dec8df7cc1fa2196296026fecd00b392fd51cf6006a56ff50"}},{"ruleId":"D2","level":"warning","message":{"text":"implicit_saturating_sub::check_subtraction (cognitive 19): implicit_saturating_sub::check_subtraction has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/implicit_saturating_sub.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb5ba2d428318cc294752fee25e40d588c95231262c30878652c5bbc9158080"}},{"ruleId":"D2","level":"warning","message":{"text":"HirEqInterExpr::eq_block (cognitive 19): HirEqInterExpr::eq_block has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 5, match/switch 2, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"7095bafe6a9f0f94d98fedb6d3b9161dd2440f52382b5c60abbdd35d7e8e7a63"}},{"ruleId":"D2","level":"warning","message":{"text":"eager_or_lazy::fn_eagerness (cognitive 19): eager_or_lazy::fn_eagerness has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, match/switch 6, boolean chains 4 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/eager_or_lazy.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c955911e06852a9ce80a02995ff39e04248b6fb92529b2c1ec10e2de19e230d"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::check_rustdoc_test_option (cognitive 19): TestCx::check_rustdoc_test_option has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, loops 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/runtest.rs"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12cbd6cbb0a2f3a988cbc2b1cefc56dde9dc785d502f5cb439c48ea95fb221b"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExtPriv::addr_from_alloc_id_uncached (cognitive 19): EvalContextExtPriv::addr_from_alloc_id_uncached has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/alloc_addresses/mod.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa578684baf4b85738fd804f2489cec75370dfabbe0aaa7f0de09d710326fe0"}},{"ruleId":"D2","level":"warning","message":{"text":"VClockAlloc::report_data_race (cognitive 19): VClockAlloc::report_data_race has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/concurrency/data_race.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"065e382b97f9b0e7b4d96cf9356e950e676bf5bf222cd4ecd9a853a5fea6e8ab"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::convert_path (cognitive 19): EvalContextExt::convert_path has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, match/switch 3, boolean chains 2, loops 2 (nesting depth added 3). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 2 function items declared inside it (unix_to_windows, windows_to_unix). 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":"src/tools/miri/src/shims/os_str.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f697d5e696f583730c4d29289a6921ab5bfb293087823ad30ee70ff7732129e0"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_foreign_item_inner (cognitive 19): EvalContextExt::emulate_foreign_item_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, match/switch 7, 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":"src/tools/miri/src/shims/unix/freebsd/foreign_items.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"794ee61d20c496656d0ddb1aae0cd2fc3fca5731a2623a34154db45abca2d882"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::linux_statx (cognitive 19): EvalContextExt::linux_statx has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, boolean chains 5, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"4469c547a3cfaeccf0fffd71fceb469fa2117bdada0bf54fa49a896eae049e43"}},{"ruleId":"D2","level":"warning","message":{"text":"eval::args_to_utf16_command_string (cognitive 19): eval::args_to_utf16_command_string has cognitive complexity 19 (threshold 15). Drivers by points: loops 8, if/else 7, match/switch 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/eval.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc81808a0ea2fdb244f60e51b18d8cb44a442738bac4682248ca6387bf6c791"}},{"ruleId":"D2","level":"warning","message":{"text":"helpers::iter_exported_symbols (cognitive 19): helpers::iter_exported_symbols has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 4, loops 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/helpers.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9199bc27d11711a2cc995921d3578d2162e6f19710b798fecfc0eb2689923de8"}},{"ruleId":"D2","level":"warning","message":{"text":"tactics::free_function (cognitive 19): tactics::free_function has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, match/switch 5, boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/term_search/tactics.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4549038534300ea04de9cc7391e8536da928651fda9ed7ae65f41a299f2e32a"}},{"ruleId":"D2","level":"warning","message":{"text":"display::write_fields (cognitive 19): display::write_fields has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, loops 3, 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":"src/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"614c7d959a737cc20935d455a9418f9362685bc34568a0d13ccf2ee4442b30d3"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprCollector::lower_generic_args (cognitive 19): ExprCollector::lower_generic_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, match/switch 2, boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"597393c04da7c50b129fc1c7ffabc3c8b9efddbd720246fcfaccb94ebac56935"}},{"ruleId":"D2","level":"warning","message":{"text":"Printer::print_type_bounds (cognitive 19): Printer::print_type_bounds has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 9, if/else 6, loops 4 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc2b6f119bd6d2d45d6559b7359ebc63297adf8f9a24814711c63a42ed7d577"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprUseVisitor::walk_pat (cognitive 19): ExprUseVisitor::walk_pat has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, match/switch 4, 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":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc46d0430cb81d01a53b3eccc9a7fb5248e1b34b9ef8e5d7f5903f62e6787cf"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::calculate_diverging_fallback (cognitive 19): InferenceContext::calculate_diverging_fallback has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, loops 8, match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fb5c89d615b6e1fbbf6bbba3e66c7f20a75102909a5e51b76b881f9d1f0f31"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::struct_tail_with_normalize (cognitive 19): InferenceContext::struct_tail_with_normalize has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 12, if/else 6, loops 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7a0990356223a7fec1f5b00648e682658c164173c07b9db9f73fd634316b90"}},{"ruleId":"D2","level":"warning","message":{"text":"MirPrettyCtx::blocks (cognitive 19): MirPrettyCtx::blocks has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 12, loops 7 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/pretty.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7db0091c6ffc4936106a59f2d58e592bad071ce18a2a44331bfc0dc8499dbc4"}},{"ruleId":"D2","level":"warning","message":{"text":"Canonicalizer::fold_ty (cognitive 19): Canonicalizer::fold_ty has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, match/switch 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cdd0945742d1c4d18951d8cb6d634e98939da40e727ff1af8186289db3872d"}},{"ruleId":"D2","level":"warning","message":{"text":"syntax_highlighting::string_injections (cognitive 19): syntax_highlighting::string_injections has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, 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":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b353b75e15949bb7474a0582ade1830f6fb00abffedc43bcfb24a1b4d67922"}},{"ruleId":"D2","level":"warning","message":{"text":"render::definition_owner_name (cognitive 19): render::definition_owner_name has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 16, if/else 3 (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":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e79fd70463ad16c0aaa3ece1b68ff7edaa88df5a3f988667ed5bf3bc8f3665f"}},{"ruleId":"D2","level":"warning","message":{"text":"folding_ranges::contiguous_range_for_comment (cognitive 19): folding_ranges::contiguous_range_for_comment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, boolean chains 3, 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":"src/tools/rust-analyzer/crates/ide/src/folding_ranges.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a3614b1d28c424c588f6b0d9c9d2ff97b5e919e218d18a72440146783cf8f4"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_struct_from_enum_variant::tag_generics_in_variant (cognitive 19): extract_struct_from_enum_variant::tag_generics_in_variant has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8, match/switch 7, loops 3, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_struct_from_enum_variant.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ae74fb03858c850ebc7d021081333a749f596c528375d755491483534f28c6"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_tuple_return_type_to_struct::replace_usages (cognitive 19): convert_tuple_return_type_to_struct::replace_usages has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, loops 4, match/switch 3, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_tuple_return_type_to_struct.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fd4a2646a62ddaf1f1823337f812ed39abad96a90502f510ecd7fe99b1038e"}},{"ruleId":"D2","level":"warning","message":{"text":"wrap_unwrap_cfg_attr::wrap_unwrap_cfg_attr (cognitive 19): wrap_unwrap_cfg_attr::wrap_unwrap_cfg_attr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, match/switch 5, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/wrap_unwrap_cfg_attr.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d563391d87e55daeec9f503f66ad6304f95265093d8f3d0534fe81b6a61af7"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionContext::new (cognitive 19): CompletionContext::new has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, match/switch 6, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbae2ae4c55e781b8cf2366dddd0124ff361177e1f88c35a2102ca7cd33b4053"}},{"ruleId":"D2","level":"warning","message":{"text":"function::render (cognitive 19): function::render has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 4, match/switch 4 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/render/function.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be9e6af748b4156d72ef36271bc631a39ec9cdccf84cbcbcc9a6ce68612124f"}},{"ruleId":"D2","level":"warning","message":{"text":"insert_use::insert_use_with_alias_option_with_editor (cognitive 19): insert_use::insert_use_with_alias_option_with_editor has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 9, if/else 6, boolean chains 2, loops 2 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/insert_use.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"98852e51dac6df7aab72d1abddfaf00b8b0dd1bdd4c8f3edbd43f0f444826358"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_doc::format_docs_ (cognitive 19): rust_doc::format_docs_ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/rust_doc.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8306ac6474dd18926f4ec0d8115e68566c29ad266b762d9eb9e6c61c116476"}},{"ruleId":"D2","level":"warning","message":{"text":"DeclarativeMacro::parse_macro2 (cognitive 19): DeclarativeMacro::parse_macro2 has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, match/switch 5, loops 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/lib.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"413872b2243d0382be1ca0c96da12e0265ea5f4e48b1a7ad913b25d20617a3ba"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::next_op (cognitive 19): parser::next_op has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 19 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/parser.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f978884d807038861de3dcc08524c0d6c84a314a9c6651c4cfaf91df883d4d"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::group (cognitive 19): Writer::group has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, match/switch 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4b7a2f418e55242dc3e82628d54d2896494dc60cde587d45e4e25be08d238d"}},{"ruleId":"D2","level":"warning","message":{"text":"request::handle_run_test (cognitive 19): request::handle_run_test has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8, match/switch 7, loops 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":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94189e11934d72d7e26693453e405689d01294b1b93499169f8ec1ce3856992"}},{"ruleId":"D2","level":"warning","message":{"text":"request::handle_workspace_symbol (cognitive 19): request::handle_workspace_symbol has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 10, if/else 6, boolean chains 2, loops 1 (nesting depth added 5). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 2 function items declared inside it (decide_search_kind_and_scope, exec_query). 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":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b096e25da155209dc7ce0514277d3fbc5f79e806dc08183da63a387fc10602"}},{"ruleId":"D2","level":"warning","message":{"text":"request::handle_code_action (cognitive 19): request::handle_code_action has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, loops 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":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffb205241024560c790493155637d754f3716864ca24c4a6d491cff339deabd"}},{"ruleId":"D2","level":"warning","message":{"text":"lints::generate_lint_descriptor (cognitive 19): lints::generate_lint_descriptor has cognitive complexity 19 (threshold 15). Drivers by points: loops 9, if/else 6, boolean chains 2, match/switch 2 (nesting depth added 4). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to one function item declared inside it (insert_lints). 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":"src/tools/rust-analyzer/xtask/src/codegen/lints.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"142062401b358e1ac2e947c30eaa751118451dbae9a9dcce217e953bd36d3b2a"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroArgParser::parse (cognitive 19): MacroArgParser::parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, match/switch 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/macros.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b42f19b8eb320449b2be8b2dffabea7ddfa87dd1d5c51e75eef4b204de094e"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroBranch::rewrite (cognitive 19): MacroBranch::rewrite has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, match/switch 3, boolean chains 1, 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":"src/tools/rustfmt/src/macros.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"073c2680a5bbe994cab7355bbf0bec02056180756e43a2be6a4db68effa02b03"}},{"ruleId":"D2","level":"warning","message":{"text":"FmtVisitor::visit_impl_items (cognitive 19): FmtVisitor::visit_impl_items has cognitive complexity 19 (threshold 15). Drivers by points: loops 6, if/else 5, boolean chains 4, match/switch 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0992f0a7f6e508a027f43fdf6a5b9f170b7891dc51fa08976196b3e0382d67c"}},{"ruleId":"D2","level":"warning","message":{"text":"comment::comment_style (cognitive 19): comment::comment_style has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"02df98dd8b21878bfb8bdd5858b7fe9ff415b022fd7e177ec18726ea9ca05014"}},{"ruleId":"D2","level":"warning","message":{"text":"types::format_function_type (cognitive 19): types::format_function_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, boolean chains 3, match/switch 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/types.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7b607e5eacf11b2e362ec4dd0a4f66d247950f7a5f6ab475449d509da43a64"}},{"ruleId":"D2","level":"warning","message":{"text":"cfg_select::parse_cfg_select_inner (cognitive 19): cfg_select::parse_cfg_select_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, loops 3, match/switch 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/parse/macros/cfg_select.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9145086fa245aebdbb1b0e981b9677220904b9192d5ed79fdeef1ed99038381"}},{"ruleId":"D2","level":"warning","message":{"text":"remove (cognitive 19): remove has cognitive complexity 19 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d463b5583e49b97f0f64e7a3c0a9b34004414fa37cb282b8280119def3bbad"}},{"ruleId":"D2","level":"warning","message":{"text":"transition (cognitive 19): transition has cognitive complexity 19 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":4010}}}],"partialFingerprints":{"codehealthFindingId/v1":"717f6c891cd8d374b3ac6c1e98f134ba8c0b26e793804bf178326ac36b4d95b7"}},{"ruleId":"D2","level":"warning","message":{"text":"calculate (cognitive 19): calculate has cognitive complexity 19 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec06aa533d5ed8d0f170f0804f5bb8a271aac332aca9c8118dfa785411f4157f"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 19): (anonymous) has cognitive complexity 19 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cfc90615e7f85e48682b78696d81b8e8b9e76aa8cd833c9c45a00241a8d74e"}},{"ruleId":"D2","level":"warning","message":{"text":"AttributeParser::check_target (cognitive 18): AttributeParser::check_target has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 2, 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":"compiler/rustc_attr_parsing/src/target_checking.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccb35babac53899f97a87f885822fd09b09da2832449104132476b13666ceae"}},{"ruleId":"D2","level":"warning","message":{"text":"UniversalRegionRelationsBuilder::create (cognitive 18): UniversalRegionRelationsBuilder::create has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, loops 6 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/free_region_relations.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5caf460bd62f1883c6c5ef5bce5a846747013c024eb52f647d4200cedbb9be6b"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::check_call_inputs (cognitive 18): TypeChecker::check_call_inputs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, match/switch 3, 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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2018}}}],"partialFingerprints":{"codehealthFindingId/v1":"2315929f345268872e11062ddf4c8e312234f56dd3bb3e0e2be902192be0c392"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::add_reborrow_constraint (cognitive 18): TypeChecker::add_reborrow_constraint has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 9, if/else 5, loops 4 (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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"48358618482b049f7aea77153360cd922cea3f422609131ab20f0b84c13728ea"}},{"ruleId":"D2","level":"warning","message":{"text":"contracts::expand_contract_clause (cognitive 18): contracts::expand_contract_clause has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/contracts.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"48dacfac9d18e9f8797adcebbac7e35a8bb69526236dda89bc81c079b49ed36f"}},{"ruleId":"D2","level":"warning","message":{"text":"UnwindContext::new (cognitive 18): UnwindContext::new has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, 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":"compiler/rustc_codegen_cranelift/src/debuginfo/unwind.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56da91edb02f83fc730df95f8a78da7fe7540d8a72d0df3c2f6ea7983146208"}},{"ruleId":"D2","level":"warning","message":{"text":"CPlace::write_cvalue_maybe_transmute (cognitive 18): CPlace::write_cvalue_maybe_transmute has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 13, if/else 5 (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbecac7ab2e53ff2cee0c0d69562cd5434bc5a0fae0ea627a65bf9538151b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::load_operand (cognitive 18): Builder::load_operand has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, boolean chains 1, match/switch 1 (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 4 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cac9a9aa2f3dae9310cc7f178a3c06a32fff055292756e3c0452769c3ba76d"}},{"ruleId":"D2","level":"warning","message":{"text":"callee::get_fn (cognitive 18): callee::get_fn has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/callee.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da8a323a2703ec5ca43625b60a166b6cee38f1e6f169653b609f5d29d07a41f"}},{"ruleId":"D2","level":"warning","message":{"text":"attributes::from_fn_attrs (cognitive 18): attributes::from_fn_attrs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, match/switch 3, boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/attributes.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3b7c848ac659ac8e9b21133a48d666824a1c330cfcfd0da353ad81677ed08b"}},{"ruleId":"D2","level":"warning","message":{"text":"intrinsic::intrinsic_fn (cognitive 18): intrinsic::intrinsic_fn has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 4 (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":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5218403745b648d587139fb9ac26fb5318281b6c987a0e0b54722dfe5e6e09"}},{"ruleId":"D2","level":"warning","message":{"text":"va_arg::emit_x86_64_sysv64_va_arg (cognitive 18): va_arg::emit_x86_64_sysv64_va_arg has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 10, if/else 7, loops 1 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d847df1ff8bcc0092e004d184f2e3e8085e48844f0715af9a4b0700730f810"}},{"ruleId":"D2","level":"warning","message":{"text":"type_of::uncached_llvm_type (cognitive 18): type_of::uncached_llvm_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, match/switch 8 (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":"compiler/rustc_codegen_llvm/src/type_of.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"483e36a7734ea2b905cd2ac95dda79ccc7cf17372e90918864b5f32937b192df"}},{"ruleId":"D2","level":"warning","message":{"text":"llvm_util::to_llvm_features (cognitive 18): llvm_util::to_llvm_features has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 17, boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/llvm_util.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a97a322c38284ca7039b27addaddc5020aeee0ddcb2e08f65377cb07c3caa22"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedEmitterMain::check (cognitive 18): SharedEmitterMain::check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, match/switch 8, 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":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbd2076779e4bd6465ce54c22ab5bedb41f9362cf3ebd2c14cb7d66d387c80a"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalAnalyzer::process_place (cognitive 18): LocalAnalyzer::process_place has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, loops 4, match/switch 3, 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":"compiler/rustc_codegen_ssa/src/mir/analyze.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c80629e5e9d2df83553b8a9056b8b3501cbc139ffbf6c61d177c8cc0ff3dd25"}},{"ruleId":"D2","level":"warning","message":{"text":"link::add_c_staticlib_symbols (cognitive 18): link::add_c_staticlib_symbols has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7, match/switch 6, loops 3, 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":2640}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ebc3762a621193c0705291a421cb1775319c3b131504259e8b8f30b601e3ee"}},{"ruleId":"D2","level":"warning","message":{"text":"symbol_edit::elf_edit_impl (cognitive 18): symbol_edit::elf_edit_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, boolean chains 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/symbol_edit.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2db0898516ea7b53456d2ccb01958b1b7fb162950615f151fbef0f2b23d73f4"}},{"ruleId":"D2","level":"warning","message":{"text":"rustc_driver_impl::handle_explain (cognitive 18): rustc_driver_impl::handle_explain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde5d540a8f28a475976c1f9df6c68c5f27bfbb3a43815e9e3d1761bc317d97d"}},{"ruleId":"D2","level":"warning","message":{"text":"check::check_opaque_meets_bounds (cognitive 18): check::check_opaque_meets_bounds has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, match/switch 4, loops 3 (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":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff09efa8143ef102c22b3b3faad8ca9fa6745b2d605cf93fd96a02ac61a18928"}},{"ruleId":"D2","level":"warning","message":{"text":"wfcheck::lint_redundant_lifetimes (cognitive 18): wfcheck::lint_redundant_lifetimes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, loops 5, boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":2360}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f562bef0f768819c2c597e27c28f73e3b010d00e79cbbc11557301fa8aa2260"}},{"ruleId":"D2","level":"warning","message":{"text":"compare_impl_item::collect_return_position_impl_trait_in_trait_tys (cognitive 18): compare_impl_item::collect_return_position_impl_trait_in_trait_tys has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 7, if/else 6, loops 4, 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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"1211005ef9e81740bb7dd79b41424b938defbbc6537ec0ef6dff526068772bb9"}},{"ruleId":"D2","level":"warning","message":{"text":"builtin::visit_implementation_of_const_param_ty (cognitive 18): builtin::visit_implementation_of_const_param_ty has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, loops 7, match/switch 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cf7da33fa7cc98d6e111089d6d6ee46cfe9a569272a8e35ca40f0a13ee5565"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_private_fields (cognitive 18): FnCtxt::report_private_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 4, match/switch 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":2417}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d9adfb88851107123ee6b75cfc3bdbb8cd07673e23ebf0435458e8094f2b6c"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::lint_fully_qualified_call_from_2018 (cognitive 18): FnCtxt::lint_fully_qualified_call_from_2018 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18 (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":"compiler/rustc_hir_typeck/src/method/prelude_edition_lints.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cf248dadcbcd09fbf817bb06a69e439a560140f58c2779d5e6b0af9d2d9d52"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::has_significant_drop_outside_of_captures (cognitive 18): FnCtxt::has_significant_drop_outside_of_captures has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61e396e34b4974b617c73e7041bb80dacbc1976ff80b58e45ce03ba2ddf35d8"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineAsmCtxt::get_asm_ty (cognitive 18): InlineAsmCtxt::get_asm_ty has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, match/switch 7 (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":"compiler/rustc_hir_typeck/src/inline_asm.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7987b01e0873f69f7c53cf2780cbd17eed50acc0301632e8e6dfefd66c02f99d"}},{"ruleId":"D2","level":"warning","message":{"text":"WritebackCx::visit_opaque_types (cognitive 18): WritebackCx::visit_opaque_types has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"7190aa63cb18f9658f03601a9caf67ab5eb66fd3b02394aaeeb7a4919098cae7"}},{"ruleId":"D2","level":"warning","message":{"text":"CleanVisitor::check_item (cognitive 18): CleanVisitor::check_item has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, loops 7, match/switch 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_incremental/src/persist/clean.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82927dc39c52dde4d1cfec91e14e7660bebe55ced23298898d26b78b4e0270a"}},{"ruleId":"D2","level":"warning","message":{"text":"Newtype::parse (cognitive 18): Newtype::parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, match/switch 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_index_macros/src/newtype.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e3a2b2bba013c46173928d58ede87b99526c8ea5d7457ce25f970e1107e45c"}},{"ruleId":"D2","level":"warning","message":{"text":"EllipsisInclusiveRangePatterns::check_pat (cognitive 18): EllipsisInclusiveRangePatterns::check_pat has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, match/switch 5 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 1 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/builtin.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb200248d8afa1a6412af700c266b34512873fb14ee5bb7b027fdeef557c516"}},{"ruleId":"D2","level":"warning","message":{"text":"ptr_nulls::useless_check (cognitive 18): ptr_nulls::useless_check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/ptr_nulls.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2c1a0b48b03ed5288a638171fd828a19bdad5bff4e7a058bf28f1562b2b441"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::visit_primary_bindings_special (cognitive 18): Builder::visit_primary_bindings_special has cognitive complexity 18 (threshold 15). Drivers by points: loops 10, if/else 6, match/switch 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c6883b3bc8d5bb3f6d5e2207c1ead1e0ad541d8f9c92331c2991e82e1f77f6"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchVisitor::check_match (cognitive 18): MatchVisitor::check_match has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, match/switch 4, 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":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a183286693afb2d8cf28d5939922c5051db52ebaaa1bcd721b1ac70bc814d7"}},{"ruleId":"D2","level":"warning","message":{"text":"PatMigration::format_subdiagnostics (cognitive 18): PatMigration::format_subdiagnostics has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, 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":"compiler/rustc_mir_build/src/thir/pattern/migration.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb08a4fc042ab0aea7d2c7450b3e5baf7dd0c1f19e4d51fdcef4623ae6292ac"}},{"ruleId":"D2","level":"warning","message":{"text":"Forward::apply_effects_in_block (cognitive 18): Forward::apply_effects_in_block has cognitive complexity 18 (threshold 15). Drivers by points: loops 10, if/else 7, match/switch 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/framework/direction.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1189d3889da7f6bb382a152132f971dff05a3a09327bb19eea53c48342823dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"early_otherwise_branch::verify_candidate_branch (cognitive 18): early_otherwise_branch::verify_candidate_branch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, 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":"compiler/rustc_mir_transform/src/early_otherwise_branch.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"096ddbaa2c12b976b09afb2e75bba3eb4aafcf288dbecdff7ce4b9cf105006ec"}},{"ruleId":"D2","level":"warning","message":{"text":"cross_crate_inline::cross_crate_inlinable (cognitive 18): cross_crate_inline::cross_crate_inlinable has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 4, match/switch 3, 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":"compiler/rustc_mir_transform/src/cross_crate_inline.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5286f16ab805690d5b8d3d172345678ba0dac42fe50fa7c0e18cf9bf472e8f2"}},{"ruleId":"D2","level":"warning","message":{"text":"MirUsedCollector::visit_terminator (cognitive 18): MirUsedCollector::visit_terminator has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, match/switch 6, loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cd2e34a462ce821be9fa39f3052dd354e429d2753c04e09b70f49c5dfeb53a"}},{"ruleId":"D2","level":"warning","message":{"text":"collector::visit_instance_use (cognitive 18): collector::visit_instance_use has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2966b8f793a850a66e3e357d45b32d7c916cdfa265ea95011d15aef32972bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::annotate_following_item_if_applicable (cognitive 18): Parser::annotate_following_item_if_applicable has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, match/switch 8, 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":"compiler/rustc_parse/src/parser/attr.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7195c2107123dc49e7d83a573753d614ad3a79171c1bf7183ee6bd9e8874e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_expr_break (cognitive 18): Parser::parse_expr_break has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 4, match/switch 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b39453350db1c3f882bab860747130c0c6e38d013e0f4675847af4aef1add5"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_pat_no_top_guard_inner (cognitive 18): Parser::parse_pat_no_top_guard_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, boolean chains 5, match/switch 4, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7179b6c40bcae57e81fca74a750e62b6c88abdfd462bcd4570ac05f9c558e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Constructor::fmt_fields (cognitive 18): Constructor::fmt_fields has cognitive complexity 18 (threshold 15). Drivers by points: loops 13, match/switch 3, if/else 2 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/constructor.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20d20d53a09cc5601f5d005f5acd0ca4a3965541ed434fc55212bfe9f740aae"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::find_module (cognitive 18): LateResolutionVisitor::find_module has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":3071}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e9e46953158ce9c6d1bfd262a2a5aebf5c9b79136c381f5564f8c17edac217"}},{"ruleId":"D2","level":"warning","message":{"text":"edit_distance::edit_distance (cognitive 18): edit_distance::edit_distance has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, loops 5, 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":"compiler/rustc_span/src/edit_distance.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d53f567e4a616639f61f31bea83ca929ed9ff5230a62a1bba55304c5d71048"}},{"ruleId":"D2","level":"warning","message":{"text":"edit_distance::find_best_match_for_name_impl (cognitive 18): edit_distance::find_best_match_for_name_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, 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":"compiler/rustc_span/src/edit_distance.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"958837f7b8e39d614a4ddc57558f664bd2a13541c9641dc06b910d5f5ceff92b"}},{"ruleId":"D2","level":"warning","message":{"text":"x86::fill_inregs (cognitive 18): x86::fill_inregs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 3, match/switch 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/x86.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27f7b4db1ce86cc64e5ec5c44a6727dc5aaa26d0624d1ef6e04be69f2f0d61b"}},{"ruleId":"D2","level":"warning","message":{"text":"powerpc64::classify (cognitive 18): powerpc64::classify has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 6 (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":"compiler/rustc_target/src/callconv/powerpc64.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d762df94a53d3d01df7fbaccbd156727e8662b6174c7b0671eca5e68cf78aa"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::cmp_traits (cognitive 18): TypeErrCtxt::cmp_traits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, loops 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa94ab490130c28ceccdbe37841909f48ab11a2ccae503b18cd7ef1e499d96e"}},{"ruleId":"D2","level":"warning","message":{"text":"AmbiguityCausesVisitor::visit_goal (cognitive 18): AmbiguityCausesVisitor::visit_goal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, match/switch 4, loops 2, 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":"compiler/rustc_trait_selection/src/traits/coherence.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"f369512dab299d9c730d7f77141b90d781d1ce7c871f70a832daf76cc142889a"}},{"ruleId":"D2","level":"warning","message":{"text":"ambiguity::compute_applicable_impls_for_diagnostics (cognitive 18): ambiguity::compute_applicable_impls_for_diagnostics has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, boolean chains 2, loops 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"65351e45ea986270e96afec9b4b4826051f786b31a9e3fee3c7abda81d01f06b"}},{"ruleId":"D2","level":"warning","message":{"text":"opaque_types::opaque_type_has_defining_use_args (cognitive 18): opaque_types::opaque_type_has_defining_use_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, match/switch 5, boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/opaque_types.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0405a6609a56e6fec6b2a17c6174234666097afb8406443aac8b007e596bb845"}},{"ruleId":"D2","level":"warning","message":{"text":"util::sizedness_fast_path (cognitive 18): util::sizedness_fast_path has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 4, loops 3, match/switch 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":"compiler/rustc_trait_selection/src/traits/util.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6c3f9cefa250f968edaad8e0f6a440d3c6a360dde874a20d80f11fba783ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"trunc::trunc (cognitive 18): trunc::trunc has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18 (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":"library/compiler-builtins/compiler-builtins/src/float/trunc.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"febdd30c96dd2f9996b981c2b22ec789c998d75423bac5632fcf499104b26900"}},{"ruleId":"D2","level":"warning","message":{"text":"libm_macros::expand (cognitive 18): libm_macros::expand has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 7, if/else 6, loops 3, 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":"library/compiler-builtins/crates/libm-macros/src/lib.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ded72715dba2b507ea4ff26e2fe713153bd2555b252a2b8d59ca9fdde352bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"exp::exp (cognitive 18): exp::exp has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18 (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":"library/compiler-builtins/libm/src/math/exp.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"532cb480e5381db537e320e509ea18badf497a7f1de1925bb6014fed77c9a07f"}},{"ruleId":"D2","level":"warning","message":{"text":"rint::rint_status (cognitive 18): rint::rint_status has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/libm/src/math/generic/rint.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a997a0f812f4d99ff716ff54fa0b330b506fc4312bea754d553a5aacce62a0"}},{"ruleId":"D2","level":"warning","message":{"text":"File::open_native (cognitive 18): File::open_native has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, 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":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b47efef98131b7db1e51d6b8984a523cb843c80ed5faee2822fd117601693d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Copier::copy (cognitive 18): Copier::copy has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7, match/switch 7, 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":"library/std/src/sys/io/kernel_copy/linux.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"5279ce2c3a2f65e5d633887a44f9b628750aca2d8c4f953813079249975981ac"}},{"ruleId":"D2","level":"warning","message":{"text":"TcpListener::accept (cognitive 18): TcpListener::accept has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18 (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":"library/std/src/sys/net/connection/xous/tcplistener.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedabfb805fc01bd77029b6d7301e5c27161d2895dc87b3c2d51b970657bfd0b"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::spawn_with_attributes (cognitive 18): Command::spawn_with_attributes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 2, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/windows.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba411339643a543522bef0f722f1a37402bc94da777a51d743ff4da4bf7a576"}},{"ruleId":"D2","level":"warning","message":{"text":"WaiterQueue::insert (cognitive 18): WaiterQueue::insert has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, loops 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":"library/std/src/sys/sync/condvar/itron.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a769513da0ba444cb3da74bf8f3848f12a259d348741915176a87fd4c4e8d5"}},{"ruleId":"D2","level":"warning","message":{"text":"unix::init (cognitive 18): unix::init has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, loops 3, match/switch 3, boolean chains 1 (nesting depth added 4). Most of this is not in the body itself: 1 of the 18 points are its own statements and the rest belongs to 2 function items declared inside it (sanitize_standard_fds, reset_sigpipe). 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":"library/std/src/sys/pal/unix/mod.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a100479c697413847025f05d1c23614409aef48d42412abaf3d97b36f238761a"}},{"ruleId":"D2","level":"warning","message":{"text":"Intrinsic::pre_build (cognitive 18): Intrinsic::pre_build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, loops 4, match/switch 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":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29bd6d9bfbc1429ab2d5a4335df53bcf72801d150ad51005f4f508c021d2201"}},{"ruleId":"D2","level":"warning","message":{"text":"stdarch_gen_loongarch::gen_bind (cognitive 18): stdarch_gen_loongarch::gen_bind has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, 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":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"060edf21ef24a9fe2f2a128756d7b7afc7df7cbb89784796a37188ee9dc6e9fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Rustc::run::prepare_image (cognitive 18): Rustc::run::prepare_image has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, loops 7, boolean chains 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb0913ce723a59fffe74e45c0aa547fc0751c4e2b5c0dae0bd4c58168134fc8"}},{"ruleId":"D2","level":"warning","message":{"text":"download::download_component (cognitive 18): download::download_component has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/download.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b08c1e0709c201285440f24260d1679479ce091c2fcbb08fa6c54c41e99913d"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderType::read_from_bytes (cognitive 18): RenderType::read_from_bytes has cognitive complexity 18 (threshold 15). Drivers by points: loops 10, if/else 8 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0096372bc3a24d1dcdf5fbc220c760782de2a4224411db0815f7be42981533"}},{"ruleId":"D2","level":"warning","message":{"text":"Stripper::fold_item (cognitive 18): Stripper::fold_item has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, boolean chains 3, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/stripper.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d6b4ba7e2c784b6a1dcf7bc11d4db6ff427cd6f396ba8586423ce3beaf6ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"collect_intra_doc_links::ambiguity_error (cognitive 18): collect_intra_doc_links::ambiguity_error has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, loops 3, boolean chains 2, match/switch 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":2375}}}],"partialFingerprints":{"codehealthFindingId/v1":"788b457b8535f795df12695f6b9a67ea9b9dff8c09f41c86e964a27e2add6cae"}},{"ruleId":"D2","level":"warning","message":{"text":"doctest::doctest_run_fn (cognitive 18): doctest::doctest_run_fn has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, match/switch 2, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/doctest.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"585f14d08a99362373762f18e09d27f4e55108da18b10b8e924412acc1469516"}},{"ruleId":"D2","level":"warning","message":{"text":"types::create_disallowed_map (cognitive 18): types::create_disallowed_map has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 3, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_config/src/types.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b444cdff1c083e4332acf7d29951b17c325943460840dc9cbf8382adfbe82d"}},{"ruleId":"D2","level":"warning","message":{"text":"needless_type_cast::has_generic_return_type (cognitive 18): needless_type_cast::has_generic_return_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 3, match/switch 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/needless_type_cast.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6f9530238f109a9f564a00e355fbcb53fe78273738c863ec2d2a271ed5449a"}},{"ruleId":"D2","level":"warning","message":{"text":"too_long_first_doc_paragraph::check (cognitive 18): too_long_first_doc_paragraph::check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/doc/too_long_first_doc_paragraph.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"86209aad300b3d9a717b500bd03091dfaba881019fd0ec1908a9b82f209eb2fc"}},{"ruleId":"D2","level":"warning","message":{"text":"cast_possible_truncation::apply_reductions (cognitive 18): cast_possible_truncation::apply_reductions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, match/switch 3, 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":"src/tools/clippy/clippy_lints/src/casts/cast_possible_truncation.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"31af997c5f91d7c2398e1815cadf22f226913186edf2c8a4bc87a46d82856e90"}},{"ruleId":"D2","level":"warning","message":{"text":"double_ended_iterator_last::check (cognitive 18): double_ended_iterator_last::check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/double_ended_iterator_last.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe414eaaf97b28d38d076958f1e73856b26a598b490f1cd571f2fb6d6d5e75a"}},{"ruleId":"D2","level":"warning","message":{"text":"unnecessary_to_owned::check_addr_of_expr (cognitive 18): unnecessary_to_owned::check_addr_of_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, 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":"src/tools/clippy/clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5686600e48d2d251e8cdebe3ca5aacbf126c78e1a0b4055eddb9836dc22401f1"}},{"ruleId":"D2","level":"warning","message":{"text":"or_fun_call::check_unwrap_or_default (cognitive 18): or_fun_call::check_unwrap_or_default has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 4, 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":"src/tools/clippy/clippy_lints/src/methods/or_fun_call.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0a12790b71f2f9424179faba6c0211f0b0b557cefd699d5f02214a6799eabe"}},{"ruleId":"D2","level":"warning","message":{"text":"ptr_as_ptr::check (cognitive 18): ptr_as_ptr::check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, match/switch 5, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/ptr_as_ptr.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4498359a6b2c728af3043bf14255f55d1b9ec79b36029251db527723e0ebfe59"}},{"ruleId":"D2","level":"warning","message":{"text":"implied_bounds_in_impls::emit_lint (cognitive 18): implied_bounds_in_impls::emit_lint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 2, loops 2, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/implied_bounds_in_impls.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"206f7b427868d30b783b89977065168ebf7bd37b73829097b7da53bee59dc307"}},{"ruleId":"D2","level":"warning","message":{"text":"manual_unwrap_or::handle (cognitive 18): manual_unwrap_or::handle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, 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":"src/tools/clippy/clippy_lints/src/matches/manual_unwrap_or.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f3c1b66520d68ce97371231bcb1261efc17b10010ca7e5cd29169c1ede930f"}},{"ruleId":"D2","level":"warning","message":{"text":"lazy_continuation::check (cognitive 18): lazy_continuation::check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 4, 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":"src/tools/clippy/clippy_lints/src/doc/lazy_continuation.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"698daceadd35ef38da3a18192198a17bf428bbd38adbaef0d0e281bd3462b7fe"}},{"ruleId":"D2","level":"warning","message":{"text":"cast_possible_wrap::check (cognitive 18): cast_possible_wrap::check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, match/switch 4, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/cast_possible_wrap.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"169a23ee4683d3342ae10a888a6fff801ffde58458ca46347098d9fbb7be4a03"}},{"ruleId":"D2","level":"warning","message":{"text":"ConstEvalCtxt::expr (cognitive 18): ConstEvalCtxt::expr has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 9, if/else 7, 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":"src/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a87b4bd9e8759ab22abd0e2f1dafdd1d90cd212ead7819fd87a980e526105f"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_min_const_fn::check_terminator (cognitive 18): qualify_min_const_fn::check_terminator has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, match/switch 4, loops 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5113b2daa20989844b9edadc408cf2929dfc65992aae4841efd7b3c1d6ff7c"}},{"ruleId":"D2","level":"warning","message":{"text":"type_certainty::expr_type_certainty (cognitive 18): type_certainty::expr_type_certainty has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, match/switch 3, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/ty/type_certainty/mod.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e0b43b9a2819d4df230f45f8bf032e2fe4297e10f326eb93819a0746cac34e"}},{"ruleId":"D2","level":"warning","message":{"text":"json::diff (cognitive 18): json::diff has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, loops 4, match/switch 3, 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":"src/tools/clippy/lintcheck/src/json.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b003266b9cde6fbd23729c2eec9a970d5c2659dff97b8a6ebb4501d96ea54e"}},{"ruleId":"D2","level":"warning","message":{"text":"imp::read2 (cognitive 18): imp::read2 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, boolean chains 2, 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":"src/tools/compiletest/src/read2.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"5803f89f9f333ccab3ad67991f01693a75b3ca02fdd02f0d7fb1967147d5679f"}},{"ruleId":"D2","level":"warning","message":{"text":"phases::phase_runner (cognitive 18): phases::phase_runner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, loops 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/cargo-miri/src/phases.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"9550ef4d83c89db08a9438b0fb42811d668cdcaa5df62da0ef9b19820245d9ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::bench (cognitive 18): Command::bench has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, loops 4, boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/miri-script/src/commands.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"8502674a880a05e73fa0630372ad616451cda6d927c842ca5ad3bd141404db81"}},{"ruleId":"D2","level":"warning","message":{"text":"PrirodaContext::resume (cognitive 18): PrirodaContext::resume has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, match/switch 5, boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/priroda/src/main.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"462127662541831a25e3fe1753bb843d76aa9df946200193145274d691877412"}},{"ruleId":"D2","level":"warning","message":{"text":"Stack::retain (cognitive 18): Stack::retain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, loops 3, match/switch 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/borrow_tracker/stacked_borrows/stack.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e72c335d3c5ee6ba59f1bebbc9ede9f237e54b9c2a7c1518774724af02c27f"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::try_errnum_to_io_error (cognitive 18): EvalContextExt::try_errnum_to_io_error has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, loops 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":"src/tools/miri/src/shims/io_error.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f83aec925cd44b8c37cbe7cfe10e843ba0e70e729d0054c334fe9780cbda13"}},{"ruleId":"D2","level":"warning","message":{"text":"ExprCollector::lower_coroutine_body_with_moved_arguments (cognitive 18): ExprCollector::lower_coroutine_body_with_moved_arguments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, match/switch 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa34e750c86df6e4057f6d3638000da4f853456714dc63e38e31eefc3c195e0"}},{"ruleId":"D2","level":"warning","message":{"text":"UseTree::expand_impl (cognitive 18): UseTree::expand_impl has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 9, if/else 6, loops 2, boolean chains 1 (nesting depth added 8). Of this number, 14 points are the body\u0027s own statements and 4 belong to one function item declared inside it. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/item_tree.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc759f998c28dd278a8ac43f9e6e900a7835e8bce21151c873756ba3b83adf7"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::resolution_loop (cognitive 18): DefCollector::resolution_loop has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, loops 6 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e710a9624133de9de084dd90f0c88d4444cf3a9be9daa269db8cf852218187"}},{"ruleId":"D2","level":"warning","message":{"text":"docs::extend_with_attrs (cognitive 18): docs::extend_with_attrs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, match/switch 4, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/attrs/docs.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78376a91737bc19d90bc8f48ffdf02a8b0516a1cd9eb24b6fbc19acc81b51e6"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroCallId::expand_speculative (cognitive 18): MacroCallId::expand_speculative has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, match/switch 3, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca782ce6b0f16f5ca402937ba3ff933b888bbc12dc92ef9bde0b8db24141725"}},{"ruleId":"D2","level":"warning","message":{"text":"mod_path::convert_path (cognitive 18): mod_path::convert_path has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 8, if/else 6, boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/mod_path.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"55416f62345a18b8f2ce68b1e9ef30a8c89b44745f11170857842ddf7b04e929"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchCheckCtx::ctors_for_ty (cognitive 18): MatchCheckCtx::ctors_for_ty has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, loops 4, match/switch 3, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/diagnostics/match_check/pat_analysis.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"10759cc9752b9427f5370e6f35f205fe1046b2555d9b4d2f2cdd93ff93c6255a"}},{"ruleId":"D2","level":"warning","message":{"text":"CastCheck::do_check (cognitive 18): CastCheck::do_check has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 14, if/else 4 (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":"src/tools/rust-analyzer/crates/hir-ty/src/infer/cast.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff6e94d45d9e34b9e06ed419e4bb72fb98e0ec223fcdf6067289f197a67db9c"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::check_record_pat_fields (cognitive 18): InferenceContext::check_record_pat_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, match/switch 4, boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"49567ca69cbed82db8b4351497b684b62c8b87295cf954201628675c0d5e6b61"}},{"ruleId":"D2","level":"warning","message":{"text":"SolverContext::fetch_eligible_assoc_item (cognitive 18): SolverContext::fetch_eligible_assoc_item has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, match/switch 4, 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":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/solver.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6800f9b4e6a113cbef3b4f991ad4c85a17da2fd1efc91842fbe588f497ae6e93"}},{"ruleId":"D2","level":"warning","message":{"text":"binding_mode::hints (cognitive 18): binding_mode::hints has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 8, if/else 6, boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/binding_mode.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e704f94d0910bf1cf24452df972d0804957350b8ba4400a431fbcb84b279cb8"}},{"ruleId":"D2","level":"warning","message":{"text":"navigation_target::orig_range_with_focus_r (cognitive 18): navigation_target::orig_range_with_focus_r has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, boolean chains 5, match/switch 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/navigation_target.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"1300b465fa2718a4b7ef049ec17fb90898d17c56f12fdda6286c294de906c761"}},{"ruleId":"D2","level":"warning","message":{"text":"chaining::hints (cognitive 18): chaining::hints has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, loops 2, boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/chaining.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e562f077cd36a6db8bc63cb0e9a46ae6c9eeeaad4f40a10dd931ccdd1f50c7eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Module::expand_and_group_usages_file_wise (cognitive 18): Module::expand_and_group_usages_file_wise has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, loops 6, boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_module.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d549494e59b4c3d21da3977662781f9f93999349a29db28b97fa7816ea928e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"auto_import::relevance_score (cognitive 18): auto_import::relevance_score has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 11, if/else 7 (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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/auto_import.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c6cf5bb2706ec8a83612c417463cb512ef2df4305ccccab4fd5ddafc21561b"}},{"ruleId":"D2","level":"warning","message":{"text":"unnecessary_async::unnecessary_async (cognitive 18): unnecessary_async::unnecessary_async has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, match/switch 3, loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/unnecessary_async.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de11a8681c982194f39a869513b488d63b5283c1f2d6c494854a4982969528e"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_delegate_trait::remove_useless_where_clauses (cognitive 18): generate_delegate_trait::remove_useless_where_clauses has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_trait.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee1a931cd32098a210dc206a0e2f26337106020bb84d2d9734af1f98e69aba0"}},{"ruleId":"D2","level":"warning","message":{"text":"add_missing_impl_members::add_missing_impl_members_inner (cognitive 18): add_missing_impl_members::add_missing_impl_members_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 3 (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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/add_missing_impl_members.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b753b481735120d30eb88759dd14af8fc64e0717b837586c228ddc25597bd053"}},{"ruleId":"D2","level":"warning","message":{"text":"inline_local_variable::inline_local_variable (cognitive 18): inline_local_variable::inline_local_variable has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, boolean chains 2, match/switch 2, 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/inline_local_variable.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca1954a6f9e19b806f276a1ac9aa10813f29f230abd8115a92b0c88e45a51b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Definition::range_for_rename (cognitive 18): Definition::range_for_rename has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 15, if/else 3 (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":"src/tools/rust-analyzer/crates/ide-db/src/rename.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e6d2c4561818329c625933eb265967a09c620e891669b85f6e7db0d6ca1453"}},{"ruleId":"D2","level":"warning","message":{"text":"adt::record_field_list (cognitive 18): adt::record_field_list has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 3, loops 1 (nesting depth added 5). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to one function item declared inside it (record_field). 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":"src/tools/rust-analyzer/crates/parser/src/grammar/items/adt.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c79b0c476960f1a55546fd289981b9f0e9c7222b1e4b5a143a023bb5562b8e7"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcMacroServerProcess::run (cognitive 18): ProcMacroServerProcess::run has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 8, if/else 7, 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":"src/tools/rust-analyzer/crates/proc-macro-api/src/process.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d3988bb8344b685ea44bcdd216e4899eeef8d0bc7a8b9bb0e143f719c8e0aa"}},{"ruleId":"D2","level":"warning","message":{"text":"to_proto::semantic_tokens (cognitive 18): to_proto::semantic_tokens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, match/switch 6, loops 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"505c9cdd32c5e5fc2b93375aa28876523245172b49b414c8b67927a0a04f83ec"}},{"ruleId":"D2","level":"warning","message":{"text":"request::handle_parent_module (cognitive 18): request::handle_parent_module has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 13, if/else 5 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d541fbbf249c6d3187eeeb4bf5bdd28986f1cfd4db56db19d53bbe8f80e052"}},{"ruleId":"D2","level":"warning","message":{"text":"imp::read2 (cognitive 18): imp::read2 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, boolean chains 2, 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":"src/tools/rust-analyzer/crates/stdx/src/process.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b819fa84046dacffb4ecc81d877192d05ae0c1d43955f42d34b3a643a980fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"notes::process_inline_macros (cognitive 18): notes::process_inline_macros has cognitive complexity 18 (threshold 15). Drivers by points: loops 15, match/switch 3 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/xtask/src/publish/notes.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cf4abe87e3e30c67611b950c2fd5db2777fc84090e3e3138486ac257c8b015"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentCodeSlices::next (cognitive 18): CommentCodeSlices::next has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, match/switch 6, boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0064980896cc55f1402f8ab6cbdc3a2ab2f529f70926217957cc1e9d64215f"}},{"ruleId":"D2","level":"warning","message":{"text":"UseTree::flatten (cognitive 18): UseTree::flatten has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6, loops 5, match/switch 5, boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/imports.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b599d6e9027203934d764568dab769b27be7a68e80db3b68d3883798fa2df7"}},{"ruleId":"D2","level":"warning","message":{"text":"lists::extract_post_comment (cognitive 18): lists::extract_post_comment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/lists.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"a175cee98744943f74c04e69f0d5a4cab3a64f02fdcf8e4b29e0fb445e594856"}},{"ruleId":"D2","level":"warning","message":{"text":"closures::rewrite_last_closure (cognitive 18): closures::rewrite_last_closure has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 9, if/else 7, boolean chains 2 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/closures.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1204d3b16ed3b42354670f4ad046174f6a1d0dad5295d53644a8f306b9de8f9"}},{"ruleId":"D2","level":"warning","message":{"text":"pal::check_cfgs (cognitive 18): pal::check_cfgs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 3, match/switch 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/pal.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"143884cc1bd87577b20a1dea06bd3421f06367d05f3d6407780baab4585803b7"}},{"ruleId":"D2","level":"warning","message":{"text":"doSearch (cognitive 18): doSearch has cognitive complexity 18 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e736d77c9def4e2dba824d831cc555ce09c52f964c4e5d1513fb56c67a5a112"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutCalculator::univariant (cognitive 17): LayoutCalculator::univariant has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, 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":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"964ddcffffd1b07e705b002b7a60549553632d968b5fce30a0d66299f272b5bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Param::rewrite_result (cognitive 17): Param::rewrite_result has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, 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":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"359b73895112aa813a0e1eb48a307212d7112dc47ba662f787b703df387119e1"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_ty (cognitive 17): LoweringContext::lower_ty has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, match/switch 8 (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":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e1c54bda50b0e67a28ad0046b613684e9149477188c32b95508cdca6998d62"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_attr::emit_malformed_attribute (cognitive 17): validate_attr::emit_malformed_attribute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, loops 4 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/validate_attr.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"92093e1db35cca85ccc8af9fba48f67a0629bea63a824ec06371ab1f6f51993f"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::give_name_if_we_can_match_upvar_args (cognitive 17): MirBorrowckCtxt::give_name_if_we_can_match_upvar_args has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, match/switch 4, 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":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffd4c8553021fdd8ea8c690a9cc6093a5de5a7854bfbed927cfd8bcf5612bde"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::manage_cond_expr (cognitive 17): Context::manage_cond_expr has cognitive complexity 17 (threshold 15). Drivers by points: loops 10, if/else 6, match/switch 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/assert/context.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2d8a7e9fcd7a9a823d3fb45b81a0883d10ff9e2c36cb7d0d50a410ed75bb74"}},{"ruleId":"D2","level":"warning","message":{"text":"inline_asm::codegen_inline_asm_terminator (cognitive 17): inline_asm::codegen_inline_asm_terminator has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, match/switch 4, 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":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f15613a22f336b653e0ef46c120faf4c8a6bde86b8f1f58875a6b0d92f73d8"}},{"ruleId":"D2","level":"warning","message":{"text":"old_archs::old_archs (cognitive 17): old_archs::old_archs has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 17 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/old_archs.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ddf74a081da76b98daecc4d25497146f4d1820ebe7ec396ac849eba05075cd"}},{"ruleId":"D2","level":"warning","message":{"text":"AssertModuleSource::check_attrs (cognitive 17): AssertModuleSource::check_attrs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, match/switch 5, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/assert_module_sources.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b265a6de35d37ed3e12697a48e083d3fd210360fb2b2c60cc15ff48f4c4e1c24"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleConfig::new (cognitive 17): ModuleConfig::new has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 4, match/switch 4 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d85f08eeadb48b7237b4aaee829f47f8ceac5d24bbef43619a33c0dd07ae41"}},{"ruleId":"D2","level":"warning","message":{"text":"OperandRef::extract_field (cognitive 17): OperandRef::extract_field has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, match/switch 4, 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":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21596b4c806a5201c8eee8d64e58582fc5a6deb183683b0b2dcc14af81710d8"}},{"ruleId":"D2","level":"warning","message":{"text":"symbol_export::reachable_non_generics_helper (cognitive 17): symbol_export::reachable_non_generics_helper has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 3, match/switch 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":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa3212b098957b32e7ab520a23f2f7e18649e750c1cd3a7978b1e86712833e1"}},{"ruleId":"D2","level":"warning","message":{"text":"link::linker_and_flavor (cognitive 17): link::linker_and_flavor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, match/switch 4 (nesting depth added 5). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 2 function items declared inside it (infer_from, adjust_flavor_to_features). 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":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"db054d2aaaef66e145639255529242a8cbdad281459d34060dc6bb36c6a412f6"}},{"ruleId":"D2","level":"warning","message":{"text":"expand::parse_ast_fragment (cognitive 17): expand::parse_ast_fragment has cognitive complexity 17 (threshold 15). Drivers by points: loops 12, if/else 3, boolean chains 1, match/switch 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":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bac982fec31e92eaa62a4b64e7e4e88db08a9f7a93378e2fb1205f3f86e8fc"}},{"ruleId":"D2","level":"warning","message":{"text":"opaque::find_opaque_ty_constraints_for_rpit (cognitive 17): opaque::find_opaque_ty_constraints_for_rpit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, match/switch 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/type_of/opaque.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca05f63099f641f97d41a1245fccacfa874a9c39385a9c976d51b4b3a508086e"}},{"ruleId":"D2","level":"warning","message":{"text":"compare_impl_item::compare_synthetic_generics (cognitive 17): compare_impl_item::compare_synthetic_generics has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, match/switch 2, 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":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91a02987e4fd12a0455d43de340d94ef376a5eb75428327b1e1c2870435f20d"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_type (cognitive 17): State::print_type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, match/switch 3, loops 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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"138e4a797817ea2b0432a6caf4a94388ba8963e7070afc1fc8ea84d690550c6c"}},{"ruleId":"D2","level":"warning","message":{"text":"Coerce::coerce_unsized_old_solver (cognitive 17): Coerce::coerce_unsized_old_solver has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 8, if/else 7, boolean chains 1, loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af27c7ab73fd90a8fd6d2ff58d304818ec9d90895752e81fc32f069de80bcfa"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_expr_match (cognitive 17): FnCtxt::check_expr_match has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, match/switch 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/_match.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f3d725233272b1e0c441c8238fffc4b721aa66febe16e60d2fd57579d095fb"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_two_fn_call (cognitive 17): FnCtxt::suggest_two_fn_call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, match/switch 6, loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4156d90cba92ef7f9134e1b1c1193ed4362735260a5763e1fe68def623909f"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::lint_edition_dependent_dot_call (cognitive 17): FnCtxt::lint_edition_dependent_dot_call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 5, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/prelude_edition_lints.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e320ddc415c8f8bc2dffb3fbbb1fcd23494627656893ab9c898a94b45eb9a93"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::report_no_match_method_error (cognitive 17): FnCtxt::report_no_match_method_error has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 6. 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cdbbbadfe1bfc3d653ed62a0493fd68c4e94ef268a8dfec4fa8a9ba12352b2"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_enum_variant_for_method_call (cognitive 17): FnCtxt::suggest_enum_variant_for_method_call has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 10, if/else 4, boolean chains 3 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7f159cf73d7c00a92e91ca89224516052af13d351e19f68f681999ad312076"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_str_addition (cognitive 17): FnCtxt::check_str_addition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, match/switch 7, 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":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"3674699ea0637806198cae942272629a884472ab2808b46f52231f9232174523"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::resolve_ident_in_scope_set_inner (cognitive 17): Resolver::resolve_ident_in_scope_set_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, match/switch 7, 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":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"16144c9bbda841c15c745e55b5bad4d2143dac8e8de4574be0f530a60c1ddf32"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::single_import_can_define_name (cognitive 17): Resolver::single_import_can_define_name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 3, match/switch 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"f918d10c59514f9c5e51781b6bb1e7af6fec2f826ea49f3b5ebda348fbac0fca"}},{"ruleId":"D2","level":"warning","message":{"text":"LexicalResolver::collect_bounding_regions (cognitive 17): LexicalResolver::collect_bounding_regions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, loops 2, match/switch 2 (nesting depth added 8). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to one function item declared inside it (process_edges). 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":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3e1d2f8bdcdcb1e8e5c5c8c800f84d3974f14778485723c26f6cee15ab51c0"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceFudger::fold_ty (cognitive 17): InferenceFudger::fold_ty has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, match/switch 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":"compiler/rustc_infer/src/infer/snapshot/fudge.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e239cf0add366e2edbfe008ca74ce49a62fdf91f2a07b92b243bc84c305bd1"}},{"ruleId":"D2","level":"warning","message":{"text":"Linker::link (cognitive 17): Linker::link has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 3, match/switch 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_interface/src/queries.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54179ab2e66b567277ddeb4f0874b1043c71e2c768c26174095a0256d07292a"}},{"ruleId":"D2","level":"warning","message":{"text":"interface::parse_cfg (cognitive 17): interface::parse_cfg has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, match/switch 6, 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":"compiler/rustc_interface/src/interface.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3a7a2af0f5ec4a5f42e20eadd7324422c7b834a648e3df17dd192cc0b5aa96"}},{"ruleId":"D2","level":"warning","message":{"text":"NonLocalDefinitionsDiag::into_diag (cognitive 17): NonLocalDefinitionsDiag::into_diag has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, 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":"compiler/rustc_lint/src/lints.rs"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f7903a1ea48cc8d701d08ef86ca8725e90de8717c753706b5414c1e3bcae47"}},{"ruleId":"D2","level":"warning","message":{"text":"InitMaskMaterialized::set_range_inbounds (cognitive 17): InitMaskMaterialized::set_range_inbounds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, loops 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":"compiler/rustc_middle/src/mir/interpret/allocation/init_mask.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ddeb14d94554cb60d8d247108f15fd11af3aaa7b9dd6914ee006c59eaed66a"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::stmt_expr (cognitive 17): Builder::stmt_expr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, match/switch 5, loops 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/expr/stmt.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"203324d792025422714d13113131aec313b3d3b90d71af68dae86e7b2b767fce"}},{"ruleId":"D2","level":"warning","message":{"text":"PatCtxt::lower_pattern_unadjusted (cognitive 17): PatCtxt::lower_pattern_unadjusted has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, match/switch 6, 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":"compiler/rustc_mir_build/src/thir/pattern/mod.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"4292a57f66a2e1d4acf4abde71cb26a0e18a5d593ccc3af786f945bb876bb4ab"}},{"ruleId":"D2","level":"warning","message":{"text":"OpportunitySet::apply_once (cognitive 17): OpportunitySet::apply_once has cognitive complexity 17 (threshold 15). Drivers by points: loops 12, if/else 3, match/switch 2 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0b2ffb0b20975529ccdd3067f00bd8e385eb6bfeed6fb99923aebe8c91cefc"}},{"ruleId":"D2","level":"warning","message":{"text":"Lint::visit_terminator (cognitive 17): Lint::visit_terminator has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, loops 5, 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":"compiler/rustc_mir_transform/src/lint.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c209e9938611a659cd73ba926304e994c42582fa7aa48095c576f5041b8513b"}},{"ruleId":"D2","level":"warning","message":{"text":"expansion::build_expn_tree (cognitive 17): expansion::build_expn_tree has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, loops 7, 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":"compiler/rustc_mir_transform/src/coverage/expansion.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7135de51ffb4b7e76137a11fcc7052b5f94bfb12d5f82eec2f4411e67fba4bf"}},{"ruleId":"D2","level":"warning","message":{"text":"inline::check_mir_is_available (cognitive 17): inline::check_mir_is_available has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 2, 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":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf8bcd8573bbc96aefb55e23442262c40b8780b40167fc4c792eb49806b0c49"}},{"ruleId":"D2","level":"warning","message":{"text":"abi_check::do_check_simd_vector_abi (cognitive 17): abi_check::do_check_simd_vector_abi has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7, match/switch 5, 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":"compiler/rustc_monomorphize/src/mono_checks/abi_check.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96a35c9bc0199d66db7a7c8c42b726b1843403e7f522db43ff135be597831c2"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalCtxt::normalize_opaque_type (cognitive 17): EvalCtxt::normalize_opaque_type has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 11, if/else 6 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/project_goals/opaque_types.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"138f2bd2bd03c6845c9e1153a8715d94b13c670aea79400bdf6bdea83f42d8d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::lex_token_trees (cognitive 17): Lexer::lex_token_trees has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, match/switch 3, 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":"compiler/rustc_parse/src/lexer/tokentrees.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b059b577c3ce6977e46173cce837ee2527c741f2b1a891870b12e48da03a5d"}},{"ruleId":"D2","level":"warning","message":{"text":"asm::parse_options (cognitive 17): asm::parse_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, loops 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/asm.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f3b9f6b6f7ae60d47978b25eb2ee4d526b7710b5f43d9b1050879344ed2724"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::break_up_float (cognitive 17): Parser::break_up_float has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 1, loops 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":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8feaa8182687ec00fd15d295c00bed6ef577a0477848135f6d8c4b1810ae10"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::check_trait_front_matter (cognitive 17): Parser::check_trait_front_matter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, match/switch 3, 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c90a123590b3abe054cd747f7253c23810221fe78e94fe1acf31a337c9ca2e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_field_ident (cognitive 17): Parser::parse_field_ident has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, match/switch 6, 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":2422}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbe5a82bfb518326017f8ecde5f798fa5cb024997ea313b7fe8c4ea69691f16"}},{"ruleId":"D2","level":"warning","message":{"text":"RustcPatCtxt::print_witness_pat (cognitive 17): RustcPatCtxt::print_witness_pat has cognitive complexity 17 (threshold 15). Drivers by points: loops 6, match/switch 5, boolean chains 4, if/else 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":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"634fe1166ace594536007333bfa897536658725edef5cf4a130f538afb18cb37"}},{"ruleId":"D2","level":"warning","message":{"text":"job::create_cycle_error (cognitive 17): job::create_cycle_error has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, loops 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":"compiler/rustc_query_impl/src/job.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a4a0e8ad85f19bfe37e8f26746e2de87bd1ab07e38b3859ed45931d5fe40c2"}},{"ruleId":"D2","level":"warning","message":{"text":"LateResolutionVisitor::call_has_self_arg (cognitive 17): LateResolutionVisitor::call_has_self_arg has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, match/switch 3, loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcc848554cc45d5bd887737b1e1680e43a88a20a5697db3994cca30fecb5ac3"}},{"ruleId":"D2","level":"warning","message":{"text":"SpanData::encode (cognitive 17): SpanData::encode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, match/switch 2, boolean chains 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":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6c6e3d0f716bc9d14629ce578e3214c0852ddc1a2c8e5801a2459ba704b5df"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceFile::encode (cognitive 17): SourceFile::encode has cognitive complexity 17 (threshold 15). Drivers by points: loops 9, if/else 4, match/switch 4 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c1efb5d3ff330c7fd3dc1b1ae5ba2135fda199691a05611b8e4e7b30d03060"}},{"ruleId":"D2","level":"warning","message":{"text":"sparc64::classify_arg (cognitive 17): sparc64::classify_arg has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 7, if/else 5, loops 4, 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":"compiler/rustc_target/src/callconv/sparc64.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b711ca67ccc021c1ca3dc040f5e5a4e62db077ed013d6ccea7615a557e37de9f"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::emit_specialized_closure_kind_error (cognitive 17): TypeErrCtxt::emit_specialized_closure_kind_error has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 3, match/switch 3 (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":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"266fb031b7553d0cb8e8f0151098e6b8f5fcb383fb09a8444d4a1bd02af92654"}},{"ruleId":"D2","level":"warning","message":{"text":"project::assemble_candidates_from_clauses (cognitive 17): project::assemble_candidates_from_clauses has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, match/switch 3, boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa367661823acfdc061789fc499a4353a726c76ca2900e432abe244f5b069aa4"}},{"ruleId":"D2","level":"warning","message":{"text":"coherence::overlap (cognitive 17): coherence::overlap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, match/switch 2, boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/coherence.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d20481f6a3693f4dca5177bc10f080b622982de5831fc54a1765379dc4e3c4"}},{"ruleId":"D2","level":"warning","message":{"text":"implied_bounds::assumed_wf_types (cognitive 17): implied_bounds::assumed_wf_types has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, loops 3, match/switch 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/implied_bounds.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e92919e5b82e8f4edc358bcc73ab4cb9f97ee38531ecbc5ccaa6b89f42a3bb8"}},{"ruleId":"D2","level":"warning","message":{"text":"hypot::cr_hypot (cognitive 17): hypot::cr_hypot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, 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":"library/compiler-builtins/libm/src/math/hypot.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a58886f730685a56a15264ab2dadf75fdafcf770e28abd3877915438c39d1a"}},{"ruleId":"D2","level":"warning","message":{"text":"detect::load_x86_features (cognitive 17): detect::load_x86_features has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, 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":"library/compiler-builtins/libm/src/math/arch/x86/detect.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6286028167d757857c3e728f16c0b013f6910776ca786f9cad4d9de9f9467641"}},{"ruleId":"D2","level":"warning","message":{"text":"dragon::format_shortest (cognitive 17): dragon::format_shortest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 3, loops 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":"library/core/src/num/imp/flt2dec/strategy/dragon.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4025de57aebb3ffe7829265a12ecca7ad84dc405877eff9f0a9f40d87fa37ff1"}},{"ruleId":"D2","level":"warning","message":{"text":"grisu::format_shortest_opt (cognitive 17): grisu::format_shortest_opt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 5, loops 3 (nesting depth added 3). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function item declared inside it (round_and_weed). 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":"library/core/src/num/imp/flt2dec/strategy/grisu.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"5126acd25f285448d8fc1a657ad058c501d7218f6cf92e3e8a2def85745fddfb"}},{"ruleId":"D2","level":"warning","message":{"text":"quicksort::partition_hoare_branchy_cyclic (cognitive 17): quicksort::partition_hoare_branchy_cyclic has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, loops 5, 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":"library/core/src/slice/sort/unstable/quicksort.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b75b00dc1d97b86e8e0af125e76c228125b8fdd210d4805526390f30ab0a56"}},{"ruleId":"D2","level":"warning","message":{"text":"flt2dec::digits_to_dec_str (cognitive 17): flt2dec::digits_to_dec_str has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, 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":"library/core/src/num/imp/flt2dec/mod.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a64d4800dfc82e6059356e27c6b678e13c0389d985fe85909d02884f235002"}},{"ruleId":"D2","level":"warning","message":{"text":"Channel::start_send (cognitive 17): Channel::start_send has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, match/switch 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sync/mpmc/array.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca80b7790b0ff874f58feb42f7106ca3d4b5da7935fc77e1fc1888692bdd4f6a"}},{"ruleId":"D2","level":"warning","message":{"text":"Once::call (cognitive 17): Once::call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, match/switch 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/sync/once/futex.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e94d688cb61398f4f0c7c0ef06d0c5b3e6e4b0680e6ffd76a015e2db478f45f"}},{"ruleId":"D2","level":"warning","message":{"text":"windows::search_paths (cognitive 17): windows::search_paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, loops 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":"library/std/src/sys/process/windows.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e185591462889472d10d7e3c8d8d8f53b580a8d8dd206f325545a16a8fc1a9"}},{"ruleId":"D2","level":"warning","message":{"text":"uefi::output (cognitive 17): uefi::output has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, loops 4, match/switch 4 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/uefi.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f219e3261119e9f1a15b69970ab6e3f82d28305ff7afa1dfd3c61aac5cc01033"}},{"ruleId":"D2","level":"warning","message":{"text":"hvx::parse_prototype (cognitive 17): hvx::parse_prototype has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, loops 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0233c9396b24461f51b99a27ff179274d84fab64f728c283790f50f16c513500"}},{"ruleId":"D2","level":"warning","message":{"text":"hvx::get_compound_primary_instr (cognitive 17): hvx::get_compound_primary_instr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 6, 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":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8af1497c0a7a9c3a74f81aa40fb88ac73239e793e1e8d3c4855da3f84cbcec"}},{"ruleId":"D2","level":"warning","message":{"text":"compile::rustc_llvm_env (cognitive 17): compile::rustc_llvm_env has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7a07727e0d3bfd13903a327d7f19159a025162756f4d7bfb4127570f647880"}},{"ruleId":"D2","level":"warning","message":{"text":"Impl::print_type (cognitive 17): Impl::print_type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 7 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/format.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fe97483179c64b49b54997a5f446d6ed0775e3a338f16fbac42af58b172206"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkCollector::resolve_links (cognitive 17): LinkCollector::resolve_links has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, loops 3, boolean chains 2, 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":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a71c4aa7d807ac44806e3d52a724e63798fba9c965bd616a54aa9cce9c8235"}},{"ruleId":"D2","level":"warning","message":{"text":"clean::clean_doc_module (cognitive 17): clean::clean_doc_module has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 5, loops 1, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e457c311ba186d1b36f52b0d3e4942feb3f56b996a3dc708e6c341b29bf3bcd"}},{"ruleId":"D2","level":"warning","message":{"text":"deprecate_lint::remove_lint_declaration (cognitive 17): deprecate_lint::remove_lint_declaration has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 2, loops 2 (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 declared inside it (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":"src/tools/clippy/clippy_dev/src/deprecate_lint.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb24ff1129026ea80fa56e833e15842fa69e5cfd7dbf80d777c5641f087312e"}},{"ruleId":"D2","level":"warning","message":{"text":"EmptyLineAfter::check_gaps (cognitive 17): EmptyLineAfter::check_gaps has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7, match/switch 4, boolean chains 3, loops 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/empty_line_after.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f04949757097da623eab2b3add6db7845b925f934627ed684c7568c6caa9e4"}},{"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 13, 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":"src/tools/clippy/clippy_lints/src/non_expressive_names.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccf2b6bee0bf9574d1db10ba0c6dad372ffe728b9f57c4cbdee453e71713682"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintVisitor::expr (cognitive 17): PrintVisitor::expr has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 12, if/else 5 (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":"src/tools/clippy/clippy_lints/src/utils/author.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d33b88ea238b6848053779027e70f3ca8732e1a2457bf72c0660b5a69bf6a4e"}},{"ruleId":"D2","level":"warning","message":{"text":"VecPushSearcher::display_err (cognitive 17): VecPushSearcher::display_err has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 4, loops 2, 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":"src/tools/clippy/clippy_lints/src/vec_init_then_push.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ba6f920e3f7efa91be61e0d6f5904e300d225754f7b1b2208cd518e9d313f3"}},{"ruleId":"D2","level":"warning","message":{"text":"infinite_iter::is_infinite (cognitive 17): infinite_iter::is_infinite has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, match/switch 5, boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/infinite_iter.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4276c3f0da87691317c591f204574ca54a2d8e7569c8f4fcb84a41e8f4e452d2"}},{"ruleId":"D2","level":"warning","message":{"text":"ref_option::check_fn (cognitive 17): ref_option::check_fn has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, 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":"src/tools/clippy/clippy_lints/src/functions/ref_option.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9c3d86a820bc542b39ee47c9563a1f43f8c375538f5e48d9b741f7e48fa41d"}},{"ruleId":"D2","level":"warning","message":{"text":"unnecessary_cast::is_cast_from_ty_alias (cognitive 17): unnecessary_cast::is_cast_from_ty_alias has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/unnecessary_cast.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32c88ef17f88274bdda715d4742b3b1e4ef92c94e1d0a76474d7f1611f11d5d"}},{"ruleId":"D2","level":"warning","message":{"text":"manual_flatten::check (cognitive 17): manual_flatten::check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, match/switch 5, boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/manual_flatten.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fff3eac3f5db914b04890246d1867d5a0c573e2053f454e51896337a46eb55b"}},{"ruleId":"D2","level":"warning","message":{"text":"reference::is_manually_drop_through_union (cognitive 17): reference::is_manually_drop_through_union has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/reference.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"62522caa0bdfc57dec23a9b671e959e7c1a14e2eb1e667c2cf4f1f5ecaab1ef9"}},{"ruleId":"D2","level":"warning","message":{"text":"lifetimes::has_where_lifetimes (cognitive 17): lifetimes::has_where_lifetimes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7, loops 7, match/switch 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/lifetimes.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e5784e64610e515988190c61dff464bcf1ba40e631d73b257f0458ffcec531"}},{"ruleId":"D2","level":"warning","message":{"text":"no_effect::has_no_effect (cognitive 17): no_effect::has_no_effect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 4, match/switch 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/no_effect.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59298935983b944d0013ec0fcbc6494c7fcfbe95d03c1ad9156d03851c7b8a5"}},{"ruleId":"D2","level":"warning","message":{"text":"no_effect::check_unnecessary_operation (cognitive 17): no_effect::check_unnecessary_operation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, loops 3, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/no_effect.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04c71ce68ed902e6527122a1ff2f2d574f98be347206499d36b34b23748d93b"}},{"ruleId":"D2","level":"warning","message":{"text":"filter_map::check (cognitive 17): filter_map::check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, match/switch 5 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/filter_map.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0c9bcbb9a88e918f3864b184228ca66123fe294f5564f947d801f71a8fb8ba"}},{"ruleId":"D2","level":"warning","message":{"text":"visitors::for_each_unconsumed_temporary::helper (cognitive 17): visitors::for_each_unconsumed_temporary::helper has cognitive complexity 17 (threshold 15). Drivers by points: loops 8, if/else 5, match/switch 3, 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":"src/tools/clippy/clippy_utils/src/visitors.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b3b597716e1dfa0ea6e5b4a6829659c23ad354bf788ceb0aba7f54b6f8e17d"}},{"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 12, match/switch 3, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":3295}}}],"partialFingerprints":{"codehealthFindingId/v1":"23eb080c9e8223f3be96b449dcdc9021558b80dd80cbd6410718785eb1cb0cf3"}},{"ruleId":"D2","level":"warning","message":{"text":"qualify_min_const_fn::check_ty (cognitive 17): qualify_min_const_fn::check_ty has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 8, if/else 5, loops 4 (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":"src/tools/clippy/clippy_utils/src/qualify_min_const_fn.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2320e46c8a6b9ff45a725c4eb5288ea7adc7c39ef3107b2df9d65c99aac01b13"}},{"ruleId":"D2","level":"warning","message":{"text":"ast_utils::eq_item_kind (cognitive 17): ast_utils::eq_item_kind has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 14, match/switch 3 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f04e1e064697c62c85fc6e5b9b6ea6b8f60336bb4598a3edcfd7ec8f6b0b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::run_pretty_test (cognitive 17): TestCx::run_pretty_test has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, match/switch 4, 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":"src/tools/compiletest/src/runtest/pretty.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9b3eb1237604fd20e38358d76c99ba8a18a883bf46217550a97beacd2a4896"}},{"ruleId":"D2","level":"warning","message":{"text":"jsondoclint::main (cognitive 17): jsondoclint::main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, match/switch 7, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/jsondoclint/src/main.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6bfbf7a774f1b067ada676710bebad6810d6646dfd70805699f407dc357aee"}},{"ruleId":"D2","level":"warning","message":{"text":"Stack::access (cognitive 17): Stack::access has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, loops 2, 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":"src/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7cc66d81eb36a5707b33e00f45ea89b0f36ebaa1602cb1e1f5831083213d84"}},{"ruleId":"D2","level":"warning","message":{"text":"Stack::disable_uniques_starting_at (cognitive 17): Stack::disable_uniques_starting_at has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, loops 6 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/borrow_tracker/stacked_borrows/stack.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf06532240b02c8485f1cab2a4eefae6f685cf3317d7cd9646270163701b64b"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_x86_avx_intrinsic (cognitive 17): EvalContextExt::emulate_x86_avx_intrinsic has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 11, loops 4, 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":"src/tools/miri/src/intrinsics/x86/avx.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"746b82a94a0068e60dc1ce67bf611e7a7a3812782db6a642554d4ba46c1807dc"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_x86_sse2_intrinsic (cognitive 17): EvalContextExt::emulate_x86_sse2_intrinsic has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 15, loops 2 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/x86/sse2.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f06f7796ac151ecaaa2234574126b08b3c94e73c8e294629d1629a5236597ef"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextPrivExt::virtual_socket_read (cognitive 17): EvalContextPrivExt::virtual_socket_read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, loops 3, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/virtual_socket.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead509024dac19c6eb125abb6aa922af73db197d7f9f7a1560c5949e617e441f"}},{"ruleId":"D2","level":"warning","message":{"text":"math::fixed_float_value (cognitive 17): math::fixed_float_value has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 6, match/switch 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/math.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbaa1c2b8dfce260d8ecd3f82be0a286715e38c2eb9f4b48999c03b1afdf93e"}},{"ruleId":"D2","level":"warning","message":{"text":"UseTreeLowering::lower_use_tree (cognitive 17): UseTreeLowering::lower_use_tree has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 9, if/else 7, boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/item_tree/lower.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b54af27cf67b7fdbaa48060482b70ffa70a0108a67ff704997088adad99d059"}},{"ruleId":"D2","level":"warning","message":{"text":"ModCollector::collect_macro_rules (cognitive 17): ModCollector::collect_macro_rules has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 13, if/else 4 (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":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":2493}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e34351c8c6a6e278a3ad4e9b699221d40f1c84737d188071c4042480a32039"}},{"ruleId":"D2","level":"warning","message":{"text":"Scope::process_names (cognitive 17): Scope::process_names has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, match/switch 5, loops 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"4714bb7b36cf4b74e266e08607ca8a933a5f3dc44fe1f82f472ae3f14e2d4cc8"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionSignature::with_source_map (cognitive 17): FunctionSignature::with_source_map has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/signatures.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea153019d0735de7d20d2ea55450e3f3ba02a1aebd3c03485aabb3c6cd097fc5"}},{"ruleId":"D2","level":"warning","message":{"text":"CoerceMany::coerce_inner (cognitive 17): CoerceMany::coerce_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, match/switch 6 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"783d3fa5377ca2ff5ecbca2862cbe25735081a7c67da24787b97792e618e7120"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_method_call (cognitive 17): InferenceContext::infer_method_call has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 9, if/else 5, loops 3 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"466c2c4145646751cf18b3d4628f197832460320b45ec0b76c841177db28beef"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::run_drop_glue_deep (cognitive 17): Evaluator::run_drop_glue_deep has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, match/switch 6, loops 4, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":3080}}}],"partialFingerprints":{"codehealthFindingId/v1":"b879ccf44cf6390c1d281f21708c5ded0dc4c67c64a5c418949e999b21538cbb"}},{"ruleId":"D2","level":"warning","message":{"text":"Generalizer::consts (cognitive 17): Generalizer::consts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, match/switch 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/relate/generalize.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"9399fb86f47489da6e4e8f2d2da6736517fff735e3e282f90174e89d55c2faa8"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceFudger::fold_ty (cognitive 17): InferenceFudger::fold_ty has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/snapshot/fudge.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d786c50916a76260bd8cb6ea1b061c2b5aacd7c510d5556ef51abdae1270434"}},{"ruleId":"D2","level":"warning","message":{"text":"drop::has_drop_glue_impl (cognitive 17): drop::has_drop_glue_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, match/switch 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/drop.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9139e2a8127ebbe7c147cffc4f71cb84758ba33b90681599191ad73744b24d"}},{"ruleId":"D2","level":"warning","message":{"text":"path::check_generic_args_len (cognitive 17): path::check_generic_args_len has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, match/switch 6, boolean chains 3, 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":"src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7ce43792e2a50d703f4fb2fe4e7c062d734ce1fbb3aa915d0b5d83cc08a5ef"}},{"ruleId":"D2","level":"warning","message":{"text":"dyn_compatibility::virtual_call_violations_for_method (cognitive 17): dyn_compatibility::virtual_call_violations_for_method has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 3, 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":"src/tools/rust-analyzer/crates/hir-ty/src/dyn_compatibility.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"c867b1d11309a50ebe32ddd3e1bed84cd7ee428d9d2d5842887e6b4c53248c98"}},{"ruleId":"D2","level":"warning","message":{"text":"inject::doc_comment (cognitive 17): inject::doc_comment has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, loops 6, match/switch 4, 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":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/inject.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5688a3895e2ad37034026628153434ca3fd57bf8e5c34abfa8d5324ad36d21f8"}},{"ruleId":"D2","level":"warning","message":{"text":"signature_help::signature_help_for_generics (cognitive 17): signature_help::signature_help_for_generics has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, match/switch 3, boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0fcbcaa526b98ef67d2c5c6dffa9202759948dc986a23919cb382524b40d83"}},{"ruleId":"D2","level":"warning","message":{"text":"goto_definition::nav_for_exit_points (cognitive 17): goto_definition::nav_for_exit_points has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, match/switch 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/goto_definition.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a97ff31d23ddda2cfa1b044c4c87ad156074be2b4c8ae359cb1920a42fe6e8a"}},{"ruleId":"D2","level":"warning","message":{"text":"GeneratedFunctionTarget::insert_fn_at (cognitive 17): GeneratedFunctionTarget::insert_fn_at has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, match/switch 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15e38e98a75049054228e8b034050ce0f7aa77733def1ffc7707ba80cf8c85e"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_struct_from_enum_variant::create_struct_def (cognitive 17): extract_struct_from_enum_variant::create_struct_def has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_struct_from_enum_variant.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bc747157022baa70881640b181c91a78347bc6d5792e4ca6f7f19a43195343"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_into_to_from::convert_into_to_from (cognitive 17): convert_into_to_from::convert_into_to_from has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, match/switch 4, boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_into_to_from.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"46176bda134e3d6d99121f5aa9bbfce7ee66def527b21a6cdf1ae297e4f082c8"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_let_else_to_match::remove_mut_and_collect_idents (cognitive 17): convert_let_else_to_match::remove_mut_and_collect_idents has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, 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":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_let_else_to_match.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ef1eb5f89c8e32644e067f5a4abb041cf4e8656472c6efa973f2fd78e6e391"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_named_struct_to_tuple_struct::edit_field_references (cognitive 17): convert_named_struct_to_tuple_struct::edit_field_references has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, loops 6, match/switch 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_named_struct_to_tuple_struct.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"824f2d8bd4eeb9be253eb45434dd4a48a71a1b6bfb76e28af7f3efd319725d42"}},{"ruleId":"D2","level":"warning","message":{"text":"mod_::complete_mod (cognitive 17): mod_::complete_mod has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, match/switch 6, 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":"src/tools/rust-analyzer/crates/ide-completion/src/completions/mod_.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5559b4378615b8587657f12e174ff11a004ef5a98a9e46c5d99a5ad3b474ca"}},{"ruleId":"D2","level":"warning","message":{"text":"format_like::add_format_like_completions (cognitive 17): format_like::add_format_like_completions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, loops 4, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/postfix/format_like.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52f59a07cb057d6122e00206317ca49a9ebd6ae443351cd0d76fd16ff7eb4d2"}},{"ruleId":"D2","level":"warning","message":{"text":"derive::complete_derive_path (cognitive 17): derive::complete_derive_path has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 10, if/else 3, boolean chains 2, loops 2 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/attribute/derive.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3b35e4298fa77724d1109731e08334c8249f5ca2797dafdca6518c7a8a90b4"}},{"ruleId":"D2","level":"warning","message":{"text":"function::ref_of_param (cognitive 17): function::ref_of_param has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/render/function.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"6472cfe586c93ea09d8e4cd25e69e7ac9c19e07da75695484a1da8c108066873"}},{"ruleId":"D2","level":"warning","message":{"text":"LexedStr::to_input (cognitive 17): LexedStr::to_input has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/shortcuts.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f486825dc71f895226aeda743dd2531fff3f9102757c0c172494940fd5447601"}},{"ruleId":"D2","level":"warning","message":{"text":"expressions::record_expr_field_list (cognitive 17): expressions::record_expr_field_list has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, match/switch 2, boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98739901a69c3abe4f167a462a6cabf3fa28788b2b0501a32a48db7b7ed777c"}},{"ruleId":"D2","level":"warning","message":{"text":"event::process (cognitive 17): event::process has cognitive complexity 17 (threshold 15). Drivers by points: loops 7, match/switch 6, if/else 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":"src/tools/rust-analyzer/crates/parser/src/event.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cd8f51f1d6e54e8701f1745ecaaa10d08f2193d4eb33489cac1dff7eb47588"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceBuildScripts::run_once (cognitive 17): WorkspaceBuildScripts::run_once has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, loops 6 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/build_dependencies.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e9ff56b5455711036232e0a18d621bf5a02a9020c798c24bc0ea86c21497fc"}},{"ruleId":"D2","level":"warning","message":{"text":"validation::validate_path_keywords (cognitive 17): validation::validate_path_keywords has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 3, match/switch 2, loops 1 (nesting depth added 7). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to one function item declared inside it (use_prefix). 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":"src/tools/rust-analyzer/crates/syntax/src/validation.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"492fbe694bdc148438042f69ef5381781146edac1d0c191918a7396390641a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"GetOptsOptions::apply_to (cognitive 17): GetOptsOptions::apply_to has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/bin/main.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"4881849657f9723e416efb68cc4b1ac5bb313c9e2cd1aece106762fb531287f2"}},{"ruleId":"D2","level":"warning","message":{"text":"FmtVisitor::process_comment (cognitive 17): FmtVisitor::process_comment has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, match/switch 4, 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":"src/tools/rustfmt/src/missed_spans.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6d3a60444e8480c3ff3a0ac97b16df27da1c0881ed0571fdf43d31d155543c"}},{"ruleId":"D2","level":"warning","message":{"text":"matches::rewrite_guard (cognitive 17): matches::rewrite_guard has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/matches.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd56c0303c836b05dbf41b55605f5866aeca100bf3898f0631daeda9af20186"}},{"ruleId":"D2","level":"warning","message":{"text":"macros::wrap_macro_args_inner (cognitive 17): macros::wrap_macro_args_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/macros.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"61db8bb071b59abcbd10c4c0d9bbf3673592f0ecdfee14bc444c8e4516a51ac1"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc_json::check (cognitive 17): rustdoc_json::check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, match/switch 3, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/rustdoc_json.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a68a6bd01cc3a33b65a915f3b786ac9badc4ee2a68a4b3987d730a9ee62eedc"}},{"ruleId":"D2","level":"warning","message":{"text":"parseOptions (cognitive 17): parseOptions has cognitive complexity 17 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustdoc-js/tester.js"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"601b49b2a2a4e219bd55538d74bda070e3978d8cd79570133332102c587dae1b"}},{"ruleId":"D2","level":"warning","message":{"text":"showResults (cognitive 17): showResults has cognitive complexity 17 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":5233}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ff3e39f484a256bb3a18150263c4d741e964c984b15789605da989cf471061"}},{"ruleId":"D2","level":"warning","message":{"text":"classify::type_trailing_braced_mac_call (cognitive 16): classify::type_trailing_braced_mac_call has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 15, loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/util/classify.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a34ffa305cc8332bd67f12d972a04c2c806d1567b7414204675cd983f37aabc"}},{"ruleId":"D2","level":"warning","message":{"text":"format::flatten_format_args (cognitive 16): format::flatten_format_args has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, loops 4, match/switch 4, 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":"compiler/rustc_ast_lowering/src/format.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"25780c1523431554836ea0f7e02e6101f1c6472b855be66bb9937e53526ba401"}},{"ruleId":"D2","level":"warning","message":{"text":"AstValidator::check_extern_fn_signature (cognitive 16): AstValidator::check_extern_fn_signature has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, match/switch 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e712646be0d3491c97e17c29d5cf6711009cd90a8fad2b6ae6640d439d5db8"}},{"ruleId":"D2","level":"warning","message":{"text":"NakedParser::finalize (cognitive 16): NakedParser::finalize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, loops 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/codegen_attrs.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"138611df45930dc6774b4d1b1f9f864a90f1ab6991add0006da2f69c569bbf09"}},{"ruleId":"D2","level":"warning","message":{"text":"AttributeParser::check_attribute_safety (cognitive 16): AttributeParser::check_attribute_safety has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 3, 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":"compiler/rustc_attr_parsing/src/safety.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84cf613bf33d316375d40da1008497959874af784150967016c9f40159e1e34"}},{"ruleId":"D2","level":"warning","message":{"text":"GatherBorrows::visit_assign (cognitive 16): GatherBorrows::visit_assign has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16 (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":"compiler/rustc_borrowck/src/borrow_set.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b717bc129fd9845357bfe817bf9fe6908046282494766296c36c439c666189"}},{"ruleId":"D2","level":"warning","message":{"text":"OutlivesSuggestionBuilder::compile_all_suggestions (cognitive 16): OutlivesSuggestionBuilder::compile_all_suggestions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, loops 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":"compiler/rustc_borrowck/src/diagnostics/outlives_suggestion.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5928db446a987980457398ad1c3559ffabda4c04bf7a552b71b77d3dd7f89d"}},{"ruleId":"D2","level":"warning","message":{"text":"MirBorrowckCtxt::suggest_similar_mut_method_for_for_loop (cognitive 16): MirBorrowckCtxt::suggest_similar_mut_method_for_for_loop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 4, match/switch 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c6575a913c2b993c083b9732202cb72e3e0bcc9855715682ad36747eda2c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"LivenessResults::compute_drop_live_points_for_block (cognitive 16): LivenessResults::compute_drop_live_points_for_block has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/liveness/trace.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b6cc0ec35888058e8f205b359322dc24677f47fc1bcd4b229f4953668859ba"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeChecker::add_generic_reborrow_constraint (cognitive 16): TypeChecker::add_generic_reborrow_constraint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 5 (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":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"765d1e66fe980a7e6fa69aef4d6a342f20873ac7214b6ce038905576282dae63"}},{"ruleId":"D2","level":"warning","message":{"text":"opaque_types::compute_definition_site_hidden_types_from_defining_uses (cognitive 16): opaque_types::compute_definition_site_hidden_types_from_defining_uses has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 2, 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":"compiler/rustc_borrowck/src/region_infer/opaque_types/mod.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"899786aab2dbd437c1410016434bba5e147c9205f8c21896d2b21657dd42f89d"}},{"ruleId":"D2","level":"warning","message":{"text":"places_conflict::place_components_conflict (cognitive 16): places_conflict::place_components_conflict has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, match/switch 5, loops 3, 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":"compiler/rustc_borrowck/src/places_conflict.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c095bdbc8ceaebbd0c05dc62c4e02b60c46f0484992564146346891709961e5e"}},{"ruleId":"D2","level":"warning","message":{"text":"env::expand_env (cognitive 16): env::expand_env has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 8, if/else 6, boolean chains 2 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/env.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"427c42815ab6cf84e40d271b587e8decd9f4db8f95249925335ee85b92dcd8c8"}},{"ruleId":"D2","level":"warning","message":{"text":"generic::cs_fold (cognitive 16): generic::cs_fold has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/deriving/generic/mod.rs"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c56a96263a5911623fe4fc817bd16b5437694b1dfc89a9153965e2a1cea0f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"Option::merge (cognitive 16): Option::merge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"src/bootstrap/src/core/config/mod.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"96024de49266e1f75ed04341d9c1e05f844e2e8c8451726fbbe8208d436cfa5b"}},{"ruleId":"D2","level":"warning","message":{"text":"abi::codegen_call_with_unwind_action (cognitive 16): abi::codegen_call_with_unwind_action has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, match/switch 8 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed271757cf769cc789212d9bd2bb780394d58bb786f7897d63369f546285b9e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::gcc_lshr (cognitive 16): Builder::gcc_lshr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 3, match/switch 3 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aae43ff3c7fca03af97225e4250e52b9949c635faab391add4c9a76b77bd6ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::gcc_shl (cognitive 16): Builder::gcc_shl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 5, match/switch 3 (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":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8f7fff9f6a3c7580875d3ed2e594fedea02e3d3d84226ca1aaaee319c8a1ce"}},{"ruleId":"D2","level":"warning","message":{"text":"CodegenCx::scalar_to_backend_with_pac (cognitive 16): CodegenCx::scalar_to_backend_with_pac has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, match/switch 3, 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":"compiler/rustc_codegen_gcc/src/common.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c314a07d7e5355818cd3a20ae31270a7e4c7a05ea10de8e10fe4f07e3026115"}},{"ruleId":"D2","level":"warning","message":{"text":"llvm::adjust_intrinsic_arguments (cognitive 16): llvm::adjust_intrinsic_arguments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, match/switch 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":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0724cfcc27a24f878f0bbba930c6dd27258f31253ac5ada0b2beb2c519b6b7"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::cfi_type_test (cognitive 16): Builder::cfi_type_test has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, 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":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b8ad3b39fbba1e0cb8f674a4586c02fbe2562e60c128cecf2100a3d77e3737"}},{"ruleId":"D2","level":"warning","message":{"text":"asm::llvm_fixup_input (cognitive 16): asm::llvm_fixup_input has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, match/switch 3, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e27c2d4f258558bf507091783f064d2a9343fe730f3e80891b01fcd04706cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"asm::llvm_fixup_output (cognitive 16): asm::llvm_fixup_output has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, match/switch 3, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19fbf48b1a44637df9b7ee4bfc0bf15fa0b20f8bb48541b932eaf224c207ccd"}},{"ruleId":"D2","level":"warning","message":{"text":"consts::const_alloc_to_llvm (cognitive 16): consts::const_alloc_to_llvm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, match/switch 4, loops 1 (nesting depth added 4). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item declared inside it. 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":"compiler/rustc_codegen_llvm/src/consts.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"588e16c5abf3ee97127f445b4aac4519204f6c74f65e8a6a193f752bcdcfa71c"}},{"ruleId":"D2","level":"warning","message":{"text":"GccLinker::set_output_kind (cognitive 16): GccLinker::set_output_kind has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 4, 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":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"d522d0185a5fd03c49e40e3f69101d78fa57d38448d0a7df147634e2cc16852c"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminatorCodegenHelper::do_inlineasm (cognitive 16): TerminatorCodegenHelper::do_inlineasm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"5828439158932b266b7dd96dd86e31a3c36471b5b024a9bdd631f54c106917a8"}},{"ruleId":"D2","level":"warning","message":{"text":"ObligationForest::register_obligation_at (cognitive 16): ObligationForest::register_obligation_at has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, match/switch 3, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_data_structures/src/obligation_forest/mod.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7e133924ec4390aaf47591e1934033a8a97a41a1e8212bad6949a66129f69f"}},{"ruleId":"D2","level":"warning","message":{"text":"macro_check::check_binders (cognitive 16): macro_check::check_binders has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 4, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/macro_check.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d7b4e3fd52bde70023220cd975d3b7633c035b8290e395772514d74c7f8d17"}},{"ruleId":"D2","level":"warning","message":{"text":"quoted::parse (cognitive 16): quoted::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/quoted.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"edab3a677d0d4facb2b0362d521c522a146532cbab12243033c25da98d0eb998"}},{"ruleId":"D2","level":"warning","message":{"text":"InherentCollect::check_def_id (cognitive 16): InherentCollect::check_def_id has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, loops 2, 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":"compiler/rustc_hir_analysis/src/coherence/inherent_impls.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f8b79391ed00caf0dae4936edae29924c60f9f39a0bb4a93028d81670670c6"}},{"ruleId":"D2","level":"warning","message":{"text":"InherentCollect::check_primitive_impl (cognitive 16): InherentCollect::check_primitive_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, loops 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":"compiler/rustc_hir_analysis/src/coherence/inherent_impls.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad19bad11099f638017291c4dfdd8c8055a82122848d9e58301b21c22450f71"}},{"ruleId":"D2","level":"warning","message":{"text":"TaitConstraintLocator::check (cognitive 16): TaitConstraintLocator::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, match/switch 3, 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":"compiler/rustc_hir_analysis/src/collect/type_of/opaque.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae32e69aaef95db0b63ec43db738767d92871b3ad331d2e3a4e969fe5ebb8e9b"}},{"ruleId":"D2","level":"warning","message":{"text":"wfcheck::receiver_is_valid (cognitive 16): wfcheck::receiver_is_valid has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"149638d43b3bb35b7c572dddf2e3251ecc3e69366d61ec51c362ed738af8cf49"}},{"ruleId":"D2","level":"warning","message":{"text":"dump::vtables (cognitive 16): dump::vtables has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, match/switch 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/dump.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afe3b22118444be96422aa8f52ccde1a7e0483c8b60f622bb25373ae4c4c31d"}},{"ruleId":"D2","level":"warning","message":{"text":"State::print_fn (cognitive 16): State::print_fn has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":2258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a486e6aa065f6bd6a88b4f421c39dcc1fabd2772b78408fd65f8a41cb3297fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Coerce::coerce (cognitive 16): Coerce::coerce has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, match/switch 3, 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":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfb858e68c713bcae3da59a48029e9c274b4964ab50bcdc069139cc3939dfb1"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::check_repeat_exprs (cognitive 16): FnCtxt::check_repeat_exprs has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 8, if/else 7, loops 1 (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":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c9c5eefe63054e42285e57e9ce0d1245eb8e467caa46d4b3a7f99cfbb15293"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::suggest_returning_value_after_loop (cognitive 16): FnCtxt::suggest_returning_value_after_loop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, match/switch 5, boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":2446}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bcdbaf82e0fd3bd252a5328a0a2fededca9939510c2b5803d57117bdc849ed"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::create_no_assoc_err (cognitive 16): FnCtxt::create_no_assoc_err has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, 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":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46d40d8f081caaed3ddf227e536b01b3f3665beebc86645bc018505152377bc"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::compute_2229_migrations_for_trait (cognitive 16): FnCtxt::compute_2229_migrations_for_trait has cognitive complexity 16 (threshold 15). Drivers by points: loops 8, if/else 6, boolean chains 1, match/switch 1 (nesting depth added 6). 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"858134d7ba1eaee7ea0c5628af83d06e2f1edf02f135f869572e0a65983b6580"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::compute_2229_migrations (cognitive 16): FnCtxt::compute_2229_migrations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, loops 5, match/switch 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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6beb89b579cc1adec40a34f64270e25615b613adba4a6f71341cadee4f0d08"}},{"ruleId":"D2","level":"warning","message":{"text":"FnCtxt::log_closure_min_capture_info (cognitive 16): FnCtxt::log_closure_min_capture_info has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, loops 7 (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":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7cf865b4586de5e5d44312642e6ff133dd3640dd4ffc37f37d7c7c7ff3d652"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::decl_description (cognitive 16): Resolver::decl_description has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 2, match/switch 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":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfabab473afbc7c0356694d2c4ed08d65ddb00f5cfec431db4895026ac184bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::resolve_macro_or_delegation_path (cognitive 16): Resolver::resolve_macro_or_delegation_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, match/switch 5, boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ffc2066f6a71cef1568f911371651c9d566c9483ab06e1629f7871d7af5be9"}},{"ruleId":"D2","level":"warning","message":{"text":"fallback::compute_unsafe_infer_vars (cognitive 16): fallback::compute_unsafe_infer_vars has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 3, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fallback.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"9698afd67b761ae100096db43c268c8bc0383d35ba822fef2443a3cb024cef94"}},{"ruleId":"D2","level":"warning","message":{"text":"LintLevelsBuilder::insert_spec (cognitive 16): LintLevelsBuilder::insert_spec has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, match/switch 5, boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/levels.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced37b8b5a85d493c74e8ab1abdf2063fdf74649e9638cf06376dc60ebff15e7"}},{"ruleId":"D2","level":"warning","message":{"text":"UnusedDelimLint::check_expr (cognitive 16): UnusedDelimLint::check_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, boolean chains 4, match/switch 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1f3be66a90e55d670cc264dd1932898f61155617117a16a1864cc298dc363d"}},{"ruleId":"D2","level":"warning","message":{"text":"utils::build_format (cognitive 16): utils::build_format has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, loops 5, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/diagnostics/utils.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5147dd5203627768c1cc160f7e2e5901784cb3da380b6bc178b923c6bb8d29f"}},{"ruleId":"D2","level":"warning","message":{"text":"symbols::symbols_with_errors (cognitive 16): symbols::symbols_with_errors has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7, if/else 5, loops 4 (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":"compiler/rustc_macros/src/symbols.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bff8c860778cb37ddbc28534fc050c33a581071b8c5f9161bb419035b29dc7"}},{"ruleId":"D2","level":"warning","message":{"text":"DepGraph::read_index (cognitive 16): DepGraph::read_index has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, match/switch 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/dep_graph/graph.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"86620817d07cbd9ed636d9d326814b7775c91ba616c9c6aecc4ebb5d4bc04705"}},{"ruleId":"D2","level":"warning","message":{"text":"EffectiveVisibilities::update (cognitive 16): EffectiveVisibilities::update has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/middle/privacy.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9ae20ef738e078de44766828a2671213e70dc0aa3836d3381e28a2c5d646ba"}},{"ruleId":"D2","level":"warning","message":{"text":"InitMaskMaterialized::find_bit::find_bit_fast (cognitive 16): InitMaskMaterialized::find_bit::find_bit_fast has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/interpret/allocation/init_mask.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"269a491e829984791e87853e2c441af3efebdf4e6a35f36889d4ec9ae097f5bd"}},{"ruleId":"D2","level":"warning","message":{"text":"ProvenanceMap::read_ptr (cognitive 16): ProvenanceMap::read_ptr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 2, match/switch 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/interpret/allocation/provenance_map.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"176104db240868733350aa5bf20124cd75488b35eee314d68bb65f0a3233cd2b"}},{"ruleId":"D2","level":"warning","message":{"text":"ProvenanceMap::prepare_copy (cognitive 16): ProvenanceMap::prepare_copy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, loops 6, 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":"compiler/rustc_middle/src/mir/interpret/allocation/provenance_map.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"9228bf99c82d4922051ce380cd35fdb82a7267312d4398c1e7d11b6d3a794d94"}},{"ruleId":"D2","level":"warning","message":{"text":"MonoItem::instantiation_mode (cognitive 16): MonoItem::instantiation_mode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 3, match/switch 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mono.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb18fbbc04ece18415cda7e7296b03e0d7f8deefe45f011ea91d456212996aa0"}},{"ruleId":"D2","level":"warning","message":{"text":"FmtPrinter::print_type (cognitive 16): FmtPrinter::print_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 6, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"9676ebeab885c822cc81296fbcf25f3ce84a442867ccd6942e184791b00262be"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::as_temp_inner (cognitive 16): Builder::as_temp_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 3, match/switch 3 (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":"compiler/rustc_mir_build/src/builder/expr/as_temp.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e441473c78d29b3a0dd7beb823d4c205ae722b29b15eaac39e0b6e161ae70150"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::break_for_tail_call (cognitive 16): Builder::break_for_tail_call has cognitive complexity 16 (threshold 15). Drivers by points: loops 7, if/else 5, match/switch 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":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c86507a1430cb7420c29cc4fa5a7b5e34ecb5aadc1b241c2c02c43964da19a"}},{"ruleId":"D2","level":"warning","message":{"text":"ElaborateBoxDerefs::run_pass (cognitive 16): ElaborateBoxDerefs::run_pass has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, loops 5, 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":"compiler/rustc_mir_transform/src/elaborate_box_derefs.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e6b24824157dd5b5754d6ecb70c61852cec2c50e914b27a997693ce2c15bd4"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionItemRefChecker::visit_terminator (cognitive 16): FunctionItemRefChecker::visit_terminator has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, loops 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":"compiler/rustc_mir_transform/src/function_item_references.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb0927b33cc664b2e6e962d8ae9d290161b4720723a078ce63fd7701540fcd0"}},{"ruleId":"D2","level":"warning","message":{"text":"jump_threading::remove_costly_conditions (cognitive 16): jump_threading::remove_costly_conditions has cognitive complexity 16 (threshold 15). Drivers by points: loops 9, match/switch 4, if/else 3 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fc3c21ddf3cbbfe8fc3a8c62784373e498e2b1051da857325f11d1a45581ce"}},{"ruleId":"D2","level":"warning","message":{"text":"fast_path::rerunning_stalled_goal_may_make_progress (cognitive 16): fast_path::rerunning_stalled_goal_may_make_progress has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, match/switch 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":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/fast_path.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9a2fd2301ea2f7b21d8bd1f471b1b69d136efd6a2e57603f986698dd0b8e8f"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_inner_attributes (cognitive 16): Parser::parse_inner_attributes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, 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":"compiler/rustc_parse/src/parser/attr.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"4596327636dbb24c69528ae53e3e9b5db494819116cd376f627750d21ddd0421"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::conflict_marker (cognitive 16): Parser::conflict_marker has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":3018}}}],"partialFingerprints":{"codehealthFindingId/v1":"e727eab85dcd6a63840b33fc0c8b5c19df9efbcd9065134dbaad32fcd877d883"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_const_item (cognitive 16): Parser::parse_const_item has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 2, match/switch 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87aeab969555b6ceda52ff0e4594c32687fd860aaf3d00a99fd880a346434a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_tuple_struct_body (cognitive 16): Parser::parse_tuple_struct_body has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, match/switch 4, 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":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac505430bec4547f1ce10d44bf5d6c58266f842b32e3a1434c82c6973c14a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_single_struct_field (cognitive 16): Parser::parse_single_struct_field has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 4, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"a374c96bac1210ae8ffef4b570e592d2998a09dc099cf1440429154fe9e3c3e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_trait_bound_modifiers (cognitive 16): Parser::parse_trait_bound_modifiers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 3, match/switch 3 (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":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59a86a10be938532008dffb834f4bed2228c6582746c681db857d321a22163f"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckAttrVisitor::check_attributes (cognitive 16): CheckAttrVisitor::check_attributes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, match/switch 5, boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d890eaffbc491a66e68c551eb1010ca136759cb80cf25da1fcc7054f5bb4d4"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicateLangItem::into_diag (cognitive 16): DuplicateLangItem::into_diag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, match/switch 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/diagnostics.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb12482bdc16e33733b3071a1a6c4360b28b8d24293ccb854d64494fa1e4db3"}},{"ruleId":"D2","level":"warning","message":{"text":"LanguageItemCollector::check_for_lang (cognitive 16): LanguageItemCollector::check_for_lang has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 2, match/switch 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":"compiler/rustc_passes/src/lang_items.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6330d8bd10743b482971b1eebb91e5e51579fd7c04a96800136a03a2c1a786ee"}},{"ruleId":"D2","level":"warning","message":{"text":"eii::check_externally_implementable_items (cognitive 16): eii::check_externally_implementable_items has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, loops 6, match/switch 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":"compiler/rustc_passes/src/eii.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"673d222fc7dc92b1643937810fffa91d0907df0d72e95697eaff1adcf69ea765"}},{"ruleId":"D2","level":"warning","message":{"text":"UnusedImportCheckVisitor::report_unused_extern_crate_items (cognitive 16): UnusedImportCheckVisitor::report_unused_extern_crate_items has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"compiler/rustc_resolve/src/check_unused.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34d08b8d195fd4e32e63137702790ab89fc812cd91111aeab8e68ecf87437a4"}},{"ruleId":"D2","level":"warning","message":{"text":"DefCollector::build_reduced_graph_for_extern_crate (cognitive 16): DefCollector::build_reduced_graph_for_extern_crate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 3, match/switch 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":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3ea3e3cc62837f62d15d48757827c47c25ccb64c655258eb0ec03e7af321d2"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::parse_links (cognitive 16): rustdoc::parse_links has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, loops 2, 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":"compiler/rustc_resolve/src/rustdoc.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99f02452c2b1eae63d6e7f416aa4efbcff91b38b68fa8acceb3c2122496b240"}},{"ruleId":"D2","level":"warning","message":{"text":"parse::parse_instrument_xray (cognitive 16): parse::parse_instrument_xray has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, match/switch 5, boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/options.rs"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f46976001ead629775aadc95e130ef8bc13b1a926000ce2699a73eeeb1afcc"}},{"ruleId":"D2","level":"warning","message":{"text":"session::build_session (cognitive 16): session::build_session has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, match/switch 3, boolean chains 1, loops 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":"compiler/rustc_session/src/session.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e96748ada78e60cdb6c0f18a7bfb3a482ab14954222d932518ca7b0b823fc20"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnostics::create_lit_error (cognitive 16): diagnostics::create_lit_error has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, match/switch 6, boolean chains 3 (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 4 belong to 2 function items declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/diagnostics.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7247ff980664ee01c88ef7ca2119ddf60a6ee0841c307f27c960e4b89eda689"}},{"ruleId":"D2","level":"warning","message":{"text":"Target::abi_required_features (cognitive 16): Target::abi_required_features has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 16 (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":"compiler/rustc_target/src/target_features.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9abee87046d20d71e850b146a8d6a34466ce72098aa8a3173b75169e9b10acb"}},{"ruleId":"D2","level":"warning","message":{"text":"x86_64::classify_arg::classify (cognitive 16): x86_64::classify_arg::classify has cognitive complexity 16 (threshold 15). Drivers by points: loops 6, if/else 5, match/switch 5 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/callconv/x86_64.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8768a1a8a63984020c34668e2cf24a575d2147402c9e0f7e4456d22e6eb60f1"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::expected_projection (cognitive 16): TypeErrCtxt::expected_projection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 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":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f1f4d759c8df14a226497a0ccfe0880e7a5d89373c77d560c902ee7be239b5"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeErrCtxt::check_same_definition_different_crate (cognitive 16): TypeErrCtxt::check_same_definition_different_crate has cognitive complexity 16 (threshold 15). Drivers by points: loops 8, if/else 6, boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/mod.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e7cce14612f8482a20a46bf8cb27afdd4704f94f4eb3d788a9aaba12f8e78d"}},{"ruleId":"D2","level":"warning","message":{"text":"region::msg_span_from_named_region (cognitive 16): region::msg_span_from_named_region has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, match/switch 4, 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":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87d5dc7a91b472242bdf4ce300062407aef62c3573f1b7ccc4d9be9754e1a2a"}},{"ruleId":"D2","level":"warning","message":{"text":"project::confirm_impl_candidate (cognitive 16): project::confirm_impl_candidate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5f7645d0f7b2e8fd24bb02512fcb3cea5279e3997ca57a3d15ae8134788d49"}},{"ruleId":"D2","level":"warning","message":{"text":"NormalizesTo::consider_impl_candidate (cognitive 16): NormalizesTo::consider_impl_candidate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, match/switch 6 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b098305db5c87855d1f9066b32cfb78081e23c4e88a9a5e78c6d9fa8781e660"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeRef::fix_node_through_parent (cognitive 16): NodeRef::fix_node_through_parent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, match/switch 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":"library/alloc/src/collections/btree/fix.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e9908dc0c88680bcce70c4ce90183d80db76e6bc962a86e14fcda72aab7c9d"}},{"ruleId":"D2","level":"warning","message":{"text":"Handle::remove_leaf_kv (cognitive 16): Handle::remove_leaf_kv has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, match/switch 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":"library/alloc/src/collections/btree/remove.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c062a9223da50bdb30fa30383c3c574a7aebac6a4b81294d3eabf47a35a73c5"}},{"ruleId":"D2","level":"warning","message":{"text":"symbol_check::exec_cargo_with_args (cognitive 16): symbol_check::exec_cargo_with_args has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, loops 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":"library/compiler-builtins/crates/symbol-check/src/main.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5afdedaf14ad2d2431231a30eae2f949496cc827aca3fd04e3b565162870ba"}},{"ruleId":"D2","level":"warning","message":{"text":"hypot::as_hypot_hard (cognitive 16): hypot::as_hypot_hard has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, loops 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":"library/compiler-builtins/libm/src/math/hypot.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"136b06cb1e8e9587e79e3acf61c65f76781b27574c72efe4d81a7ab4e7073863"}},{"ruleId":"D2","level":"warning","message":{"text":"exp2::exp2 (cognitive 16): exp2::exp2 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, 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":"library/compiler-builtins/libm/src/math/exp2.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"672535e3f6fc9d778068a8fa54a7fddb61b3b2a8488896e4d938f182195f7ef1"}},{"ruleId":"D2","level":"warning","message":{"text":"CharSearcher::next_match (cognitive 16): CharSearcher::next_match has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"library/core/src/str/pattern.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbd095cb99725ec6926d0d5da0ddfc8f9ee4dd76b1ca2e7d69e069bf3eec2fa"}},{"ruleId":"D2","level":"warning","message":{"text":"CharSearcher::next_match_back (cognitive 16): CharSearcher::next_match_back has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"library/core/src/str/pattern.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc11731eb00d2201f0d25d70c00f3f1e3cf3d431d0f353033b186dbc0107556"}},{"ruleId":"D2","level":"warning","message":{"text":"parse::parse_partial_number (cognitive 16): parse::parse_partial_number has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 2, 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":"library/core/src/num/imp/dec2flt/parse.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fa9325ccf2662452ee23fec1e2233f3442760714324cfe0051ee976524088e"}},{"ruleId":"D2","level":"warning","message":{"text":"ptr::align_offset (cognitive 16): ptr::align_offset has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, loops 1 (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 5 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/ptr/mod.rs"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9231502aaee4a95a47c053ce1614d34bfd1cfe01cc7aa2c0f602a87ceb4302"}},{"ruleId":"D2","level":"warning","message":{"text":"DirBuilder::create_dir_all (cognitive 16): DirBuilder::create_dir_all has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 4, loops 2, match/switch 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":"library/std/src/fs.rs"},"region":{"startLine":3567}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed724078ca71c53eeb5cdd42a48ea67eb6fc5982bea397393f2dd13a5e1ef27"}},{"ruleId":"D2","level":"warning","message":{"text":"Mode::fmt (cognitive 16): Mode::fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, match/switch 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2163629c6b371ca0c218c3e02b96dc3c3d598b99ddf84b95251ae694ec5004"}},{"ruleId":"D2","level":"warning","message":{"text":"Socket::connect_timeout (cognitive 16): Socket::connect_timeout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, match/switch 3, boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/hermit.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8577a8afab0e40a852082a20554abf34b1e0fcc94b812b036a3a117e872fab"}},{"ruleId":"D2","level":"warning","message":{"text":"Socket::connect_timeout (cognitive 16): Socket::connect_timeout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, match/switch 3, 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":"library/std/src/sys/net/connection/socket/windows.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f21b1438546e2a28d3bb6b237af4d90aa990b44b2b7bc2f098f8f8a7a774bfd"}},{"ruleId":"D2","level":"warning","message":{"text":"uefi::parse_lp_cmd_line (cognitive 16): uefi::parse_lp_cmd_line has cognitive complexity 16 (threshold 15). Drivers by points: loops 6, if/else 5, match/switch 4, 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":"library/std/src/sys/args/uefi.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3781097fc2f2f5703ed26e5dc6341fdf7ace33c6e5b182dedbaaca159f02354"}},{"ruleId":"D2","level":"warning","message":{"text":"Invoc::parse (cognitive 16): Invoc::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/assert-instr-macro/src/lib.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0accba314f9d4bd7125a7510aef8ba876854c0042051e73da5c9b5cbf0463a"}},{"ruleId":"D2","level":"warning","message":{"text":"Standalone::run (cognitive 16): Standalone::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/doc.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9358f2c12e35aa5a8b547b517aa90ae3685a46388185ff51480bdcb8173517"}},{"ruleId":"D2","level":"warning","message":{"text":"rustdoc::main (cognitive 16): rustdoc::main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/bin/rustdoc.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a64c51c2691e487c68bd7b7d5781d4b2c8654598c66fe6a6cff85bf38da20a"}},{"ruleId":"D2","level":"warning","message":{"text":"dist::copy_src_dirs::filter_fn (cognitive 16): dist::copy_src_dirs::filter_fn has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, 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":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c416aab0f36d73e7c7f2a8d82dacd65e7b877bdba524934633764671a73cba"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis::report_debuginfo_statistics (cognitive 16): analysis::report_debuginfo_statistics has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, loops 5, match/switch 5 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/ci/citool/src/analysis.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4460bda35b1ffb01fc687e233ed17009db5e883e8290de44514a9ea3ba2f2d2"}},{"ruleId":"D2","level":"warning","message":{"text":"Markdown::split_summary_and_content (cognitive 16): Markdown::split_summary_and_content has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, match/switch 2, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"008f5d3440a96c70a3d0c775d1307721cba288d2d0209898b3c67f5d36e84638"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkCollector::resolve_with_disambiguator_cached (cognitive 16): LinkCollector::resolve_with_disambiguator_cached has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 5, match/switch 2, loops 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":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"1add8b59c79c6393257ca85090705dc484abd02f388e2174bfb3b461d1fd8605"}},{"ruleId":"D2","level":"warning","message":{"text":"render::render_stability_since_raw_with_extra (cognitive 16): render::render_stability_since_raw_with_extra has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4040496feab6d8407e805a261cacccd42c445ee0be04634538bc87d2150332"}},{"ruleId":"D2","level":"warning","message":{"text":"render::render_assoc_item (cognitive 16): render::render_assoc_item has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"602bc433dbe10e3a125d07b78261ccf50a84216f246761e80436ae6f12737228"}},{"ruleId":"D2","level":"warning","message":{"text":"render::render_impl_summary (cognitive 16): render::render_impl_summary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, loops 3, 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":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"5782610d16522f7d29f1364a10f86c28e9b666cf32963e32f9325664e94e512f"}},{"ruleId":"D2","level":"warning","message":{"text":"print_item::print_item (cognitive 16): print_item::print_item has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, match/switch 4, boolean chains 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":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e06b47d4dde63af3fe162093c31e2683483b5297dbbf39b5e59fb74e87bb3f"}},{"ruleId":"D2","level":"warning","message":{"text":"blanket_impl::synthesize_blanket_impls (cognitive 16): blanket_impl::synthesize_blanket_impls has cognitive complexity 16 (threshold 15). Drivers by points: loops 6, if/else 5, match/switch 4, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/blanket_impl.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcd5ae8b6dfb114dd81002e5f2181fff846133e5872363f6761971397dde760"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool::collect_checksums (cognitive 16): Tool::collect_checksums has cognitive complexity 16 (threshold 15). Drivers by points: loops 12, if/else 4 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/bump-stage0/src/main.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cf35c0bd53bf7e0628c7e2f48c9524b3ad666f29500925375a5f9b91a2668e"}},{"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 13, boolean chains 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/infinite_loop.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93614e14d5cd7dd8500185a361b44a9bf237ca0f9468c9369b40a6cc3e42e6a"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportRename::check_item (cognitive 16): ImportRename::check_item has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, match/switch 3, boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/missing_enforced_import_rename.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f232dd719e4ba467261a757810da081baae543ee13d01929b12849cc08ff9d4"}},{"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 9, boolean chains 4, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/mut_mut.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ef1c97b56213bd8a7a7de74087a16519b70a11cb3edf63d3491aed97cce20e"}},{"ruleId":"D2","level":"warning","message":{"text":"PanicUnimplemented::check_expr (cognitive 16): PanicUnimplemented::check_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 5, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/panic_unimplemented.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa7daee2c162294cbeaf37963dd78d8e08d34e0b80d687a4a36819d9a48d5ff"}},{"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 12, match/switch 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":"src/tools/clippy/clippy_lints/src/raw_strings.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dd71a64aec41a22afbf2f89759cff546c1f363d0574bd62510b91a2c8055f6"}},{"ruleId":"D2","level":"warning","message":{"text":"unnecessary_clippy_cfg::check (cognitive 16): unnecessary_clippy_cfg::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/attrs/unnecessary_clippy_cfg.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"023c8e0ddd4b7cd780b17f0608127ef41e606d5b700ac4c0357340a9f3f35e35"}},{"ruleId":"D2","level":"warning","message":{"text":"obfuscated_if_else::check (cognitive 16): obfuscated_if_else::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, match/switch 7, 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":"src/tools/clippy/clippy_lints/src/methods/obfuscated_if_else.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0cf32807456eadbde07d5f8c628f22da30ee6794bfac3dcb9ef936309cd945"}},{"ruleId":"D2","level":"warning","message":{"text":"missing_asserts_for_indexing::check_index (cognitive 16): missing_asserts_for_indexing::check_index has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, match/switch 3, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/missing_asserts_for_indexing.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad19b687125a777f1fef67fa5a703f88da69876923ca5427c34b09af25366cb6"}},{"ruleId":"D2","level":"warning","message":{"text":"utils::enum_ty_to_nbits (cognitive 16): utils::enum_ty_to_nbits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, match/switch 8 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/casts/utils.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c6f57dfe13837f66201126cbc94cc8eee6497432eb2752467069fa28da3301"}},{"ruleId":"D2","level":"warning","message":{"text":"manual_pop_if::check_if_let_pattern (cognitive 16): manual_pop_if::check_if_let_pattern has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7, if/else 6, boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/manual_pop_if.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"9952e80f31b1a012c1109b45080ad931fa2a70f6dd0a5162f53e3c1e23c5b7fb"}},{"ruleId":"D2","level":"warning","message":{"text":"or_fun_call::check_or_fn_call (cognitive 16): or_fun_call::check_or_fn_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 2, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/or_fun_call.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb59c4f24ba8dfb4ddc6bb3dc22d8ddd944819ccebc7bd2b588496a031413b5"}},{"ruleId":"D2","level":"warning","message":{"text":"explicit_counter_loop::check (cognitive 16): explicit_counter_loop::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 2, 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":"src/tools/clippy/clippy_lints/src/loops/explicit_counter_loop.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fcad77464f66c4ba6a5cff7d42c4e619b05fcebccf9933941a4fb14c919719"}},{"ruleId":"D2","level":"warning","message":{"text":"overlapping_arms::all_ranges (cognitive 16): overlapping_arms::all_ranges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, match/switch 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/overlapping_arms.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad278b3db87ee42c6722741eb1098a593cb6c87ed00a0dfdbc658548d28a4cf"}},{"ruleId":"D2","level":"warning","message":{"text":"overlapping_arms::overlapping (cognitive 16): overlapping_arms::overlapping has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, loops 5, match/switch 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/matches/overlapping_arms.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d86e9a04800dadfbe63b73d27baef323791af6db67af1a1b166fc6337f7e79b"}},{"ruleId":"D2","level":"warning","message":{"text":"markdown::check_word (cognitive 16): markdown::check_word has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 7. Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 3 function items declared inside it (is_camel_case, has_underscore, has_hyphen). 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":"src/tools/clippy/clippy_lints/src/doc/markdown.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48fa033a16033cf885a379483dd3f22f98c7f24417041ed9f336c7db3e80332"}},{"ruleId":"D2","level":"warning","message":{"text":"mul_add::check (cognitive 16): mul_add::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/floating_point_arithmetic/mul_add.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6dfb88281c6ab71ae1b914b768390d2077c6f16b1284181e07b68829694d9e"}},{"ruleId":"D2","level":"warning","message":{"text":"checked_conversions::get_types_from_cast (cognitive 16): checked_conversions::get_types_from_cast has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 3, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/checked_conversions.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68c33a7c2dc26dfca73b8dd91a774cc32fd28ec0e6df3b907bb81e12ca9a897"}},{"ruleId":"D2","level":"warning","message":{"text":"collection_is_never_read::has_no_read_access (cognitive 16): collection_is_never_read::has_no_read_access has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, 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":"src/tools/clippy/clippy_lints/src/collection_is_never_read.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae50727ba7b31399223fe966c4548952c1735235df2b7e47e5e0ad9d5d59e02"}},{"ruleId":"D2","level":"warning","message":{"text":"never_loop::check (cognitive 16): never_loop::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, loops 5, boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/loops/never_loop.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24b0d858745821220214e4c221c44f4247b21be8c6cca7949643d11d9c0ff05"}},{"ruleId":"D2","level":"warning","message":{"text":"manual_contains::try_get_eligible_arg (cognitive 16): manual_contains::try_get_eligible_arg has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/manual_contains.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd43969eeb0066cb2ec74e53100539b0d530301ea76e874ed6978176675b095"}},{"ruleId":"D2","level":"warning","message":{"text":"powi::check (cognitive 16): powi::check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/floating_point_arithmetic/powi.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbb2726aea4f928ebf72c0b333e69e70ea6c31b87545ebf631163883da7a367"}},{"ruleId":"D2","level":"warning","message":{"text":"unicode::check_str (cognitive 16): unicode::check_str has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"src/tools/clippy/clippy_lints/src/unicode.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9783ea1a43c6be12e3230bc6a9b3eecc2447d17b1fee83c2ffa36a4b9461609b"}},{"ruleId":"D2","level":"warning","message":{"text":"set_contains_or_insert::try_parse_op_call (cognitive 16): set_contains_or_insert::try_parse_op_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, loops 3, 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":"src/tools/clippy/clippy_lints/src/set_contains_or_insert.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"224f02816e953f3d2e2962bec8129bbeec5d2524b56456466c3c91418b39921e"}},{"ruleId":"D2","level":"warning","message":{"text":"needless_collect::check_collect_into_intoiterator (cognitive 16): needless_collect::check_collect_into_intoiterator has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, match/switch 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec86802a55bada6600483064f1f4b1cf7f5145c37a57eb4ddef4977c1cd5f768"}},{"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 11, match/switch 3, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/numeric_literal.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1235937a35559789b904d06f947c4741c2af3a485ba3dd706619a7012b16cd6f"}},{"ruleId":"D2","level":"warning","message":{"text":"str_utils::camel_case_start_from_idx (cognitive 16): str_utils::camel_case_start_from_idx has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/str_utils.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c30aea1e142ab20d2e4e62e0532255d195e275316fb5644b1bb904534ac0e5"}},{"ruleId":"D2","level":"warning","message":{"text":"TestCx::run_incremental_test (cognitive 16): TestCx::run_incremental_test has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, match/switch 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":"src/tools/compiletest/src/runtest/incremental.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a7e9a33dae436f7b671b0dc23fd7caeb4ad7924f4df0b8e0fec0b0b767c10e"}},{"ruleId":"D2","level":"warning","message":{"text":"compiletest::run_tests (cognitive 16): compiletest::run_tests has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, 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":"src/tools/compiletest/src/lib.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2caf66dc5dd3588c5006ed423171e0ac566e61d165b7074e3848ed9ce7c98a5"}},{"ruleId":"D2","level":"warning","message":{"text":"LintExtractor::replace_produces (cognitive 16): LintExtractor::replace_produces has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 9, loops 7 (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":"src/tools/lint-docs/src/lib.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95316870f7553c21fd5173a891789edf7c8c298cb3171405862011ec7c90397"}},{"ruleId":"D2","level":"warning","message":{"text":"LintExtractor::generate_lint_output (cognitive 16): LintExtractor::generate_lint_output has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 2, loops 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/lint-docs/src/lib.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38d4951c0f39d2ea35333561e30cb9460a1f795e38649a1f818ed8e089cc6b8"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::call_llvm_intrinsic (cognitive 16): EvalContextExt::call_llvm_intrinsic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 4, loops 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7762e6ac4026bc5ad883094e4140c18c1690c19fc19b196c2468bce1887951"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_simd_intrinsic (cognitive 16): EvalContextExt::emulate_simd_intrinsic has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 10, loops 6 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/simd.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"994d473528d1349448b5a8be129a8c9a764e7c5e5f087488b107e5c60a5e95b7"}},{"ruleId":"D2","level":"warning","message":{"text":"EvalContextExt::emulate_x86_sse41_intrinsic (cognitive 16): EvalContextExt::emulate_x86_sse41_intrinsic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, loops 6, boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/x86/sse41.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d6a1276e685689b97c01eb7e01be2d245c3045cd69d139347996e9fc771e67"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticsImpl::analyze_impl (cognitive 16): SemanticsImpl::analyze_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3646a6a01d4f7d2c650ca28912eddbaa4df70e4794272f826bcd9d7401b8ce"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticsImpl::locals_used (cognitive 16): SemanticsImpl::locals_used has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, match/switch 4, boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fb4c18b658048a6ceb42d937691e0c2420a4f44ab182bb70b45b3da5e4659a"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceAnalyzer::resolve_offset_of_field (cognitive 16): SourceAnalyzer::resolve_offset_of_field has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 11, if/else 4, loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"653f26449a742a792b7b71b726d606dd72cd2b5cca8b12e70794e1691cda2d55"}},{"ruleId":"D2","level":"warning","message":{"text":"find_path::find_in_sysroot (cognitive 16): find_path::find_in_sysroot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/find_path.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad477c7a262113fa1efdf579caf126c5893eec16530eb99821de04b7a512585e"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_tuple_struct_pat (cognitive 16): InferenceContext::infer_tuple_struct_pat has cognitive complexity 16 (threshold 15). Drivers by points: loops 7, if/else 4, match/switch 3, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67ce70f44766ce1b6d6efa1fec73c4907a2a94291392d87d0e3cec5f6b74c5f"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::try_index_step (cognitive 16): InferenceContext::try_index_step has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/place_op.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b931205a80dc0a8bc2040c952cd40f1364b2d21ad19a0182fb1353ee9e3246"}},{"ruleId":"D2","level":"warning","message":{"text":"Evaluator::exec_atomic_intrinsic (cognitive 16): Evaluator::exec_atomic_intrinsic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ff9a39a9add303cb5928a3cd6cebf4987aaaa11cc27343a3790fecd31bfd5e"}},{"ruleId":"D2","level":"warning","message":{"text":"consteval::literal_ty (cognitive 16): consteval::literal_ty has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 16 (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":"src/tools/rust-analyzer/crates/hir-ty/src/consteval.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7ac5cb10fc04282b6c564bb6e55509034a67ec132a321709f07486bdcb0cab"}},{"ruleId":"D2","level":"warning","message":{"text":"display::render_variant_after_name (cognitive 16): display::render_variant_after_name has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, loops 6, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/display.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd06767faf734bf6b6890c997d328926579bee685b3e531168adc84a93c501bf"}},{"ruleId":"D2","level":"warning","message":{"text":"inlay_hints::hints (cognitive 16): inlay_hints::hints has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 9, if/else 7 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb603d96f56bff6c9eeee71d23f17729cad7fffa207738902c1cc320dfc1f2e4"}},{"ruleId":"D2","level":"warning","message":{"text":"expand_macro::expand_macro (cognitive 16): expand_macro::expand_macro has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 3, boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/expand_macro.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"25456d77891b318b1117b68446a42d961e34e6e064b26c2c067048ecf7e1a37c"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_documentation_template::make_example_for_fn (cognitive 16): generate_documentation_template::make_example_for_fn has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 2, loops 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_documentation_template.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1465e770856367de8296abb9ae988c7ff10b523ea789e7b93e9fd9afd71d39cd"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_fn_type_alias::generate_fn_type_alias (cognitive 16): generate_fn_type_alias::generate_fn_type_alias has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, match/switch 2, boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_fn_type_alias.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93abb7ee84471ae871571b533acdc90732c9f923d6e09a459063385afc66680"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_bool_to_enum::find_bool_node (cognitive 16): convert_bool_to_enum::find_bool_node has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_to_enum.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c31c08076c37ee62540eacf5df973b3d36b41d68e39c5e1dfaf9ec76a9a4274"}},{"ruleId":"D2","level":"warning","message":{"text":"trait_impl::add_type_alias_impl (cognitive 16): trait_impl::add_type_alias_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, match/switch 6 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions/item_list/trait_impl.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"f836f6a56b3ced05d456215da0732b67ead946027c2636cf73e161c7a88c6919"}},{"ruleId":"D2","level":"warning","message":{"text":"fn_param::fill_fn_params (cognitive 16): fn_param::fill_fn_params has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 9, if/else 5, boolean chains 1, loops 1 (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":"src/tools/rust-analyzer/crates/ide-completion/src/completions/fn_param.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3d1a984096e29e45c6b35e211ed2d158c0f50e4ac2fe1228099c2423c39d54"}},{"ruleId":"D2","level":"warning","message":{"text":"expr::complete_expr (cognitive 16): expr::complete_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, loops 6, match/switch 3, 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":"src/tools/rust-analyzer/crates/ide-completion/src/completions/expr.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"82414bfe3c60c1ace5af7ee515d1003393ceaf1c02bcf5f907c7e25698970ff5"}},{"ruleId":"D2","level":"warning","message":{"text":"render::render_resolution_path (cognitive 16): render::render_resolution_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, match/switch 5, boolean chains 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/render.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8f3c843de3d9c7b6b8865c25639e5b449fb9305e2e1f8038ccb351dba0d2ab"}},{"ruleId":"D2","level":"warning","message":{"text":"node_ext::for_each_tail_expr (cognitive 16): node_ext::for_each_tail_expr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, match/switch 6, loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/syntax_helpers/node_ext.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"181bf451f3462183e2ccf5528bcb40165a87e57abbc3c690eef47f4dd9f96aa1"}},{"ruleId":"D2","level":"warning","message":{"text":"traits::get_missing_assoc_items (cognitive 16): traits::get_missing_assoc_items has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, match/switch 7, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/traits.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"090d58968b62b9d863be863d8ce69c48eb0db1711a41f01a1e9d7b5a5381b5cb"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchFinder::output_debug_for_nodes_at_range (cognitive 16): MatchFinder::output_debug_for_nodes_at_range has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, loops 4, boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-ssr/src/lib.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b6e0d11c3ae1b631030f803ae88cfd79753c8cef2da1760de618d979adea77"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceRootConfig::source_root_parent_map (cognitive 16): SourceRootConfig::source_root_parent_map has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 3, boolean chains 2 (nesting depth added 7). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item declared inside it. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/load-cargo/src/lib.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"27eb1019231d0cb1814c8f8d80019068d00086fc177b849dd86a02599653fafe"}},{"ruleId":"D2","level":"warning","message":{"text":"expander::expand_rules (cognitive 16): expander::expand_rules has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ba8baf0f28ce1a82b4de693db869fcd213138904445df473920c6cf06d9bf4"}},{"ruleId":"D2","level":"warning","message":{"text":"expressions::stmt (cognitive 16): expressions::stmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 5, match/switch 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8341af710febc68e867487fb567d468279484edb164f05447eb2530dbe55cbc9"}},{"ruleId":"D2","level":"warning","message":{"text":"patterns::pattern_single_r (cognitive 16): patterns::pattern_single_r has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/patterns.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a159e94071cba3aa7e7b1a21a4c2f7ec176b6f73e96efcbcac527730c0bdfa5"}},{"ruleId":"D2","level":"warning","message":{"text":"FetchMetadata::exec (cognitive 16): FetchMetadata::exec has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 3, match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/cargo_workspace.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1b2dd21ad21757be13d6f25f54385cebec025210b4dd2881fcaed5b88c4057"}},{"ruleId":"D2","level":"warning","message":{"text":"LsifManager::add_token (cognitive 16): LsifManager::add_token has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, loops 2, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/lsif.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c80da59650cb764452f680a93d90e1e9597b8f5f9bf91c6d7e712e19d55a660"}},{"ruleId":"D2","level":"warning","message":{"text":"session::run_session (cognitive 16): session::run_session has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, match/switch 4, boolean chains 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/session.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"315b07c54b18378da1fc2abc15a59dcab4d4eab1d49529d1caf00502fa01a75f"}},{"ruleId":"D2","level":"warning","message":{"text":"prec::precedence (cognitive 16): prec::precedence has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 16 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/prec.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3181bdab0deabd3f72f217d56b0d92e4824915fbfccdede5021954f5045e567"}},{"ruleId":"D2","level":"warning","message":{"text":"reparsing::reparse_token (cognitive 16): reparsing::reparse_token has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 3, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/parsing/reparsing.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7466f816e8c18d6780dc3056ca71d5fafd9b7d273eeea998af6278b5c14b407"}},{"ruleId":"D2","level":"warning","message":{"text":"line_index::analyze_source_file_sse2 (cognitive 16): line_index::analyze_source_file_sse2 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 5 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/lib/line-index/src/lib.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"81eea57f322c08c64e7a3007268fd8d26cccbe9ae62c35989c85766f79f2f1fd"}},{"ruleId":"D2","level":"warning","message":{"text":"tidy::check_cargo_toml (cognitive 16): tidy::check_cargo_toml has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, match/switch 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/xtask/src/tidy.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc64a737dca1f1d980e91a382f27c16bd8db8a85b8c92e7cf93d0f5c36c854a9"}},{"ruleId":"D2","level":"warning","message":{"text":"ChainItemKind::from_ast (cognitive 16): ChainItemKind::from_ast has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, match/switch 5, 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":"src/tools/rustfmt/src/chains.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba216879e6bd21a0288d1a790a2ca9b996657f1cf2c2a85bf9b32eeddc3acc48"}},{"ruleId":"D2","level":"warning","message":{"text":"SilentOnIgnoredFilesEmitter::emit_diagnostic (cognitive 16): SilentOnIgnoredFilesEmitter::emit_diagnostic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/parse/session.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96f5f0071a920cb7ae0b2949fc56c4eb695096870e03f77d1b37a15daecafb6"}},{"ruleId":"D2","level":"warning","message":{"text":"FmtVisitor::process_missing_code (cognitive 16): FmtVisitor::process_missing_code has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/missed_spans.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"4306e6a05e6b8bfd1b82d3cf1d13672ec6ad4055ade297706f827751a9aa85d4"}},{"ruleId":"D2","level":"warning","message":{"text":"items::rewrite_struct_field (cognitive 16): items::rewrite_struct_field has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 3, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"8242e27004daf0843fb4daa983265c51e05530dab42a4365d13256a890a879ce"}},{"ruleId":"D2","level":"warning","message":{"text":"pairs::rewrite_pairs_multiline (cognitive 16): pairs::rewrite_pairs_multiline has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, match/switch 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/pairs.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c6a4c4e0734e89152de1cad4236af8956deb2166c25d42746de741cf310e11"}},{"ruleId":"D2","level":"warning","message":{"text":"main::execute (cognitive 16): main::execute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/cargo-fmt/main.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf518df4a9efc8ec7c70f616b971b3951f55c2c6e758818da5ab6ba11d5a208f"}},{"ruleId":"D2","level":"warning","message":{"text":"extra_checks::check_cpp_fmt (cognitive 16): extra_checks::check_cpp_fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 2, match/switch 2, 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":"src/tools/tidy/src/extra_checks/mod.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ab878eb51f1970cde2adcc3617122d8acd0d875f0b82784982acf38d1f9f8c"}},{"ruleId":"D2","level":"warning","message":{"text":"unifyFunctionTypeCheckBindings (cognitive 16): unifyFunctionTypeCheckBindings has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":3628}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2ced7cf6690c5dc7a1dca9eb803bdec2f63f55b1aa08b233c2f56297b84dd1"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 16): (anonymous) has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":4403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75086963bdfc1b3079399ed6e0904191277bc17a4f51ab8fbd3aabdec0eb87f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::x86::avx512f: TooManyFunctions \u2014 2603 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c180ee3b1c293a8f6f7d61cf017ed20c4eb79e7341cf82dfd9a8724c89c150"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/avx512f.rs: FileTooLong \u2014 27619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512f.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a483470a494e3e0b241e8bbf65ea510ebb24bc4f5688426a90376ad1c1ea3c99"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::x86::avx512fp16: TooManyFunctions \u2014 923 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"331aa45dda6d2eeeb50d985388b2f831e5997f17ce0b538644029aa37b67ccd2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::x86::avx512bw: TooManyFunctions \u2014 826 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de456457d9aaa232564a879081599d00af9d036b2d7450819f1415478cb693e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::mips::msa: TooManyFunctions \u2014 527 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/mips/msa.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c580de085c45ca4dfa9f94bb16ae6a86fa29b283247a149c115786bba29460e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/avx512fp16.rs: FileTooLong \u2014 8189 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512fp16.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf18e42bf40678e17da6e2c8c8012fba7cc01db8f50bdf930f07766a2b1b2554"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FnCtxt: TooManyMethods \u2014 490 methods, declared across 26 files: src/expr.rs (68), src/pat.rs (63), fn_ctxt/_impl.rs (53), fn_ctxt/suggestions.rs (50), \u002B22 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/mod.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0572becd6df362f7ce7ddd9b54bcf492da1bcb6c7538608d1758f01652128f30"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/avx512bw.rs: FileTooLong \u2014 8031 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bw.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ac80f3ee91517d8e00c46c245163a9e5566dab397dbcd24e830e4d268f2391"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 470 methods, declared across 12 files: parser/expr.rs (141), parser/item.rs (84), parser/diagnostics.rs (78), parser/ty.rs (48), \u002B8 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace6d23696c77f09ea08de78f87852b18898466da105f42dc993ceea029236f4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::x86::avx512dq: TooManyFunctions \u2014 399 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bb29670dc2bb2f5c53a45887431b0f3210718fbaaf4183bbeae4f65297b70a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LoweringContext: TooManyMethods \u2014 272 methods, declared across 12 files: src/lib.rs (93), src/expr.rs (71), src/item.rs (44), src/pat.rs (15), \u002B8 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"652a58484c0adf07b6844d7e4f5e4d0973a443c87572b237f93e1329564ff807"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mips/msa.rs: FileTooLong \u2014 4517 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/mips/msa.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f93e7d65aa915346de11abf5263bce6054c568a55c014710bf67fd44e75f865"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::wasm32::simd128: TooManyFunctions \u2014 258 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/wasm32/simd128.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"0109331a486e569a0f5c5cd0be0fe5c773dc547b39a78952db7c8d32b8d03ac5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InterpCx: TooManyMethods \u2014 250 methods, declared across 19 files: interpret/memory.rs (52), interpret/eval_context.rs (28), interpret/place.rs (28), interpret/intrinsics.rs (25), \u002B15 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/eval_context.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3214d7354c029f9a2cbbc9a8d6a7e1f2d4ae81ad1459a56e849e6574ea8f573d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: s390x/vector.rs: FileTooLong \u2014 4029 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/s390x/vector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c946c4b1c1cf26caa721ab316a1d6a122322d8e3eae4f1c689f244c340bc6af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/avx512dq.rs: FileTooLong \u2014 3769 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512dq.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f5c645b11b5521b3473ee8a760ef76c3206e2de05eefc89ef4b0aae8fdf68c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::x86::sse2: TooManyFunctions \u2014 218 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/sse2.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf465a7f44905cb07bb816dfa749ccccccf99b0a50a08160e8ea6fcebbcf38be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 3610 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3f42cd1a5eb930b1b983a9ee3d3a2665336190a14b7adfc88ede893a6ca2b2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InferenceContext: TooManyMethods \u2014 215 methods, declared across 15 files: src/infer.rs (64), infer/pat.rs (36), infer/expr.rs (32), infer/closure.rs (19), \u002B11 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c4ccb493921c89b0c017dd3b027853a0c31e602ea264ea07c07e6248ab50ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: method/suggest.rs: FileTooLong \u2014 3522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/suggest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b56b128ca1d1b1c3fec4d2b62ad65d3505545c2bc8e6565af704806440f44b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/late.rs: FileTooLong \u2014 3469 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad03952807c9737ecd68831ecedabd957164edc3b93b8dc79ab4bf416f7b18c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/search.js: FileTooLong \u2014 3300 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/search.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5253efb3d2e57a84e5b9987b4369be9a80c4639b004ae939aff78b013165cf53"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::x86::avx2: TooManyFunctions \u2014 193 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f0aa0bb26c8f9f205b8ad0109b9cf3756234b076a667040546c0b6262b846b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: powerpc/altivec.rs: FileTooLong \u2014 3160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bc588579e797dda73bb6b251e9396c4cc794db39ddf94c320a96d16e3cba98"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::s390x::vector: TooManyFunctions \u2014 188 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/s390x/vector.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"8381497c22b9ce0e6fc24f437fad2b6a9794704854b1a640b9ad86079d670cb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: late/diagnostics.rs: FileTooLong \u2014 3130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aff7106038f40cccc7af3439e61bdd7063a179efca425e838640ce71e8ea18c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::x86::avx: TooManyFunctions \u2014 187 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"59369be896a2a8ac92b888dba3eddb5e31f27a478176c5ee0a5224af3a929381"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hir.rs: FileTooLong \u2014 2895 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir/src/hir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b586ebff4e4f00cddc49a61acad96a718dfbc305a9ea1ffa5fd0c5920f398cca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/expr.rs: FileTooLong \u2014 2894 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"367fb6e1641ffe066e9fa9856443e0b71f22f73f40d421b941d0f5294946f79b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/stringdex.js: FileTooLong \u2014 2776 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/stringdex.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bb3294d6828a2559820983720363fb4e5e3bec7b89bb266e4feec674b0dd05"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Ty: TooManyMethods \u2014 165 methods, declared across 6 files: ty/sty.rs (136), ty/util.rs (18), inhabitedness/mod.rs (4), ty/diagnostics.rs (3), \u002B2 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/ast.rs"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d894638d83650dbe3ab9f1126799511a2333d77e85c22fd2abf7f65919e7adb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/impls.rs: FileTooLong \u2014 2650 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/diagnostics/impls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcceaed26d45274976ad3926f27b23d3665144b1034b88c6492d0d8bfd822a9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SyntaxFactory: TooManyMethods \u2014 157 methods, declared across 2 files: syntax_factory/constructors.rs (153), ast/syntax_factory.rs (4)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"06034b92c2d1448d583108862d6e5e8c4962439777f86fbddd9b5e19e880b763"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/items.rs: FileTooLong \u2014 2594 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c961e28457f48dabff589b2d4cd09a87f0daf82ce87046a3ecd43909045eb65"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: traits/fulfillment_errors.rs: FileTooLong \u2014 2591 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"102cd24af7b80a80a1d3af2fede6e0f6a9a401e784c264d07d44eba35abf0fdc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/eval.rs: FileTooLong \u2014 2591 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccde9228d8ee24cd7e454d673423d06dbf0d745ddda95c3c62da8e1f5703ee49"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InferCtxt: TooManyMethods \u2014 154 methods, declared across 21 files: infer/mod.rs (73), outlives/obligations.rs (13), snapshot/mod.rs (10), canonical/query_response.rs (9), \u002B17 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a7899e448a3e73d712da00a7ec2e7aaaf638ba979a01567d57423f297f0527"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr.rs: FileTooLong \u2014 2529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be01d8c3b10fd9a2cccb9c071271040a6b922edd0a1676d3d99e13ad66235118"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr_store/lower.rs: FileTooLong \u2014 2520 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0968396da49cc6663758b62cbe6b1bc0fa3631b3741163015b0b8a2824df9b85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fn_ctxt/suggestions.rs: FileTooLong \u2014 2518 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/suggestions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5674b019d28de623df0809069ea5e31e030c8650ae2afe96b56ae15274926447"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::x86::avx512vbmi2: TooManyFunctions \u2014 150 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c3d1181c20b42f4a58d4d2b6a9a38a85c6fd3f46707458f0f5f17eb78a9ff0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MirBorrowckCtxt: TooManyMethods \u2014 149 methods, declared across 11 files: diagnostics/mod.rs (28), src/lib.rs (26), src/borrowck_errors.rs (24), diagnostics/move_errors.rs (21), \u002B7 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92ce3fd4a3aa65d16117786a2d0a8faccabec9a916e8583d06471c779e5d4bb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::ast::make: TooManyFunctions \u2014 149 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/make.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1893228128aae52a80feb73796394bb533d6737ea41c4e67caf30cc2a5e45b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wasm32/simd128.rs: FileTooLong \u2014 2471 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/wasm32/simd128.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"658e53f6b38043dc81e3b15360142168a3d05e34a4b18637f6794178c24b9843"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate: TooManyFunctions \u2014 147 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07d7b674fae09ebcf305edee460985717bfe2e480435c339159871049b8439c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hir_ty_lowering/mod.rs: FileTooLong \u2014 2403 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85db4e60f46cc7b173a773b4e396e659a05ebad76215ce3c9e6785f53dc5264a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/item.rs: FileTooLong \u2014 2387 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/item.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d468639792d252a00acb60c969a63cecc6429ac9e8cb6d6987fd055045c2b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config.rs: FileTooLong \u2014 2359 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdea878c704610da5232292a4ff3683a22f0b99ef1c2e83f77d1761194dcbc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/avx2.rs: FileTooLong \u2014 2330 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04d89e4cf193f10e96f6b4e576a3bad49161658fe510f13c53d6598bdf8d851"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SemanticsImpl: TooManyMethods \u2014 139 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a25a93a7865abea56f40df2eaaa61befc7dfd49e61aace917b9f6f321f96bf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast.rs: FileTooLong \u2014 2298 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/ast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1cf161955cf8fb55ee5666757fef17db7313757872130d840994c1a1ccd7f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: print/pretty.rs: FileTooLong \u2014 2240 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/print/pretty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0831c1e67510d4064f52f3073ca82e01b74b8605d6c6138559fb2ffe2533e938"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: clean/mod.rs: FileTooLong \u2014 2238 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca959ad13ce4e961b5d4a635679757d4297ebe38660e887c962d2fbe8591a50"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LateResolutionVisitor: TooManyMethods \u2014 133 methods, declared across 2 files: src/late.rs (80), late/diagnostics.rs (53)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/late.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4678f5bfa5d9cf97f8cb1bd9f704bfcb6786faf76d9b2463e45b4a2d86df90"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lints.rs: FileTooLong \u2014 2199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/lints.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35afa76040498a977629b8683b7eed7a6f7fb24b66b26a46d1fdff4522ac950d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/intrinsic.rs: FileTooLong \u2014 2196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7731667ab18f5187dd36a20319f7040607bc1d44a608055074f9a29f55cd1678"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/options.rs: FileTooLong \u2014 2189 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cd84ca81e9eb47860359accecf942914f1d5348a3205a2efdf0276ff74bf79"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeErrCtxt: TooManyMethods \u2014 131 methods, declared across 11 files: traits/fulfillment_errors.rs (47), infer/mod.rs (31), infer/suggest.rs (15), infer/region.rs (11), \u002B7 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/mod.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2433e7e8012252f45137eec3a86e0df52cbeaec67222e3d1f0b5ca33511677ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: back/link.rs: FileTooLong \u2014 2179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fbd19b955023aff5fd96240e2d1ba24d57cb2fd2cdaf90ca19d15996bd9184"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a89dab8542be63b83c44efd1e0b261d6e1ad8ae45071c2341f3aec0b0dbf24a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fn_ctxt/checks.rs: FileTooLong \u2014 2170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/checks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14b40cea5c15a2d85b6b1e7b989cdfc3bc0d99f92bc64b65988535e949928d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/mod.rs: FileTooLong \u2014 2157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00055bf72403854f18f3db0c202f44899f2dfecf8f7da2f869aeb9e41724151e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c2360ba48dd90110a1a20b940034e6642d32bedd504b0eee1a85934af3f3e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: llvm/ffi.rs: FileTooLong \u2014 2118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/llvm/ffi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ba24499bbe427ecdf4755ec72a6d7f569a63add356cac635f9fd604619bd4c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Builder: TooManyMethods \u2014 126 methods, declared across 15 files: builder/scope.rs (38), matches/mod.rs (35), expr/as_place.rs (11), builder/mod.rs (10), \u002B11 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"730c276bdf1378a4f5ea30121b8999411051639bba04a128b1126c3f8b997db2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lower.rs: FileTooLong \u2014 2050 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97891769d3fa1c58487ccebe2c7c2906b509f22e18171ed42b9205eb3d08bf68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pat.rs: FileTooLong \u2014 2045 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/pat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebc11c9ee4f9eb93350e4b8dbae3249d31ebd3b2b87cb1dc48bac7a545cd305"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/display.rs: FileTooLong \u2014 2031 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd86eda2fdd2238c70305b4f1874196fff194cc70ba469660caa3f7f2910e4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handlers/request.rs: FileTooLong \u2014 1948 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a065e61277e6b3276628e1234115346c8987da5b158d0c5e6e75547408b0eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/diagnostics.rs: FileTooLong \u2014 1921 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac608195e41fd40a84aea5ebcdd99680e826605aab0786cdff9536b95c95aae9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CodegenCx: TooManyMethods \u2014 115 methods, declared across 16 files: src/type_.rs (20), src/int.rs (18), src/consts.rs (12), src/context.rs (11), \u002B12 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/context.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed6252adad91682630ac611e2ff81a50bc600f6364122d238108a820810c32a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1912 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6adedb05624b63f1cfb2335afb8901daf853c3a8426a37e48c2c68d234a3dc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/semantics.rs: FileTooLong \u2014 1904 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffbbef42f140e6e94cd7710113ab8f25436078ef99224f76da328b366002679"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/config.rs: FileTooLong \u2014 1902 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e53fb8d1dbd5b7623a0092e22d6f20a4d4683ddb2e8514c2c8d4f433e0d3ff4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: build_steps/dist.rs: FileTooLong \u2014 1897 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/dist.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d159886b0c2935556f48c34042bba98488497bacf794b1dfae47a401bca7e13"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CompilerCtxt: TooManyMethods \u2014 112 methods, declared across 2 files: context/impls.rs (111), context/mod.rs (1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public_bridge/src/context/mod.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d72e3f301a0b368d3231af89da0fe1795482f0acdc87baebe79afcd721d2ca"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InferCtxt: TooManyMethods \u2014 111 methods, declared across 13 files: infer/mod.rs (71), snapshot/mod.rs (10), canonical/instantiate.rs (6), outlives/obligations.rs (5), \u002B9 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8a7917ebb1c8c73cdfe3294d02603cc1eb86d63bb84309b37e3e0b74529fd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/sse2.rs: FileTooLong \u2014 1846 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/sse2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b75721e5993754d501ff3b97dc3b9a9d4c4c0930d0b60e34f8e24fed39fc9e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/avx.rs: FileTooLong \u2014 1842 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d6de96037a7ff08e4f198b8f14226bae5d1e6123866d87d21e105926e74b2c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EvalCtxt: TooManyMethods \u2014 110 methods, declared across 13 files: eval_ctxt/mod.rs (50), solve/mod.rs (15), assembly/mod.rs (13), solve/trait_goals.rs (11), \u002B9 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d401d938023615e801b4c08f84ef04b0f5c9aa33f75df772a5c3abc4d1f95f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/print_item.rs: FileTooLong \u2014 1832 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6e75e431d07ce680704b8207257e893544bd09b8e6fb699d85ec7cbe086181"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/search_index.rs: FileTooLong \u2014 1826 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/search_index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d722a5fbd03a50970ab7e57712c52cdbe4eaf065987847f8088d2a932eddc9d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: methods/mod.rs: FileTooLong \u2014 1820 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe78b08c9ed69d82772f47323b69e155b9c19b14d36cd11145d74b48d0f821c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nameres/collector.rs: FileTooLong \u2014 1795 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/collector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05455a73106ef97a999246340679f2cf9d81a76128359cd2c51d23f03c6f3aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/lower.rs: FileTooLong \u2014 1786 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d973b4305ca9998fd0a6af03f64de51dbf9f01d93a1da73051580b89111b52c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/infer.rs: FileTooLong \u2014 1785 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"483088a4fa483b2b30ef61b215633af1c597f74cbcd0dc0555d41ba14a7b7aa6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::powerpc::altivec::sealed: TooManyFunctions \u2014 107 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"872d516db86b3561021b978191b8a07a2f653fd9a9c05d8ba9a5d766f59576b0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExprCollector: TooManyMethods \u2014 107 methods, declared across 3 files: expr_store/lower.rs (101), lower/format_args.rs (5), lower/asm.rs (1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d7718bc633b104d1253123948581f676d76568fd7dc01eb07ee442b491d916"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: next_solver/interner.rs: FileTooLong \u2014 1771 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/interner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe1c6506e8295991a532669178fc3768e7da3e8d2347a360d69996d435d14ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: select/mod.rs: FileTooLong \u2014 1768 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8b3de43a319997ac8706fd3791cb91ca603435cb9d779ebc53c11d9f523d49"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::x86::sse: TooManyFunctions \u2014 106 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/sse.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"453d5cb7503b1fe8434b8dbffc03489866fbd9f4cf953d17f68bd4ab03e7e87a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::riscv_shared::p: TooManyFunctions \u2014 105 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/riscv_shared/p.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c546a3efc47f91d1ffb0b86bb39fee162e258d0f1d5c27fbddf5e72e6740765f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expand.rs: FileTooLong \u2014 1739 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/expand.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dfbd42aff008af891aa961e372f83c1f1d0efbcbf955a844e197af428ce2ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/mod.rs: FileTooLong \u2014 1737 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6168502f269e5ec5c6357fbb56e227961047ce19a623a19838190a5d6e2c2462"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::powerpc::altivec: TooManyFunctions \u2014 104 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/powerpc/altivec.rs"},"region":{"startLine":3323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2e9e888335cb052406c292c1c2d7b737276b1a9e9c2c26c0eb57f2fe698afb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/unix.rs: FileTooLong \u2014 1725 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/unix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"373799485080640a146064d3058aa5e0f0890fef04051d3d763a989004d7dd57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr.rs: FileTooLong \u2014 1707 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77d6cba327f3f5f755f5ae47cd0bd6778e6ebf5eb825e9a2aeb2047afee50f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_check/mod.rs: FileTooLong \u2014 1705 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80caf7acc6b41b0414b7c7c950ad7e6cdd2238615a8746901ae086b56ae26cd4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SelectionContext: TooManyMethods \u2014 102 methods, declared across 3 files: select/mod.rs (53), select/candidate_assembly.rs (27), select/confirmation.rs (22)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/mod.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"281e2b155e659013e07bfeb7d1d1abf263e67ecb9d78ff88dddb3a866fb50ab8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: State: TooManyMethods \u2014 101 methods, declared across 3 files: pprust/state.rs (55), state/item.rs (24), state/expr.rs (22)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"641d09f8f8997cbedbe3b1e1ce5fef1f18e9dfc4039459c5de520e88c82c6c15"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rmeta/encoder.rs: FileTooLong \u2014 1680 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e58bdaebd783b20173082b554e1694925e54ba17dd822957ce42bdd467c824b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CompilerInterface: TooManyMethods \u2014 100 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/compiler_interface.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"76319c228cded7543dcbc75fefcc51f21e11fd2d8e7073fb73a0ec0ec69a98cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: method/probe.rs: FileTooLong \u2014 1648 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c29cb1e5cd929a76cd8e714bbc4a59f302460e309e3dcacdd7791d173b9e492"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: slice/iter.rs: FileTooLong \u2014 1639 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/slice/iter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1956fb0ba28f4fc6113db4c617c13f48a587781e8814d84b26634b7ed5b2d1d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: check/compare_impl_item.rs: FileTooLong \u2014 1633 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/compare_impl_item.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7b2948d1ad28cdb56e98c4a83c1e1d6aba6a8cbd104cbde98157d1f9a17e84"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: State: TooManyMethods \u2014 97 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_pretty/src/lib.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"697d642d2575e449cb4c204fecec0edb8091952dfbf1a7f3dc9d6176ea10f573"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax_factory/constructors.rs: FileTooLong \u2014 1616 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/syntax_factory/constructors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6423c844ca274ce5f61b8fad0b77d8fa1d15edb9065555cd9775315503d97cd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/builder.rs: FileTooLong \u2014 1615 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cfbc4a1bdc3ea9f98827b711a58042580d2f8a77648cb8b81ed31d4243e1c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1613 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e00cc8a2210e841342c0baff9a36a43800998999052226d1945a87bc9cdc41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: passes/collect_intra_doc_links.rs: FileTooLong \u2014 1601 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f4a5176456dbef8981a6ed625e330ddf80f4fd5be640214c0a0249fdea5e10"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::intrinsics: TooManyFunctions \u2014 96 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/intrinsics/mod.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b887524fc3505c0891415fc0512b9495c380bbcde287ca964d3f35a7e86d243"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/block.rs: FileTooLong \u2014 1597 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/block.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1114b39c81856868c364db276fd22f102548c19ee524a437b3beb0bfb59b254b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/source_analyzer.rs: FileTooLong \u2014 1590 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7edf1333810fa1923db372ff987a43f14108ed7f4acc906e26f66a6132692785"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Resolver: TooManyMethods \u2014 95 methods, declared across 8 files: diagnostics/impls.rs (43), src/ident.rs (21), src/build_reduced_graph.rs (14), src/macros.rs (10), \u002B4 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9701aa55bf9297a4bfecd2d4f63323c031ac12f7649522b203bc40f4288ace4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 1574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef24f5732f05ca7589b2792a579d76666322d8914a62c7efa89c56200a48fa1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/avx512vbmi2.rs: FileTooLong \u2014 1571 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512vbmi2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28df17cd78c8c6958c8e57ab6172fc4ce23a0d6180737011b381b8683bf8d2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pprust/state.rs: FileTooLong \u2014 1564 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2847387d7c514080f58e45ecf99960b9cd3253c6fd035cd9e5aa6dba8ea81a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: clean/types.rs: FileTooLong \u2014 1537 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ff5e8a1f205cf2561a9f90ae598eb3a79f4167a2869eae92ef928b7c50546d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VecDeque: TooManyMethods \u2014 92 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/vec_deque/mod.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac28a859f4febe654677720062cd5dc8077af8eaa56195f4bdfd94437f86b19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/to_proto.rs: FileTooLong \u2014 1529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8b154d0c12499d3d12dd305eb9847d022cfb5e4ff76b1ca24fd7efdcf5ea8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr.rs: FileTooLong \u2014 1523 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"680ee3de0560cdbc19b9fb5a8a5365c000f6fef7273bd9ae13c657228cdc94fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: build_steps/compile.rs: FileTooLong \u2014 1520 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/compile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b6dd5998e1f5042ee859bb582da82652b6351945d62dc88fe358bf5fd3df59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1494 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f2ca95eda40b45c45b8645241996dfcd4fb53ad0a1309a917aa0f95d9451e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/builtin.rs: FileTooLong \u2014 1489 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/builtin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d0303de56b9b7ab4d7a9247af40115243f2d345808113eac7f1e4863f0c295"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: check/wfcheck.rs: FileTooLong \u2014 1486 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/wfcheck.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9972f9ef1afac1b16c856944a97c1df792b2979b75079df856c00dcee7101148"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Build: TooManyMethods \u2014 89 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/lib.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf1934b743c6a8b206cd548116564c9f04a974d13ad07fd92b43923460547cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: context/analysis.rs: FileTooLong \u2014 1480 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context/analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62e537d5ae92111cb16aa1364f07f6105febd799732a55a4ddd2f10cf381c78"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ident.rs: FileTooLong \u2014 1461 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/ident.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2291efb9a40c06b01d0601e2dd5b5ae16db8a8891b8d556ac23a2147fa5164"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: check/check.rs: FileTooLong \u2014 1453 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e89f1be9ce899566918035661550d2f5e2693bd79bf49e70009ed950d3ea45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handlers/extract_function.rs: FileTooLong \u2014 1452 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6348df38f0e7d12b0f694409ec71a550351c23944a75d591af3b5f75ee82c7b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsic/llvm.rs: FileTooLong \u2014 1419 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/llvm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22e0080572b61cef20cfdc2feb28a05c26dfb86a0dfecf6bb46f6b189d761fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/item.rs: FileTooLong \u2014 1402 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_lowering/src/item.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb8d71a674ba7570f68287638a343da69ded983f412bb9dda5939eb3186b3cc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Config: TooManyMethods \u2014 84 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/config.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dcbb675aef0a8db18816194ca7b37a4e62d43c260298a5c3d4ff4ad2700c41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/expr.rs: FileTooLong \u2014 1397 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e69dc54e941358d1289010a6b6560151a02dea01c20626d717a700a2bd3a57b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hir_ty_lowering/errors.rs: FileTooLong \u2014 1383 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c1d034800acad6a60baa665757cda0ae914e35a1c88099b234f9cb764195fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/workspace.rs: FileTooLong \u2014 1377 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/workspace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ff5d2c209faa472fd810ecf6ce14ddfd2a847d534e43e9d670082c4da9a013"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: html/markdown.rs: FileTooLong \u2014 1374 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/markdown.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4211183915b8dbfba9bf773f904c7a9452b89abd4a1fbf9fd5fd19273a25a9d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: matches/mod.rs: FileTooLong \u2014 1365 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/matches/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aff3775b155249e5c38fb90782dcc545305b05741d2d3ca8f09034c3c69fd68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast_validation.rs: FileTooLong \u2014 1362 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77f07fefe0aabc473b29b845490280a3393550ad78f631e835de091fb9d14eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/builder.rs: FileTooLong \u2014 1352 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad77d66b01ef3b731fdf55970a022decf3d6fd8df03fdb5699760cd9c4c21dc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::handlers::request: TooManyFunctions \u2014 80 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/handlers/request.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"99979bccd2ed78b40f9d9e4d0758aa7f623a89e62808ca2deb65862fa1cea373"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1327 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"872a299025556179500a2870e31faf58d5c2d1ff6e9a14f11429538fedde6092"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ty/sty.rs: FileTooLong \u2014 1327 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/sty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b670e48dd8a573edc41301e937a4d03699d1154fd92f3989d2a07512eb1de4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: traits/project.rs: FileTooLong \u2014 1324 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/project.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3d4ddcd34489ba154125e5bc22bb85aa604bce7aa4f3c9d2129c79700032bc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Analysis: TooManyMethods \u2014 79 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/lib.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"250ee52f8e806288c5c6e53edef86af941a5af16b921e6a4aa54f1b76c929382"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vec_deque/mod.rs: FileTooLong \u2014 1313 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/vec_deque/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15a88eb23ffe69650289ee3b6c63f10bfa9c4220b5f64e8f8835d10abc648bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/pretty.rs: FileTooLong \u2014 1306 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/pretty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de78d2e88d197e6f6eb3c039b6fcd9ec3fe0b45f9104a3aa6a9aca297f52124b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::options::parse: TooManyFunctions \u2014 78 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/options.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96ec775443fca5da3d81e8a589b149a68c5bec1d387fece766231f9e69648ad"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Session: TooManyMethods \u2014 78 methods, declared across 2 files: src/session.rs (76), src/utils.rs (2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/session.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26333b3187bab3a8557fbe52db0a489caf6547cb17fc92b74d48247f51c18a1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::clean: TooManyFunctions \u2014 78 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/mod.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c454b62e2c4ad6ac0d7f9d648cd57147f1421e7f44ef0e54b0675cb0612df72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gvn.rs: FileTooLong \u2014 1300 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8dcb3732332d3e2659201bb88a3de51e3a50f87313614f0eec83778b30fdbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/upvar.rs: FileTooLong \u2014 1293 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/upvar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7d10a77131986772950b9af4c81c2316de0d0d13275032cad8fd2b13eb6f79"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsics/mod.rs: FileTooLong \u2014 1284 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/intrinsics/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f9f908ea5a819893017e1648acb1c2fb5f25de3c147531fc4fed868171f3f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/machine.rs: FileTooLong \u2014 1271 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/machine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c7b70c580af41077832de6e5999a5b84d46df9522d7e986fcc84d713eb4749"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/mutability_errors.rs: FileTooLong \u2014 1242 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mutability_errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb67cbf198648edd939b30ef51950961ac2382baced2169d0ada4c502bdee8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 1237 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-loongarch/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b05013c382b397813fe7aec4c7011e511ee849974e150d034796c9b6edfbb33"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/check_attr.rs: FileTooLong \u2014 1233 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b829157ee1268d7b4c4461b578a6eafa137fc72b38ef8e710ec3d564eeffdc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: js/main.js: FileTooLong \u2014 1229 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/static/js/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de774c84748043f3b0bb1b80cef12a1802239e8d08a8a2e07c192418f9a1df27"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: method_resolution/probe.rs: FileTooLong \u2014 1220 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c88709b1c10561f25b2552e3de1f60a404121dbaee5b66ee45a778329b2d352"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unix/fs.rs: FileTooLong \u2014 1217 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4d5e33be13e7f8b4f3d2bbcd83aa9a9a8826e771e98c817f41c2e799e122a5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FunctionCx: TooManyMethods \u2014 73 methods, declared across 12 files: mir/block.rs (27), mir/debuginfo.rs (12), mir/rvalue.rs (11), mir/retag.rs (5), \u002B8 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/mod.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d838a811331973015b5187bafc0be2592a5b79bb829abb5f6347efebdb277f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/analysis_stats.rs: FileTooLong \u2014 1211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/cli/analysis_stats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1407da3935e32afae20efe73fe9062c9d36737bfcdbd614d9bb78a0d0665e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/coercion.rs: FileTooLong \u2014 1210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/coercion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49dd51d174cf4682ed3ee68cc33d8aba2182c710a4641a491a88469460b79c3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Span: TooManyMethods \u2014 72 methods, declared across 3 files: src/lib.rs (58), src/span_encoding.rs (13), src/hygiene.rs (1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/span_encoding.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"148bb8d71d8baf59a9dc32e6934576cdc16dd2e6acfb40ae824d39616b99f321"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsic/simd.rs: FileTooLong \u2014 1195 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/simd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f0f7b8e7b3b9788dd3fc42f8c5946b86c86c62af5a2d526dbed6fe2771343d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: debuginfo/metadata.rs: FileTooLong \u2014 1195 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc756457279b917f9d089f6af7675940f7abff5a55cd4d31b8be34b66cbf95a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hir_utils.rs: FileTooLong \u2014 1193 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ab9ba0c2beb1231c233221a2337ac4a7fe778a3730cbfbe6f6a3d9b605ace0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: back/write.rs: FileTooLong \u2014 1181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/write.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6733dc2592dbb2e54b18d509b2e05f0b8f77586a2e7e59e266a3e7ba96c1b365"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/intrinsic.rs: FileTooLong \u2014 1180 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-arm/src/intrinsic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c722f7312e284f022e4e594d8f3ffecd9d5e2e16257a36d023d50e399b96af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eval/shim.rs: FileTooLong \u2014 1178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval/shim.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e014301ea7a838911955069d2acad639f2f2b23e9f01f55250a437ff91e302"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbf64e6eb2eb1610616d759d9b7d60a1b950c83f5c761588746ad43a3515512"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unix/foreign_items.rs: FileTooLong \u2014 1173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32873be5c4b1767783308ceab344727d81a033ee049e3d3073c8ae616bdf7700"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SourceAnalyzer: TooManyMethods \u2014 70 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/source_analyzer.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab4ab6d0059d57f6a6ef5709fd81771b03619141755060e0cd0a4515f499cfa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/compiler-builtins/crates/api-list-common/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b63b39a0aad37981efe76be043485d0b3ee1dee1f96fdc5653900bdcae50a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/comment.rs: FileTooLong \u2014 1160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/comment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc76a767b26922c42d5c5aa6ece4aa8c283d74dc970c684a788e82b601659036"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Evaluator: TooManyMethods \u2014 69 methods, declared across 3 files: mir/eval.rs (55), eval/shim.rs (12), shim/simd.rs (2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/eval.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5c457f223bde99e52b4e798e6b6160eb8f52f02228d4554f1f7ed66e101878"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: back/linker.rs: FileTooLong \u2014 1146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/linker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e84be734bc6e897ea24cfe3ff3e075b9c9f464716e43ff6aed8d9931d13b05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/scope.rs: FileTooLong \u2014 1140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/scope.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10966566bb5c1831fabbee7ded914ee3f0ad5f0b92de78e7edfa7331af70fef7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodeRef: TooManyMethods \u2014 68 methods, declared across 4 files: btree/node.rs (49), btree/navigate.rs (9), btree/search.rs (8), btree/fix.rs (2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/btree/node.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b17ae579656209379c6146be1f9aeed567e5613448daf950eab3062ab4fe6fa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::x86::avx512vnni: TooManyFunctions \u2014 68 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512vnni.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7651ef9b117d98b5b7cd7ccb82c32494bda24590c24a1f582943f0812ed29e0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cx/expr.rs: FileTooLong \u2014 1130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/cx/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0981959e9a4ec81e5f0d6a8c4c6c2fd5d288704038f3cf7eefcc2eb868def38a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/asm.rs: FileTooLong \u2014 1126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/asm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f223be26279b078264e903fe80bb98df8d5dde341928ddb6be854134de4dc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eval_ctxt/mod.rs: FileTooLong \u2014 1123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c838cfa63014797112247d80ae71ea42c23216e04963a50426b84722516bad6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mbe/macro_rules.rs: FileTooLong \u2014 1120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/macro_rules.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb366e7ddc957c47054822d3e7f2072cb8d8182805865480081f3f365e73a32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/collect.rs: FileTooLong \u2014 1117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d40668690771a8923fc7ceaac5c627fe10989f0d21794921600dbf80fa7d393"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: concurrency/data_race.rs: FileTooLong \u2014 1110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/concurrency/data_race.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc5a40136a3aeda70a048f62c5aa0f832bc3ddad9330139016c6032ab80bae9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsics/mod.rs: FileTooLong \u2014 1107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"255d0528ab8498ad0a7ed14d664a8b397b32dc97ff0579af6a3356e73a9f0e88"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Config: TooManyMethods \u2014 66 methods, declared across 3 files: config/config.rs (44), core/download.rs (19), toml/mod.rs (3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/config.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccca78cdae67838b1eaceeb2cec29c020a83bc10404df930511e914c4f9f70d1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MirLowerCtx: TooManyMethods \u2014 66 methods, declared across 3 files: mir/lower.rs (48), lower/pattern_matching.rs (11), lower/as_place.rs (7)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6549be26f83aad24a9b7cb284e64c1f3ab07fb27a285b6316e8c7bf6fc4b9ecc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Ty: TooManyMethods \u2014 66 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"04256f5bd585fab9b3f8468f87a3df9038288ae6e27fb11f1d0cc59f3adeca7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/windows.rs: FileTooLong \u2014 1074 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c7fed12723cf1cc7e9c7352dee74818109a45310bfee96bf3eb90a62e87b6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fmt/mod.rs: FileTooLong \u2014 1072 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b440d028ade0f81cc41b2b65164f82a59ce48af41cb9698227214e7a2352092e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pattern/check_match.rs: FileTooLong \u2014 1071 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/pattern/check_match.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5de88a3ce583bd25ee335ca952599377dfe4890bf99578df3573f1e5e35f1ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/region.rs: FileTooLong \u2014 1070 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/region.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02342508179ea7c935e318a184b04c29ffc84ab4c72dbb662ea5c47be31075e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::back::link: TooManyFunctions \u2014 64 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/link.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a99946c439f0521d40a90190851687d934e197f3185723e99f3d1c0074a063e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/pat.rs: FileTooLong \u2014 1065 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/pat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc4655e5093e3f138c87d5c8f219f69ccb54d2826b140be3cab804f7bd87871"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1064 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f94c78991d67d886f5bc95c653872e4fe1c3ab401d9755693bdf8bd2902a93"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/validate.rs: FileTooLong \u2014 1060 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/validate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2eb5d4385ca1cc479b0280d969d613ef8233817666f9f44faced2aec6ae698e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/build_reduced_graph.rs: FileTooLong \u2014 1057 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/build_reduced_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0b27bfd20033b50d25f6efdbf259c6370803dde7b9e148614e4ea0f4eaa568"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: build_steps/llvm.rs: FileTooLong \u2014 1057 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/llvm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc0eb419bc0dcb81bde66f711915ea98631845d99ac19428ed15fb9d113fb86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: html/format.rs: FileTooLong \u2014 1057 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d27f05f17c011a725370b5621368a71d4b89009427dcd3ade4fc7eb58d10d08"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SourceMap: TooManyMethods \u2014 63 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/source_map.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cad0b0feea970cdcf850898bd1468ca1c9c4cac27f79771b702adc86c8b798"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows/foreign_items.rs: FileTooLong \u2014 1049 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/foreign_items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7880b5e0addd078f0e296199df60c75068106ed7e15bf19d693cd4319b9bbfb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsic/mod.rs: FileTooLong \u2014 1044 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/intrinsic/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ed10b39e015e22cf130a2f9c2e70adf077ccf97a72dee2aae2887c8228f2bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/mod.rs: FileTooLong \u2014 1043 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2c044aad37f6a40c5753a526008f7dbb250dec93c069353d236ceb58ff8bc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/ty.rs: FileTooLong \u2014 1035 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/ty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"526288351e428949516aff6e87d5ca954b411c6ebca5a6d243ce228697642cb9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::expr: TooManyFunctions \u2014 62 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/expr.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec326c32d6bcac0ceeb481ab59a6bbacfa3ff14c858a10a3ea179d87a05a9d8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr_use_visitor.rs: FileTooLong \u2014 1030 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d34a17e860727fc77eb567f6b48e2aff6784dee2bbe88d7d2363c855af70cc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 1029 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"673d954dfa0a9700fca88a697313b8478af640777395dd363b7ccb9bc6042126"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr_store/pretty.rs: FileTooLong \u2014 1022 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/pretty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15049d6a81422a390c3e3d3d6c3b4288ded1e9498a4666ba3ce8e8cf373c2923"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hover/render.rs: FileTooLong \u2014 1020 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/hover/render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43845c24b01dbbe9e881ad19a5684b7fb77705288e47f18a80afb793a50d5a4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: asm/mod.rs: FileTooLong \u2014 1019 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/asm/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d852ee6e3145668fe603945faec750e78237ced701f4a9a6f77694cd928f48"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DiagCtxtHandle: TooManyMethods \u2014 61 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/lib.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2b71bb52265b1a972707f01aed8a0b14d23bf079e4068996617f7d7f142f8e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::ast_utils: TooManyFunctions \u2014 61 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbe9089f4318ac70338f136c9f301d9bdbc21162e5289623f6edbbe2a228a4a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FmtVisitor: TooManyMethods \u2014 61 methods, declared across 5 files: src/visitor.rs (34), src/items.rs (13), src/missed_spans.rs (11), src/reorder.rs (2), \u002B1 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/visitor.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"41eea27787657e17e06d7e5359ef2398d7ad9ff000f250c5e9dccb6fd3eb1be9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/macros.rs: FileTooLong \u2014 1015 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/macros.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac9c0bf29a66fbed57ba9a10ef2088728267c1954a02fb17ed3e9f53b4ae994"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtin/derive_macro.rs: FileTooLong \u2014 1013 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/derive_macro.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d87b3a8e47fff2d0c55cd7c2d78ef288e015c799bf6dcffc9d90aa7548c31c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/elaborate_drop.rs: FileTooLong \u2014 1010 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/elaborate_drop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc367a49144925b377bd50eca03eab2b57b7b6cc19b0d092bd5f1eb464292019"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/mod.rs: FileTooLong \u2014 1007 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6adf51169dfef5ae185d64b51212a473edc577d037c9877a68a6fabcc34aa7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1002 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/proc_macro/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"342d7e783a90b029f703fd358c8de4e505429f14808ced393c48cde0b8f9e3c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/mod.rs: FileTooLong \u2014 998 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8936df4e867475a8e7b2ae16a15dd7de11588cb44335a15fccc51ed0db34d0a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fn_ctxt/_impl.rs: FileTooLong \u2014 997 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74218f126ad8a43ec80c969879d08751f70de6116bbd4c9591f5c317b6e91238"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main_loop.rs: FileTooLong \u2014 996 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/main_loop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf59b48f1343f8910dff0565f0f635c7af882b17b4b396cfa139b6661397ced"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ty.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/ty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14943f29cafa088a3b008b31a79a4aa2b3200a3f60662980998f019b02e3e5db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsics/llvm_x86.rs: FileTooLong \u2014 994 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_x86.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdce03de46db5f594dea4c9737688a5b86e657df335c58030fba44f2cdd1cab9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 990 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a7edf80f4d78dd9ca297c108273bb3d0b95106bf97e01b10816634e8e27b5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/validity.rs: FileTooLong \u2014 986 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/validity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc00e276cac3297cbcbd311546d271cd2a3dbb4acc1f16ace9646d4556f6151"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 985 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a337dbc99e502193cfa5000659f871d5461c27444c2012c3f319e01f0130a03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solve/trait_goals.rs: FileTooLong \u2014 984 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/trait_goals.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5250de74b24cd47e238a1e2ed76f643926c28b07ea384a8afe1034014b4a9eb4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RegionInferenceContext: TooManyMethods \u2014 59 methods, declared across 6 files: region_infer/mod.rs (44), diagnostics/var_name.rs (6), diagnostics/region_errors.rs (4), region_infer/dump_mir.rs (2), \u002B2 more file(s)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/region_infer/mod.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c4fe73b54e002e972355c0c5f4c6146e8fb1b59a7957421ff827d32907989b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::s390x::vector::sealed: TooManyFunctions \u2014 59 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/s390x/vector.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14561bc64e187604ba21cf7c5572e4f93025a0e176e97850f52121d0947d03d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::x86::sse41: TooManyFunctions \u2014 59 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/sse41.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0aa48febbdb420f60436bb92d04870980110a4b91fde40162612ba2a2819266"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/intravisit.rs: FileTooLong \u2014 980 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir/src/intravisit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5222f505c24601a4a315d43cee9bff3027faa7ba6851a3a7c540916bbb4f6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: build_steps/tool.rs: FileTooLong \u2014 978 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/tool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"438bfcc6c6de68d491850d59650ab417f3bf249f7542d8ee732667c13849c393"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 976 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"337617d241a5a9fb75986312b6161b3ac77bcd29633007a00937418fa1f60fb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: next_solver/ty.rs: FileTooLong \u2014 976 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/ty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5ce8a3c4ce922bc38b161356d18e61724ea350a087b7290690665459859780"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/attrs.rs: FileTooLong \u2014 973 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/attrs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabbc0400c5586d4595e8db3c6ec7ec1beb8caf125f3a90f12181575f56c32fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/memory.rs: FileTooLong \u2014 971 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/memory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"177a8d50e3d492dce2d62698a830303f0ac31690252ac13712608615b88c17ce"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Builder: TooManyMethods \u2014 58 methods, declared across 3 files: src/builder.rs (27), src/int.rs (19), intrinsic/mod.rs (12)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/builder.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7761ba5c9c2f55f7d5218f9a178dde5582947931d338df4b4bf8c4c0b986f287"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::intravisit: TooManyFunctions \u2014 58 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir/src/intravisit.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"a267f5c3636885c3279aaa4f9d28a3192116c715e8d21ad3ed222709de58445f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hvx.rs: FileTooLong \u2014 964 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/stdarch-gen-hexagon/src/hvx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb555268a03ee9a7d1509218d9c6b7b0e57562bb422673b1c4359b1feb30a99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ty/util.rs: FileTooLong \u2014 960 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fa70481acb1e473e8456b3e6bdf47ff98d0c189dac1f7a5c558b1570835c85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/resolver.rs: FileTooLong \u2014 958 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedfb9cc46d492be4119b0154945bfc96fd273e25283a7cb8185903e9208d974"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ty/mod.rs: FileTooLong \u2014 956 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/ty/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"332f78772919cbc65525e03b337ce767f4c12b7f3b02888f1b0b3dcb37700812"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 955 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6984cce41ed6edd90a195e165afb91e8028231758f86c8a09c4118a743ebdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 954 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdfdd11a6d61fd582a884e2f5ae9d175e9b21d878da32a9fcc06760c55c6a41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/make.rs: FileTooLong \u2014 953 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/make.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca344d5e4b46e389665d82de4333356790e4eee9adef6925ec0c08993b34a3a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collections/linked_list.rs: FileTooLong \u2014 952 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/linked_list.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59b3d8d531443d2923c7b801f76691a02d93a609c0c59ff9cb8bfd34f605970"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CStore: TooManyMethods \u2014 57 methods, declared across 2 files: src/creader.rs (46), decoder/cstore_impl.rs (11)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"006fd76ea74f4d4954564f20d89fac6da0e71e9ce0d827bbc15992c453b05cab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::x86_64::amx: TooManyFunctions \u2014 57 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86_64/amx.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f09e72b2a84d5d41b17f1cd6f14f9c1c5c1065ce360c8901b35337492ec08cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 948 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4facb1f99c0420d6e40fda4c5efb24b8326eb0543739946f73cd0c9f45b0b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/collector.rs: FileTooLong \u2014 945 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/collector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"763b9042f4de793ebb40faa9a4996b8656be2849a5092cb942e61fbb00e93156"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handlers/generate_function.rs: FileTooLong \u2014 943 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f55e818a145e0d76b6aa86c423e33b4d3151c181bd58929caf48fc05bbcf60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/search.rs: FileTooLong \u2014 943 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/search.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f981f9443e0c0259cef324694a1e2513e1ff83cdf65633295f7fc4db1eaa31"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/liveness.rs: FileTooLong \u2014 942 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/liveness.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d192c8b68d93b9b4a237f39cbc8f5a4ef6dc302a8230dfaffe2eb2f45bde7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/intrinsics.rs: FileTooLong \u2014 937 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/intrinsics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcefe80f9640fd3c67aad9325d544159f332f192f2b806c65f0607203691255"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: build_steps/doc.rs: FileTooLong \u2014 934 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/doc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d556713d47b93861debdf55d3753f38ab89fba0fcd021aa2305853c4d7a4e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 932 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7f46d800382f31a7cd1a9d4f9062a35e6ab706c34efe4f8372652360b1516f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 931 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"517a170a0b98130c183c7ae5f6e3248c646b913893ad850a123c622d960a12e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: region_infer/mod.rs: FileTooLong \u2014 929 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/region_infer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf6418c55e56e1b45523b847e7422b5aca8d2d36029625ec3444aad7a9a563f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/path.rs: FileTooLong \u2014 929 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower/path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca93489567bc85b9cff8c432aca52066d363870e1b4310195725e9458bf43b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/layout.rs: FileTooLong \u2014 924 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_abi/src/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a105f52522164926d60d902b8c35683126c4afdb3c04196cd037215df14e3a07"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \u2014 923 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_session/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f32d87b24d8537e3f95df1ab7d51a7f38a73eb32d83c8ed3259bd7a79e8c53"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/sse.rs: FileTooLong \u2014 920 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/sse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a09fc8e847beaad125d15c4c7a0abcb3406ac190e3e754f9e8300c0fc36d6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/target_features.rs: FileTooLong \u2014 917 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_target/src/target_features.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc054fff19e48023e6110b21e88cfd1db1638285ca12e5422e338e6eee26454d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeckResults: TooManyMethods \u2014 55 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/typeck_results.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0259e7c9b2484b8256f82a2a11e5be71f897968e9436cf5e563f002e9d4df6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ItemScope: TooManyMethods \u2014 55 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9b15c585abe4316bbfeb4fbfd5925cad1634962e99da900267215649c511b9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::utils: TooManyFunctions \u2014 55 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/utils.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0953a69645629f1e64b0feb2bc4ab5327059f6df7e06f2714bfea2b7aac58c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::utils: TooManyFunctions \u2014 55 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/utils.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b1c22aeda4e9ba683e000a9228e0017261319dbb2a1bf7bfc40cdb1ac75410"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: back/write.rs: FileTooLong \u2014 912 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/back/write.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b12c7672327e300c832b37f38c0930c9af3aa555b17bffa78365cb4ba8ebdf9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bit_set.rs: FileTooLong \u2014 910 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_index/src/bit_set.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3525443c123f99e78f0454873a229a1fbafe6c58e879043d7b3c7a6b3e70f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/builtin.rs: FileTooLong \u2014 909 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint_defs/src/builtin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55cb43f5a9e28e5e92e9c43f17df9e4dd2e459753927f7821246340a0052c92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: btree/node.rs: FileTooLong \u2014 906 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/btree/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6694fa631e8bb315daebb3261c42e0d361b4da17e41ba236407ca0095d1b114e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: neon/mod.rs: FileTooLong \u2014 905 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/arm_shared/neon/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d4524f97bf2cc26c7f8e279618adf42311ca6902c8ae2f6da77ca21489b693"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generic/mod.rs: FileTooLong \u2014 902 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/deriving/generic/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae65750539b3aad28a5b383662a72c045f2b900701891a24074f122b2854a94"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Handle: TooManyMethods \u2014 54 methods, declared across 4 files: btree/node.rs (36), btree/navigate.rs (11), btree/fix.rs (4), btree/remove.rs (3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/btree/node.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"929b7eb5da48308c79421218a2ec626e8dadf0742ccbfeb6b9ecc652d73befc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dead.rs: FileTooLong \u2014 898 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/dead.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5d41b7c9dc9d6bd122bf0876821cebc8516960c5ba45be1f28cf0dff8a0653"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: select/candidate_assembly.rs: FileTooLong \u2014 897 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/candidate_assembly.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31d268dda0118c4d9d6809484e48d19d6fbc724b7b0a1844e1d1d9ce99363c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/op.rs: FileTooLong \u2014 892 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/op.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19f6c5d96ca4ba67222c6186b477bd2ac1104b35a872e65038b8b704b4f5696"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/pat.rs: FileTooLong \u2014 892 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/pat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a051752766ac887f93a49919bc24b1deb079fe78b67e747822594f1b303a4340"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/passes.rs: FileTooLong \u2014 890 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_interface/src/passes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6381f4579c88015877841da8976c751a27c3f6d1a962c6aee3c26cb467db2134"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: json/conversions.rs: FileTooLong \u2014 887 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/json/conversions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edca8719de95312472708ec3aff42afd897bf385191a538f9cef71c630a7f8d4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AstValidator: TooManyMethods \u2014 53 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_passes/src/ast_validation.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef330efdb877c0308350283c91f1fd94006352bf6c285594bbe9ed15b1c6f401"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AdtDef: TooManyMethods \u2014 53 methods, declared across 2 files: ty/adt.rs (44), src/ty.rs (9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/adt.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7459c47c8bc038443dbcb029b2c7ea88050353df4276af863a965a4dd5588fd1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::amdgpu: TooManyFunctions \u2014 53 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/amdgpu/mod.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ff0852314c864d0fee892ab0fcd720da9c6d21f53720c53896f44c54686598"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::ty: TooManyFunctions \u2014 53 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/ty/mod.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b753624de834bcf2bf08ecb6567308fb76fc8ab868d3dd59572ee38b571457d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: select/confirmation.rs: FileTooLong \u2014 881 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/select/confirmation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a718d653930637eef64f6e599dfbb29d564be35da5dc3d623027fb07ca5b2bd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/coerce.rs: FileTooLong \u2014 881 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/coerce.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79ef8066994e0383fb839793406db01a55a3780c5ca11be7c9b4dd0e2ab16cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/macros.rs: FileTooLong \u2014 879 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/macros.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b94fb67c87cc3730230991e3dbd2598eaf9836a8dbfa1fcd0d18f7e9e3657a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: str/pattern.rs: FileTooLong \u2014 874 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b913823604ea6273967dd10f4109b4abca96d2e5a61e523bd3863f5202b1fcf3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/creader.rs: FileTooLong \u2014 867 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/creader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"080a7e3cd218469efc0af445c69accee7be857ac607b670cd0dfe0dc907cc441"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analysis/expr_use_visitor.rs: FileTooLong \u2014 867 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f030e742909c1d417037206df825c4e2443a5c518f53f451e83fee7adcf62d20"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::lsp::to_proto: TooManyFunctions \u2014 52 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/to_proto.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d528c54a1f7699a4d2821a1e5bcffc9ef0160d2030c26a6fad445cd0b319a5fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unix/tcp_socket.rs: FileTooLong \u2014 865 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/tcp_socket.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c607e611f29432a1b6fbfdedd750c0885604c5bae96874593568ccdabbb02612"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/visit.rs: FileTooLong \u2014 863 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/visit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a2f7dd8d94e3972219d81491a7b2063cf6a75eca964e4ca5262f8fd6546da6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/demand.rs: FileTooLong \u2014 862 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/demand.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dbcd608070117070a1ccb1e897aaccd4ea71bd3b9609db5ad9b7c0b0b7d9f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: attrs/data_structures.rs: FileTooLong \u2014 851 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir/src/attrs/data_structures.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0488a00dc04c3f8a4bb65d5c2451281561ca21f6c82b123df44f8bc689e6e0a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Box: TooManyMethods \u2014 51 methods, declared across 2 files: src/boxed.rs (49), boxed/convert.rs (2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/boxed.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf830bd919d4738c259e0cd9548d779a5b4b1738a095e70c19a6b6378cc6cb5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GlobalState: TooManyMethods \u2014 51 methods, declared across 4 files: src/main_loop.rs (18), src/global_state.rs (16), src/reload.rs (13), lsp/utils.rs (4)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80d50ae7e15cf51c245cbe4586c4ba3d78aba2b8ae904f51e0cecfc7be0d44f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: assembly/mod.rs: FileTooLong \u2014 846 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/assembly/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"715a24b07b954c9e06c3aaa3d87b2cd953f4b20ffbff6d2d4ea16a25492660c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/inline.rs: FileTooLong \u2014 842 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/inline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fef700070987a46f6c8ad8b59803c1754753ab139cc69118730dd02b402e31a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lexer/mod.rs: FileTooLong \u2014 841 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad3a8322d10efd17612e98b3501d618825bdc96e4237d444e8cceb92c03cacf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: riscv_shared/p.rs: FileTooLong \u2014 841 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/riscv_shared/p.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad32415304a81cbbb9e92b9929f34eb368b8a3df0e82ef093007a79d084e67a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hygiene.rs: FileTooLong \u2014 838 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/hygiene.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda1e5fe3848431c63972ac4a6282ab247a8667b09ee2077b78a37d4bbded9cb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Item: TooManyMethods \u2014 50 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/types.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"5337b3c041ea0e56f2c83a3465454a2c6749cd1580effaec37c74903b6f8790c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Validator: TooManyMethods \u2014 50 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/jsondoclint/src/validator.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdc6f626a762ea6f82633bd98258dda3f298440ee467cf1820fd27874df496f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/directives.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/directives.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b8f4d6e4527ff60ecbadfe7c56027d8c5a527a26ace622bedabad6273fc006"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: attributes/rustc_internal.rs: FileTooLong \u2014 825 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/rustc_internal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0c2aba77c2c6a723977ceb05d4ffd3fb0f45a204192e73153bc3cf092020bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/base.rs: FileTooLong \u2014 825 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/base.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db46fc5aef96781f0ee6f8f54da74ebff997dafe6a7846db5decccfc1c684de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stable/ty.rs: FileTooLong \u2014 822 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/unstable/convert/stable/ty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aede8d4dfea052a8f850f8ea4115b9d7c959d6870645226ffecb5e73082c24bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/consts.rs: FileTooLong \u2014 821 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/consts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f6720d4a7e82ce7eda822332f656d6df78caee14fa1ca7e4215850e4aa2cfc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/move_errors.rs: FileTooLong \u2014 820 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/move_errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd9c0fae9458680a6ab862a9f42bf715d4fb892da97476a7d538204245c3a9f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::items: TooManyFunctions \u2014 49 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/items.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4438132f7e90a20d0cf0a59a5af44f6cd2f77a1ab639b228cd985f7b7e8c73"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/base.rs: FileTooLong \u2014 816 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/base.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e332214e7331915aea2c2d92902c9d45e566ed09ed02bd418f33692602ac245"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session_diagnostics.rs: FileTooLong \u2014 814 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/session_diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c8246272ebde35659ea56322884725edee83de9e63a6f9fe3f093af364da4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 814 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52b04000cd33308254107e8ff4c290a69e7f060f1f6e4c9cca51949bace9f8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr_store.rs: FileTooLong \u2014 814 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ae5b03ae2a34aae1e7075c4f524dd85c9608fb0e8c90550b405c0b31bea111"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/mod.rs: FileTooLong \u2014 806 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/x86/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3c21eeb4a93906c7c61b763e2a86cb49fee2794a7001f16a235f71bbfec38f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/mod.rs: FileTooLong \u2014 801 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"649e173b7cfd94a6350ea6cac5014d955fad8fff8e2554275fe84fc19a88173f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: str/iter.rs: FileTooLong \u2014 801 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/str/iter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1010f2a580c61a5ba86d991e44ee21750532d562fd2da55a16396159cec0a3f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::llvm: TooManyFunctions \u2014 48 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/llvm/mod.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22bb9566c4fbaf35027e72bb8f817efee63ee8f1410ce739a7d5fabfa65f327"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Socket: TooManyMethods \u2014 48 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/unix.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff0769af77a453a6372fcd72ed8ac9c727aee8500e93d6c760eed8d1a80522f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/utils.rs: FileTooLong \u2014 800 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4498edade5f2de8e68cb308b8c1229ae533cdfc9b9d6b5a4eee8b690e2a6fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ty/layout.rs: FileTooLong \u2014 796 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b051c9181eac7fbca2cc34e9e9b9d8410594ca435c71818507653e03f6001250"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsics/llvm_aarch64.rs: FileTooLong \u2014 793 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/llvm_aarch64.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19d5fb00dee20ac50fd56cf0cde55694bf47e0278dbc71c0e0b2da4de235938"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/signatures.rs: FileTooLong \u2014 789 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/signatures.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3739ce930d8ffa18aa96fbd653fd72a43a35556ef348570c42131cac3fda06f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostic.rs: FileTooLong \u2014 786 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/diagnostic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9307b48fd12f1dfcb332f96f2aaa70e76b7827a4b8d267a6a7da1b2daa9fad69"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Rustc: TooManyMethods \u2014 47 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/run-make-support/src/external_deps/rustc.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec6a570149f412a0ca6757a7267fadde65e170023c3502c5eafc4949982345b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/format.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7fc5d1ecf24dfe878044370c40fbcb13df944c0534f9178465b7f69a228109"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dereference.rs: FileTooLong \u2014 779 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/dereference.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1bdd7cf496c7583bce3a5cc6ae1c24369f0b87811d341d461fff479e06ea21"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/check_unsafety.rs: FileTooLong \u2014 775 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/check_unsafety.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9468a0d0a9e11bab81f5580ed3477006c5b46c08abcf9a7b9f13d024e88e9043"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsics/simd.rs: FileTooLong \u2014 773 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/intrinsics/simd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c720a8e7e93a74e63a2ac04d9b85f48f687258dec590eb2705a822cbc049912"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast_utils/mod.rs: FileTooLong \u2014 773 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/ast_utils/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f8a3f440b8faa29a4d415c14beeb6f5cd844ad12c0f1ecf13e945456e934d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/defs.rs: FileTooLong \u2014 772 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/defs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5d9eafb8b61da28cd683ab1922d5993d5fc112148238161805e05bfc9123e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/rvalue.rs: FileTooLong \u2014 771 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/rvalue.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cad9d3b85057d076e1b3826c9cb08f2a3ee7f97c36d87233c20756fa5e9af47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unix/unix.rs: FileTooLong \u2014 771 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/unix/unix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"529d9ce342b1f47210d467d18d1be10ea0b6477e14f43f1cb300a6c12f62fa04"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/callee.rs: FileTooLong \u2014 770 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/callee.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"143bb3fba2b5165e15e4a4bb3fd4b407077d1c1395b74a3a6e4e737cb4b3e1dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/shim.rs: FileTooLong \u2014 768 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/shim.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9378fecf70a86370019b66c8fa68133c866a28b1214ff424b368f8ce39f8a3e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::html::render: TooManyFunctions \u2014 46 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1399f001f3548a0785daab33addc839f762191502afe40b7b284fa0fcaa03b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::lower: TooManyFunctions \u2014 46 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a4f8debd6ba2fa2ef0ad457ddc3120aee26586acf5f2caf4e43f23c6aa9111"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: librustdoc/lib.rs: FileTooLong \u2014 766 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3eaf403b1c5f8fd490c63afbf7baad39ceceb486753129ca7abcf8180c5d004"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/base.rs: FileTooLong \u2014 761 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/base.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34bb9408a144840ddb6c481034b6d50ce0be00219ea3903ac4c05f26e045016"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: search_graph/mod.rs: FileTooLong \u2014 761 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/search_graph/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43b6b562106b004cb1f36780053557bfc5317c3e9641f2a0fbddcee5d9037da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/cargo.rs: FileTooLong \u2014 761 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/cargo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8ac964eff51350d8c09957f700f6c12b64e6eed3435310aebe021ce7fd3183"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/node_ext.rs: FileTooLong \u2014 758 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax/src/ast/node_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb09dcb0c1aacdac26cf59bf02d6b83a1b723227ab6153cf06e4873b536ec24"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: coroutine/mod.rs: FileTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/coroutine/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d3090b8f256b217180bf31eaf07c040816e2d5c188c845f6c30fee828e192a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/visitor.rs: FileTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/visitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df691424e9565643ac28378ac8e2715cfba5b10172b5324071497ef8fd338add"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/imports.rs: FileTooLong \u2014 756 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/imports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f198bdedad8126d3581b55b50bbb32ef5bbccab3a1626523297855544c751a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/region_errors.rs: FileTooLong \u2014 751 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/region_errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df19aeae28ca52f046a1265c385080eda847cc42ccd02c0005137645cad1cba5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/int.rs: FileTooLong \u2014 751 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/int.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a15449c4d7f05f53f442a1e8be3d6f1e58fe1e2ae2a35ff9780ec160dab159"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cast.rs: FileTooLong \u2014 751 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/cast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f54865f665bd29ffbb466e41937915768855c4ac94b85622ce7012b7627d1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: thir/print.rs: FileTooLong \u2014 751 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/thir/print.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d582e089aa3577c362e7d31fdf125b3c2e362824173355c50874ed977e9119"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GenericCx: TooManyMethods \u2014 45 methods, declared across 4 files: src/type_.rs (18), src/context.rs (16), src/common.rs (6), src/declare.rs (5)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/context.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"63793de805fb01e24403cd1b5736f0044e7eae01d4194dae3be6b26dd8d246b4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EncodeContext: TooManyMethods \u2014 45 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/rmeta/encoder.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f13cfc222834f5a8146b5a0034d61549fd9deb9cc6620e218b74c874b7c954a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::html::format: TooManyFunctions \u2014 45 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/format.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9465b439d6af4c6474cd3c99e0b1f97831c156648efb2536b8e4c6441d6bd12"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClientCapabilities: TooManyMethods \u2014 45 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/capabilities.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"427a384cb786e700b40c928dfa545d1b413c75170d724f5d8cfb72d5f1e89525"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: collect/clauses_of.rs: FileTooLong \u2014 746 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/collect/clauses_of.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9981760341af6bb91726e4bd97b4269afa274ced78367246b3dbb1de45b95bbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/deps.rs: FileTooLong \u2014 745 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/deps.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c1185c1617d2b0eb3cba00faecc77dedeb8d54512caa12817984a5e840801c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/token.rs: FileTooLong \u2014 741 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/token.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2eb98228300623c52fbdfd637133a490fce1e7ed382e93c172c415a62bbc9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/rustc.rs: FileTooLong \u2014 741 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/rustc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b36b2b6c5bf67ce11b5d5152467d93f4f800690b8361bcefe0cf415218bf782"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: closure/analysis.rs: FileTooLong \u2014 739 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5872aa71f882a59c1ed20e832b2f3c13d16df4f8d29f02dcbf8e57fc68a8d2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/boxed.rs: FileTooLong \u2014 737 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/boxed.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f283ade3f94a5130f49635406ad5036131690f79d8ce9923af4398bb41ab2ba1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/conf.rs: FileTooLong \u2014 737 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_config/src/conf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c542a00f1e3dddb02584ed811c723f9b2438b78e8619263989574895dd64d958"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/unused.rs: FileTooLong \u2014 736 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/unused.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0307372000dcc2f022a6569f9b088a7ffdca4d612c3332220c378be0ff619c7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: coherence/builtin.rs: FileTooLong \u2014 735 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/coherence/builtin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"babf615508dc9c400bcdf69baccd557f45956a75d6a47f445153fc65fa0cfced"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/item.rs: FileTooLong \u2014 734 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state/item.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a491ac83297a126c383bb434709c31d57c3bd4583a0d7b81031022f11231f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: librustdoc/config.rs: FileTooLong \u2014 734 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3a18b8815071756076bf5718677143d8190f3b72acbd753e28f863b2585972"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExprUseVisitor: TooManyMethods \u2014 44 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/expr_use_visitor.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f02d7c861c9f0ff7cafa52147fc65e3afcdb00e6980ad6fcbae151a7ce79f40"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TyLoweringContext: TooManyMethods \u2014 44 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/lower.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdd69aeedadd91f624759444e79a8e2afce560159c12d2ef60e2f29ad9132b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/wrong_number_of_generic_args.rs: FileTooLong \u2014 732 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e179a53598836624a9ade2664510ccfb826f276d00cface173b0db251edffc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dep_graph/graph.rs: FileTooLong \u2014 732 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/dep_graph/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8423ed8f63db97f0b1c51ead0e4e8f427e7cc6d585c1e25cc139c8512d2abb33"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extra_checks/mod.rs: FileTooLong \u2014 732 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/tidy/src/extra_checks/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62232a0a8aac7c34397fcc2488a9a81fde69f8720dcdec955d9a82682fb3e748"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solve/normalizes_to.rs: FileTooLong \u2014 731 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/normalizes_to.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7c047695825b0d616ab0a69753a560cd8e8331e3491a7f5b63f42b027af50d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/va_arg.rs: FileTooLong \u2014 730 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/va_arg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8065df5478b3d59483b76b1cf97291f255d8c5e5237c5f291d3388968a04744"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context.rs: FileTooLong \u2014 728 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"142eb3d9555eaec90adb2744d4e39c2e601526ab3c368d7b92e9d321d4363674"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Builder: TooManyMethods \u2014 43 methods, declared across 4 files: builder/mod.rs (38), build_steps/toolstate.rs (2), builder/cargo.rs (2), build_steps/tool.rs (1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/builder/mod.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2faf4d8538c38a3d0c680a207cf2684f1dac36c243929e93ac98a4c754a4bc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Resolver: TooManyMethods \u2014 43 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/resolver.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f7eb265e6b5d68247819a75da9716d68aa2b599e33d06b11cd59e9f16d2918"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExprUseVisitor: TooManyMethods \u2014 43 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure/analysis/expr_use_visitor.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac3c55b9d9b55be45a2f59b495f9936dc3322e413d6dd9b3b509929b26bb9fe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SourceToDefCtx: TooManyMethods \u2014 43 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70dc515e77f69563fb2b5e460f030cc4fb214390108dd948d77b5948f6ea9de"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FamousDefs: TooManyMethods \u2014 43 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/famous_defs.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e8dfe33441a05379cd27e73e915dcb76cb1af49982a8a96527a961bb57fc77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/note_and_explain.rs: FileTooLong \u2014 716 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/note_and_explain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43923b9485af5a0a9821d95c534de95b0325872e6bef2ca25bace04f44edba49"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/download.rs: FileTooLong \u2014 716 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/download.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e933ab28c86ae0902da94f6bb48a9843dfa7641c20c9e276d4343ad7a3b8013f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ty_kind.rs: FileTooLong \u2014 714 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/ty_kind.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"509ce3aa184847f3a3a85eff3a8b14834175596b2495294021b842cf533854f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context.rs: FileTooLong \u2014 713 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd55124fce96cfa94420fd6a5879022e715cd58e114f1bc079af5f023a698aec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/asm.rs: FileTooLong \u2014 712 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_gcc/src/asm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b2c6931d69df312fafa60aaae171f1984d40d46d0d27b02c9a9c31ce00f66a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: imports/import_assets.rs: FileTooLong \u2014 711 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/import_assets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fb46539674c40f8cc47978c3813e69416c10132b2e5c0c8d3ddd7e93ee51fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/locator.rs: FileTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/locator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b0a5a06a9afc1dd7fb7bec3dd46747b58a5b5fba6a3aea63e02962187c52ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/mod.rs: FileTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b241748bf596437d89be4415ed4d95ef42946ae8bbed52fc65dd0f5203eec1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/partitioning.rs: FileTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_monomorphize/src/partitioning.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2181d77cc32439cb458c845605072e8ba2b81ea35561bd39e593e570db0ee80"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/navigation_target.rs: FileTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/navigation_target.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33996c5c7b504b76dcca5780787c0bf3baa57ca73a244f82df23a1f69a7ad61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/expr.rs: FileTooLong \u2014 701 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pprust/state/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bef7e504a32d966ff8e11946f1d92462ce192abf5a5610a9bbb9c95729eff45"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Printer: TooManyMethods \u2014 42 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast_pretty/src/pp.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"938829677e9f37be01febc59498a3c458998e62027096c321954407d87eafa70"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProbeContext: TooManyMethods \u2014 42 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/method/probe.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"da77cce65d3a466a45cffb171bad610ce355ec7760b79b268c8651a80055febb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::x86::avx512cd: TooManyFunctions \u2014 42 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512cd.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a55f11e608fd60a4b1f7448a0993a2b89abca7add59bbe0924e23c9b185e1b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DefMap: TooManyMethods \u2014 42 methods, declared across 3 files: src/nameres.rs (28), nameres/path_resolution.rs (12), nameres/attr_resolution.rs (2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"137587cddc135770b2fb45c60df50594591fb121fb8f46db60d6dbc22a2d99f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: msg/flat.rs: FileTooLong \u2014 700 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-api/src/legacy_protocol/msg/flat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d2259521ef20be771a3bdc0ef1ff56c4673166de5f0610a92d85c7bd2c6a90"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/source_map.rs: FileTooLong \u2014 698 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_span/src/source_map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2506e23a6a14f3f6f362b41458cf2e226c6dfb2a45e3ab6fec1132c06a42edb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/display.rs: FileTooLong \u2014 696 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"749b154e6604cad806a018198660eab063c29d15097a1d31917b7e2cc6ae1244"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/reload.rs: FileTooLong \u2014 692 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/reload.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f439ae57b09e78a71d7416535b6aad69482ca0451dc9daeee65f440b2696da1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/improper_ctypes.rs: FileTooLong \u2014 689 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/types/improper_ctypes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e844206cb48502691488744d2eacdd377b18b3798df66a6ec26ef20d23e3c4c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/binder.rs: FileTooLong \u2014 686 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/binder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8a9b42c2e2ec82701ebd3e266914c88e369cca9361e9c203f26331d5634a61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fn_ctxt/adjust_fulfillment_errors.rs: FileTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/fn_ctxt/adjust_fulfillment_errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a3558be6c0e9d211be64daa90f19c8bf1d2e161316a1c5c1015c1365b8b277"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::riscv_shared: TooManyFunctions \u2014 41 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/riscv_shared/mod.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2e4f027e02aa72b728e89dbdb5aad7e8a0211b0b81a8308a9e113af7f9a8ef"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InferenceTable: TooManyMethods \u2014 41 methods, declared across 3 files: infer/unify.rs (38), infer/autoderef.rs (2), src/method_resolution.rs (1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/unify.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee859bec0b2d88d9bfe412c5a5e2d7696325b93772caca38c78ca97ed59cda86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dataflow_const_prop.rs: FileTooLong \u2014 683 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/dataflow_const_prop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb733ecc185b32868a9fbe5cf134336ae364b74941778a5c29b3fe453c9535e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hir_ty_lowering/dyn_trait.rs: FileTooLong \u2014 680 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/dyn_trait.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf23a8ecc4bd91693021ed4a2cee052fc6493ff478831a9afa1b3103b4681884"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stable/mir.rs: FileTooLong \u2014 679 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/unstable/convert/stable/mir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab34bbac0147cc069f1ad88c5dad49e0e961dff2ed1637da1ceef5261a820bc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/region_constraint.rs: FileTooLong \u2014 678 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/region_constraint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc796ee3ea05d14535df367ee0bd441e6ce31a42e27dbd3c8d4e74834250585"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builtin/fn_macro.rs: FileTooLong \u2014 678 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"453c1c93cdab2bd3f07e34f4f76ce7cb97a93215778348c015b727adda740f25"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/statement.rs: FileTooLong \u2014 677 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/statement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b4ab11e5715553a6db04a735792c4e0252dfd026afb04f659bdcba5d2a33ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/layout.rs: FileTooLong \u2014 675 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ty_utils/src/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"072f846752dea250af392777d56790fe209ca162e07569c21c5e25e89a5f90dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/value_and_place.rs: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/value_and_place.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bd64ddf491f579d5a73cfa0b3a576f732e0c19f19bba8e3933731a38c4c01a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/mod.rs: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3453d7d7b5ef9e09132a7b4f77406c1a3a02b4d135efbab3321885dac46454e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lasx/portable.rs: FileTooLong \u2014 672 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/loongarch64/lasx/portable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fbc454b88fee10b2a4eab0a070f31b5e9688931d5957d721dad34bdc1a022f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lsp/ext.rs: FileTooLong \u2014 667 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/lsp/ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"126ce7e2107d6758edb3366894f23726c61853ce397b2f75e17731c3ea330760"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Diag: TooManyMethods \u2014 40 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_errors/src/diagnostic.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"152972d1992ce10b760e210b71d8d3dd059e95148d33ae5d46ab91d2f45d7913"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VnState: TooManyMethods \u2014 40 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/gvn.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7e6f48e2ba811eda12693f73cfde30238c8db66c15f762c9fcbdf68a69ac43"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Formatter: TooManyMethods \u2014 40 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/fmt/mod.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acd5d35c403d9070edc5d2bd1ec27352f9ab444d56a5ece148db3e119c70731"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: traits/wf.rs: FileTooLong \u2014 666 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/wf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a04cf1acc2b65fbcbae53fb428628d380330e21064c5ced1e96b3dab0c30a04"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 666 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/syntax-bridge/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc33a713fbdf2e57bba450c5bc8391a7e2b9c3d9371992ea2eca98fd0c86324"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/stability.rs: FileTooLong \u2014 665 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/stability.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0bb7929458d4bd86913989af6faf4ea67ba6b6f298717f46d5041928df0aa7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context.rs: FileTooLong \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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da4e9fa7adf8f4c1beeb5bd59dacd193a10ea073f0350e738c42c051ba7651f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fc84f7e6b85fdb5377813d0dbd846e57987ddcafcb7479b651467e2c8581ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/v0.rs: FileTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_symbol_mangling/src/v0.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adb955f71c4c591d0d5f173101ef459490bf06592a10819de7ff48be4257c45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: imports/merge_imports.rs: FileTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/imports/merge_imports.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d25ccb489d449bef6259424cb042bb02e7635de2b19d8e7a1c084c049bf8ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/place.rs: FileTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/place.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4fefe3380c2c347dd0468c8f80e900de486e692f9c85e1cfba78779c01fae1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/region_name.rs: FileTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/region_name.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eca3dd9101243d46333d5f5a53fd36690e42849b2449c35b646971364f8bde1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/writeback.rs: FileTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/writeback.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b518c354e25f2d3af455a54eac693a6ba2cf91852cd92cba8d9f4becdc29fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rustdoc-json-types/lib.rs: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/rustdoc-json-types/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3e411a4769fa69e7de3aaf75e999ce96131e78b720df4d435bad2638339609"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: traits/fulfill.rs: FileTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/fulfill.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8567a3bef8d254d506ee54ac3e4235a151769eff9b7ccf19cbc040e4fea0d88a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/chains.rs: FileTooLong \u2014 651 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/chains.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"612e04f94b9220e9d918253d9a1eb7aeed0d94fbfde381d2b5d7c6d97c653058"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Token: TooManyMethods \u2014 39 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/token.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bb27b1f10f6226b62c8ae5a11348cb45e8b28f8a54baf4e95abb431a2c8377"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::debuginfo::metadata: TooManyFunctions \u2014 39 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/debuginfo/metadata.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6f7084bb1445dc78a4a9561cf84fcbd458113e82c54fbcca5fe13536212202"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Command: TooManyMethods \u2014 39 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/unix/common.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"802797cf09b111518d0a90b655ef8de5527fc546d20b913bfa9859a80e0871f8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::html::render::print_item: TooManyFunctions \u2014 39 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/print_item.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"315d3e5b16817992b21f92ee81b34ce1ab176ace48693960a7136e6d568d98bf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InferenceResult: TooManyMethods \u2014 39 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"300347bb0705f28784c5d1ef5a5e3b3fd4b2f633e4b7b49ad34703eda537fb7d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProbeContext: TooManyMethods \u2014 39 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/method_resolution/probe.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f81c32b2610ca7b7f19e320381755bba0f729f14391e78780affbcac8948acc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/suggest.rs: FileTooLong \u2014 650 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/infer/suggest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1140d2d6d5056ee2edfe965b234131ca5b6a6d0650c36caf9146357395047a20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: check/intrinsic.rs: FileTooLong \u2014 649 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/intrinsic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0483f5db1f9ec21037edfbb7c7aee5d98638cbb5b3b2bd80e1ded192275d5404"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/flycheck.rs: FileTooLong \u2014 648 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/flycheck.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"966bc290ac6717648c6ed29ab55049f202f4ff45b983883e4bb3952ec8bb7668"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/write_shared.rs: FileTooLong \u2014 647 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/write_shared.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1184880a91b1566d896478cedc47053ab98d0fcb220d5ae885573ca954ce80d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: assembly/structural_traits.rs: FileTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_next_trait_solver/src/solve/assembly/structural_traits.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f0ba3801e6ff875e97d35580dc16816ad5d437409fe73c57f23b1f0d89e1e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/levels.rs: FileTooLong \u2014 643 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/levels.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5eb7254a7128af77c1fa83e26f3666410a3e089dffb482060d7e39d4c18e82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/error.rs: FileTooLong \u2014 643 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/interpret/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb221bc865f26732ddb0e011bd5adc6e8e9e8b016f4115591e8c0e7b3e917dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: enums/cpp_like.rs: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/debuginfo/metadata/enums/cpp_like.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4384d10707a8b47f13306a20763b84ab59ff4e4870ceadf4ca2b450c065af29c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: context/impl_interner.rs: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/context/impl_interner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffca3cc200cc64ad16e05b8324d607d9724c29cf2b2df86183f8e2a8d7e8d4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lists.rs: FileTooLong \u2014 639 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/lists.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbf1fcdfcd7e29ba50d0d7cb596c3de105135aa98c80c9c387b635f4a42fffa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/helpers.rs: FileTooLong \u2014 638 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c560229647de2d7d72b9b485b6f6e54869c5bf2ff665b500ea270e9f66e6ba1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/operand.rs: FileTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/mir/operand.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf970778bf4d6d0b3a909014fd8322b556ce9606fc0ab6ee1d00253f06b2dfac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeChecker: TooManyMethods \u2014 38 methods, declared across 4 files: type_check/mod.rs (21), type_check/canonical.rs (12), type_check/input_output.rs (3), type_check/relate_tys.rs (2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/type_check/mod.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf043a0e77c5674f2d45acaacda8da84dbc405fa56bbec5766fb1a57e74afc2f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DropCtxt: TooManyMethods \u2014 38 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/elaborate_drop.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c43596bbcf94f44e5c8176eab1d3157e751023a75b3db0fb697bcb208b27f1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::loongarch64::lasx::portable: TooManyFunctions \u2014 38 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/loongarch64/lasx/portable.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7df1345ebc3d7f85bddcd0fc432d4c22b0e467bb7c8bc0913f9107d342f88b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::x86::avx512bf16: TooManyFunctions \u2014 38 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512bf16.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4041c0bc430444a9baf00d68bcc048d379222fde2f837be4ef44cc657690a9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88945b4d57480f2b5e5501272109ae8391d5df4380b5a7a2494959fb7c5c85aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/storage.rs: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/tt/src/storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1e7fd1dad132f5d9c827e1aaff0ea15cb4242fcb7bfbbddc06725ac59d6366"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intrinsics/simd.rs: FileTooLong \u2014 630 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/intrinsics/simd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e83d823419dc94894eff05f24d3d8d9e892eaca7921b10331e65c3b5dcaa9c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: syntax_highlighting/highlight.rs: FileTooLong \u2014 630 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/syntax_highlighting/highlight.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5096d685157dc517ce19b5c96f352bbc2ee602d5c426127aa09a0374b80e383c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/jump_threading.rs: FileTooLong \u2014 627 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/jump_threading.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56c9b9b17fb0b2419e5ae258f30c7604a190621d59dec555d0ef9f63f9ed622"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: abi/mod.rs: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/abi/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9585715f47363452efdab08d016e842f73bd46e605842dcd2c239348995d1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"300e54dad43cae6ab11fc847b05a4d41bb51816e137f5673c9f22ec81abe8d7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fs.rs: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"358e2d75cd29284b5f3e8d9023bfd8c158aa3ddf9b3762771f8d561472bb3036"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/closure.rs: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/infer/closure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ada1efb3e31986d3bd941cf4ef86aaefc70589278a3ae7c56f5ca3c283c5440"}},{"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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/sugg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab207d79f2626aed4a3f1158e1bf8ec9999cb88d6e4796154bb4fd35b2b0c83"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf5efc38e6e3187e2fed522a19a8369e9e0896bf21788b40a5484d44635b23c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/body.rs: FileTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/mir/body.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c6cfd2ee5641cd698e831d647b5f105d33226733bc97a080dd0b3ad1bfddd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/value_analysis.rs: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_dataflow/src/value_analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c3c197d2b4b40eb3831069febad9711fc18e17f45013092b3c23f7692b3895"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse_format/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb728dac864d102bf3f8a56042ef0399cb9847a7961526e7ca922bc01bbef49d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/explain_borrow.rs: FileTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/diagnostics/explain_borrow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1aa6c565c1c10b1dae1d5ac70ce5602c93853976cdce4ea60b682505667198f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mir.rs: FileTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f48865f9358f065f4914a67ba095bad302ebfa1b9c10f323a841cd475c730b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/inlay_hints.rs: FileTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71648e1ae2463d8cd8310ca60032c9616509524d06f1db377215679e0fb4db44"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/lib/smol_str/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"435260f5ec88e7820dfaaff4803a614b113554e8736eaf7c8ff1c80edf33c7f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: const_eval/machine.rs: FileTooLong \u2014 617 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/const_eval/machine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9959b3644610f6b8110ca45f48dca69fa203dc91511fc2b452048d760f739d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BinaryHeap: TooManyMethods \u2014 37 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/binary_heap/mod.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc1d26d643a6cce49bfca1fa385aaec055106deae339063551290f194bb434e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/common.rs: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/compiletest/src/common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f949203966b56da68316e0717f3d186da38b50aca2227f600f99f03a4f0f4031"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb7f39764e65665bcf126b76cdc0396c3088d59b4f6b1387e25f6a1dbe30fbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/item_scope.rs: FileTooLong \u2014 608 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/item_scope.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4212c95936b179d5bfcad624f69bc1c47aad66d7b5742abe86d22689d5970bed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: concurrency/thread.rs: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/concurrency/thread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e84bc5ab6dba6bee73451b1629bedd34f95df38b51a6fe902904a03e5679f2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/promote_consts.rs: FileTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/promote_consts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3c8bbf49eec1347079ce30b4a9ee5d7ccdda591f95ce4c9a9ab89ca8c9660c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: clean/cfg.rs: FileTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/cfg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee25f072bd3cef6fd9379c0f5e8c428e3c1dbaf25708d0d9bc1b59b00532de9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expander/matcher.rs: FileTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/mbe/src/expander/matcher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac644c29960b2f1b7a93855a758b4bca4b0ffb025f90f7379077f6b3b5d927b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/author.rs: FileTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/utils/author.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e068411ef949179e836cf4c33cd18b2c0137b35a52dd9bdf2dd74cacce8908c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/context.rs: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cab882be69ff4c479776856f134c58ac87fa0d0cf70ac5c38b26d8fa8d96f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eaf3d8f6bd3bc0a0d5f46bfcb54fb0a67deaec37cc73b896412869d94304cdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/global_state.rs: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/rust-analyzer/src/global_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca0d647908a3a78161affcff95f6dffb4ac0f88641609573ed2903d9872fe09"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LinkedList: TooManyMethods \u2014 36 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/linked_list.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0676af5f444acd30a06b1150bb2570f0459e63b4b5e555f76f4387934d3b1cf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: File: TooManyMethods \u2014 36 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/windows.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a5b73ed3038dda1ca62b08b1bdc215c13372f9ce82dee9d665f8d65169c60b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::handlers::extract_function: TooManyFunctions \u2014 36 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_function.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bd10075583eba8fed059be65705a9cef60439a6f137c9c2e694b7d1094b76d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Completions: TooManyMethods \u2014 36 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b80cc6a752a3bbd9e95670b38b304e47e7b983a8536b40cfc62d0b81e8a49de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: query/on_disk_cache.rs: FileTooLong \u2014 598 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/query/on_disk_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f084f8f9ad2d0f2add8de7433d7b7c24edc986ac9e403661b5ba654d9ea9513"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tree_borrows/tree.rs: FileTooLong \u2014 598 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/borrow_tracker/tree_borrows/tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bab903b15d4f3ca5ee245899bd049ca7bf6c0c87edf1cbf25f18ac6e0364a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/thir.rs: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/thir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"199170eb866c9391a08c82db5d2901acf76a336e8953af959fa937c84fcedd77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/into.rs: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_build/src/builder/expr/into.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af82e8bb240e87634350fbdc09e3d4d8028cc14bafcfbabc9c7b0e43a58abcd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: convert/internal.rs: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/unstable/convert/internal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df912fef444dcd2603c5526ea98de1faa0f452e013187af83474a05cf8db58b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/inline_asm.rs: FileTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_cranelift/src/inline_asm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b893d8c698bb16a3f3f65ef110514688dc282264092883298bc701bd32d21625"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/closure.rs: FileTooLong \u2014 593 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_typeck/src/closure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f298c70591b76a6eeb0bf0cfd1c62d7915ffe8dfce13a6d00d7d8b9d3d7245"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: thread/unix.rs: FileTooLong \u2014 593 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/thread/unix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66932064635318a5b83ce90c25c7fb2afe961b90c9ee6794c0a640e5c4549dd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: clean/inline.rs: FileTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/clean/inline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"607f7bc0fa1f331636d0602deb8020b1597275c289d5fe3509c54d0b61a4e9d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/exec.rs: FileTooLong \u2014 590 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/utils/exec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc952c2455e68ba9fcea9ad4d3df3bc199d1d1e12def607cfb1ce62e7720136"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/known_panics_lint.rs: FileTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_mir_transform/src/known_panics_lint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec59dfb8e87b6cf3c535cc9fae7a20a0516a587f9cc766e6cdcab70ca66e5dc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: process/uefi.rs: FileTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/uefi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7face5217f3db351b7ad447c5bec255005ca41a57d34b1a8dd138a843baa203f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/input.rs: FileTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/base-db/src/input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"333773b3853dcad949326213d89db8120e1e286cd44d7005a914e1323b611dfb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/call.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/call.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bc2d03ec88b2e12d1410a4b1340bc9216ff176755029e25d3b72127c528e82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: unix/sync.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/sync.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d492f3e8676bd808bb616ec4b4346b343d273be2ca9ec24cba7a24e0b541f39c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hir_ty_lowering/bounds.rs: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/hir_ty_lowering/bounds.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e9e611e70b0ac0cd568d07ac27790f4795b1a62f85b846499f0c5982b16d88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86_64/amx.rs: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86_64/amx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cff4da20245b146f6efa0bc9042efc72c16b26657e9662b36a37e9b14a424d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binary_heap/mod.rs: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/alloc/src/collections/binary_heap/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68857804166b03dbd520ef9e000c42f002219290dc828a0a92fc66484ca41790"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: doc/mod.rs: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/doc/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60efcf911dbd62a1e058d27e81f5d58f85b6218f0b2755c51fce54e3526ae9d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/sidebar.rs: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/html/render/sidebar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"930bfc82dd11c0388ee133a9921f02f2f2b6a74c23a0999696d5588fcd36dde8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WrongNumberOfGenericArgs: TooManyMethods \u2014 35 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/diagnostics/wrong_number_of_generic_args.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1638e13657792813de69af7bc6995a3658653bf6b2e321fc8164b5569fd49277"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ScalarInt: TooManyMethods \u2014 35 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/consts/int.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"867feeefc0d8ed874e5dc28a69f690eee2595148f177b4c9109d9f9d280595d1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CheckAttrVisitor: TooManyMethods \u2014 35 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd1bca3b8a12d718de0cf70702bc75bfa91e4e76564f3223c04da3e93498142"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::utils::helpers: TooManyFunctions \u2014 35 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/utils/helpers.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"606cfd1de3b259840d7f8bc7b31d10049d8526ddf3e8075141825ac09bcf54e7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GenmcCtx: TooManyMethods \u2014 35 methods, declared across 4 files: genmc/mod.rs (30), genmc/run.rs (3), genmc/scheduling.rs (1), genmc/shims.rs (1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2200a9c5bb3c3d7052184a6a4b0c7e17509e6a3a77db62a3bfc92cd5d9e49d7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::builtin::fn_macro: TooManyFunctions \u2014 35 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-expand/src/builtin/fn_macro.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14e5dd8f26b59825490747f6a4c5c79229f7b1e6582b936aedfe20aaeaa12ad"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Semantics: TooManyMethods \u2014 35 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a0e3cd53b7c3e66acf25fccb3b980ba1c82159dec14c3ddde701838262d571"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: next_solver/predicate.rs: FileTooLong \u2014 582 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/predicate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abdb1e0be55fd1411e1776cb568a46f3d07dbaa51e478164e9cba58ff5a97a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: attributes/codegen_attrs.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/codegen_attrs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"539a6828baef4dcff66c92438102625238867b353c4d61aa3ff02e1719d5554b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/autodiff.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_builtin_macros/src/autodiff.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7deb20b571ac86a6a03b80cecbbe7854ce75818a2de4c5b1bee3b91e3565df6c"}},{"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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/undocumented_unsafe_blocks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"568ac170843c670ade05788b827e58852ad4dc9ed6cc695fbf70c104f2950c7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/method_resolution.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb652d02f364412dfca8c337edd2eb5dda69e82ee7bbb9c5c16b2d52e7f454dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/completions.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/completions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc3455cc257103c60108f7876027a85daf8a8b2ac9e763c9801e150b95fc930"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dep_graph/serialized.rs: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/dep_graph/serialized.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f592e02dc331c92032377561b1e9d2cc7443f6b0bb07f800240deb52099bc368"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/overflow.rs: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/src/overflow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6023dea744968afff76657d247262aa1cbf33ad5da29451513322708f57ddc1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lifetimes.rs: FileTooLong \u2014 572 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/lifetimes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1285f68f3e9475ffe139f36c26e42d338e3407ac0fb8d8581de5b7b5b35e7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/process.rs: FileTooLong \u2014 571 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/process.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2999ee7dc8a480484b35c753e901c5a8054b88b1150e52f8f04054e5aee8bb80"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/sse41.rs: FileTooLong \u2014 571 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/sse41.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d248d44e82573151de1dbeb965e3ddde40b25691b451fdf216cc28d81ef3bc14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c37e6cbdae3df2d9430ed0d49727a9a40795485e3443f19e9c7d91de1075858"}},{"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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/visitors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb98fb42c4db7fc046b8e2f2a9aa1886d7b95fb514c21e38f5cf9f48f6baf562"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rustfmt/check_diff/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48882451f87a27d5d5111d43b2c731e08d52d239f3bf7f0db36b86edb3440f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/usefulness.rs: FileTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/usefulness.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0569ea80b90cd4ca238ce7e9e6b938ed4113e96c50b7fe080f7974d0acc37dbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: process/windows.rs: FileTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/process/windows.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a409024944f2b053a2557e556650cc8521c87d492029fe98b78f32a6d1416f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/pattern_matching.rs: FileTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower/pattern_matching.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f369ad482f068e6ce17d4ea184ad233b194d054384ab1cf6e1db3bd1886d55"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: attr/mod.rs: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/attr/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c9ec96d6d3816b214b6af13b7f551493ab9ca3dca1c3c36996f010cb869d19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mbe/transcribe.rs: FileTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/mbe/transcribe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4702586b48b4161c36f8c282f6032a227fd1c06be66f5a035580523b9baccc9d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Cursor: TooManyMethods \u2014 34 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lexer/src/lib.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d77409db22ae2a3b8dd1f30b35e1443b4b3f601be691074d827b69743aa118"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Binder: TooManyMethods \u2014 34 methods, declared across 3 files: src/binder.rs (13), src/ty_kind.rs (12), src/predicate.rs (9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/binder.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a307f6e8bca407e7549422b7897fb0f50902928aced5d4b59f9d9b5a30f7d7d8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::ptr: TooManyFunctions \u2014 34 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/ptr/mod.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"a837ed9e86a2554dca56b8f935199d005201c55b270bbf935e1a501586ba8be8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::loongarch64::lsx::portable: TooManyFunctions \u2014 34 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/loongarch64/lsx/portable.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5207fd7c5992dd6e2209674adf5d784f1d072a61492c29d27cfdc6c59519d42c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/registry.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_thread_pool/src/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b070cc0ec582d60c1a9a4bbe793850821b764fd23f2d63936705c472c43bd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interpret/operand.rs: FileTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/interpret/operand.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc04533ee4d5d690aecf716b1760bc7ed16788fc9079d15992691d0e460685e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/non_copy_const.rs: FileTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/non_copy_const.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3962d8cb1bf676894facd022afedefa8e63a9282242ec646636aa26b0dd91cd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/rename.rs: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/rename.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65d3db750e2271588cb52deaa6ebad2c131d32297e4fb082e263f8a78c3c47e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/tt/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8c52c2d03d995a1398e7281fd984ae8721a05c42cfe46e4bb7098b0e141db9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/path.rs: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29396e9ed797bd17fecef8c61d9b762eb223f56ebdb2321602a572c00a6db3f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stacked_borrows/mod.rs: FileTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/borrow_tracker/stacked_borrows/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"887d6060261d2c99b1d9ffa8212a9638d47597a5ca483bb5eb406cd6222d460d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/proc_macro_server.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/proc_macro_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad3b3e805223f1fc0222e403aaadc0858827067f3bee1e07fee6a34befa57f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: next_solver/generic_arg.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/next_solver/generic_arg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bf2e4d31747af0af806db6c90a894176a304a69b5ccf72f6011b133bcbce22"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate: TooManyFunctions \u2014 33 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_driver_impl/src/lib.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"439e3a410e2beeca0784d537ba0bbe640ee20aea1e24450730a5a1fc1fc70170"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DefCollector: TooManyMethods \u2014 33 methods, declared across 2 files: src/build_reduced_graph.rs (27), src/def_collector.rs (6)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_resolve/src/def_collector.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b75f616b76798eca5851473f5965ebfbb36a7a323d56493b1c2848b8045fb3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UdpSocket: TooManyMethods \u2014 33 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/motor.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cd3da5fd5661ec3fb386d852096529bad641ac71dfa67ecc0bdf6520646a14"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UdpSocket: TooManyMethods \u2014 33 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/mod.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ca70967d891874844ba9a278fca14dcb4393bcf74b41488aa063adc853128d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UdpSocket: TooManyMethods \u2014 33 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/wasip1.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dc6b7642d1f6285c261c8569607e238c6e70b6b1a653275cf7f4fb44860d7f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::passes::collect_intra_doc_links: TooManyFunctions \u2014 33 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/collect_intra_doc_links.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c939c066e64f8a4a8ef8ff077a208e29118387f0bee40683a7f9ecd8f4cec1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::intrinsics::x86: TooManyFunctions \u2014 33 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/intrinsics/x86/mod.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"26870cf4a131ad579735e3867278b0bf6a06f8ae845e28b517e099a7ae3ed97f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/profiling.rs: FileTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_data_structures/src/profiling.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7394cddbbae6933a883d3354e087780703665b4deb5407147b25e16aaf4f181"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: check_consts/check.rs: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_const_eval/src/check_consts/check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d93661dc355b9ede1cb5d3b909e87487dbfc4afcc2b1fb4e307e02ee07ee6a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: methods/needless_collect.rs: FileTooLong \u2014 548 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/needless_collect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8107d6b7d83594375cff4f7cb3e0a5e0456ddcfefc2f9017c436f2c0dbcaf010"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/rename.rs: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-db/src/rename.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed9fb86b102b730769415a13a502d9c0ea812b6d1263847e33690f722aae692"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: num/wrapping.rs: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/core/src/num/wrapping.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8bed99d25ecdd6304e77216fcab8ab9205524394b0a192b96458fda9df63be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: windows/fs.rs: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/windows/fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d7946eafea816e4402fd087d370d7e3d84070a8c5e8c3c1545daed8e74bdaa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: traits/ambiguity.rs: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/ambiguity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64064918e750e1436733b448200dee366ff4121decba72be17c963edf476d731"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/token_stream.rs: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/proc-macro-srv/src/token_stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb08c06bc3e470682eca85d4c0c5f00716e2174350f6492a113f624638c6503"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hir.rs: FileTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/hir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58c2daf7ccdef1e57b3fcfad321e32c012d95a3ae3a4b3d7e00c092653bcd46"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/nameres.rs: FileTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91110050e2cb49d999e79a4d85cedb1b146f8c07710c1e226ec422ada43d645"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/highlight_related.rs: FileTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/highlight_related.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11586a2245bd40df5b86db8f33b925fe2dfcd3649df02e45708591b60591f087"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hover.rs: FileTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/hover.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e892bbadf30291244dfeffcda2ad9566c0a3712d2cbb96415f9657b670711d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lint/html_tags.rs: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/librustdoc/passes/lint/html_tags.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06d31f981609454faac5f7dbdfd9fa670c2f31a7b51049ac8684824c0e7f63e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ty/instance.rs: FileTooLong \u2014 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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/instance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b7f38daf56e6064cc61159c2021fda3afe3332768d48f83fa7f59bbb572d9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: genmc/mod.rs: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/concurrency/genmc/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb27aca51697c15c226a53daba0803196c8f238a62b4bacdf2fae2c4f0de7d70"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/render.rs: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-completion/src/render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe43a2407c27e515f1e5b5bb963d9e500031ce2f65c929dcfed1a2165d50736"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expressions/atom.rs: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/parser/src/grammar/expressions/atom.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a24831eb5699f64ae0dada120748cb7d878c87c15b0dfa36d1478f918a1a014"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UdpSocket: TooManyMethods \u2014 32 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/xous/udp.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"22725237834127c2b54d1b2a6be272ec676b5ab45182b2b6960edb3cf70e828a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::x86::fma: TooManyFunctions \u2014 32 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/fma.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ba84ddd692d5f7094b5ee9cb25126a16e4525b66bb596261623a3341ff3587"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: attributes/doc.rs: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/doc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a678033ea86e8fa9e5688ad85e9af9ad03a808b5f52c8b59c3ecd1289ba5e60c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: x86/avx512vnni.rs: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512vnni.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edbae5b00437c893fc3552c9346bd1a23177623d714973665d61af97b661c5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: traits/dyn_compatibility.rs: FileTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/dyn_compatibility.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c5ad3f8466204f61e0b5c9aabfde793aa1febb9ad6e690116da89ee0607f83"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cargo_workspace.rs: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/project-model/src/cargo_workspace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c5bc3cb17e6e750ef44b1cdba04f22f30d79a82e01b69f9296923683905c8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast_id.rs: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/span/src/ast_id.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"188464a6665307e63ab04f76f2f90a8275c1fd7b09532eef4599e816ba56b344"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handlers/extract_module.rs: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/extract_module.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78074a9852f066b4939bdc63651f35e42f6dfd0baa7bc8a836b07a0c2a576912"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/signature_help.rs: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/signature_help.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa75f574f83dca16c390cc896174150ab0891456f35ab69c8185fd5259e1f40f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_metadata/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf8e9761d673060fc7f698a6b6598a6a68120e43157ac545010a86595da31c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/gpu_offload.rs: FileTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/builder/gpu_offload.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6124258a4818d2498076fcc388f80f9f1e067f99dc3cac9a2f9eb63a130d2c9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: traits/coherence.rs: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/traits/coherence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e565b892a98ec90b143f9736460d7ac7fab1d6285a0c91dcc01d72a43de3573"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: build_steps/check.rs: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/build_steps/check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3170cea4d530b3f4733df96013abd7b36750e6982d8b7971b115c96cacdc3b2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lang_item.rs: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/lang_item.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"269ffef946f5d22efd71ad5d15f20348763e5cefc04b6c3a41df9e2f52ef592e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context.rs: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8b055dea71bdb7c6ca5330ba7b8c177847e23b946908da44a0970737e7abb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/internal.rs: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_lint/src/internal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9ce439f12ea25f76ee16ad1836f2d26499b04bd5796d681dcf741c62fdfb72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/input_stats.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/input_stats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5335fc6e90516f3f3f1711de00918980ba208f179c16db54fca1d4d53e66f087"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/compiler_interface.rs: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_public/src/compiler_interface.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26fd5c5c7c7e535283550dcd80aa8ad6d7d4a55af642d3a225392c88a796ea9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lexical_region_resolve/mod.rs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/lexical_region_resolve/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42d8ce55287d9e893d5dbca6e030ca442e11794ca7bf46cef844b445bbfab6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tokenstream.rs: FileTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_ast/src/tokenstream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed1918014eebc8397aa8d007c50d877c9453130c2a5e1b4b368e1c9054e78c3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::check::check: TooManyFunctions \u2014 31 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir_analysis/src/check/check.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03234140690a0667dc118637f58b16292f5c02a081cff1f1ab6c28ea76ba75f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Body: TooManyMethods \u2014 31 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/mod.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02e98ddca4f61151de0ec996a5a0457b65cb80f0c8c65dfae0aaa9f346fe33a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Const: TooManyMethods \u2014 31 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/consts.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9787612c68404cecd5bb19f20486f99c1f273195f0c77a1a8e0bc1739a52a830"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lexer: TooManyMethods \u2014 31 methods, declared across 2 files: lexer/mod.rs (24), lexer/tokentrees.rs (7)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/lexer/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"e517c5ba6edd59a35a16fb40d0c0e43d5139f7ca6e2c6254bb2324c931399486"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UdpSocket: TooManyMethods \u2014 31 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/net/udp.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d03a71feb9008c86246eb61023da7a5fe24fb01a360cdddbe8504f1d71d9f88"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UdpSocket: TooManyMethods \u2014 31 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/sgx.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5abd2434036a1179bc522a019a5da98222a5907a78bb6ac2c55b5619700023"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UdpSocket: TooManyMethods \u2014 31 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/uefi/mod.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d6b3a041c158c00c462304a6f43622fdf55d7b76875cea5e5b8c88853674ea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UdpSocket: TooManyMethods \u2014 31 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/unsupported.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfae4b200f5c3a1c26bb042d87a8ad782a8e4a5ef677157031b7378e892892d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::aarch64::neon: TooManyFunctions \u2014 31 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/aarch64/neon/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dad22e1838ad01eabefb15a41513336ca775f9ed6b96151c751e25cc57d34d0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HirEqInterExpr: TooManyMethods \u2014 31 methods."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/hir_utils.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc6b14a37f54216e3001166a338dae2247d7771a729dcdc7295bccdd203b853"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::source: TooManyFunctions \u2014 31 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_utils/src/source.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c88a09892b48b8f8601e7ef964f09aa5df3486cb28fcbfdf74070b4a32b58d8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: crate::handlers::generate_function: TooManyFunctions \u2014 31 free functions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_function.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd92aef4544c22525d418451258739f33b27d2d5451807c17b0444ecea27f203"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fs/uefi.rs: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/fs/uefi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc3429ac06484300250ae2a8fcae1593cc198941c1170b35ce614f3d8c76d99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/utils.rs: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_macros/src/diagnostics/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a979c738b6d3a096a694c0520b4b64f6e87d5af5052b6036e7132e4ad6c6e9cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/constructor.rs: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_pattern_analysis/src/constructor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa77957a85dc48f59228287f58fd3a0019a7c35659f2a15a9b581c97d539c43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shims/foreign_items.rs: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/foreign_items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"937da237df700fcaed45ad59ba7e4547d9ec35d90cf34dccffcb4d5de22ebfa2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/matching.rs: FileTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-ssr/src/matching.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ef4a2a7c33cf5c72b37490e685ab854fdcd9c86f99d63499079ebf33bc4917"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/universal_regions.rs: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_borrowck/src/universal_regions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd61723028c6d099411f462168b675831e86490e0010f765e8056374ce58770"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: back/symbol_export.rs: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/back/symbol_export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6181a4f95bec44a8acf9403fd49a987679121f281ade3362ddddaff839b50d50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: methods/unnecessary_to_owned.rs: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/clippy/clippy_lints/src/methods/unnecessary_to_owned.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"115c12baddc140b119ec2d470af69b466b375f13763f8052b3e1846101ece987"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/token_type.rs: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_parse/src/parser/token_type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec76cf3960a9378a573cf4688de025f3e34995061f0419be63d87689de7c937"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: debuginfo/type_names.rs: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_ssa/src/debuginfo/type_names.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbb9ca75b3adfaa4734d5f1bbfde7ae39d3be3ebe47687171db462999649a02"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ty/structural_impls.rs: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/ty/structural_impls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fe18a57f530703da4405b215230d1bf0ef6b611c0a52333b25aa471dd40273"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/terminator.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_middle/src/mir/terminator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cfbf2d1eda9b88339d23d9c44d68fc7411af3fa5fe06bb7c1676da82d23fab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics/decl_check.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/diagnostics/decl_check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"797004be549c83eba359f9ecbc4591dcb96cdb73a9516d59a0648e3204926368"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mir/borrowck.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/borrowck.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c52558fa08e5dd224bd8a6f5ca2399417b69b5828edc5b48d3be415c6459e0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runnables.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)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/runnables.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42887bed67e33fa8c0f7f91a27c3f0cebb6b47c888584f102690457a9a66fc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_expand/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1b3d4a6f7f3b2f4d46bb5acc2ec97140a2d5ca3a5061288b5e3f81808935a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: solve/mod.rs: FileTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_type_ir/src/solve/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4db68b2bc1ca9f08978befe44c535e819004262942c7e93450f2c6b0904fdb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handlers/generate_delegate_trait.rs: FileTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_trait.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46a5aeda2d7bf0df925d3abf21e5c1308fe6e03a4eed1585bcaf12ad16423ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: nameres/path_resolution.rs: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/nameres/path_resolution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10a626648eb8e32a08a1444a80133295a4ef562d54db3ca9f89fb9a94a9884f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/load-cargo/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"904e3fa993376b81005406db2c984630e66cfa031794558757d4c678adada6b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/def.rs: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir/src/def.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9ed2db2bcb60425a0519022d10013aac4d9d967a04d415480d8063b2f9d2ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: socket/mod.rs: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/std/src/sys/net/connection/socket/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"004226bd979148ce63b67ade9b70f15de10cb2dba7f37a6f4260865cbc2f28da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/priroda/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d800365b298c4df506c5a7ca99067dd046ec427f99a051e647f4484c7a60bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: semantics/source_to_def.rs: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir/src/semantics/source_to_def.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7714ab31e9bc366e879d14e77fbcddebf878acfc785555da355db3779c2dc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/flags.rs: FileTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/flags.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3d2f13c578beddd344d045306105104b5706d74bccb339761d7c40beb855f9"}},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cab3be82b631ec574cce02d7a07198a72ab18605dfcfb7e28d07dc868c03bcb5"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_passes/src/check_attr.rs: compiler/rustc_passes/src/check_attr.rs changed 45 times in last 90 days, max complexity 193."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_passes/src/check_attr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55efea32721272c1be2847bcbc5462656eacae6a7a9f9eabe09a18292d5dd9d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_codegen_llvm/src/intrinsic.rs: compiler/rustc_codegen_llvm/src/intrinsic.rs changed 29 times in last 90 days, max complexity 129. 4 of those changes were fix/bug commits \u2014 a defect-dense hotspot worth prioritising."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_codegen_llvm/src/intrinsic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15872cf4f0cddce670b2cbf9ce6664157472790d4c0befaeec3363c700bdc782"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs: src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs changed 40 times in last 90 days, max complexity 86. 7 of those changes were fix/bug commits \u2014 a defect-dense hotspot worth prioritising."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-def/src/expr_store/lower.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fe12124fee1f43ec623d2366fa753d558571be2fbce06b34d92e02e7f79bc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: clippy_lints/src/methods/mod.rs: clippy_lints/src/methods/mod.rs changed 18 times in last 90 days, max complexity 188."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clippy_lints/src/methods/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2831c6fb77718a6c1a1dacac51cbbfb2337a81f733be317ff07f025ce77185"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_hir/src/attrs/encode_cross_crate.rs: compiler/rustc_hir/src/attrs/encode_cross_crate.rs changed 17 times in last 90 days, max complexity 193."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_hir/src/attrs/encode_cross_crate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5f17c1023ed39be32c69a4299e4500b8711bda15ec52830ab3ea609632dc5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/miri/src/shims/unix/foreign_items.rs: src/tools/miri/src/shims/unix/foreign_items.rs changed 21 times in last 90 days, max complexity 156."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/miri/src/shims/unix/foreign_items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4b64bcb1491309571731483f6e6ef0fada3b25a5deb657274d1030838e2437"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs: src/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs changed 29 times in last 90 days, max complexity 97."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9bcfa29c8af2caa8d145f2455dd741c76c8944a666edcd4768d58b7ea2bd23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bootstrap/src/core/config/config.rs: src/bootstrap/src/core/config/config.rs changed 21 times in last 90 days, max complexity 120. 4 of those changes were fix/bug commits \u2014 a defect-dense hotspot worth prioritising."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bootstrap/src/core/config/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5935717cb7a2e80cabf367acf3b28d79ccfa0106dda0ac9cc4e73688a269013f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs: src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs changed 23 times in last 90 days, max complexity 108. 2 of those changes were fix/bug commits \u2014 a defect-dense hotspot worth prioritising."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/hir-ty/src/mir/lower.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cede506109a91518e9f4e92082da7947108aef23860010a86317dbbbd63826"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs: compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs changed 28 times in last 90 days, max complexity 87. 4 of those changes were fix/bug commits \u2014 a defect-dense hotspot worth prioritising."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_trait_selection/src/error_reporting/traits/fulfillment_errors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49be6814feed38fc873ab0b633a9a34b6138bcabe96e9c81d6c2381b3564e41"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 43 significant file(s) lose their only recent owner: library/compiler-builtins/libm/src/math/support/hex_float.rs, library/compiler-builtins/crates/api-list-common/src/lib.rs, library/compiler-builtins/libm-test/src/generate/case_list.rs, library/compiler-builtins/compiler-builtins/src/float/div.rs, library/compiler-builtins/libm/src/math/support/float_traits.rs, library/compiler-builtins/libm/src/math/rem_pio2_large.rs, library/compiler-builtins/crates/libm-macros/src/lib.rs, library/compiler-builtins/compiler-builtins/src/macros.rs (\u002B35 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cb6edc4c9a44cc025a11685e91d47939b0575f6fcf2e2a2044699acdbe07c629"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 22 significant file(s) lose their only recent owner: compiler/rustc_pattern_analysis/src/constructor.rs, src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/canonicalizer.rs, src/tools/rust-analyzer/crates/hir-ty/src/next_solver/consts/valtree.rs, src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/region_constraints/mod.rs, src/tools/rust-analyzer/crates/parser/src/grammar/expressions.rs, src/tools/rust-analyzer/crates/hir-ty/src/next_solver/infer/canonical/instantiate.rs, src/tools/rust-analyzer/crates/hir-ty/src/infer/fallback.rs, src/tools/rust-analyzer/crates/hir-def/src/macro_expansion_tests/builtin_derive_macro.rs (\u002B14 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aead3902b208bb815a0f86fdd13e9e48ff9c391ba4150594f9d2b3c8f8b4efd9"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 20 significant file(s) lose their only recent owner: src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_delegate_trait.rs, src/tools/rust-analyzer/crates/ide-assists/src/handlers/convert_bool_to_enum.rs, src/tools/rust-analyzer/crates/syntax/src/syntax_editor.rs, src/tools/rust-analyzer/crates/proc-macro-srv-cli/src/main_loop.rs, src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_new.rs, src/tools/rust-analyzer/crates/ide-assists/src/handlers/generate_impl.rs, src/tools/rust-analyzer/crates/syntax/src/syntax_editor/edit_algo.rs, src/tools/rust-analyzer/crates/ide-assists/src/handlers/raw_string.rs (\u002B12 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0ee75fec365a1480aa68263af6723668f5792ac599c8e907ae16705a7830718d"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #4: If anonymized user #4 becomes unavailable, 18 significant file(s) lose their only recent owner: src/tools/clippy/clippy_lints/src/lib.rs, compiler/rustc_ast/src/tokenstream.rs, compiler/rustc_ast_pretty/src/pp.rs, compiler/rustc_parse/src/parser/attr_wrapper.rs, compiler/rustc_span/src/span_encoding.rs, compiler/rustc_mir_dataflow/src/framework/mod.rs, compiler/rustc_mir_dataflow/src/move_paths/mod.rs, compiler/rustc_mir_dataflow/src/framework/direction.rs (\u002B10 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5ff223b2b5372a585252b5b28e948aa82b1ee3d074c25a9f8ffeaad473434396"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #5: If anonymized user #5 becomes unavailable, 11 significant file(s) lose their only recent owner: compiler/rustc_middle/src/mir/interpret/allocation.rs, src/tools/miri/miri-script/src/commands.rs, compiler/rustc_codegen_cranelift/src/num.rs, src/tools/miri/src/shims/unix/linux_like/sync.rs, src/tools/miri/miri-script/src/util.rs, src/tools/miri/src/intrinsics/mod.rs, src/tools/miri/src/shims/windows/env.rs, src/tools/miri/cargo-miri/src/util.rs (\u002B3 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9c2a0eb6e5f0ab50ca300a1458fbba84666c3a6e685563410fd9ba9e259917a1"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #6: If anonymized user #6 becomes unavailable, 10 significant file(s) lose their only recent owner: src/tools/rust-analyzer/crates/ide/src/inlay_hints/param_name.rs, src/tools/rust-analyzer/crates/ide-assists/src/handlers/merge_match_arms.rs, src/tools/rust-analyzer/crates/ide-assists/src/lib.rs, src/tools/rust-analyzer/crates/ide-assists/src/handlers/replace_method_eager_lazy.rs, src/tools/rust-analyzer/crates/hir-def/src/macro_expansion_tests/builtin_fn_macro.rs, src/tools/rust-analyzer/crates/ide-assists/src/handlers/toggle_macro_delimiter.rs, src/tools/rust-analyzer/crates/ide-completion/src/completions/fn_param.rs, src/tools/rust-analyzer/xtask/src/codegen.rs (\u002B2 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bc5992551a617bb3d9acc472e24ddeb196d715c798792114e91b6b0ba081cfd8"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #7: If anonymized user #7 becomes unavailable, 9 significant file(s) lose their only recent owner: src/tools/rust-analyzer/crates/ide-db/src/defs.rs, src/tools/rust-analyzer/crates/ide-db/src/symbol_index.rs, src/tools/rust-analyzer/crates/ide/src/doc_links.rs, src/tools/rust-analyzer/editors/code/src/ctx.ts, src/tools/rust-analyzer/crates/test-utils/src/lib.rs, src/tools/rust-analyzer/crates/ide-diagnostics/src/handlers/unlinked_file.rs, src/tools/rust-analyzer/editors/code/src/bootstrap.ts, src/tools/rust-analyzer/crates/ide/src/inlay_hints/closure_captures.rs (\u002B1 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"41cf2518341b2ca815bb0932c6b1221bf4ea8ce1fb549b6f1dc7e1e5d3447343"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #8: If anonymized user #8 becomes unavailable, 8 significant file(s) lose their only recent owner: src/tools/linkchecker/main.rs, library/alloc/src/io/impls.rs, library/core/src/io/util.rs, library/core/src/io/cursor.rs, library/core/src/io/error/repr_bitpacked.rs, library/core/src/io/io_slice.rs, library/alloc/src/io/error.rs, library/core/src/io/impls.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a27ad95691e237aff88b2e403b032d913583ad285a1f1e8f6ba54f63cd81e06a"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #9: If anonymized user #9 becomes unavailable, 8 significant file(s) lose their only recent owner: src/tools/opt-dist/src/main.rs, src/bootstrap/src/utils/tarball.rs, src/bootstrap/src/utils/tracing.rs, src/ci/citool/src/jobs.rs, src/ci/citool/src/main.rs, library/alloc/src/collections/vec_deque/into_iter.rs, src/bootstrap/src/utils/step_graph.rs, library/alloc/src/collections/vec_deque/extract_if.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dcf7bfc89bf7ee859925877bf3136a3380849ced460db97ba50bf9a06bb2e112"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #10: If anonymized user #10 becomes unavailable, 7 significant file(s) lose their only recent owner: compiler/rustc_mir_build/src/builder/matches/match_pair.rs, compiler/rustc_mir_build/src/builder/matches/buckets.rs, src/tools/compiletest/src/directives/handlers.rs, compiler/rustc_mir_transform/src/coverage/spans.rs, compiler/rustc_mir_transform/src/coverage/expansion.rs, compiler/rustc_mir_build/src/builder/matches/user_ty.rs, src/tools/compiletest/src/runtest/mir_opt.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a3cdd0ad1b6b53bf2088092c1766d00d3480a627e125e0ac211d781626924c64"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #11: If anonymized user #11 becomes unavailable, 6 significant file(s) lose their only recent owner: library/stdarch/crates/stdarch-gen-arm/src/typekinds.rs, library/stdarch/crates/intrinsic-test/src/arm/mod.rs, library/stdarch/crates/intrinsic-test/src/common/values.rs, library/stdarch/crates/stdarch-gen-arm/src/context.rs, library/stdarch/crates/assert-instr-macro/src/lib.rs, library/stdarch/crates/stdarch-test/src/disassembly.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c40239c95479fc11587c11393ed98982df9029daa7fc4e780cfb4681117f00d4"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #12: If anonymized user #12 becomes unavailable, 6 significant file(s) lose their only recent owner: src/librustdoc/html/span_map.rs, src/librustdoc/passes/stripper.rs, compiler/rustc_builtin_macros/src/concat_bytes.rs, compiler/rustc_mir_transform/src/ffi_unwind_calls.rs, compiler/rustc_metadata/src/fs.rs, compiler/rustc_monomorphize/src/diagnostics.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4e718b543b0f824206f10a8426115bded7614800e49841040e0014b4c176b542"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #13: If anonymized user #13 becomes unavailable, 5 significant file(s) lose their only recent owner: library/stdarch/crates/core_arch/src/wasm32/simd128.rs, src/tools/run-make-support/src/external_deps/llvm.rs, library/core/src/ffi/primitives.rs, library/stdarch/crates/core_arch/src/aarch64/mte.rs, compiler/rustc_target/src/asm/s390x.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ad953e9dd66d9c1c473ba1f95684228408868e37c2edc078c0af2cbaeff9875"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #14: If anonymized user #14 becomes unavailable, 4 significant file(s) lose their only recent owner: library/stdarch/crates/core_arch/src/x86/avx512vnni.rs, library/stdarch/crates/core_arch/src/x86/avx512vp2intersect.rs, library/stdarch/crates/stdarch-gen-arm/src/fn_suffix.rs, library/stdarch/crates/stdarch-gen-arm/src/big_endian.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"156623e5e91684ff5e0142e56b90ee5be1cf8f7ce498c28dfdbadcb9b4ebb03c"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #15: If anonymized user #15 becomes unavailable, 4 significant file(s) lose their only recent owner: src/etc/lldb_batchmode/common.py, src/etc/lldb_lookup.py, src/etc/lldb_batchmode/from_lldb.py, src/etc/lldb_batchmode/runner.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"def35a1a9d5bb8ebc0f39cfca126942fea856b894481f1d43b44ad242e10f486"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #16: If anonymized user #16 becomes unavailable, 3 significant file(s) lose their only recent owner: library/stdarch/crates/core_arch/src/loongarch64/lasx/portable.rs, library/stdarch/crates/core_arch/src/loongarch64/lsx/portable.rs, compiler/rustc_target/src/asm/loongarch.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"95631f6206f78bf9bae3705232d0d511b80bd184ff3267fc09286b8a5b96d5a8"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #17: If anonymized user #17 becomes unavailable, 3 significant file(s) lose their only recent owner: compiler/rustc_macros/src/diagnostics/utils.rs, compiler/rustc_macros/src/diagnostics/subdiagnostic.rs, compiler/rustc_hir_typeck/src/typeck_root_ctxt.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f5991db5816ee100ad078d6abb5fdcf1901fe50a1a20d179da35ee169769a722"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 82 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 (289 single-owned of 2497 analysed files in total)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D19","level":"note","message":{"text":"The Why Rust section lists Cargo/rustfmt/Clippy/rust-analyzer but does not mention the rustdoc-gui tests that exercise generated HTML output.: Add a brief sentence noting the presence of rustdoc-gui tests and how they ensure unsound GUI changes are caught."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddfd159f3ebe9f7989934ca6740b9573c3db3c697eb70b5a76ced91850a5011"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a2d0000499f45ecd8d102299f4b9b7c3ff0a200e0e1130044ed01b4799178aa4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb87c9cfc0ca6c2859b0f220e8fff2b148794ae559799d40c903484f44791641"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c54f15b65231136c5db3113a99dce2d9e6a57bc4f4f8ea247475692431bce2d0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53a58118bf9dcc673d893c7dfe366de1a66be17c0131bd1c34b6f7bde0c4be53"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"008053d3c077124c74331cb5f8d0e30462d727233eb1cbc2a7dc8b3a9ace62c2"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7735c98496cbd68c4307dde9b9665ca8106cb3502c8c3e1dfcb0484b580a2b6d"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b3425ecf38e75003e7abafd316cfe11d05e8d90b851760fee575f4b38d2503e"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44eff905af99d1a54632f1e88739e561c342822a09d6963a4c6300fcbb2aad0d"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a0a85263ec3ab2bf89123a773999cff731f55ee292ecfc8035434fb3ec089ff"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f7769a36fc6086c817955854a4a59c15d96b8efc5c40d359a4b688e01b0500f"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28847bfb68128ad6c95eb6a19a3df3a0787d1bdadcf090baba24802b8a233364"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a7c60d84ec124dea0266da2cf23510056e10aadd6ac2dae11dd81d8528da72e"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71d1bf6b46ad62dd40fdcb528b92e4b7a2d896acb7716390b0a4839d785f5df8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ed9259971ad60afcbb6e0e0eadce8019f4400566c5522261cccbb67158a5be8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f21d78486826f194e9d1023c91e77f59aeec404526eb5af42814bafec3409aa1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed4a0187472393076e6148e5033eab9f931a0b441ac1dfb7ef50ae4d7dc0387c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2c07d08f37c977cdb9ce50bc8ea19c0af1ee77a2d2daceb604487a32e6dcd66"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c273e553ccf781c9408511e95bcf120ee6e9a328558107948ed888d5ab4ef278"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6a4ce6912b486b7be7c2dbfce8fd3ecdd4a5306e109fc1bbcacf8f54efcdafa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1dc7ef7bde32dcb3bb75c724335c88ed91bcdb52c0f453f39484732eb8cc096"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1add2f67ee0d90cffb0c2e9a30a278fb3fd549189349fea4e442d637fe2e8742"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"460389a1489bffa98fe4d8c5e36d776fd21d1753dce51ed83d031886425fc72b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fca1da9bd4c42ab6fbe24f9f0cc13d8b016a391e1ff87be1cb23deaf6e197ee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04c4fc54512f5b80916daf8a44fbba6d5606b19dcf950ffb8e1651d0679b0365"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"11580004a84210d3cb3c4ccb0d6f95c9174bd34950b68551ba50b0f3de36e83d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffb05e279e7bcaa8839f3ce77a061e59b10f1f612858d031f53624ac8eb5652b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f09fe756c60ecefda86b60890c5b63d91e6e88dbf61b801a0a646bc54d7880b0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ea76ad5f12642b9a58a905d3892c47b79d365cd5068caa317ff4bdc877c1515"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3bde49ce0016c07d414c000eda2edbc8d8f0e1f451e467ebb2ec65ac89b0867d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1afbbe0e5d1cfa2d03c6c7a61474cca13e1b1065eec39e66e09e188b93e65b78"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18c50079d201039451e2b2416314edac5a574aba94e87fb9473852685c584351"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4d0c26d42e7ac1369d8638888d25cb6bb136d41ba7d45a9489a64828e3b806e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f352476f431628edf80dc1bf489f5aef4ec6917a76e6c9296752cbef063652bc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f3d93b33bd7735036ba8bf11ab4dec86278d404131cb9e82b8770073c9df218"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e025fb6f903db9427c5cc7f78991eacf8de872d42f80383786596bbee4b4598"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"547edee06be691ecdd6f75c8365d9672f0c4e11e49f884871ae54e1cc8bf7265"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20e8803598f57f30adfa8f48f67a4bf61ce29ef4f57cf5b6f8c90d4ccd99bc60"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3ad2cf9d35e9a81449a816e6f057296f25f8d53bfee071228623f6309a268eb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b16c133688560c7951d8ac3e5df29263822247f7a60ea254e25225e620dc5624"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4c253275306a9e1e1a6baf83267fdf9720e54eb976bc9530b706b254b3c66b91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20e00331b85817ea90b5052d4ffeb0a697b83051d1da531e6a35acb8ab40c248"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8269630b026ffdd72e6df4d57bf944dd2358453d2ff52af90ea930ab92c5c9f0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"230b431d6e6393aa511da4faac9d838405ebfffd79ac911d591a865291441c9d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43274ba911eb77800e1be9af9a956fedbac061b2532f5bda295c1f2d28e0e03a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbc815105b20d6edfd0e4e97d7e6ced1ee80f84bd4750988fbce260ef94c0555"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6641ab01240d1fa615f486ac0382fb9b916d3c9022b2e84b3307eb02ad5ed730"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2fa62edfa155dd891ca85215bdd70fe22203cb73e37b3f7eff938d8fd567f2dc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"074e02db9831826982399b93d23ec60b7408caf828e160c9f9c687fe5729bf0c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c20a30dcd7710864a3c6a8b64ab3ff7b7b872ad45b57554ed40a4bbf42d79851"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1aa337d1c55e522770753baddb00f530bb6954151b9264b779be347d1dc44ef4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6471b9e4634e5870743455b37f215b940a463597a5e489e9679ecd43c3157c4c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"38953542303f898e5fb4608730af7ecf92822c2b4c41f702237cee7d836036a7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6dda17cbce30420110ccc6694f3c6b4b771fa88fb9ae6771aebc66c200294ef"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b276cdc087c021a7aa9055c1ab360b61b742447c665bc9b7ad10917cee858de"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d3c989268032034e9369a5971abdeafe3f0861eefeda25b0cc9e4eaf144f77aa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f84966dc7f57a601b2c7f88a064afa5633ca0d2ab16b3b1a92bc2f1fd12c9f1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd48aaa712c91f53e740f75b87fc1f6be95bc5b27fe76a2f6f5b8709b4104e7c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c156d60623a71be29ab1e2d93277f75cc21005416a1b4491a080959d0c2d2db"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"baefe1d3dcbef01dc847b6c5e0f5b858d85a8640c6cea38f42d2162da68ea611"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db15cb6583a5b339bf08f7653a75d310b1d5adf1289185823ee9d0f3931d15a8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55197dc39d22778f94cb13c8244b6a2c9647d10a74ca4d1e55fc4fd78c4a4264"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"116b40a66b30af651aca7db0224201bc0b8ccc47a3326da5aa9ec2b98384ed25"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b54819f2b3235e3019a17c5c5feba5663f6d25c50c4a2533a3b1c46526eaa00a"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da5c42a81aa3c4f7d98c56592a442dfde3f86bc6e4a716417cab97f3f87616b5"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9b21686ae7482f64294b8e27acd8996f89492826532db4e841bcb030b60c58f"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4d36a21266705bb0b4b42088751c43478ab85800d519ed036f38a1f616bf6d1"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf2478d26ac905550db787166799100f6d4f93d70694f67b493eb9fba6f02b59"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c51aa89e0dbabcc1777c0633ebe99b278aaaf6afa90893a9b9f42ce3eef52f5"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"156f0f5e110dbfc037340d549078e34f00f513ee4f132352c5fab3cab29d2dd2"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de04e5b6ab5e4b386eb1abd311fb9b15b0e1da8fded0a00947591d55c3744177"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4736e8c3c32b8f6fc3f4ac41a38b9796f8fe76f3f3067c4868abe2df38968fa"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c1c1543417964e37ea1d92c9583c404a2ca019fc6dd0b9e7f193cd4e1bebf95"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1875aed92cc485709cf06db775e3dcf1114c5c8fee8096a833942d6825fcb837"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5542f158d4cc2aa91532812472734e986d1c87e66728accc75f4a382d56ab291"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0ebe9ffaa414fdc9761cdd6e308043b2423af8ce894bcfc0da72d6ef270426b"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3bfe8fca33bfadb2bdc30be4f8e4ea37cd5e9b0a9a701ca99786f04a52fce1b"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa1feed675d87bb700ad118aa8a1465728bfc8a2b0ad344c834e339b7e3e8d1c"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0fd56aab0972d31bcaa2b88cd488fb462bfb8f7f711327485bd51513363ed573"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3315713f31a0c746c0253dfb5a5d92f54cf554f7d19acf5f9ced39d1600f704"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a95eeac0b301181bce374bec487a2f0bff157112f7f95417b5a2188fcc5dc35d"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81cb2895d0e1db89bec6629326bf70425b483946a475415eb30a1a0637ed0d06"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"464b579ccad890a2f6082a18fbf0ba920e5df58053825ff19b5fc7e4571c0b6c"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"430f5825134915cd2964480bbf2194662398ea15faf7a9dadd54004bb293001e"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a490010adf54cd4f4b4f9a7b7cd833ded396fe49e7587def5e0bfa47fae66aa7"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8a0914d687d5dc9ff940924c2e149ff578e90a44ec6a518b90702362c9ef561"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1badff7ee114d06916dcf283ad5fe23bfc98228328b4310fac203eaba0cd94cd"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fd63ec67153177b1600a7ffa3f02e1da8ae4d9c22b1751acfc12e21d081d1db"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"12e67405218f68b8d11acd18c9eb39b8ae69b3993bd9656e5ff0e15e3ef696e0"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"701e4676a12cb8dffa2f13b4d883e3f83773dff49fcd8b822e9807526f1daff7"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"910b1257eb6b64ba2eb475d87bc1b9fc55ab8e430d4933589da437360c8385ba"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dad63ed801d93ab12b6cc2612533990ec3b88bb9ca680cfbe1bb571973d2ab08"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a95ff42493cfe2e7a0f00292ac0991ab088d00db832285cf24f2e8449a123efd"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1652307a5fede366cca5f0f31f10896fcf8b26a4c01574312e14b2e22a697722"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbdb6a1bb5e5cbacfb640cd64e9285858cd3d58d9b457d36cd08da480a8eac60"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e085f3a85c375d73714b9197285dae533c9e10e9a05fba6729b74659bb63e44"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06d8af91d71bc56057bbe0c35faf2b010c9d1bb1987de1a43492c0ecd4d10d47"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1068b0284abb9c47bef2e1940e487b89108a2069bee35147ae83225bcbc78d73"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c991d8698365c5c8b63f5a13fbaa223b1988674556b6e5928cd9f9b704ba70a3"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70ae2ec4533dbdb51adec90a2445251209a37a38812f8b64a63e4fbfdc796463"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e05682012c9711d0417c3dfa18a9a05ff32bdcd10824b4678e4179c0ba693997"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26e57adc84a89512c377ccf1507dbc830f0e3929467b0f9aa82d0ad8fcd9ef54"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a7242582ba4808b261d001ed3df1cbf417555e0e0bde806874c70357c042217e"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"584c10252e9368e0824d684af6820c41a3c1853bd99486bff6a94fe00c40d639"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5a64b81a437c3e4257b4403d8b3c860604bb65cc1a486ae23eda62d17cb1bba6"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8dc78885ae7b1f80b87714250ea763c8bde53e6d41867046b9fa7a475949e753"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4ba1412356e2802f3fc56c0c4fe8bacffdf4862222128af2b92eb94392bf5b0c"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5972e6aa298aa8e1ee0a46042bdb7f4ddc965cc6670ffb0f5be3e28a2a864b95"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"092db7595311be27f6e8c59c4f8a73241244410896ca705a16ec1e8176d79894"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8f3baeca4bf704d90dbc800bb73cc456044dd4c7fa039445e4c2244f09cc8385"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e51eb75f93fd7ae7056c28a37bf54b51deb2b2ea31e5cb8b5c70caa09da7969"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/fma.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1b7f9b0da5021bb187d81027f289fbe18be51318c831ec4a89e60c9adae977"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tools/rust-analyzer/crates/ide/src/inlay_hints/chaining.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfb0988cd9a87ac2341a7c7a197d39116c70ee99f52bbb2546d763522b19436"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/avx512vpopcntdq.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed6a04d20a63f32f8d7636b32f18e27c54080a8ed0efc892b5a06a62719bc6f"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/core_arch/src/x86/kl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89914d7d5765ce8005de689b74635a60f9f780d4cb2d42340cda607195d737e4"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 13 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than listed individually (17 orphaned of 2497 analysed files in total)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: gen_c.rs \u2194 gen_rust.rs: \u0060library/stdarch/crates/intrinsic-test/src/common/gen_c.rs\u0060 and \u0060library/stdarch/crates/intrinsic-test/src/common/gen_rust.rs\u0060 change together 90% of the time (9 of the 10 commits that touched the less-changed of the two, renames followed) with no explicit dependency \u2014 a hidden/logical coupling. They already sit in the same directory, so if they share structure, extract the common part into one unit; otherwise break the coupling."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/intrinsic-test/src/common/gen_c.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d2088bfb62ea20dbd2afb65d74643521784728b24e5529066a50ae1bdd01e9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: diagnostics.rs \u2194 diagnostics.rs: \u0060compiler/rustc_attr_parsing/src/diagnostics.rs\u0060 and \u0060compiler/rustc_lint/src/early/diagnostics.rs\u0060 change together 89% of the time (34 of the 38 commits that touched the less-changed of the two, renames followed) with no explicit dependency \u2014 a hidden/logical coupling. If they belong together, co-locate them; if not, break the coupling."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9ce954adefde474928ad8d282ee02c3a1854dd22f05ba4d59cb2f43901dc3c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: context.rs \u2194 mod.rs: \u0060compiler/rustc_infer/src/infer/context.rs\u0060 and \u0060compiler/rustc_next_trait_solver/src/solve/eval_ctxt/mod.rs\u0060 change together 67% of the time (10 of the 15 commits that touched the less-changed of the two, renames followed) with no explicit dependency \u2014 a hidden/logical coupling. If they belong together, co-locate them; if not, break the coupling."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_infer/src/infer/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"babc252c7f67c55c02e025b0f866e9f8ccd6b27752e96bce309f892f9580ba0d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: argument.rs \u2194 gen_rust.rs: \u0060library/stdarch/crates/intrinsic-test/src/common/argument.rs\u0060 and \u0060library/stdarch/crates/intrinsic-test/src/common/gen_rust.rs\u0060 change together 64% of the time (14 of the 22 commits that touched the less-changed of the two, renames followed) with no explicit dependency \u2014 a hidden/logical coupling. They already sit in the same directory, so if they share structure, extract the common part into one unit; otherwise break the coupling."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/intrinsic-test/src/common/argument.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a60e8ec750eb15f77f7055be9b2524320e1b596cfded6f834fe2355bdf77ae"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: on_move.rs \u2194 on_unknown.rs: \u0060compiler/rustc_attr_parsing/src/attributes/diagnostic/on_move.rs\u0060 and \u0060compiler/rustc_attr_parsing/src/attributes/diagnostic/on_unknown.rs\u0060 change together 62% of the time (8 of the 13 commits that touched the less-changed of the two, renames followed) with no explicit dependency \u2014 a hidden/logical coupling. They already sit in the same directory, so if they share structure, extract the common part into one unit; otherwise break the coupling."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/diagnostic/on_move.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"442403a53240eb236019209c53302f08ca99fa7b209e8f9935af14eb52829d40"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: argument.rs \u2194 gen_c.rs: \u0060library/stdarch/crates/intrinsic-test/src/common/argument.rs\u0060 and \u0060library/stdarch/crates/intrinsic-test/src/common/gen_c.rs\u0060 change together 60% of the time (6 of the 10 commits that touched the less-changed of the two, renames followed) with no explicit dependency \u2014 a hidden/logical coupling. They already sit in the same directory, so if they share structure, extract the common part into one unit; otherwise break the coupling."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"library/stdarch/crates/intrinsic-test/src/common/argument.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b9315bbf653276ad09e8a1438bae9d56af4c1468d627a5cd171cfd60537a6b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: on_const.rs \u2194 on_move.rs: \u0060compiler/rustc_attr_parsing/src/attributes/diagnostic/on_const.rs\u0060 and \u0060compiler/rustc_attr_parsing/src/attributes/diagnostic/on_move.rs\u0060 change together 58% of the time (7 of the 12 commits that touched the less-changed of the two, renames followed) with no explicit dependency \u2014 a hidden/logical coupling. They already sit in the same directory, so if they share structure, extract the common part into one unit; otherwise break the coupling."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/diagnostic/on_const.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"257f06945d0705672aac3bddcb1a81f317b2d332e1d13388c40bd288b508ab7a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: on_const.rs \u2194 on_unknown.rs: \u0060compiler/rustc_attr_parsing/src/attributes/diagnostic/on_const.rs\u0060 and \u0060compiler/rustc_attr_parsing/src/attributes/diagnostic/on_unknown.rs\u0060 change together 58% of the time (7 of the 12 commits that touched the less-changed of the two, renames followed) with no explicit dependency \u2014 a hidden/logical coupling. They already sit in the same directory, so if they share structure, extract the common part into one unit; otherwise break the coupling."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/diagnostic/on_const.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"332d7b9f3b89352e47d2016a7cd43018d27089c513343c15ea4aaad50d551e1b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: on_move.rs \u2194 on_unimplemented.rs: \u0060compiler/rustc_attr_parsing/src/attributes/diagnostic/on_move.rs\u0060 and \u0060compiler/rustc_attr_parsing/src/attributes/diagnostic/on_unimplemented.rs\u0060 change together 58% of the time (7 of the 12 commits that touched the less-changed of the two, renames followed) with no explicit dependency \u2014 a hidden/logical coupling. They already sit in the same directory, so if they share structure, extract the common part into one unit; otherwise break the coupling."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/diagnostic/on_move.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"253a02897d19400cb48af6fcc2b315fc524b35e59747b66f18f835949e8dfd34"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: on_unimplemented.rs \u2194 on_unknown.rs: \u0060compiler/rustc_attr_parsing/src/attributes/diagnostic/on_unimplemented.rs\u0060 and \u0060compiler/rustc_attr_parsing/src/attributes/diagnostic/on_unknown.rs\u0060 change together 58% of the time (7 of the 12 commits that touched the less-changed of the two, renames followed) with no explicit dependency \u2014 a hidden/logical coupling. They already sit in the same directory, so if they share structure, extract the common part into one unit; otherwise break the coupling."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compiler/rustc_attr_parsing/src/attributes/diagnostic/on_unimplemented.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b6ce52e6e85c1dfc67575ee5950ffbf1d789e75c92dbec03aa204ebe4714ae"}},{"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"}},{"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"}},{"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"}},{"ruleId":"D38","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1edba8c94a0c3943a4a85f5155d6ca3f4465f6a53d2309bd75ca20f1f568290b"}},{"ruleId":"D38","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2805129d821a139b7123528a8796ed8ec212bf4bc7d0b171acb5a870dbeba9e0"}},{"ruleId":"D38","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6ba8b62d4daa7af8362d7dfcd59bb055c9989d0199cf45a158a39baa584004c"}},{"ruleId":"D38","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0706661a76e85ff0613b629fb37f12b100da31b39447308a4cf84afa5606395c"}},{"ruleId":"D38","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89e638de2d3682472e187a419c42c97be2d40934d9cd6590eea9a0bd325919bf"}},{"ruleId":"D38","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe032be9d77d40afa215e3b543cbdd17bf7be6d703a8fd18286b50c3b234932f"}},{"ruleId":"D38","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b44e74fa52ce1b66f3b8696adc5cdcd979b74cb36105d61d824ece80930d017"}},{"ruleId":"D38","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9107838d6cc6f42864b0b7bdcd78a4f49c39191268c27c99ecca028ebb679b7"}},{"ruleId":"D38","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8b5f0d2b08c6a0cf080ad246a1bcd92c6737981ef1e2b3d1747cd875eeafce5"}},{"ruleId":"D38","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":"21d29e9fc94997f2fc743f904945cce2fd777ddd42529b54762bd6b213569950"}},{"ruleId":"D38","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":"e7300e1c0694da5ae3d4f53c11810eaae238860b2fef9f721ed67bdc73a02fcd"}},{"ruleId":"D38","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":"ea82e6e1917de6223dfe64fdd7bb2cfafd5892ca5a750de46428d70921ff8495"}},{"ruleId":"D38","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":"db26126d7b2af9e7377653d3a2d65c126fe85ae0865eceaec1c9d75200d1af59"}},{"ruleId":"D38","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":"b2d85c4e40271b1f9d0237744d49ff021275126e0d8b46d239f3660296037519"}},{"ruleId":"D38","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":"f1fabc28de3a591be4432828a9f5792fe602ceda94839b00d2573e946560675d"}},{"ruleId":"D38","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":"417861f7b2f0cf676f83a3bd876c03e9888555087a5b9d6c55f8b53650d9e281"}},{"ruleId":"D38","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":"e7604df33a373bff24c037da69839436e408b0759087702c3b3178c7b5497630"}},{"ruleId":"D38","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":"fb531c5d8da95d2812b95285deb783ab0943a3393c93cc84e609d9513ba18bef"}},{"ruleId":"D38","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":"ccfbe3facf5e93feb4f5e9770f7017624044f7d70b6944d07b3b666e6f166642"}},{"ruleId":"D38","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":"dd190b012fd55893f054ec5931e597cc3fa3e504ee9c9959a24736e4fecf4361"}},{"ruleId":"D38","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":"3cbfedb5bd43c74430e2508bebc3aebaac754bc1af8f59a00256498e7611ae43"}},{"ruleId":"D38","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":"69450d22805f72fd7a2180a326431667459141b92146fcecb880ec5155d4087e"}},{"ruleId":"D38","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":"9d6003b7bd16dac40c37caa213d6619b430e27b9c0daaf0ed333c6f08e6985b4"}},{"ruleId":"D38","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":"7b4fa731c6608d7e2372758fb5ebb9511d70a965a2a949a4e1d2df7e8f42f038"}},{"ruleId":"D38","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":"1633ec7487d2b42421230364f7a01252f74cfe62a101410dcae4cbc3641dfbd7"}},{"ruleId":"D38","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":"90168eb52ec09083cb0bc83ae0aea747b8c6f25569d03c19ddfd95d0980081d1"}},{"ruleId":"D38","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":"f6d13a910db8828e2e41f0b19d19b1fb3548635aa6356ce119042ddc7e58f50d"}},{"ruleId":"D38","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":"ca9c1d10578489ad0ff1874a1bca8eabdd4ad8d8f3c8d6ebdbb989c6295742ac"}},{"ruleId":"D38","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":"18afa09310e10f0e02f653b0961afde3b6100e95d3102940481a15b55409031e"}},{"ruleId":"D38","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":"9b3b5c4d03f93bb27cb655fb58c06dfa244ed18e428051c99393ecf3b6b05166"}},{"ruleId":"D38","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":"cb66e04d262a67d1c7cc096693871a152df7427acd889d52235acc51b991a2c4"}},{"ruleId":"D38","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":"525ef768a1c50c7b0e045260ef768100e0107132415493eb12f24f145833aec9"}},{"ruleId":"D38","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":"072a4edc3bb2bc96ff2c26613581469d6e4607a94ba78576fbc8ea9830fbfbd9"}},{"ruleId":"D38","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":"a1ef5b2ccb00dbb52c0164d9b6d083028a3996b502402d36d04c72a13cee968c"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"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":"SQL Injection","shortDescription":{"text":"SQL Injection"},"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":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":149,"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."]}]}