{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_call (cyclomatic 93): InferenceContext::infer_call 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":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4963}}}],"partialFingerprints":{"codehealthFindingId/v1":"32894ef663330eb6fee61455531df7e4f5959c969c49f68ab26ac17ce00c0d99"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::body::lower::expr::lower_call_expr (cyclomatic 85): hir_def::body::lower::expr::lower_call_expr has cyclomatic complexity 85 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2cb05899827d4620ea0a3ce5dafb751b8b784c7161477364c5996cc58e3888"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::bin::cli::analyze::analyze_salsa (cyclomatic 83): bsl_analyzer::bin::cli::analyze::analyze_salsa 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":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fbb903c9c314d5a600429dd6e21ade4cd0f89849646310a276925d370fbc33"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::tools::search::status::search_status_with_cap (cyclomatic 79): mcp_server::tools::search::status::search_status_with_cap has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/status.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63c1c7ce02a43a779f20546f2a962678d370f6feac4cfd647fb1d653c22de7f"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_types::display::render (cyclomatic 76): bsl_types::display::render has cyclomatic complexity 76 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/display.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"724bd3077d56068ce32803741e4c43d96befe8ad8a7e2eb3116fe598e5625949"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::server::handle_task (cyclomatic 67): bsl_analyzer::server::handle_task 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":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a54881853aa936e8f20c338b645a9085ad781c84987e3720291ca56f3a3031d"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::resolve_bare_name (cyclomatic 60): InferenceContext::resolve_bare_name 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":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4410}}}],"partialFingerprints":{"codehealthFindingId/v1":"639ef65ea281fee3ca433ba770bf98e62843b66b427db0c9b2dd2b4a16c9062c"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::bin::cli::deps::run_deps (cyclomatic 59): bsl_analyzer::bin::cli::deps::run_deps has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/deps.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e41300964eddf533296e0f7043403efe5317778d01c958ce22388c3fe7d1a7"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_expr (cyclomatic 57): InferenceContext::infer_expr has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":3971}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7d4ff61bf8a3af1c5551ac9366e2a57a29034fdd0de890df443a3bf52b7e60"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedState::init_workspace_search_engine (cyclomatic 54): SharedState::init_workspace_search_engine 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":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b38f66adbd794933c167f04301b18d1679879d9bf91e8160e88b2746590c20"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_check_executor::native_check::profile::run_native_check (cyclomatic 53): bsl_check_executor::native_check::profile::run_native_check has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcf42a847028c0652ded0eb114363d0be3aa16a48489d0ead0ac43bfe5a77fe"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedState::workspace_indexing (cyclomatic 53): SharedState::workspace_indexing has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/mod.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"792aeb2fdeadc7b3ebeb0daa86fc0ca2a275c10fec13f01504f5f58bdeb82b71"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_debug::types::events::parse_ping_events (cyclomatic 52): bsl_debug::types::events::parse_ping_events 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":"crates/bsl-debug/src/types/events.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f241a2643e247b49b65a85e667c3f1e3f61ac423119815bf92410b6cb1a1d0"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedState::spawn_embed_pass (cyclomatic 52): SharedState::spawn_embed_pass has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9015c3d78d9920e4fe05ecd8664a1caf104aed6bc643d0f2171d2e2caf886e"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_stmt (cyclomatic 48): InferenceContext::infer_stmt 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":"crates/hir-ty/src/infer.rs"},"region":{"startLine":3619}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ae3e55d88f4fc66d975f339f7f6bb566f5dc96cb10d1b46b5df8a14335cdf0"}},{"ruleId":"D1","level":"warning","message":{"text":"DiagnosticsState::refresh_saved_path (cyclomatic 46): DiagnosticsState::refresh_saved_path has cyclomatic complexity 46 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/drift.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee73920b080bc1b052723ae8d18ffc03b2c7fad0f847c070dacb43c66068ea13"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchEngine::run_embedding_pass_owned (cyclomatic 45): SearchEngine::run_embedding_pass_owned has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b87ad75e1e328c79fe2faca63524365359b08ba5d07f40f4a84785679e9fe84"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedState::spawn_search_sink (cyclomatic 44): SharedState::spawn_search_sink has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/sync.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ff28914df97373c5f4682e9cc2ea992fc786ae587033ffc58699dca002808d"}},{"ruleId":"D1","level":"warning","message":{"text":"NotifyActor::load_entry (cyclomatic 44): NotifyActor::load_entry has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23c951d15e45bc12c7107f5f8d3b43306a18c607682f4536b10ee1ad2fca27b"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchEngine::refresh_dirty_contexts_fenced (cyclomatic 43): SearchEngine::refresh_dirty_contexts_fenced has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":4766}}}],"partialFingerprints":{"codehealthFindingId/v1":"344e6286a33f24be6efee4551491f0be4417f9a6b8bda62287599fe14e7e42be"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalState::process_changes (cyclomatic 42): GlobalState::process_changes has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/workspace.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be20cd78c4b7168a4d0e15dfb58ebe9461aeb643ccc74d48d266a2564c22880"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::rewrite_method_parameter::stmt_uses_binding (cyclomatic 42): ide_diagnostics::handlers::rewrite_method_parameter::stmt_uses_binding has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/rewrite_method_parameter.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"580d555cde8f15d700c0645fa3c42f591324f7c674becdcc887a1fd529f67088"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::subtype::is_assignable (cyclomatic 41): hir_ty::subtype::is_assignable has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/subtype.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"031710d4ef5945fcfa02c0934220604e559754f1637b121224614cbbad3ad2cc"}},{"ruleId":"D1","level":"warning","message":{"text":"SdblType::display_name (cyclomatic 41): SdblType::display_name has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/types.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef3136fdd9224acf3aa91aa4c73ab35787baaa519d31969bd3f9898cf733763"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::bin::cli::lsp::relay_lsp (cyclomatic 40): bsl_analyzer::bin::cli::lsp::relay_lsp has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/lsp.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e3fec279af407e5e175217954654a812b666b9a3d8b4fbc729c715fff7b8f8"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchEngine::index_directory (cyclomatic 40): SearchEngine::index_directory has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"e947b1043da956fd0b82a2d9aa70a1a344debc579319aac341187870b95a626c"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::latin_and_cyrillic_symbol_in_word::collect_and_check (cyclomatic 40): ide_diagnostics::handlers::latin_and_cyrillic_symbol_in_word::collect_and_check has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4f5549649cf6d139e8029d5147a4daf49a4be8a2345943e991b1e8f7df58b3"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_host_core::metadata::refresh_metadata_substrate (cyclomatic 39): ide_host_core::metadata::refresh_metadata_substrate has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/metadata.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e371da26a3473b3b0a5447f736da1b01e9c8541f8cc9b63f702711f74008f79"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::tools::search::semantic::semantic_code_hits (cyclomatic 39): mcp_server::tools::search::semantic::semantic_code_hits has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/semantic.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a687a8fcd01bc57e0011b2cd56df4d58fd9232e83ee542d62a71aa6e50e19b61"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::build_accounting_register_table (cyclomatic 37): LoweringContext::build_accounting_register_table has cyclomatic complexity 37 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/register_tables.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6234c8355729f7ad8ea9380d88b55ece9695e77c7edae1f860a0f116a33849cd"}},{"ruleId":"D1","level":"warning","message":{"text":"PlatformDataInner::from_help (cyclomatic 36): PlatformDataInner::from_help 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":"crates/bsl-platform/src/db.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38a533f53f56e7cdb2c4200812ba6ef466b57320914f6953c915e259271d620"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_host_core::metadata::bootstrap_metadata_substrate (cyclomatic 36): ide_host_core::metadata::bootstrap_metadata_substrate 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":"crates/ide-host-core/src/metadata.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bda91220a88543acde97d0dc6715c3ce4ee70d0ebddb01363cf7c1518a5028"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::server::handle_loader_msg (cyclomatic 35): bsl_analyzer::server::handle_loader_msg has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00c34e890d3fd2807f1b3d640b9277bda4f13b46c26063e6746fa42f4b442f6"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::body::lower::expr::determine_magic_number_context (cyclomatic 35): hir_def::body::lower::expr::determine_magic_number_context has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e690152cf31913a0c5f5e39bfb7b58f1d4b53224831f6ff46d8cce96e6208b"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::structure_keys::collect_structure_shapes (cyclomatic 35): hir_ty::structure_keys::collect_structure_shapes has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/structure_keys.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"76add76f64c0764f1d53491feaf30b6bfe9b17fcba38f561bd54551f7dc074a2"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::unused_parameters::check (cyclomatic 35): ide_diagnostics::handlers::unused_parameters::check has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_parameters.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4aa6ae19ed027e850e0192d59383d2a3bf42c628ee66f15486d27615d0aa38b"}},{"ruleId":"D1","level":"warning","message":{"text":"DiagnosticsResident::workspace_aggregates (cyclomatic 35): DiagnosticsResident::workspace_aggregates has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/resident.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c72f9bad6873f33a175a89353eabc1e9c64beada1d90f9a298dcb9422383183"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedState::refresh_search_roots_after_graph (cyclomatic 35): SharedState::refresh_search_roots_after_graph 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":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"003a45649f170879d6a1567cae76148e3f5c5c1e23c1108bffe986b69ef1fd56"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceOverlayCache::full_refresh_from_manifest_scanned (cyclomatic 34): WorkspaceOverlayCache::full_refresh_from_manifest_scanned has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"21431e8ca639c97b8bd19ae9d9e7389ca1206ffa85f1a32e7db6761d43b276dd"}},{"ruleId":"D1","level":"warning","message":{"text":"parser::grammar::sdbl::select::recover_field_to_alias_or_delimiter (cyclomatic 34): parser::grammar::sdbl::select::recover_field_to_alias_or_delimiter has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/select.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea1fbad582177ceceb0e5848c17e4e92c078c45b21bbc79500dd649fde373f5"}},{"ruleId":"D1","level":"warning","message":{"text":"parser::parser::torn_if::walk (cyclomatic 34): parser::parser::torn_if::walk has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/parser/torn_if.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b779e570d821e7cfc8d4898609b57fe06663542e8c13b4de5ff3360cd8a40382"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::pairing_broken_transaction::dfs_check_paths (cyclomatic 33): ide_diagnostics::handlers::pairing_broken_transaction::dfs_check_paths has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/pairing_broken_transaction.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fc6590668421915e316a42457134e90c8b0da05c578d96f9c27cf92693ca0c"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedState::run_overlay_warmup (cyclomatic 33): SharedState::run_overlay_warmup has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4743e0316b3af8c9bee1a77ba2acdf71b277ae2d066a6a1a20608f7b65e349"}},{"ruleId":"D1","level":"warning","message":{"text":"NotifyActor::run (cyclomatic 33): NotifyActor::run has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9872497309e17d56a9adbc03ec24abe17fb4f16ca7c23a282f5a621b6c4ba3a9"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::completion::platform_completion::platform_completions (cyclomatic 32): ide::completion::platform_completion::platform_completions has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/platform_completion.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9090efd4e0cef68e97d63be82ac8dd6b18aca09c8a8798a1abcbf604ca7176f5"}},{"ruleId":"D1","level":"warning","message":{"text":"InsertionTracker::hash_expr_into (cyclomatic 32): InsertionTracker::hash_expr_into has cyclomatic complexity 32 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dc12a7df302533a1a8810d93c5f981e13a145a8b4d549d6f443dcb9a1d013a"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::graph_db::compute_body_patch_with_metadata (cyclomatic 32): mcp_server::graph_db::compute_body_patch_with_metadata has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c3c806f3c92032c86bf300f6d60c4de499d6550ab4323619ea555650a2d2df"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::broker::daemon::serve_shared (cyclomatic 31): mcp_server::broker::daemon::serve_shared has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/broker/daemon.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d02c16bb594c75af15172bc1e9ba8bd6015840f48017ff4d652bdba2c4979b0"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::change_hub::run_hub_thread (cyclomatic 31): mcp_server::change_hub::run_hub_thread has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":4678}}}],"partialFingerprints":{"codehealthFindingId/v1":"3709090c59d277dafb590fe84d512dbc9758f172cfc90fde3cc9aa0068f903a7"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::change_hub::apply_rearm (cyclomatic 31): mcp_server::change_hub::apply_rearm has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5725}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be63a19e98650274678c66ba1dbf4477e361993d19481a5627a25fa37c2aa78"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_acceptance.main (cyclomatic 31): runtime_acceptance.main 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":"scripts/user2/runtime_acceptance.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1853fecb8891ca4cac99e234fb8f0fb2ec312cbd6e3b0cd4bc03e7a3b43a0ea3"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::diagnostics_baseline::transaction::publish_set_with_hook (cyclomatic 30): bsl_analyzer::diagnostics_baseline::transaction::publish_set_with_hook has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"27346113b229b93efc63a457dd0ad3db3adec83d2f6a041875b71ade7a31b5ee"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::unused_local_method::collect_called_methods (cyclomatic 30): ide_diagnostics::handlers::unused_local_method::collect_called_methods has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_method.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"584c4abe26af11a212000991fcf8c8dd50ae10a8dc3fc9d402638f59887068bf"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedState::spawn_workspace_search_init (cyclomatic 30): SharedState::spawn_workspace_search_init has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a29a9142db59df19db1b1b2f457857dea096f97846d552013b3d914924f6fc8"}},{"ruleId":"D1","level":"warning","message":{"text":"Project::diagnostics_baseline_partition_plan (cyclomatic 30): Project::diagnostics_baseline_partition_plan has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"6444465da9d68b5da73ae7f887f21614e8d6f5b952b6fb344ce2988b585c395d"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_function_call (cyclomatic 30): LoweringContext::lower_function_call has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/expr/mod.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71a12eb6b27ce7774e2c9909e4f6fa4fae2fd62604cdd26d2339e4536351632"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_lifecycle.main (cyclomatic 30): runtime_lifecycle.main has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user2/runtime_lifecycle.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc890cbca1cf3e26738be13abc80d61c3dc65e3a945ede437e8e5308da91a4ba"}},{"ruleId":"D1","level":"warning","message":{"text":"html_parser::scraper_parser::extract_examples (cyclomatic 29): html_parser::scraper_parser::extract_examples has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b922889afe5ab3f594f9a102eca935dfcca75d63536ca15989c6ba4c763ca9"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::body::lower::stmt::lower_stmt_list_with_unreachable (cyclomatic 29): hir_def::body::lower::stmt::lower_stmt_list_with_unreachable has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/stmt.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31eecce569bc209e699581e968d23637121ca257336ab25546eeaed46b78375"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::commented_code::strong_statement (cyclomatic 29): ide_diagnostics::handlers::commented_code::strong_statement has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/commented_code.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bced522402d42f9eb76de3bc96f2953c8ae856c1ce224784beb950a18683ea"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceLease::publish_checkpointed_inner (cyclomatic 29): WorkspaceLease::publish_checkpointed_inner has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/workspace_lease.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e9b817edc166c5fc1373ea63a676b400c242454999e30a9689eef8a1c09952"}},{"ruleId":"D1","level":"warning","message":{"text":"parser::grammar::sdbl::expressions::recover_to_delimiter (cyclomatic 29): parser::grammar::sdbl::expressions::recover_to_delimiter has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5599fcfc092c4049491c528a72b73b5bf12e4d21be65d8f40ffaee52357e538e"}},{"ruleId":"D1","level":"warning","message":{"text":"parser::grammar::sdbl::expressions::predicate_expr (cyclomatic 29): parser::grammar::sdbl::expressions::predicate_expr has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c402b3fe8fa84d914b0e4dee545124173bc57e7de6eed2442fedbfc7a907b7e"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeProfile::validate (cyclomatic 28): NativeProfile::validate has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"56828878a3d34d44eac807233dd69aec1d1cfb3d278aaa88d39918e76d799be7"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_check_executor::native_check::compiler::run_bounded_with_log (cyclomatic 28): bsl_check_executor::native_check::compiler::run_bounded_with_log 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":"crates/bsl-check-executor/src/native_check/compiler.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebd8b83108f14bd482370e16f1808329641779c06bfda90730eb7d00b509de0"}},{"ruleId":"D1","level":"warning","message":{"text":"CommonAttributeSet::project_extension_object (cyclomatic 28): CommonAttributeSet::project_extension_object has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/common_attribute.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"8597a8a031944236b6dce22d81b1a94851e6941782ebc1b2150366f9937f5c74"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_metadata::xml_parser::catalog::parse_metadata_object_xml (cyclomatic 28): bsl_metadata::xml_parser::catalog::parse_metadata_object_xml 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":"crates/bsl-metadata/src/xml_parser/catalog.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f055689f96d3f8bc529537a1d56ff8ceea5f90163199ba26789fd1696ef71999"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::hover::definition_to_hover (cyclomatic 28): ide::hover::definition_to_hover has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/hover.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b797c38d8f03c36f8cbb3777698125f3b1f0887386da50054e53c0d033b2fd28"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::hir_inference_dispatch::dispatch_inference_diagnostic (cyclomatic 28): ide_diagnostics::hir_inference_dispatch::dispatch_inference_diagnostic 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":"crates/ide-diagnostics/src/hir_inference_dispatch.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c56ac22a42f30082fde024e7545f1b84c7edb1baf4d0303319a7a71b4ba493a"}},{"ruleId":"D1","level":"warning","message":{"text":"McpServer::graph (cyclomatic 28): McpServer::graph 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":"crates/mcp-server/src/lib.rs"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d0f881f4639c712804a0b446dbf6a9989faf3d45ddedc4bd38ac9dc6404e98"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedState::apply_prepared_search_drift (cyclomatic 28): SharedState::apply_prepared_search_drift 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":"crates/mcp-server/src/state/sync.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"833173770a53a141a379be45ad6fbe9b29a844ce1e25504e9ff36e28f7f54f14"}},{"ruleId":"D1","level":"warning","message":{"text":"parser::grammar::sdbl::expressions::column_or_function (cyclomatic 28): parser::grammar::sdbl::expressions::column_or_function has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9e2f8c1e28a06c5a9d7e5572eb93da75fcfa9e038a6f35f8bf60b733862318"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_metadata::loader::build_configuration (cyclomatic 27): bsl_metadata::loader::build_configuration has cyclomatic complexity 27 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3efdd7a59db9906061e57da5179a52eef96a44b0685aa11d93ca4717217926"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchEngine::stage_validated_workspace_roots_transition (cyclomatic 27): SearchEngine::stage_validated_workspace_roots_transition has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":3556}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0ff2975e27017017c6898003d8e01368dda3c40910299eb3c237ec5ab71c8a"}},{"ruleId":"D1","level":"warning","message":{"text":"SlabLayout::compute_with (cyclomatic 27): SlabLayout::compute_with has cyclomatic complexity 27 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/method_slab.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12fb5ebf0b81aa6cbe1855383c244474354ef601f5aced71c10415a47a034cc"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::docs::tokens::doc_comment_tokens (cyclomatic 27): hir_def::docs::tokens::doc_comment_tokens has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs/tokens.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72ceedb7abf9593b100e02f699a0da2dbcd51ea65fda75bb411c19ff04b20f1"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::using_hardcode_secret_information::check_body_exprs (cyclomatic 27): ide_diagnostics::handlers::using_hardcode_secret_information::check_body_exprs has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_hardcode_secret_information.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1e59119c1a90973f26ab4cf423bb9b4fa9458f132997bf5b4918485f72b141"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphDb::neighbors (cyclomatic 27): GraphDb::neighbors has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_query.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"166477ebca8299c98d9d074493e31cceb42467a4080c5e13e287858712b75033"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::diagnostics_state::resident::apply_resident_changes (cyclomatic 27): mcp_server::diagnostics_state::resident::apply_resident_changes has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/resident.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"9107a0b7931eac2cd64129bbf403e38a714866e59d0a4e88e010da6d7ddc46f5"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_debug::dap::handle_request (cyclomatic 26): bsl_debug::dap::handle_request has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/dap/mod.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a14fc39b5f860b4dd0f2b8549faaff108b77d2e96d2da8cbe76f5249bd1407"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::dispatch_bare_ident_field_call (cyclomatic 26): InferenceContext::dispatch_bare_ident_field_call has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: InferenceContext::push_inference_diagnostic (cyclomatic 29) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":6228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88a2a7f02ee9c4fe0a992fec431968d6830910c4a47d768630b07e55274c2ae"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::graph::build_workspace_graph_rows (cyclomatic 26): ide::graph::build_workspace_graph_rows has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"77af158f6c31e54714738e50c134812c0063effcca818ff22bd87813b9729d1a"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::server_calls_in_form_events::bfs_find_server_calls (cyclomatic 26): ide_diagnostics::handlers::server_calls_in_form_events::bfs_find_server_calls has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/server_calls_in_form_events.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed57a66c74f9e26ba173d2b002ea9f33f6b3c25dff50fc073566124b7868653"}},{"ruleId":"D1","level":"warning","message":{"text":"EditorView::catch_up_deltas (cyclomatic 26): EditorView::catch_up_deltas has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/workspace.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"2126c308d3120e3ae7fe571c8dadd86ecd209a706d3e160aa25f7959a9a4784c"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::tools::search::status::write_summary_block (cyclomatic 26): mcp_server::tools::search::status::write_summary_block has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/status.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ede8aa6986d0987719f55c75651adf8e393358ff19b84988f45371f5c61fcd2"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeProfile::run_scoped (cyclomatic 25): NativeProfile::run_scoped has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2a2ebd6d4d4f30a4e449695aeed26fc77230ea3752a783a00a3e9487e43e07"}},{"ruleId":"D1","level":"warning","message":{"text":"PostgresBaselineAdapter::populate_serving_semantic_with_progress (cyclomatic 25): PostgresBaselineAdapter::populate_serving_semantic_with_progress has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6a78cdffff921204bd77ad7affc5f61782e36c26494d97482d009df283ba51"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedEmbeddingPublisher::publish (cyclomatic 25): SharedEmbeddingPublisher::publish has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/publish.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1e4f0109ff0245974fc64a4ebaf72d0ff328f83e3177104bca3a4a957611f8"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::unused_local_variable::check_method (cyclomatic 25): ide_diagnostics::handlers::unused_local_variable::check_method has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_variable.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1111ab3ecaeab657f01b672baab57bab70444ceafd3d43420395f6de9b20ccd"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphDebt::apply_recovery_publication (cyclomatic 25): GraphDebt::apply_recovery_publication has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/debt.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bb1b5d2996591699fbfb32f5c1557a5f65facac58181f99f78a43c7b94dfc6"}},{"ruleId":"D1","level":"warning","message":{"text":"Target::native (cyclomatic 25): Target::native has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/indexing.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"117ae8483d538037f7a0600d332ec306d04925dd639f36b2e1b3a6131d87285a"}},{"ruleId":"D1","level":"warning","message":{"text":"Owner::run (cyclomatic 25): Owner::run has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/overlay_backlog.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"135f9f58889b9c3d6171531e75ff7d22b7a79f56bdfb8190a764bd6aef4bc044"}},{"ruleId":"D1","level":"warning","message":{"text":"NotifyActor::scan_appeared_dir (cyclomatic 25): NotifyActor::scan_appeared_dir has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d30894742016f8a034ee42b6ebb57c60de6abba164d839932367860f6f1c55"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::bin::cli::diagnostics_baseline::apply_partitioned (cyclomatic 24): bsl_analyzer::bin::cli::diagnostics_baseline::apply_partitioned has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bde263cff3124f917fcbf0a9f0e41e87f514bf2bd49a3c870423aae501253f"}},{"ruleId":"D1","level":"warning","message":{"text":"Store::reindex_file_in_collection_checkpointed_with_reuse (cyclomatic 24): Store::reindex_file_in_collection_checkpointed_with_reuse has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79795601610317f5481ceae22339afa98affd1b3111871f175178b1809d02d1"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphCtx::neighbors (cyclomatic 24): GraphCtx::neighbors has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bee34464bd38980c293a4c0423773480ad52c3d9914cb2ed9953a6a6cd36b7"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::partitioned_diagnostics_baseline::load_diagnostics_baseline_set_once (cyclomatic 24): ide::partitioned_diagnostics_baseline::load_diagnostics_baseline_set_once has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebac3c6d31e0139f5c93e0f5f96655676d3af8a11c52c85b55efa7f5537f9e0"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_db::metadata::get_module_type_from_uri (cyclomatic 24): ide_db::metadata::get_module_type_from_uri 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":"crates/ide-db/src/metadata.rs"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"018b3d007fac97e01c6b3c3a8bc47c9288145f5e02e99f596075b722a33a3ac1"}},{"ruleId":"D1","level":"warning","message":{"text":"BodyScan::stmt (cyclomatic 24): BodyScan::stmt has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/transferring_parameters_between_client_and_server.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9780a9f609dcaaf36084bc16682d37b40ca058f56da4642c7dd8f37ca18acce"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::utils::nstr::extract_language_entries (cyclomatic 24): ide_diagnostics::utils::nstr::extract_language_entries 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":"crates/ide-diagnostics/src/utils/nstr.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde4568dfb6c5833d59f9875d9fc274a3bf02dc65fb60c463ea04b2cd16546ff"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphStore::checkout_with_admission_wait (cyclomatic 24): GraphStore::checkout_with_admission_wait has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/snapshot.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1af40d54b6e4ac70762246fc8f04a7229b19902dc5ad92fa2852308f0c67335"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::graph_db::write_body_patch (cyclomatic 24): mcp_server::graph_db::write_body_patch has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede8fd405cfde6b468b2dfbf44336e1aef18cabacc86bdfad5adbcc3dc4f1d20"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_table_ref (cyclomatic 24): LoweringContext::lower_table_ref has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2bc18ab8703ad550473e7fbaa23b7577ff3cc8fb97369b6d07ec1ac34a3603"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::handlers::notification::handle_did_close (cyclomatic 23): bsl_analyzer::handlers::notification::handle_did_close has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/notification.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffac9ae71a5bdbdb6971ba10bcb84c07dcedc44f61026b3496806bdeef2315e8"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_check_executor::native_check::source::parse_metadata_form_type (cyclomatic 23): bsl_check_executor::native_check::source::parse_metadata_form_type has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eddb867d16d2453851a297b9a6c011fea377fa16291f4cf626c96990f068063"}},{"ruleId":"D1","level":"warning","message":{"text":"Record::encode (cyclomatic 23): Record::encode has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/lifecycle.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4722e9a2328f764989e3372a5ccb4b4d59781a1e8a79904f61fbd7a6c5bb01f"}},{"ruleId":"D1","level":"warning","message":{"text":"MetricsVisitor::visit_stmt (cyclomatic 23): MetricsVisitor::visit_stmt has cyclomatic complexity 23 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/metrics.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8350ea60d89a808bfe0152ff3129738c09a9795139d41742163bd05286ea50"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::form_items::body_may_change_items (cyclomatic 23): hir_ty::form_items::body_may_change_items has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/form_items.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b494a5be55ff242d8f2e8b9e599e212148aa29728bd72c2d3444850d383379ae"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_db::metadata::load_configuration_from_prepared_inputs (cyclomatic 23): ide_db::metadata::load_configuration_from_prepared_inputs has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"7272ebe1498f639f8fefd3b77f5acfa6f5e1cb89f562b204b8c1a4515c4b182d"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::tools::metadata::format_filtered_tree (cyclomatic 23): mcp_server::tools::metadata::format_filtered_tree has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ffdb2c413b69aacef22d0df04dde172be2b25399f888096646e95e9f6a79bd"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionTopology::build (cyclomatic 23): ExtensionTopology::build has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/extension_topology.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"d106c63a9099fdeeb36c9a476aeef7049b04a0763ffab8bbb778206b9a0d9325"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_column_ref (cyclomatic 23): LoweringContext::lower_column_ref has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/expr/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bd28eb597f51f109eef2de9c52d4bf08d0ee85bbdcda61f8cd8a4eae4d9b8f"}},{"ruleId":"D1","level":"warning","message":{"text":"SdblType::fmt (cyclomatic 23): SdblType::fmt has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/types.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"44057e92493b0006d255580cbd53dbc8afbca90376a67b3ea020fa5092efe6ec"}},{"ruleId":"D1","level":"warning","message":{"text":"sdbl_hir::context_detector::detect_context (cyclomatic 23): sdbl_hir::context_detector::detect_context has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/context_detector.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a844d3bd89ae4a6793cea26170cb5f6491cc9b17e8bfd5472dc7a3b3440a0b"}},{"ruleId":"D1","level":"warning","message":{"text":"sdbl_hir::hir::collect_expr_objects (cyclomatic 23): sdbl_hir::hir::collect_expr_objects has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: FunctionKind::name_ru (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca2e954ce216585e241357ba634b7942aa8a700bfa419aab3b7b0d6e525856c"}},{"ruleId":"D1","level":"warning","message":{"text":"Store::apply_workspace_roots_transition (cyclomatic 22): Store::apply_workspace_roots_transition has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b18b6aafe2951bf809bc95bfb252944bcbaffe5521b94664132fe4e7b8e6ff1"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::body::lower::expr::lower_binary_expr (cyclomatic 22): hir_def::body::lower::expr::lower_binary_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":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a7a6e8ff8230609fc466a4cc9ea89611072f2b52f5c4610de7ac16b8d00dc0"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::completion::mdo_completion::mdo_completions (cyclomatic 22): ide::completion::mdo_completion::mdo_completions has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/mdo_completion.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60be9ad92f500fcb405251af6e0cf39dc493898a58c865ce2211c723f0f61f4"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphState::drive_as (cyclomatic 22): GraphState::drive_as has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8e825bec8b224f44275a83da13897d8f0ad0e5650daf64e11342c9aac57766"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::tools::references::render (cyclomatic 22): mcp_server::tools::references::render has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/references.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab0e5d1a7cf977c183e455e706c3d8425be95c74891fcfe37842b56acf551ae"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::check_expr_for_unlimited_string (cyclomatic 22): LoweringContext::check_expr_for_unlimited_string 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":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbca8f19262a56297c5d025707c21be60e1615f3615201175264d14862753a25"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_debug::types::responses::parse_targets (cyclomatic 21): bsl_debug::types::responses::parse_targets has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/responses.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a06c64e38392dd99d2a65a1b2fecb8e12fbaceef4fcd1778c9bea9cdb582bc"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_metadata::xml_parser::common_attribute::parse_common_attribute_xml (cyclomatic 21): bsl_metadata::xml_parser::common_attribute::parse_common_attribute_xml has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/common_attribute.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6865beeca2a44c4c2a357bf308e7fc1b9efb9922dca6ac94bf6c3aa06a2684e5"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchEngine::sync_indexed_documents_in_collection_with_embeddings (cyclomatic 21): SearchEngine::sync_indexed_documents_in_collection_with_embeddings has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":6372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4c1443339e47ca1176e4580fde1a21b137df007daf37fdb7f5b46d251fbb73"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_types::intern::write_type_order_key (cyclomatic 21): bsl_types::intern::write_type_order_key has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/intern.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"972bd064d67d08f22186e225e72b4ef8c49946fa755d62892ff5e718599098df"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::body::lower::lower_method_with_externals (cyclomatic 21): hir_def::body::lower::lower_method_with_externals has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/mod.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ae688426e113bdef33ee289cd43de780b3943e816930e88df847bdd29ecde0"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::call_graph::extract_from_body (cyclomatic 21): hir_def::call_graph::extract_from_body has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/call_graph.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1095514c83a923ec5bb1fdab99b43246f313c6a1b6a9c2f24e37183c2f5b01"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::iteration_lookup::resolve_iter_element_ty_inner (cyclomatic 21): hir_ty::iteration_lookup::resolve_iter_element_ty_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":"crates/hir-ty/src/iteration_lookup.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10b8d8be4fc18f2328f98aae5ff9c222e6bd07da5156008e8fa68a90ecd23b7"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::rewrite_method_parameter::scan_stmt_before_target (cyclomatic 21): ide_diagnostics::handlers::rewrite_method_parameter::scan_stmt_before_target has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/rewrite_method_parameter.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d293e87b6edc81e5763fee82ac77708c777c50c09900fc08326135118fd355c"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphState::status_report_with_indexing (cyclomatic 21): GraphState::status_report_with_indexing has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":2604}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a06078e2591668f6580a16ca8f7f5b471b9b5f2284070237c2627506e52006"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::tools::redact::redact_targeted_tracking (cyclomatic 21): mcp_server::tools::redact::redact_targeted_tracking has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/redact.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"72faae6cf51bff31598c45078dc5eedc0625bb84dfdae31e40464a354f96f968"}},{"ruleId":"D1","level":"warning","message":{"text":"sdbl_hir::literal::map_offset_to_query (cyclomatic 21): sdbl_hir::literal::map_offset_to_query has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/literal.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6a031d3f8b4d8873f67c105bf20d26605d28c433bfb650fd378f9d68192e5b"}},{"ruleId":"D1","level":"warning","message":{"text":"e1.main (cyclomatic 21): e1.main 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":"scripts/user2/e1.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d944a78be1e85d2f554c0a4f8bbeb9fd7428629b8802c5ad8543cdfaab62b61"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_lifecycle.lifecycle_root (cyclomatic 21): runtime_lifecycle.lifecycle_root 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":"scripts/user2/runtime_lifecycle.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"475357b86ef72a49ec7e9edd9bb5c21a902c0d40742e946ebe5d2fe9f39757fd"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_lifecycle.prepare_cache (cyclomatic 21): runtime_lifecycle.prepare_cache 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":"scripts/user2/runtime_lifecycle.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c17bd1aade3b07109405efd0d1a98595877fca7be40575fdc38a83c2e4cd31"}},{"ruleId":"D1","level":"warning","message":{"text":"RequestDispatcher::on_latency_with (cyclomatic 20): RequestDispatcher::on_latency_with has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db822db6e846713c57f7f3d6777de1f31fd4d46851229eaaa99621b8aa1fca1"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::bin::cli::search_baseline::publish::run (cyclomatic 20): bsl_analyzer::bin::cli::search_baseline::publish::run has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/search_baseline/publish.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6a3b95570c2b16a393ada7ae76dcf94f4af2a58f29cd9e7521b4b2723b4cdd"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceOverlayCache::full_refresh_scanned (cyclomatic 20): WorkspaceOverlayCache::full_refresh_scanned has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ccb689ceca21a4841755759bd32bccb3bdaa61af4e833e6bbe8b1161b76ed8"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_search::publish::validate_source_span_layout (cyclomatic 20): bsl_search::publish::validate_source_span_layout has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/publish.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21d5f27fcd82ca2627487ab86f713172c7a79f0f1cee8098e33e377fb511953"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::body::lower::expr::is_unsafe_safe_mode_context (cyclomatic 20): hir_def::body::lower::expr::is_unsafe_safe_mode_context has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b3f2124dc5d96c968f4cba3e6c251f6d8a2dd4b96334f6323af993346e0585"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::graph_index::project_batch_form_edges (cyclomatic 20): hir_def::graph_index::project_batch_form_edges has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b25a538b1983054b8d8e524fa1077fc9ce656051ced49c5b774bb07c1922df"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::types_on_every_path (cyclomatic 20): InferenceContext::types_on_every_path has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: InferenceContext::push_inference_diagnostic (cyclomatic 29) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1e240e698bb235e31d56b8b1dbc19e47a60ab7c4971aa89703354be7059dde"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::definite_init::collect (cyclomatic 20): hir_ty::definite_init::collect has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/definite_init.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e3432a593afa4bd0d4cc5f89f777ae4b6950a3ba2d142b91331929b53bcba2"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::duplicated_insertion_into_collection::check_stmt (cyclomatic 20): ide_diagnostics::handlers::duplicated_insertion_into_collection::check_stmt has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7070f286e66d99ef7d4c453e5618486a008e774d17aac8e65f95f56b297756"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::incorrect_use_of_str_template::check_body (cyclomatic 20): ide_diagnostics::handlers::incorrect_use_of_str_template::check_body has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7746a94623aa3bebf40c3a1bdbee1518a5ee9266b55e961e54f3c62530d7b57c"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::unused_local_variable::build_attribute_names_to_skip (cyclomatic 20): ide_diagnostics::handlers::unused_local_variable::build_attribute_names_to_skip 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":"crates/ide-diagnostics/src/handlers/unused_local_variable.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2a9ac7f5e8a8e936540519ebacb7d0c1de05c52c3f60be58a3e25f21427b5f"}},{"ruleId":"D1","level":"warning","message":{"text":"LspChannel::new (cyclomatic 20): LspChannel::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":"crates/mcp-server/src/broker/transport.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"da91e2244f9f4a79fc5a7d64457210fc4c0daaf43d17c3ec4077c2f4f9773859"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphDebt::standing (cyclomatic 20): GraphDebt::standing has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/debt.rs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e5bd1c50975dc21b274fd6991cf975f420674dd53cdd2156eb23d65410fe39"}},{"ruleId":"D1","level":"warning","message":{"text":"OverlayRetry::run (cyclomatic 20): OverlayRetry::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":"crates/mcp-server/src/state/overlay_retry.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d34535e1013cf6c1a726e73749dc552511c5e819d73a676e9957a02b7e26b8"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::graph_db::plan_caller_delta (cyclomatic 20): mcp_server::graph_db::plan_caller_delta has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"973a3d3db778a1de2a23953b985e40f61f756c471c0d445ead6a856512525204"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::tools::diagnostics::file_findings (cyclomatic 20): mcp_server::tools::diagnostics::file_findings has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3edb71085998270e85850376bb1d3c3d25e1f674838a99ec36fc22597c702a5"}},{"ruleId":"D1","level":"warning","message":{"text":"Sink::finish (cyclomatic 20): Sink::finish has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/sink.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f557f393b6bc1f6bb6687b9a62b3ceea9e83f6c91f439644468ccc99c3d3811"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::check_expr_for_ref_overuse (cyclomatic 20): LoweringContext::check_expr_for_ref_overuse has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5cef457234ad084ac367b73c1a10a0f66d41c90b5f0a1441e0f5f7014eebf0"}},{"ruleId":"D1","level":"warning","message":{"text":"NullableUses::walk (cyclomatic 20): NullableUses::walk 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":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f0fc25322294d4cf358f77fe29452ddf712444fc64055ffd21ecf16ccf182e"}},{"ruleId":"D1","level":"warning","message":{"text":"MissingRowConditions::of (cyclomatic 20): MissingRowConditions::of has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/missing_row.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae237d9262a8203dc76192bac338ddb283440a85c0eaf2f72beafc463e020de"}},{"ruleId":"D1","level":"warning","message":{"text":"sdbl_hir::hir::walk_level_expr (cyclomatic 20): sdbl_hir::hir::walk_level_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. This is NOT this file\u0027s highest cyclomatic complexity: FunctionKind::name_ru (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f37a979066709ddd5b37bf8d93f00100d66887d65e4d1654333a96d4ab256ad"}},{"ruleId":"D1","level":"warning","message":{"text":"syntax::sdbl_query::extract_sdbl_with_corrections (cyclomatic 20): syntax::sdbl_query::extract_sdbl_with_corrections has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/syntax/src/sdbl_query.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8069cc82c3ffc2ea8a89ea30adf3c864658fa37d80b2f663c6fba1a9539a1bb"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluate.embed (cyclomatic 20): evaluate.embed 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":"scripts/user2/evaluate.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"57084f3a91d7cdab8b41679d18062503ca7d4fb2df93d49cf131e72777fdff64"}},{"ruleId":"D1","level":"warning","message":{"text":"Handler.do_POST (cyclomatic 20): Handler.do_POST has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user2/serve.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8ed7f12ec93d4838a46332a24e7d18ca016739247f6a121be58fe00a4d174d"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::bin::cli::rules::markdown_to_html (cyclomatic 19): bsl_analyzer::bin::cli::rules::markdown_to_html has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/rules.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"128f5068ec612e480eb207e4c8d1d335479b29cefcb93e42e8832083d6ffd204"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_check_executor::native_check::profile::add_synthetic_owner (cyclomatic 19): bsl_check_executor::native_check::profile::add_synthetic_owner has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"31249ad3db65de0f5ae1817e3c00fa2b2167fa637c9ed976706c7a0243769243"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_check_executor::native_check::source::flat_module_export_name (cyclomatic 19): bsl_check_executor::native_check::source::flat_module_export_name has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9ec404305192cc4032180e9afc019f491279d6065459c070990430ed580299"}},{"ruleId":"D1","level":"warning","message":{"text":"Configuration::merge_extension_overlay (cyclomatic 19): Configuration::merge_extension_overlay has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/configuration.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5d69fa43660ce2cf38d2ac132f13587b5a72b317253f2da67403067330ace2"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::docs::parse_parameters_with_roles (cyclomatic 19): hir_def::docs::parse_parameters_with_roles has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f8f512cb10c4904448d4377027e06fa0b3c4d38289d59afa7be3cf30980742"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::docs::parse_returns (cyclomatic 19): hir_def::docs::parse_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":"crates/hir-def/src/docs.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"7683b6df26c8156a896abdd7cb09980a434c65a8773f7b50ed20acf376904969"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector::visit_stmt (cyclomatic 19): Collector::visit_stmt has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/map_keys.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8cad8d1e9b9399ac1d604cc7c66d2a19d8e97df9751cca229dfeff5b1e8cb3"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::field_enum::enumerate_projected_fields (cyclomatic 19): hir_ty::field_enum::enumerate_projected_fields has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/field_enum.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa2e63f6ed83a2906d9f8ed298cb7726264024add39f84fd3d58529e1416aea"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::platform_global_lookup::bare_global_name_claim (cyclomatic 19): hir_ty::platform_global_lookup::bare_global_name_claim has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/platform_global_lookup.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e233c02b9fced66ed96988a9fe29521344cdbbf57cb288bd2d431029a91a45c7"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::subtype::is_coercible_to (cyclomatic 19): hir_ty::subtype::is_coercible_to has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/subtype.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5919fb04c23e5459693af6d3893abffc1c9e8016bd1170f5e0c2cf440467b0"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::references::resolve_by_text (cyclomatic 19): ide::references::resolve_by_text has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/references.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd03451669adaac7c65cc0f94228002643e02722307b12e284686be63098232"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::identical_expressions::are_exprs_semantically_equal (cyclomatic 19): ide_diagnostics::handlers::identical_expressions::are_exprs_semantically_equal has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: ide_diagnostics::handlers::identical_expressions::expr_to_string (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/identical_expressions.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fe2a71d0031f5e6d09c8714fa46709fe4ae9be8d86a0ee132b1372abf8209d"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::identical_expressions::check_binary_expr_hir (cyclomatic 19): ide_diagnostics::handlers::identical_expressions::check_binary_expr_hir has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ide_diagnostics::handlers::identical_expressions::expr_to_string (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/identical_expressions.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8b16facad82d152cd5e07739b86895d2673f0c4cb75f1ed3b837b6bf59a923"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::latin_and_cyrillic_symbol_in_word::matches_trailing_pattern (cyclomatic 19): ide_diagnostics::handlers::latin_and_cyrillic_symbol_in_word::matches_trailing_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":"crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda078bcdfd8ae99ca7c3688cc4157ac9e7408df5ba957380d06ef72b831fdad"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::missing_code_try_catch_ex::check_stmt_recursive (cyclomatic 19): ide_diagnostics::handlers::missing_code_try_catch_ex::check_stmt_recursive 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":"crates/ide-diagnostics/src/handlers/missing_code_try_catch_ex.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4507625f30b499f51fa4a399e0d85bd9709e8fffc2c56365f68b91b1d84b9c38"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::multilingual_string_has_all_declared_languages::check_body (cyclomatic 19): ide_diagnostics::handlers::multilingual_string_has_all_declared_languages::check_body has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"619fdd13da630bfff7e90f0de3296d4f9f42eb529758345bdc180a059dbfbb07"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::nested_function_in_parameters::find_name_token_range (cyclomatic 19): ide_diagnostics::handlers::nested_function_in_parameters::find_name_token_range has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e931103a44f075e623bc86c78f9b3f44b950388cecc050efc74a9143c5da23"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::timeouts_in_external_resources::check_body_for_timeouts (cyclomatic 19): ide_diagnostics::handlers::timeouts_in_external_resources::check_body_for_timeouts has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/timeouts_in_external_resources.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0070bef7ccb1a6680af452d7e30f97f41718e29f643f36032645ae9f3d4ed0b7"}},{"ruleId":"D1","level":"warning","message":{"text":"DiagnosticsState::retry_holes_in (cyclomatic 19): DiagnosticsState::retry_holes_in has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/drift.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89a08d1578544555db027a053913c01b50c53ceb2252ab888c28f2c351c6ffa"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphState::recovery_proof_with_roots (cyclomatic 19): GraphState::recovery_proof_with_roots has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/snapshot.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5a296841cb006621471b45bb3db076f55edac4cf6cbdcc6654532f9b3077a4"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::tools::search::docs::search_docs (cyclomatic 19): mcp_server::tools::search::docs::search_docs has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/docs.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d31f1858e11a00cccd7073af9406e07f8e29a51005c9668a336e39b7aa4ee27"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::tools::search::lexical::lexical_code_hits (cyclomatic 19): mcp_server::tools::search::lexical::lexical_code_hits has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e806d4deb19944ab87397bda7d8c8733c8b3f1fda3057cccedb683121f4d357b"}},{"ruleId":"D1","level":"warning","message":{"text":"parser::grammar::sdbl::expressions::primary_expr (cyclomatic 19): parser::grammar::sdbl::expressions::primary_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":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"d943ffd6c663b5d0311244c8ed96ab5533f9b2b6853246802b0393d8be50d407"}},{"ruleId":"D1","level":"warning","message":{"text":"SdblPackage::collect_expr_diagnostics (cyclomatic 19): SdblPackage::collect_expr_diagnostics has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: FunctionKind::name_ru (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"314d44e584f93549ec32c68b97726a772be89e9d4fa74abb9b203da586546865"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::extract_limitations (cyclomatic 19): LoweringContext::extract_limitations has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/select_fields.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf30171c9bca06d5cab2c56b0e6980457e35b480b561c353def5c70e7e86aa9"}},{"ruleId":"D1","level":"warning","message":{"text":"sdbl_hir::hir::collect_expr_tables (cyclomatic 19): sdbl_hir::hir::collect_expr_tables has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: FunctionKind::name_ru (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12d5c822abb3e2bc75d46b4cf3998de4e56caeaaeb1fd17ddeae74577dc5482"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::bin::cli::rules::export_rules (cyclomatic 18): bsl_analyzer::bin::cli::rules::export_rules has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/rules.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"77745103ee8262f3648053b81e27c144796b0c60485f6da25d57960ddd21ce7b"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::server::handle_vfs_msg (cyclomatic 18): bsl_analyzer::server::handle_vfs_msg has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b575d6c2b8b5c5655bfc15aecbcfabcfa28afce218a153ac80a935bf13db4ff"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_check_executor::native_check::profile::recover_process_group (cyclomatic 18): bsl_check_executor::native_check::profile::recover_process_group has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":3307}}}],"partialFingerprints":{"codehealthFindingId/v1":"72596f13842d716075044dc82ab50c0b58f2bfaa02d973450e0b7f7bec993b58"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_debug::types::responses::parse_call_stack (cyclomatic 18): bsl_debug::types::responses::parse_call_stack has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/responses.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a2e0fa1c539d90f2edfb671711c1fe286051536c94fc3661c1d8da16a88db3"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_debug::types::responses::parse_eval_result (cyclomatic 18): bsl_debug::types::responses::parse_eval_result has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/responses.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"d186e6e16f446dccee5fd98f59a5307f5e4144861ebec1a93d120c91a49dd0cc"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchEngine::run_fenced_embedding_pass (cyclomatic 18): SearchEngine::run_fenced_embedding_pass has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d12e72341bad662aa21e858c3cbad814f32387e11d579f0bfa34738cc7001e"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceOverlayCache::plan_full_refresh_from_manifest_scanned_with_embedder (cyclomatic 18): WorkspaceOverlayCache::plan_full_refresh_from_manifest_scanned_with_embedder has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"975fb1a94579d80be6521bb64e7c23ed18000233601037877ebef332abefef85"}},{"ruleId":"D1","level":"warning","message":{"text":"MetricsVisitor::visit_expr (cyclomatic 18): MetricsVisitor::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":"crates/hir-def/src/metrics.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"784d12bc1f22220be2399f97e4ef50e3d63f69023bceb0f955cf4e8499bec2d9"}},{"ruleId":"D1","level":"warning","message":{"text":"MetricsVisitor::count_extras_only (cyclomatic 18): MetricsVisitor::count_extras_only has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/metrics.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf75cef8cb09b1208d6f8e46b108f27b123792145b96a4361777a9632c496ff"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::body::lower::collect_referenced_externals::collect_declared (cyclomatic 18): hir_def::body::lower::collect_referenced_externals::collect_declared has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/mod.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7f711dad944cd0b5577c57f4159384811e29a9e3a26aa64c4b2ff5cccf870f"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::docs::parse_method_docs (cyclomatic 18): hir_def::docs::parse_method_docs has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd413e13bb3b1ce258b1eee2e952b05c58505816c35f23b3a5326f63dbf9849"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::docs::see_reference_ranges (cyclomatic 18): hir_def::docs::see_reference_ranges has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"12773b9666721abc872f820d9c95f7693a59ddbb48e9ba83a41b963e0b2b2038"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::ty::doc_types::parse_method_doc_types (cyclomatic 18): hir_def::ty::doc_types::parse_method_doc_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":"crates/hir-def/src/ty/doc_types.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab36145af9ffe6fb1d10b0e469a90aa49a546f7bbd1caec0d0d49b2cb9b7952e"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::completion::type_string_completion::type_string_completions (cyclomatic 18): ide::completion::type_string_completion::type_string_completions has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/type_string_completion.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f4190ee1b65f9f9566441cf905fc65ac2774700d39c7ddb64171abdc2b44c0"}},{"ruleId":"D1","level":"warning","message":{"text":"RootDatabaseImpl::resolve_common_module_files_for_file (cyclomatic 18): RootDatabaseImpl::resolve_common_module_files_for_file has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b54513251f0808942d8201c0b627aa4644b6815386200ccd39d8c0b85317db7"}},{"ruleId":"D1","level":"warning","message":{"text":"ExternalBaselineService::indexing_publication (cyclomatic 18): ExternalBaselineService::indexing_publication has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/baseline.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7dceb58472d1e8106dc9c83a8053a538661098d5b56be602b5e60812a81777"}},{"ruleId":"D1","level":"warning","message":{"text":"DiagnosticsState::apply_metadata_and_body_drift (cyclomatic 18): DiagnosticsState::apply_metadata_and_body_drift has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/drift.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6eaad430e4baf7f4d8894c225b2c5eda4660660c4bbc2e50437995ae32294b9"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedState::prepare_search_drift (cyclomatic 18): SharedState::prepare_search_drift has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/sync.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"87996fef277188ffdc7755e193b6ee50ddd03e7a43eba886a84d7b683452b627"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::drift_classify::classify_drift (cyclomatic 18): mcp_server::drift_classify::classify_drift has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/drift_classify.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9c8243dff3beac2982d9259780448a43369f0e73aac8c200ff6c464e2fae89"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::graph_db::local_metadata_delta (cyclomatic 18): mcp_server::graph_db::local_metadata_delta has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"4927a8ab5d363c0aa4ed5099f90bd2db5854cdb429bbcdda4aeac2885c80d4e7"}},{"ruleId":"D1","level":"warning","message":{"text":"parser::grammar::preproc_content (cyclomatic 18): parser::grammar::preproc_content has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"74196f79cb297772e82bba9a5e181fe85a85aac69d7d66eee22fcfb8c12a2e93"}},{"ruleId":"D1","level":"warning","message":{"text":"project_model::parse_dotenv_value (cyclomatic 18): project_model::parse_dotenv_value has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab6cbe1bb41cbe63ec904cc2e047c7d5bf859970aeeda8f0c8fc7bf1b88e710"}},{"ruleId":"D1","level":"warning","message":{"text":"SdblHir::collect_resolved_attributes (cyclomatic 18): SdblHir::collect_resolved_attributes has cyclomatic complexity 18 (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. This is NOT this file\u0027s highest cyclomatic complexity: FunctionKind::name_ru (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d0e82fd701feb2a3a3b8cfe2e9bc86457c6c4ba49ceeb7f8d5dbdae0f1cf16"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_totals_by_clause (cyclomatic 18): LoweringContext::lower_totals_by_clause has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/clauses.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa910ee9989233437e5d7c62f6a68bf3768726a14e24261abfca055fd2c18534"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_literal (cyclomatic 18): LoweringContext::lower_literal has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: LoweringContext::lower_expr (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/expr/mod.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1def669bbe4e6a2058be17d5829009b8d2acd33f9d42a30b0b3d4dd58aaaf3b6"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::resolve_table (cyclomatic 18): LoweringContext::resolve_table has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffce0122905d2385a4c5c97ec027bb93adfdc5b0411d9177ef0b1b8ab09e773"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceSetArgs::resolve_extensions (cyclomatic 17): SourceSetArgs::resolve_extensions has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/source_set.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"df032aad2cc3b193dd74392d97cde47b175a40cd320bcfb688785c7d987aa7ec"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::bin::cli::mcp::validate_serve_args (cyclomatic 17): bsl_analyzer::bin::cli::mcp::validate_serve_args has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/mcp.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0504f35833ba9d49563d0300d477fcce43d4c7483ac8d3d78f606d19fa9b31"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::handlers::request::handle_code_action (cyclomatic 17): bsl_analyzer::handlers::request::handle_code_action has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"513b1a1f02f4228630f4cfd389536f3b713bd76d1a6ef6a09db07cde05e545e9"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_check_executor::native_check::profile::cleanup_owned_jobs (cyclomatic 17): bsl_check_executor::native_check::profile::cleanup_owned_jobs has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":3060}}}],"partialFingerprints":{"codehealthFindingId/v1":"0418436eac17e79d52e4507c0a4def19d257564c58b57bc9fb11fee5bc7c9d30"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_check_executor::native_check::runtime::parse_connection_identity (cyclomatic 17): bsl_check_executor::native_check::runtime::parse_connection_identity has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/runtime.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d0407f9b087bdc475e15f3d07d011a901161b366ab0a48fd54373472714eb1"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_check_executor::native_check::source::parse_configuration_boolean (cyclomatic 17): bsl_check_executor::native_check::source::parse_configuration_boolean 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. This is NOT this file\u0027s highest cyclomatic complexity: bsl_check_executor::native_check::source::metadata_collection_directory (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea2476dfb639f27f900c8466ea2c59db566035d92ed6d19929576965c67a7de"}},{"ruleId":"D1","level":"warning","message":{"text":"DebugSession::handle_event (cyclomatic 17): DebugSession::handle_event has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/session.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b25fb3d9f6a5949158e20671b225bf27e6c53e14ef25751dff0474ca38b75a"}},{"ruleId":"D1","level":"warning","message":{"text":"Configuration::build_caches (cyclomatic 17): Configuration::build_caches has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/configuration.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b8c177a0c3483df74ea5029657f2ef48162347e1853fd7426ddefc79c7c2dc"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_platform::db::apply_docs_gap_member_context_overlay (cyclomatic 17): bsl_platform::db::apply_docs_gap_member_context_overlay has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/db.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb48dee875dd0ae0b2a58182b922248bfe9cfc74396499fcfde6ad19ef5098b"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_platform::snapshot::check_kind (cyclomatic 17): bsl_platform::snapshot::check_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":"crates/bsl-platform/src/snapshot.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5065a4cd3c75e15431c78ba02d58f4c1d4b96521884bdef7cb76d0039aaa1e1c"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchEngine::embed_documents (cyclomatic 17): SearchEngine::embed_documents has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":3266}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9b247511ec9ba99540c5d7af68551581e4e9631a7a942a57c4f9ee5d3dfc69"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchEngine::apply_staged_workspace_roots_transition (cyclomatic 17): SearchEngine::apply_staged_workspace_roots_transition has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":3743}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b16233d41149e0da77fd982604ea41a4cca40e4d89f06dc06387b6eebc70c7"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchEngine::embed_missing_overlay_chunks (cyclomatic 17): SearchEngine::embed_missing_overlay_chunks has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":5679}}}],"partialFingerprints":{"codehealthFindingId/v1":"968730a18cd8f0bc3e9372a26af69d01cfda659e34c9a3325e9c39ba28c18cb7"}},{"ruleId":"D1","level":"warning","message":{"text":"DataflowSolver::solve_backward (cyclomatic 17): DataflowSolver::solve_backward has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/lib.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed0b7761721501ca8f0ad5471b0bd0c4266888b9c537e778a9f0d3a21458437"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::body::lower::expr::lower_literal (cyclomatic 17): hir_def::body::lower::expr::lower_literal has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c046bb98d6b8d9e1e2ade6434ba0da7c8c758bef8d2927d61f2b90c3c35c45"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::graph_index::resolve_summary_via_index (cyclomatic 17): hir_def::graph_index::resolve_summary_via_index has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e32348ec51ba6b2c1d7c55cf1c16549d4e2a5673ba41923a4d5bf4bf01b414"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::field_lookup::lookup_field_raw (cyclomatic 17): hir_ty::field_lookup::lookup_field_raw has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/field_lookup.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6542d95e4620b0169ee5e8d69e20a7626d516e0aa194607e854628488746a67"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::partitioned_diagnostics_baseline::classify_partitioned_diagnostics_with (cyclomatic 17): ide::partitioned_diagnostics_baseline::classify_partitioned_diagnostics_with has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"078485ef007d31620767cd731d6179318ca6a315e54c2e1537acd0a1af451c1f"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::syntax_highlighting::highlight_name_semantic (cyclomatic 17): ide::syntax_highlighting::highlight_name_semantic has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: HlTag::as_str (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b8f3869921dfea728092eb3b7c654fc2404c63b9be994b1d4af8d8801db66e"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_db::metadata::build_module_metadata (cyclomatic 17): ide_db::metadata::build_module_metadata has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d86c1e29d12ed3ebbf62197fa86984524ed17635c9f2daea4f4f64e9c93cc23"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::redundant_access_to_object::from_hir (cyclomatic 17): ide_diagnostics::handlers::redundant_access_to_object::from_hir has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ide_diagnostics::handlers::redundant_access_to_object::get_plural_collection_name (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/redundant_access_to_object.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"876a6adf39e644ccd05253a83f2eb649b25c18eb75e238bc41f42537b77f0a49"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::using_hardcode_network_address::check_body_literals (cyclomatic 17): ide_diagnostics::handlers::using_hardcode_network_address::check_body_literals has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_hardcode_network_address.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccb12ca015c9ade26de04fc115cd2bb5563f19dd19eda6dbb855944144c9f0c"}},{"ruleId":"D1","level":"warning","message":{"text":"DiagnosticsBaselineSnapshot::load_once (cyclomatic 17): DiagnosticsBaselineSnapshot::load_once has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97fa5bece482999b1f8a5b21ba3b9cce685382e4e411ca378991de252af0d79"}},{"ruleId":"D1","level":"warning","message":{"text":"Watch::arm_within (cyclomatic 17): Watch::arm_within has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15b4ae71d09558fd4b8e2c5235fcfe7c5477f52bb13e8fce1886296bddc08ea"}},{"ruleId":"D1","level":"warning","message":{"text":"HubInner::ingest_event (cyclomatic 17): HubInner::ingest_event has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6374bb153b34655d17ef823e319ee7192fb2212b217d471ca4943d640551c6"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphDebt::finish_probe (cyclomatic 17): GraphDebt::finish_probe has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/debt.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcea851382778886df6f55f06e85d5879455e823f00558931ac7a34ef4dc064"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphState::invalidate_scan_on_hub_drift (cyclomatic 17): GraphState::invalidate_scan_on_hub_drift has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/snapshot.rs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8dd8ce269478503fd54af31fa3c4a789f79115e79b9849e3cbab491e3022cd0"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphDb::resolve_stored (cyclomatic 17): GraphDb::resolve_stored has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_query.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"e954c486b816592d1216f9281ecef9166985c4bca5c794f1283c858217c30264"}},{"ruleId":"D1","level":"warning","message":{"text":"McpServer::metadata (cyclomatic 17): McpServer::metadata has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"278c9637cc0ce8c8eb4a7f760db78515881264d74066043d7843824320ee477a"}},{"ruleId":"D1","level":"warning","message":{"text":"Owner::round (cyclomatic 17): Owner::round has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/overlay_backlog.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e79116820cf9249fc831d4ee5c1ede4eaa814340056e15da79db1ab345002a5"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::broker::daemon::serve (cyclomatic 17): mcp_server::broker::daemon::serve has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/broker/daemon.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c488f34503b08225d06a84565917222c0317dbaa5b92d24fa780ea407d3e89"}},{"ruleId":"D1","level":"warning","message":{"text":"parser::reparse::reparse_method_guarded (cyclomatic 17): parser::reparse::reparse_method_guarded has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/reparse.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a4106b9bb1fc89e8af1cc8cb1c39844196b054da250edad5a9ccdd3110b446"}},{"ruleId":"D1","level":"warning","message":{"text":"NotifyActor::classify_event_path (cyclomatic 17): NotifyActor::classify_event_path has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b469759509f53a6f134c90bcab8309789de4ef21bf5491ed92aeade124c64e"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceSetArgs::resolve_externals (cyclomatic 16): SourceSetArgs::resolve_externals has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/source_set.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"9091ce1e003b847fa297686297161bdcfa5c0bfe6614ac5c69e67b66c537145e"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::bin::cli::diagnostics_baseline::validate_set_for_repair (cyclomatic 16): bsl_analyzer::bin::cli::diagnostics_baseline::validate_set_for_repair has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"9833c1edaf986ae649ec5af0ca78c6878831f0758aa1241d04c29707e8ca8389"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::bin::cli::logging::journal::append_locked (cyclomatic 16): bsl_analyzer::bin::cli::logging::journal::append_locked has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/logging/journal.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f5dad2e244a6b3078975cf8aa678b6394a5c3810a077280f518fae46ebb9a7"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::handlers::notification::handle_did_save (cyclomatic 16): bsl_analyzer::handlers::notification::handle_did_save has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/notification.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4c67ed0622581352cb57a82919acd27fab6da697dd60a12bb99de47ddcea5a"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_analyzer::server::handle_latency_request_finished (cyclomatic 16): bsl_analyzer::server::handle_latency_request_finished has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc6907eb3a387b40758cf5fa3fd8a0d16377b8cdf5c2a9049ad112da34847b9"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_metadata::vendor_support::tokenize (cyclomatic 16): bsl_metadata::vendor_support::tokenize has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/vendor_support.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"549ade9313e017e08585904bdbd1f5f2a665bf1e3f2cde78445562fc140b4858"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_metadata::xml_parser::form::parse_form_xml (cyclomatic 16): bsl_metadata::xml_parser::form::parse_form_xml 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":"crates/bsl-metadata/src/xml_parser/form.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5be9bf74886828f0b6e6e4e7222cb07b65063b85f1d276bdedf0035028a2c0a"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_metadata::xml_parser::standard_attributes::build_attr_type (cyclomatic 16): bsl_metadata::xml_parser::standard_attributes::build_attr_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":"crates/bsl-metadata/src/xml_parser/standard_attributes.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"424df384a4a6acbfc63c68f21ebffa8909753ba6b294d8314c84b0da2081f1e7"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceOverlayCache::finish_publication (cyclomatic 16): WorkspaceOverlayCache::finish_publication has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31dc669a5f243e4b28dcf3d01d1cbbb8592bbdc55bb884dc3fb1abee6f25cb4"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceOverlayCache::plan_full_refresh_from_local_scanned_with_embedder (cyclomatic 16): WorkspaceOverlayCache::plan_full_refresh_from_local_scanned_with_embedder has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7f09b1313902867538f979ec5ee1c9dfdd3cd4725ec23302f4c09f1736aa4d"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkspaceOverlayCache::apply_plan_in_memory (cyclomatic 16): WorkspaceOverlayCache::apply_plan_in_memory has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9194910550dbdf993ceba72b99434f180188d4c03d2e21941b68a4fc004ca4bd"}},{"ruleId":"D1","level":"warning","message":{"text":"bsl_search::hybrid::fuse_smart (cyclomatic 16): bsl_search::hybrid::fuse_smart has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/hybrid.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc558fcee9ec3bfb0d545ddc374cf513562fa569819dd160d2e1534150782cba"}},{"ruleId":"D1","level":"warning","message":{"text":"DefinitionIndex::from_body_with_params (cyclomatic 16): DefinitionIndex::from_body_with_params has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/reaching_defs.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"0494afe4dd657fe65b8a6f5813a70803ed85bae36dfdeb7e7fd96da79993dae6"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::body::lower::expr::compare_template_and_params (cyclomatic 16): hir_def::body::lower::expr::compare_template_and_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. This is NOT this file\u0027s highest cyclomatic complexity: hir_def::body::lower::expr::lower_expr (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"310ef2ceda3ec88a3bacdac81dd6f3abc5149e502b5f30b2cf24205343f785a5"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::body::lower::query_fragment::is_substitution_source (cyclomatic 16): hir_def::body::lower::query_fragment::is_substitution_source has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/query_fragment.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d3b493bfdcc62a7e4c3c9d0ac0bc47789db516d6655d8105b2c754ce31b15d"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::body::lower::query_fragment::completion_after (cyclomatic 16): hir_def::body::lower::query_fragment::completion_after has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/query_fragment.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f80af8cebacd85720c5a259c70d535b98fc830b5741b9fe44054ddef51ed95"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::body::lower::stmt::lower_assign_stmt (cyclomatic 16): hir_def::body::lower::stmt::lower_assign_stmt has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: hir_def::body::lower::stmt::lower_stmt (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/stmt.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"987c0303aaab7cb4959a55830e3a3989a3c0f3e78b55f2befea00cb225a6fa14"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_def::metrics::count_logical_ops::walk (cyclomatic 16): hir_def::metrics::count_logical_ops::walk has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/metrics.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"9120558e582c46cdc62f3add3bcf0d52561301c9dba3a987db214602a4f6a07c"}},{"ruleId":"D1","level":"warning","message":{"text":"hir_ty::structure_keys::invalidate_expression_escapes (cyclomatic 16): hir_ty::structure_keys::invalidate_expression_escapes has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/structure_keys.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6729f7594f26988e1c65e5066b2863ff22d0f7aca813d28aa5d551ce24a64c"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::completion::platform_completion::collect_platform_items (cyclomatic 16): ide::completion::platform_completion::collect_platform_items has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/platform_completion.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"7938eac0ff43a57990b3fde548948515851064dd1577a9ddbe6939d7a2cb195c"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::formatting::ir::decide_inline_gap (cyclomatic 16): ide::formatting::ir::decide_inline_gap has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/formatting/ir.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e313651338792364b72f17c2a8222bed3042790c2b9cd55b516e9b8b6c3457"}},{"ruleId":"D1","level":"warning","message":{"text":"ide::graph::classify_graph_id (cyclomatic 16): ide::graph::classify_graph_id has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":3067}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ef58ca6cc82bc95a807c8d775afaa269103519be56f5d07af6e9af99130dd0"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::config::parsed_override (cyclomatic 16): ide_diagnostics::config::parsed_override has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/config.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8d82643bdb52e88306b07ce032e76d65c79e2ce6c4524c5511c1eec3938524"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::identical_expressions::check_preprocessor_split_expressions (cyclomatic 16): ide_diagnostics::handlers::identical_expressions::check_preprocessor_split_expressions has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ide_diagnostics::handlers::identical_expressions::expr_to_string (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/identical_expressions.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bb47d51927a8cba33e7ca4969df1726b746ab911d39963b7b14cfc2b9643c7"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::incorrect_use_of_str_template::compare_template_and_params (cyclomatic 16): ide_diagnostics::handlers::incorrect_use_of_str_template::compare_template_and_params has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46dcee79e80144dac3623a64fa9f8461f28a7e76dc560ead7dce377756ecff8"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::object_modified_in_on_write::check_body (cyclomatic 16): ide_diagnostics::handlers::object_modified_in_on_write::check_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":"crates/ide-diagnostics/src/handlers/object_modified_in_on_write.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"499ab84b9436cf8f6b3704ba8a5b768360de5708dbe96834961b19cc028c618e"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::unused_local_method::remove_method_fix (cyclomatic 16): ide_diagnostics::handlers::unused_local_method::remove_method_fix has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_method.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f04f0785dd9020efee42c90b2606c0b1004913b5c4e94df554e0050333ae709"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::handlers::using_service_tag::check_default_tags (cyclomatic 16): ide_diagnostics::handlers::using_service_tag::check_default_tags has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_service_tag.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"490ee6328ab2e9ad7e2feba028b05eae2f4d925cb450c53bc6d18e14623637e8"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_diagnostics::utils::nstr::extract_language_keys (cyclomatic 16): ide_diagnostics::utils::nstr::extract_language_keys has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/utils/nstr.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ec4edf2fd345112b2a3b3941ffc4df969187feec5754acab50aeb6d9004d85"}},{"ruleId":"D1","level":"warning","message":{"text":"ide_host_core::load::apply_source_batch_cancellable (cyclomatic 16): ide_host_core::load::apply_source_batch_cancellable has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/load.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a092c1964dd23e4c8c821004fa9a54240f3ac1848837dd13f88a700761ff40cb"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedState::workspace_with_cache_and_prefixes_impl (cyclomatic 16): SharedState::workspace_with_cache_and_prefixes_impl has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"838e06bed21c4eaabba0d11cbdf9e3c5945815277a85090796c1db0ef5e303d4"}},{"ruleId":"D1","level":"warning","message":{"text":"OverlayRetry::run_pass (cyclomatic 16): OverlayRetry::run_pass has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/overlay_retry.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a2481260ec3e0c72dfbd05f60777377a1a0732b6bc1f8478be9fb5a33bee64"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp_server::tools::check_executor::execute (cyclomatic 16): mcp_server::tools::check_executor::execute has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/check_executor.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e7f7706c3f0d62a0cd45cd7f1a5112fbb4fdbf8de8bf09d2d13ead339206d7"}},{"ruleId":"D1","level":"warning","message":{"text":"Project::diagnostics_baseline (cyclomatic 16): Project::diagnostics_baseline has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7838a4a0bb0a103848a39fa84f1478310f045a6644769d0ba9d9b08d705be10"}},{"ruleId":"D1","level":"warning","message":{"text":"Scope::resolve_nested_field_type (cyclomatic 16): Scope::resolve_nested_field_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":"crates/sdbl-hir/src/scope.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b23be351c473daac567a672da89d3d56055380d21af1876a961fd6c6c08cc9"}},{"ruleId":"D1","level":"warning","message":{"text":"sdbl_hir::lower::lower_sdbl_to_hir_with_resolver (cyclomatic 16): sdbl_hir::lower::lower_sdbl_to_hir_with_resolver has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca000c0617b9a48cac23ccfdbb4130214744460245419a0471a90d60c13fbbf6"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_acceptance.wait_ready (cyclomatic 16): runtime_acceptance.wait_ready 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":"scripts/user2/runtime_acceptance.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fde32b8382715398d3a9413e2ca982fa0d592fffed122cc478e6ec4c0123646"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_call (cognitive 254): InferenceContext::infer_call has cognitive complexity 254 (threshold 15). Drivers by points: if/else 68 (193 pts), loops 9 (35 pts), match/switch 6 (16 pts), boolean chains 10 (nesting depth added 161). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4963}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb83e4f3d2fbb66d6a3663077a194fafdccac48acb059f111495ce47fa1625a4"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::expr::lower_call_expr (cognitive 210): hir_def::body::lower::expr::lower_call_expr has cognitive complexity 210 (threshold 15). Drivers by points: if/else 72 (191 pts), boolean chains 8, match/switch 3 (6 pts), loops 1 (5 pts) (nesting depth added 126). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1266a06eb2ac4ed26fce6cd8c1122718dcb41a2ebc329555fa706c8bbf7f616"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::analyze::analyze_salsa (cognitive 142): bsl_analyzer::bin::cli::analyze::analyze_salsa has cognitive complexity 142 (threshold 15). Drivers by points: if/else 67 (104 pts), match/switch 9 (18 pts), boolean chains 13, loops 6 (7 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46030c909be5e5b37b61a77e27c7b7e034732b2d1d0ae79610491bdcd1f6f14"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::deps::run_deps (cognitive 141): bsl_analyzer::bin::cli::deps::run_deps has cognitive complexity 141 (threshold 15). Drivers by points: if/else 57 (101 pts), loops 14 (36 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/deps.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c1b10536323e2dda68962b46ab72c72e9ac886108c8a3172d11d2e1fc9c3b4"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::search::status::search_status_with_cap (cognitive 139): mcp_server::tools::search::status::search_status_with_cap has cognitive complexity 139 (threshold 15). Drivers by points: if/else 46 (89 pts), match/switch 15 (44 pts), boolean chains 3, loops 1 (3 pts) (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":"crates/mcp-server/src/tools/search/status.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5881aef61e5af28e5e49d9c64a99b5fa0f96513e51a3afb66ba47fd80d53e9d3"}},{"ruleId":"D2","level":"warning","message":{"text":"html_parser::scraper_parser::extract_examples (cognitive 136): html_parser::scraper_parser::extract_examples has cognitive complexity 136 (threshold 15). Drivers by points: if/else 25 (117 pts), loops 4 (17 pts), boolean chains 2 (nesting depth added 105). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7d57092e72452c185de05d075e3cd7569cf5bf98d11d0d5ccdd0b1d2aa58dc"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::latin_and_cyrillic_symbol_in_word::collect_and_check (cognitive 131): ide_diagnostics::handlers::latin_and_cyrillic_symbol_in_word::collect_and_check has cognitive complexity 131 (threshold 15). Drivers by points: if/else 22 (105 pts), loops 7 (21 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 98). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"940b6429cde40beb3f7c476fe80a95b4c63830ac0fd8697be04f6fde89e4d958"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedState::spawn_embed_pass (cognitive 126): SharedState::spawn_embed_pass has cognitive complexity 126 (threshold 15). Drivers by points: if/else 37 (96 pts), match/switch 8 (22 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 75). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a449aeb3a016d8a25063bd307d76cb64ec95b52330f2e9a98555aacb715a8f7b"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::server::handle_task (cognitive 113): bsl_analyzer::server::handle_task has cognitive complexity 113 (threshold 15). Drivers by points: if/else 37 (93 pts), boolean chains 9, match/switch 4 (7 pts), loops 1 (4 pts) (nesting depth added 62). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"906032409ee5bd0809c0f241ca86d0f9c6520bcc693c51ad9fa4a034e9d9b981"}},{"ruleId":"D2","level":"warning","message":{"text":"NotifyActor::load_entry (cognitive 105): NotifyActor::load_entry has cognitive complexity 105 (threshold 15). Drivers by points: if/else 21 (55 pts), loops 10 (26 pts), match/switch 4 (18 pts), boolean chains 6 (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f87b9c5f45c4d79cf3db162a50edfec93d1315b0334be1ecfd1787a60cb3df6"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::lsp::relay_lsp (cognitive 104): bsl_analyzer::bin::cli::lsp::relay_lsp has cognitive complexity 104 (threshold 15). Drivers by points: if/else 14 (59 pts), match/switch 8 (28 pts), loops 5 (14 pts), boolean chains 3 (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":"crates/bsl-analyzer/src/bin/cli/lsp.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"764bcd002b935c243d70107748d0b31e216b9e1051c99d459bad04c5d36339c3"}},{"ruleId":"D2","level":"warning","message":{"text":"NotifyActor::run (cognitive 103): NotifyActor::run has cognitive complexity 103 (threshold 15). Drivers by points: if/else 16 (63 pts), loops 5 (22 pts), match/switch 4 (16 pts), boolean chains 2 (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":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de6f7873664927f9347ddbfcee59c99e93a127f9d7301c6fed56cc6c96d7fd7"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::using_hardcode_secret_information::check_body_exprs (cognitive 100): ide_diagnostics::handlers::using_hardcode_secret_information::check_body_exprs has cognitive complexity 100 (threshold 15). Drivers by points: if/else 18 (87 pts), loops 3 (7 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 76). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_hardcode_secret_information.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"540bb87af024105203e57638d510766562116799f6aa05be9584a8885d0888b2"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedState::spawn_search_sink (cognitive 94): SharedState::spawn_search_sink has cognitive complexity 94 (threshold 15). Drivers by points: if/else 27 (74 pts), match/switch 5 (15 pts), boolean chains 3, loops 2 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/sync.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"d333cbf77c7ebf08d5b44d559ef53683c96fc984ad175036a0f5b1ace6cdbe1f"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::structure_keys::collect_structure_shapes (cognitive 93): hir_ty::structure_keys::collect_structure_shapes has cognitive complexity 93 (threshold 15). Drivers by points: if/else 20 (83 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 67). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/structure_keys.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28a7867bb4b5898a7fc2bc12bf4c05e13fb1c33db96c0deb9e4fbe0e74a2bc7"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_expr (cognitive 91): InferenceContext::infer_expr has cognitive complexity 91 (threshold 15). Drivers by points: if/else 23 (52 pts), match/switch 8 (20 pts), boolean chains 13, loops 3 (6 pts) (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":3971}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5ed4a573fe7c0bfae84c105889ebf61189ba1fec4f3f843bb5494c8d84ef5c"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::resolve_bare_name (cognitive 88): InferenceContext::resolve_bare_name has cognitive complexity 88 (threshold 15). Drivers by points: if/else 42 (71 pts), boolean chains 17 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4410}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c75d4c401783906c8a578c4e82e388ad0251e05af7e8e9888436e99ecc17ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchEngine::index_directory (cognitive 87): SearchEngine::index_directory has cognitive complexity 87 (threshold 15). Drivers by points: if/else 26 (56 pts), match/switch 7 (16 pts), loops 8 (14 pts), 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":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ce530a3dd4c4f52efe1bdda5a033001745e216349682505084e935e9ce8971"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceOverlayCache::full_refresh_from_manifest_scanned (cognitive 86): WorkspaceOverlayCache::full_refresh_from_manifest_scanned has cognitive complexity 86 (threshold 15). Drivers by points: if/else 24 (64 pts), match/switch 4 (13 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 51). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c9eebc9389c9a00c4291c3f4a31c9e223664cad87fcc1029921bdca898dc9b"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedState::workspace_indexing (cognitive 85): SharedState::workspace_indexing has cognitive complexity 85 (threshold 15). Drivers by points: if/else 31 (43 pts), match/switch 10 (34 pts), boolean chains 8 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/mod.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8caf0ab80ec7c739b009830964a766e3975b923676dfe0712122fdaadaa055d"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::server_calls_in_form_events::bfs_find_server_calls (cognitive 83): ide_diagnostics::handlers::server_calls_in_form_events::bfs_find_server_calls has cognitive complexity 83 (threshold 15). Drivers by points: if/else 16 (67 pts), loops 4 (9 pts), match/switch 1 (4 pts), boolean chains 3 (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":"crates/ide-diagnostics/src/handlers/server_calls_in_form_events.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"de41655a9d47d55f6f1b464c2d81b5ca1ccb2f71fcb68eeeb074041eef541737"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedState::init_workspace_search_engine (cognitive 83): SharedState::init_workspace_search_engine has cognitive complexity 83 (threshold 15). Drivers by points: if/else 35 (52 pts), match/switch 11 (30 pts), 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":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a2a06216a1036390e1c109d067de6a6a87f5e714351ee3041958a63d809834"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::extract_limitations (cognitive 82): LoweringContext::extract_limitations has cognitive complexity 82 (threshold 15). Drivers by points: if/else 11 (63 pts), loops 5 (17 pts), boolean chains 2 (nesting depth added 64). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/select_fields.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37ae7d7d08f4942d419b7d05c26894d20fdf268d730613f56ec32b3562184dc"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::profile::run_native_check (cognitive 81): bsl_check_executor::native_check::profile::run_native_check has cognitive complexity 81 (threshold 15). Drivers by points: if/else 33 (52 pts), loops 10 (19 pts), boolean chains 5, match/switch 5 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c4655d3456c1ccf5d387620f9a9facb2dc4d5b80ceec84febc52e996283b50"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::broker::daemon::serve_shared (cognitive 80): mcp_server::broker::daemon::serve_shared has cognitive complexity 80 (threshold 15). Drivers by points: if/else 18 (49 pts), match/switch 6 (17 pts), loops 6 (13 pts), boolean chains 1 (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":"crates/mcp-server/src/broker/daemon.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"610d680e923a782f79609e3e6accd583a4e1e9dade5574ffa2dd2cfa30de2014"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_host_core::metadata::refresh_metadata_substrate (cognitive 79): ide_host_core::metadata::refresh_metadata_substrate has cognitive complexity 79 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 16 (27 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/metadata.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e099e0d090fbb551639eebd3d62384980de3be32825ed415eda3e5e5e6d7e4a"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_host_core::metadata::bootstrap_metadata_substrate (cognitive 78): ide_host_core::metadata::bootstrap_metadata_substrate has cognitive complexity 78 (threshold 15). Drivers by points: if/else 15 (41 pts), loops 18 (31 pts), match/switch 2 (6 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/metadata.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00bdc2e326df361327f69629a6f671ffd36c85a4e2a3c67fda8d2086bf8f987"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchEngine::refresh_dirty_contexts_fenced (cognitive 76): SearchEngine::refresh_dirty_contexts_fenced has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (37 pts), match/switch 10 (28 pts), loops 5 (8 pts), 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":"crates/bsl-search/src/engine.rs"},"region":{"startLine":4766}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edec711662ea927412de865ad3ad01468397b0d6b49a79a9dfa22b402097537"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_stmt (cognitive 76): InferenceContext::infer_stmt has cognitive complexity 76 (threshold 15). Drivers by points: if/else 22 (55 pts), match/switch 5 (11 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":3619}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1aee2796ec64ec8d4b8a737ba18514f1eb5df63f4668ceeb019bc17452b9670"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::process_changes (cognitive 74): GlobalState::process_changes has cognitive complexity 74 (threshold 15). Drivers by points: if/else 30 (53 pts), boolean chains 11, loops 3 (8 pts), match/switch 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/workspace.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5bb787312b197e754e5c2f4f5cc541f4b3f28139bcce10ea09cdc0cb686f26"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::server::handle_loader_msg (cognitive 74): bsl_analyzer::server::handle_loader_msg has cognitive complexity 74 (threshold 15). Drivers by points: if/else 14 (43 pts), loops 7 (22 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 45). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac4ce7cfe6e23d1d4ef65d374a2afd4fea3e26b2ac64e83ef150df771c21d1b"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_debug::types::events::parse_ping_events (cognitive 71): bsl_debug::types::events::parse_ping_events has cognitive complexity 71 (threshold 15). Drivers by points: if/else 16 (38 pts), match/switch 8 (28 pts), loops 2 (5 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/events.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ea3be6e0be39be2d32578a5a64e1266947ec7f494d5dadef09c4459e3eea3d"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::completion::platform_completion::platform_completions (cognitive 71): ide::completion::platform_completion::platform_completions has cognitive complexity 71 (threshold 15). Drivers by points: if/else 24 (52 pts), loops 5 (15 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/platform_completion.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b96f7af5c7a10a22a171d9e01c6b4af983956aba34127e58b34a3f32c1c625"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::pairing_broken_transaction::dfs_check_paths (cognitive 67): ide_diagnostics::handlers::pairing_broken_transaction::dfs_check_paths has cognitive complexity 67 (threshold 15). Drivers by points: if/else 17 (37 pts), match/switch 4 (13 pts), loops 6 (12 pts), boolean chains 5 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/pairing_broken_transaction.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"1219b43baf9b15067c76b460100ad5720afd758b46e4814dc61285bea9bfef74"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::build_accounting_register_table (cognitive 67): LoweringContext::build_accounting_register_table has cognitive complexity 67 (threshold 15). Drivers by points: loops 16 (43 pts), if/else 6 (13 pts), match/switch 4 (8 pts), boolean chains 3 (nesting depth added 38). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/register_tables.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f84fc79e4fe538fd52af0fcd36caa80a1290c405cf7e5d5d8ea2d5ca14213c"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::sdbl::expressions::column_or_function (cognitive 66): parser::grammar::sdbl::expressions::column_or_function has cognitive complexity 66 (threshold 15). Drivers by points: if/else 20 (52 pts), boolean chains 9, loops 2 (5 pts) (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"402ba788fa268224d0add11bcc16dd411f02d7b50643a6aacce626fa2ba3d0ef"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::unused_parameters::check (cognitive 65): ide_diagnostics::handlers::unused_parameters::check has cognitive complexity 65 (threshold 15). Drivers by points: if/else 20 (41 pts), loops 13 (23 pts), 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":"crates/ide-diagnostics/src/handlers/unused_parameters.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cfb9fe8f966c876d6b4d3c718fef113c8cfadade63bd0beeed46f95c2f9580"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::rewrite_method_parameter::stmt_uses_binding (cognitive 64): ide_diagnostics::handlers::rewrite_method_parameter::stmt_uses_binding has cognitive complexity 64 (threshold 15). Drivers by points: if/else 14 (39 pts), loops 9 (20 pts), boolean chains 4, match/switch 1 (nesting depth added 36). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/rewrite_method_parameter.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cab591ddcd2b140e3d3d2b6833fcdaab8da6f86ab595cce2621f7e555b13ce"}},{"ruleId":"D2","level":"warning","message":{"text":"NaparnikHttpClient::read_chat_sse (cognitive 64): NaparnikHttpClient::read_chat_sse has cognitive complexity 64 (threshold 15). Drivers by points: if/else 10 (56 pts), match/switch 1 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 50). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/naparnik/src/http_client.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a7db57c7d0ec35a2852eb2876a33a1d47bbeb81fa7dc48b86f3de47239e158"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::unused_local_variable::check_method (cognitive 62): ide_diagnostics::handlers::unused_local_variable::check_method has cognitive complexity 62 (threshold 15). Drivers by points: if/else 15 (51 pts), loops 7 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_variable.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fd4a841c3816f601ba1cc159d822feda708b30663e1a185f139f283ed8036d"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphStore::checkout_with_admission_wait (cognitive 62): GraphStore::checkout_with_admission_wait has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (44 pts), match/switch 2 (10 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/snapshot.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"2104dea5bf5332b708c52e3e3eae74a3ae54f13d1b7e26d779d2916f741db709"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::sdbl::select::recover_field_to_alias_or_delimiter (cognitive 62): parser::grammar::sdbl::select::recover_field_to_alias_or_delimiter has cognitive complexity 62 (threshold 15). Drivers by points: if/else 25 (52 pts), boolean chains 9, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/select.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"823e9920f22b5147cef68348250cf359fd79aac494f85f188ebfe9491a3136f1"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::handlers::notification::handle_did_close (cognitive 61): bsl_analyzer::handlers::notification::handle_did_close has cognitive complexity 61 (threshold 15). Drivers by points: if/else 19 (51 pts), loops 1 (4 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/notification.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"01435a9a044125b31318a563d95975073f11a12457a225828fd51be149b07a19"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::stmt::lower_stmt_list_with_unreachable (cognitive 60): hir_def::body::lower::stmt::lower_stmt_list_with_unreachable has cognitive complexity 60 (threshold 15). Drivers by points: if/else 22 (53 pts), boolean chains 6, 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":"crates/hir-def/src/body/lower/stmt.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c54116cdea471623b57b11339871c077dae033b38253b4453c0b3806cd725c7"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::change_hub::run_hub_thread (cognitive 60): mcp_server::change_hub::run_hub_thread has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (41 pts), match/switch 5 (11 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":4678}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e4801e13f90517f3ac48820ce0e961993a9de083d27d78e4bef372cafa357d"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::sdbl::expressions::recover_to_delimiter (cognitive 60): parser::grammar::sdbl::expressions::recover_to_delimiter has cognitive complexity 60 (threshold 15). Drivers by points: if/else 25 (53 pts), boolean chains 6, loops 1 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"530e451ef44af56fa24baded2af93a40299e03ee838e40eb722a1609eff046bf"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchEngine::run_embedding_pass_owned (cognitive 59): SearchEngine::run_embedding_pass_owned has cognitive complexity 59 (threshold 15). Drivers by points: if/else 25 (38 pts), match/switch 8 (17 pts), 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":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"9476c602c23739a90f7a523b709fa0570ba0a0b571062c700792a53d97391ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::timeouts_in_external_resources::check_body_for_timeouts (cognitive 58): ide_diagnostics::handlers::timeouts_in_external_resources::check_body_for_timeouts has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (46 pts), loops 4 (8 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/timeouts_in_external_resources.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb462f1f32f8e6d68b45181cf17a5778a0c8e0a360dc3d123389b3b59391da95"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::graph_db::compute_body_patch_with_metadata (cognitive 58): mcp_server::graph_db::compute_body_patch_with_metadata has cognitive complexity 58 (threshold 15). Drivers by points: if/else 23 (43 pts), loops 5 (9 pts), boolean chains 6 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"82eda9e40de441f2d231159ffa017c60d8bf5c654df8ebe58ee278b364b0f7eb"}},{"ruleId":"D2","level":"warning","message":{"text":"PlatformDataInner::from_help (cognitive 57): PlatformDataInner::from_help has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (39 pts), loops 16 (17 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/db.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f4229089eef09e3ae7786a4786f3d4a5bf70d020d0593f66f623f0e03171a2"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::docs::tokens::doc_comment_tokens (cognitive 57): hir_def::docs::tokens::doc_comment_tokens has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (36 pts), loops 4 (13 pts), boolean chains 8 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs/tokens.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"08efe75ebf1924addf9dab7ab8470e5ce553e59125e2ee22a249dc59316c052a"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::change_hub::apply_rearm (cognitive 57): mcp_server::change_hub::apply_rearm has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (42 pts), boolean chains 6, loops 5, match/switch 2 (4 pts) (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5725}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4a078161c5f963e0e40a4dd0cc4e34c7be41b3351fdbd388d51c8a51065124"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchEngine::sync_indexed_documents_in_collection_with_embeddings (cognitive 56): SearchEngine::sync_indexed_documents_in_collection_with_embeddings has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (43 pts), loops 6 (13 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":6372}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a893ce4870365641e69d15da14fb7b4baed3c144a7fc5dd54663d3677306c86"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::sdbl::expressions::predicate_expr (cognitive 56): parser::grammar::sdbl::expressions::predicate_expr has cognitive complexity 56 (threshold 15). Drivers by points: if/else 24 (45 pts), boolean chains 8, loops 1 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e8c9b30300e5c0ab628758f11257a9157b9b62e7f88f52bc4595acf9fe64f3"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::parser::torn_if::walk (cognitive 56): parser::parser::torn_if::walk has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (38 pts), match/switch 4 (11 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/parser/torn_if.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"30638c20ae5606be97f4e44dec8ebe59beb92b35ac91361767124483ef706041"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::drift_classify::classify_drift (cognitive 54): mcp_server::drift_classify::classify_drift has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (40 pts), match/switch 4 (12 pts), boolean chains 1, 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":"crates/mcp-server/src/drift_classify.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2b3579ac989632441e8eca4e538ed990a49f446ecb2ebdb2cb3bf5f5f62a70"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::diagnostics_baseline::apply_partitioned (cognitive 53): bsl_analyzer::bin::cli::diagnostics_baseline::apply_partitioned has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (34 pts), match/switch 4 (9 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 28). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed21455ba519ea4c871bddbb7e707efd674c6b12f879e5334016fc298a020064"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::diagnostics_baseline::transaction::publish_set_with_hook (cognitive 53): bsl_analyzer::diagnostics_baseline::transaction::publish_set_with_hook has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (36 pts), match/switch 5 (10 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6919d943fe744055f18c97e778bb08a8cb3370a34b1e9aadcacb34aeea492a66"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::unused_local_method::collect_called_methods (cognitive 53): ide_diagnostics::handlers::unused_local_method::collect_called_methods has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 11 (20 pts), match/switch 1 (2 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_method.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"668247d0d97a67b91a4ee5e684573c7101296c907fb2ef78488eb276e7b51385"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticsResident::workspace_aggregates (cognitive 53): DiagnosticsResident::workspace_aggregates has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (30 pts), match/switch 6 (12 pts), loops 5 (6 pts), boolean chains 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":"crates/mcp-server/src/diagnostics_state/resident.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"23519f92b57c4d3e0ff8c2c110e6fe03668fc106e0381723b29c427c8400476e"}},{"ruleId":"D2","level":"warning","message":{"text":"Project::diagnostics_baseline_partition_plan (cognitive 53): Project::diagnostics_baseline_partition_plan has cognitive complexity 53 (threshold 15). Drivers by points: if/else 20 (38 pts), loops 9 (12 pts), boolean chains 2, match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c45bff88ce008df4834a6bf542e33d9adc7616403bd6ed83cbf3159d0dd483"}},{"ruleId":"D2","level":"warning","message":{"text":"sdbl_hir::literal::map_offset_to_query (cognitive 53): sdbl_hir::literal::map_offset_to_query has cognitive complexity 53 (threshold 15). Drivers by points: if/else 23 (48 pts), boolean chains 4, 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":"crates/sdbl-hir/src/literal.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3a00bbd746cf601ba51c066fd52d403c18a205ddb51eef8cfda3a0df473114"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceOverlayCache::full_refresh_scanned (cognitive 52): WorkspaceOverlayCache::full_refresh_scanned has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (35 pts), match/switch 3 (10 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"1482ba1656adda53a145a3ddad17d2b269e8941b03ad9fd0b7963f53c4620471"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::call_graph::extract_from_body (cognitive 52): hir_def::call_graph::extract_from_body has cognitive complexity 52 (threshold 15). Drivers by points: if/else 9 (34 pts), match/switch 4 (12 pts), loops 2 (5 pts), 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":"crates/hir-def/src/call_graph.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ed643ae2375fe7acdb1bcaacbfaae8114fbd703ced447365959bd3a58243d0"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::subtype::is_assignable (cognitive 52): hir_ty::subtype::is_assignable has cognitive complexity 52 (threshold 15). Drivers by points: if/else 31 (43 pts), boolean chains 9 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/subtype.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c4bbd6a628b6afba7892b3b3c012f1cc33bcf691ecbf1c3e21c0abab2c9313"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::definite_init::collect (cognitive 51): hir_ty::definite_init::collect has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 4 (7 pts), match/switch 1 (3 pts), 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":"crates/hir-ty/src/definite_init.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"388f0c5bc01f4d013df581ab13604041f6c2c350ce413760ee933ea79ac11697"}},{"ruleId":"D2","level":"warning","message":{"text":"InsertionTracker::hash_expr_into (cognitive 51): InsertionTracker::hash_expr_into has cognitive complexity 51 (threshold 15). Drivers by points: loops 14 (39 pts), if/else 6 (9 pts), match/switch 2 (3 pts) (nesting depth added 29). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b91c89c280a3e4652646e913d42b663becdd607707876bf3cadab1cba464569"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDb::neighbors (cognitive 51): GraphDb::neighbors has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 9 (13 pts), boolean chains 6, match/switch 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_query.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"da44611dd33bb55f85d0fa4e334e470c1c2fcde0a9b5c1e30a864cf9dcf693d1"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::metadata::format_filtered_tree (cognitive 51): mcp_server::tools::metadata::format_filtered_tree has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 6 (22 pts), match/switch 1 (2 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9410e37cd1aeb24f0bbc348df683a8127afda5b5a6babfe744b24158f4e44e"}},{"ruleId":"D2","level":"warning","message":{"text":"syntax::sdbl_query::extract_sdbl_with_corrections (cognitive 50): syntax::sdbl_query::extract_sdbl_with_corrections has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 4 (10 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 28). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/syntax/src/sdbl_query.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d4eb4bfa32ab1e6a355955eb7adf4d68b36059f13a37f82159130ec712e563"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::docs::parse_parameters_with_roles (cognitive 49): hir_def::docs::parse_parameters_with_roles has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (47 pts), boolean chains 1, loops 1 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"420fa95b7ab886d4c63d077b0cc3fb878f75f97e27cb89afb12e1f2a8e05f142"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::ty::doc_types::parse_method_doc_types (cognitive 49): hir_def::ty::doc_types::parse_method_doc_types has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (43 pts), match/switch 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/ty/doc_types.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b46fc7cdf5fbc18d1dd8c1f4277790cf79557c6ac7b42c20162d5b509a9ec7a"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphCtx::neighbors (cognitive 49): GraphCtx::neighbors has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 6 (10 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"3713761a448db783d43e62df1a0d1b419bdacd53462b61a3d37a0df7f40ee794"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::diagnostics_state::resident::apply_resident_changes (cognitive 48): mcp_server::diagnostics_state::resident::apply_resident_changes has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (36 pts), match/switch 3 (8 pts), boolean chains 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":"crates/mcp-server/src/diagnostics_state/resident.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3aea8d7eec5c24cc29434dbdef1dc467497fc7f4e2249d13a94b3806e07786"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::graph_db::plan_caller_delta (cognitive 47): mcp_server::graph_db::plan_caller_delta has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 6 (14 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd513544b777822ebe01e1e701d85fe0c93236ee9ae8c61a9783bc110d32602"}},{"ruleId":"D2","level":"warning","message":{"text":"DataflowSolver::solve_backward (cognitive 46): DataflowSolver::solve_backward has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 4 (11 pts), match/switch 1 (5 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/lib.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d1c746f96897fd39ecad743db99386da9f069fe3a58d848af7bfaf526dd258"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::docs::fields::parse_fields_at_level (cognitive 46): hir_def::docs::fields::parse_fields_at_level has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (44 pts), boolean chains 1, loops 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs/fields.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2b991e824450efcc120f153526378d1040a590308e08539619a9c26527cd57"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_table_ref (cognitive 46): LoweringContext::lower_table_ref has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (38 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46d2bd217fb8c84071ebaad68c2ad2432a1bff2ab5a7dd8f4d7aefb0e0beb8f"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_acceptance.main (cognitive 46): runtime_acceptance.main has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 8, error handling 2 (5 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user2/runtime_acceptance.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b296b8fee995bfd3168d9251f3c0347cc61270d32d7ee47577009ca0204ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::hover::definition_to_hover (cognitive 45): ide::hover::definition_to_hover has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (38 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/hover.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de64491083f54b937ee268937d4271ea917811a1594956722b2bb1305ad6b41"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionTopology::build (cognitive 45): ExtensionTopology::build has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 8 (12 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/extension_topology.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4b627a49ce66db19de8c2b1de8a3259bdb8dbd1517de873c9946ad00b62132"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::reindex_file_in_collection_checkpointed_with_reuse (cognitive 44): Store::reindex_file_in_collection_checkpointed_with_reuse has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (31 pts), match/switch 3 (6 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e94d872b5898fe3afa6e6a7ae7055b1f3b5e93378221393f6c369b368b299b5"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticsState::refresh_saved_path (cognitive 44): DiagnosticsState::refresh_saved_path has cognitive complexity 44 (threshold 15). Drivers by points: if/else 29 (30 pts), boolean chains 8, match/switch 5 (6 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/drift.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"03018553b8222091b7681a58e7f6a8a0a806e68dc6e763a125c33ea5e1411ada"}},{"ruleId":"D2","level":"warning","message":{"text":"NotifyActor::scan_appeared_dir (cognitive 44): NotifyActor::scan_appeared_dir has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 6, loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"059477bbc99ccef3bc95ff2b501a5da630926b933ad69d60ad0297281cfe86ea"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::expr::determine_magic_number_context (cognitive 43): hir_def::body::lower::expr::determine_magic_number_context has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 9, match/switch 2 (5 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e89771701a6a1f1d63d9d8db3ffc338beb83addd3d2e3c1963a5c5b4f89563d"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::nested_function_in_parameters::find_name_token_range (cognitive 43): ide_diagnostics::handlers::nested_function_in_parameters::find_name_token_range has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (29 pts), match/switch 4 (10 pts), boolean chains 2, loops 2 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2866e664763287b4728d30bfc101f280ef29dbf52a163b113a087a79b5071c8"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::redact::redact_targeted_tracking (cognitive 43): mcp_server::tools::redact::redact_targeted_tracking has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 5 (10 pts), boolean chains 5, match/switch 1 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/redact.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5d8816da63a34cf755945121af38f89a2c96a85f506a13e1a9074b46dace0a"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_column_ref (cognitive 43): LoweringContext::lower_column_ref has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (38 pts), boolean chains 4, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/expr/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a0500ba96aeb455812eb0f10f6191962d5d4aee378d7b9a1fbe2530a6386e9"}},{"ruleId":"D2","level":"warning","message":{"text":"LspChannel::new (cognitive 42): LspChannel::new has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (27 pts), match/switch 5 (13 pts), 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":"crates/mcp-server/src/broker/transport.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33119142d78b86df120d4cd5858e08c4dbb407a2d94e7b0f52a3073d87a4b73"}},{"ruleId":"D2","level":"warning","message":{"text":"html_parser::parse_method_html (cognitive 41): html_parser::parse_method_html has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (34 pts), loops 1 (7 pts) (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"1181c3e7a1139f8f6d6cef1c2e9774b7a2ffd4107a6093de398e9b03caedd5ca"}},{"ruleId":"D2","level":"warning","message":{"text":"Record::encode (cognitive 41): Record::encode has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 6 (9 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/lifecycle.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52700ac09d1a8b4be7c5039376acd15549efdb0fdfc1f178c207c8c7b75658e"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::rewrite_method_parameter::has_unwritten_entry_path (cognitive 41): ide_diagnostics::handlers::rewrite_method_parameter::has_unwritten_entry_path has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/rewrite_method_parameter.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f2c9f8d2b1005196620560e5198844a8bd1a103c143c0470945c19e6299832"}},{"ruleId":"D2","level":"warning","message":{"text":"EditorView::catch_up_deltas (cognitive 41): EditorView::catch_up_deltas has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 5 (7 pts), boolean chains 5 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/workspace.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4849f1dcedd79ba912736535994be03a052c29a4696ad2957400508c84d795"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedState::run_overlay_warmup (cognitive 41): SharedState::run_overlay_warmup has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 10 (19 pts), boolean chains 1, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b614c1f37c6c7cd9c059e4526301695e66fcd8b94522976ac5eaa9dfdb6f829"}},{"ruleId":"D2","level":"warning","message":{"text":"Sink::finish (cognitive 41): Sink::finish has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 6 (12 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/sink.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff57d8ae82abeb0fb104f3980220990d9362c1483a967e6317560fcda9680983"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::apply_workspace_roots_transition (cognitive 40): Store::apply_workspace_roots_transition has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 7 (10 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa193b50e2cb78a624960738bc84b322ab2e8f54f16fbfd45644cc97e56b3b2"}},{"ruleId":"D2","level":"warning","message":{"text":"SlabLayout::compute_with (cognitive 40): SlabLayout::compute_with has cognitive complexity 40 (threshold 15). Drivers by points: loops 12 (20 pts), if/else 5 (11 pts), boolean chains 9 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/method_slab.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0747c6d284eace854f3d0906017e1b7b2abb679c9c233e11bb7b573ea69e88"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::expr::is_unsafe_safe_mode_context (cognitive 40): hir_def::body::lower::expr::is_unsafe_safe_mode_context has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (35 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef36aaf926c2998fc115895b12c37fe4092181d80e493e818553097ce16df43"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::graph::build_workspace_graph_rows (cognitive 40): ide::graph::build_workspace_graph_rows has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 9 (12 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e770ac12907d3e8f9c9d910301a60cd09acfee073d80ad7ac24d38a15f7296c"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::identical_expressions::check_preprocessor_split_expressions (cognitive 40): ide_diagnostics::handlers::identical_expressions::check_preprocessor_split_expressions has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 4 (8 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/identical_expressions.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9ce4c250858ca21d522d9916731992489802a781a82033d0e33c9bc3ff5aac"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::references::render (cognitive 40): mcp_server::tools::references::render has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (37 pts), 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":"crates/mcp-server/src/tools/references.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"9047d2bf3f4c77acfe51a3becdfcae52603f61c1f3306e554b0f810663780bdc"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::utils::nstr::get_assigned_variable_name (cognitive 39): ide_diagnostics::utils::nstr::get_assigned_variable_name has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (27 pts), loops 3 (11 pts), boolean chains 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/utils/nstr.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c30bc35f5cc171c27df1df9d49bc7be83d63b02a56d1b8ab41d31002753b09"}},{"ruleId":"D2","level":"warning","message":{"text":"html_parser::scraper_parser::extract_see_also (cognitive 38): html_parser::scraper_parser::extract_see_also has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (34 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee78f6167ba77a817ba9031e74a6bdabff857fcfab63378f400af3f2ca0d9ce1"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::graph_index::project_batch_form_edges (cognitive 38): hir_def::graph_index::project_batch_form_edges has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 7 (11 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e21c4275524583943666fd8ac1ad850503b5cbc13523f93c28d18ad330ba8f9"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::partitioned_diagnostics_baseline::classify_partitioned_diagnostics_with (cognitive 38): ide::partitioned_diagnostics_baseline::classify_partitioned_diagnostics_with has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 3 (8 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe6c66cfcee6f62b75d016cd5604454b626dafe8ad36e45089c26a3e02a78d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::unused_local_variable::build_attribute_names_to_skip (cognitive 38): ide_diagnostics::handlers::unused_local_variable::build_attribute_names_to_skip has cognitive complexity 38 (threshold 15). Drivers by points: loops 8 (17 pts), if/else 5 (14 pts), match/switch 4 (7 pts) (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_variable.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"82604dc9fa680f0d766888531fc764b8b88880e491fecd9864791d09c730806d"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::broker::daemon::serve (cognitive 38): mcp_server::broker::daemon::serve has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 4 (5 pts), match/switch 2 (5 pts), 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":"crates/mcp-server/src/broker/daemon.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c02a207f611fb41c28a94ee989d48168262a5431abd92dbd0b0df2c57c3b7d8"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::graph_db::write_body_patch (cognitive 38): mcp_server::graph_db::write_body_patch has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 9 (12 pts), match/switch 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe6f1a9054bd89dbeb4fd847988880d811f17f364e0406233d18f0f9be598da"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::search::semantic::semantic_code_hits (cognitive 38): mcp_server::tools::search::semantic::semantic_code_hits has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (25 pts), match/switch 8 (11 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/semantic.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a384134ceeb0de410ab5b620f7b57b300bdef6582c23f4cd86c61311a0592cb"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_totals_by_clause (cognitive 38): LoweringContext::lower_totals_by_clause has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (33 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/clauses.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9ac427d661f50ae500c3caaddaf77da4f41abe3d268a893f996ce2cd1a99e6"}},{"ruleId":"D2","level":"warning","message":{"text":"e1.main (cognitive 38): e1.main has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (10 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user2/e1.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dddaaee105370098c451c418e6a3403f4c4b6088d58b67827d4798bfe7d6c7"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedEmbeddingPublisher::publish (cognitive 37): SharedEmbeddingPublisher::publish has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 3 (7 pts), loops 4, boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/publish.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"893a5fd8b2fbf7344c717a095608ceeefb71803ff733072dec6ff4267eeb7621"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::incorrect_use_of_str_template::check_body (cognitive 37): ide_diagnostics::handlers::incorrect_use_of_str_template::check_body has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (29 pts), match/switch 2 (5 pts), 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":"crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b48b9b43635884435b960a77b5ecfb97eed851ca65c55eac1cb23ee95816a9"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::graph_db::local_metadata_delta (cognitive 37): mcp_server::graph_db::local_metadata_delta has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f6d48a5d38c214eb0f2469dea2bbc64ae16628f9b93698c51edba69174b6cb"}},{"ruleId":"D2","level":"warning","message":{"text":"html_parser::scraper_parser::extract_chapter_content (cognitive 36): html_parser::scraper_parser::extract_chapter_content has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (30 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"0678f8670575d7278e1734baeac5aa18986153cda9ab56309378cd78721905d5"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchEngine::stage_validated_workspace_roots_transition (cognitive 36): SearchEngine::stage_validated_workspace_roots_transition has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 10, loops 4 (5 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":3556}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6c0673510bf9cb8aa22d4cc9e1be47efeef7ab5a21a776a31c9d0436544c64"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_types::display::render (cognitive 36): bsl_types::display::render has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 28 (30 pts), if/else 3 (6 pts) (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/display.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd75d9317d03d16799b84b803df50a47976a5d1e252c0224b1b36703666c7f38"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::effective_exports::effective_module_exports_query (cognitive 36): ide_db::effective_exports::effective_module_exports_query has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 1 (5 pts), loops 2 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/effective_exports.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd29b1f3438eee0b6a8ff794ead1d5fbed05258e7ecb5928c832542ddf48df81"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::missing_code_try_catch_ex::check_stmt_recursive (cognitive 36): ide_diagnostics::handlers::missing_code_try_catch_ex::check_stmt_recursive has cognitive complexity 36 (threshold 15). Drivers by points: loops 8 (24 pts), if/else 4 (7 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_code_try_catch_ex.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e33cab79f1377149ddc03731073ed7ff3c2df888ff5fa85507e17258ae74d0"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::utils::nstr::extract_language_entries (cognitive 36): ide_diagnostics::utils::nstr::extract_language_entries has cognitive complexity 36 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 12, loops 6 (11 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/utils/nstr.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf7b2f13b0ec53fd71a12f7aa5cf70a0899e343786fb250643e05c46a5cdc36"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphState::drive_as (cognitive 36): GraphState::drive_as has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (33 pts), 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":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c2773aeb5ad5f422d86139af0804132f716ea85331ddbb70f6e51d0040d57b"}},{"ruleId":"D2","level":"warning","message":{"text":"Owner::run (cognitive 36): Owner::run has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 3 (8 pts), 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":"crates/mcp-server/src/state/overlay_backlog.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"61314aa0cef048da34c66717c5e7e4f6e51c5f68f34a3002d133f1f4941bd140"}},{"ruleId":"D2","level":"warning","message":{"text":"sdbl_hir::context_detector::detect_context (cognitive 36): sdbl_hir::context_detector::detect_context has cognitive complexity 36 (threshold 15). Drivers by points: if/else 21 (31 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/context_detector.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"25edfecd8e1af7728fa138eb2b1282f6aa6135465d03610caf0ff03ab8ede3d0"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::rules::markdown_to_html (cognitive 35): bsl_analyzer::bin::cli::rules::markdown_to_html has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/rules.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9126d5a0ea9c6425b122b2fcd91e0c2c05fd7c7abde1f9a2c64ce4a4626492e6"}},{"ruleId":"D2","level":"warning","message":{"text":"CommonAttributeSet::project_extension_object (cognitive 35): CommonAttributeSet::project_extension_object has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 4 (10 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/common_attribute.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5c8da83c4b4cf310f873dec6cd3a438d90fd0c5980d23899bd4b3b6f36ef66"}},{"ruleId":"D2","level":"warning","message":{"text":"DataflowSolver::solve_forward (cognitive 35): DataflowSolver::solve_forward has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (7 pts), match/switch 1 (5 pts), 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":"crates/dataflow/src/lib.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ad8654b50451b7639acaa28ebef66618f27138ce9cfb79152f8b08f9deafd3"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::diagnostics::check_rollback_transaction_in_try (cognitive 35): hir_def::body::lower::diagnostics::check_rollback_transaction_in_try has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/diagnostics.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e1810173c0909b08b732e5bb334b00efc9ce7947a3afeff468fa93305a569f"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::multiline_string_in_query::query_has_multiline_strings (cognitive 35): ide_diagnostics::handlers::multiline_string_in_query::query_has_multiline_strings has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (30 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/multiline_string_in_query.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7324dd09f9399846cbd4bca9db3c5939611d7a1a4eb56df58d41529c748baa20"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::multilingual_string_has_all_declared_languages::check_body (cognitive 35): ide_diagnostics::handlers::multilingual_string_has_all_declared_languages::check_body has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 5 (10 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"154b7ec9177d015c630c1d13d0c7aef1595635e71458415f90a57437527bceb5"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedState::spawn_workspace_search_init (cognitive 35): SharedState::spawn_workspace_search_init has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (25 pts), match/switch 7 (10 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cec969309d62e964289fa7441c2339050df897bc5e8f4dc6707135168af2501"}},{"ruleId":"D2","level":"warning","message":{"text":"Project::resolve_extension_specs (cognitive 35): Project::resolve_extension_specs has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 4 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d362caa05d8203bae83f9a5c2ecd41e3f0e8f1c58f4778ce17b79f1d0f1032"}},{"ruleId":"D2","level":"warning","message":{"text":"project_model::search_configuration_recursive (cognitive 35): project_model::search_configuration_recursive has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 1 (3 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"90861d216144646f07c61aeb41fc4962673f83bf0d8f8f9ecd3dc05048b33eff"}},{"ruleId":"D2","level":"warning","message":{"text":"Scope::resolve_column_type (cognitive 35): Scope::resolve_column_type has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/scope.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"376f6d1c971ee9c0cf9f4c619e821ad82b5ea431644bd90c6beec991ba317b9e"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_lifecycle.main (cognitive 35): runtime_lifecycle.main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (25 pts), boolean chains 6, error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user2/runtime_lifecycle.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"57df9266a04fe26f92e2084310b8ed0c5ff77c3120ad040c3461ead457e5e187"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::handlers::request::handle_code_action (cognitive 34): bsl_analyzer::handlers::request::handle_code_action has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3062aebee7b40190009929b62e03459d7fc9a9c965d3d89ea073340433fb5f"}},{"ruleId":"D2","level":"warning","message":{"text":"html_parser::scraper_parser::extract_return_type (cognitive 34): html_parser::scraper_parser::extract_return_type has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db287f95c5649e34d0c81ebce6ce6139a6778ffeaff73f4fcad99b358a59442"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::metadata::load_configuration_from_prepared_inputs (cognitive 34): ide_db::metadata::load_configuration_from_prepared_inputs has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 10 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf09640ed0393357c7fb6953bfef118b2d4b991d4ba3a6aaa228b10e24fc169"}},{"ruleId":"D2","level":"warning","message":{"text":"OverlayRetry::run (cognitive 34): OverlayRetry::run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 6 (10 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/overlay_retry.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c07c33ccf3a43015aaec5f908565f7a7114c33cd644a2e6689c3361b5b6a75c"}},{"ruleId":"D2","level":"warning","message":{"text":"sdbl_hir::hir::collect_expr_objects (cognitive 34): sdbl_hir::hir::collect_expr_objects has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 4 (9 pts), match/switch 2 (3 pts) (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"6119b44309f2990f4255cd1858cf22131035585f18fc49c78f036526832ca77b"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeProfile::run_scoped (cognitive 33): NativeProfile::run_scoped has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 10 (13 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"31505f750615dfacab08a17d1e07999f9ac67008821bba591b1bfbd407ac9216"}},{"ruleId":"D2","level":"warning","message":{"text":"html_parser::parse_global_function_html (cognitive 33): html_parser::parse_global_function_html has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 1 (6 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"61871795ff568843b63ca1eaaa38db189b264c060588b1bc128ccc8bf508ae81"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceOverlayCache::plan_full_refresh_from_manifest_scanned_with_embedder (cognitive 33): WorkspaceOverlayCache::plan_full_refresh_from_manifest_scanned_with_embedder has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (5 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87716473493c0d5fcf5c85d06a0162dc3bd5d15c489f7a78abaa2fdc9cc6035"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceOverlayCache::apply_plan_in_memory (cognitive 33): WorkspaceOverlayCache::apply_plan_in_memory has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 6 (10 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ec457b02995791ac25a65c5f8b3d3f395369ec8f3162fc11077293126d5a00"}},{"ruleId":"D2","level":"warning","message":{"text":"Ir::build (cognitive 33): Ir::build has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (30 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/formatting/ir.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"06967ce659a364ac03f8733f0c203818e9573dd81318499f006ee17d06166fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::completion::mdo_completion::mdo_completions (cognitive 33): ide::completion::mdo_completion::mdo_completions has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 6 (11 pts) (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/mdo_completion.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c07b1ae3309a5daed3b96b0984050d2cc35c530905eed3a7d7a841a8d71a09"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::metadata::build_module_metadata (cognitive 33): ide_db::metadata::build_module_metadata has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (30 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"4805f2e3121fc8c8beb9d2ad2d4f1487f36431ea1a3cae19c19c2027d846d5be"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::commented_code::strong_statement (cognitive 33): ide_diagnostics::handlers::commented_code::strong_statement has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 11 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/commented_code.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f46514e15c2fb1f0b565fb103e378fb54043ffd7bb66fb5117ae6bb15e68d3"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::pairing_broken_transaction::compute_begin_guard_flags::walk (cognitive 33): ide_diagnostics::handlers::pairing_broken_transaction::compute_begin_guard_flags::walk has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 4 (10 pts), 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":"crates/ide-diagnostics/src/handlers/pairing_broken_transaction.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cb947ac07cbc149609100c561f1d5e2092a1e7ee9a6879c98f3d9eab50a903"}},{"ruleId":"D2","level":"warning","message":{"text":"Watch::arm_within (cognitive 33): Watch::arm_within has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (11 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67ab8c0be373d39e8919ff9df604c9fe3d74a0b7d54cc7e8b3db425e60d2604"}},{"ruleId":"D2","level":"warning","message":{"text":"sdbl_hir::lower::lower_sdbl_to_hir_with_resolver (cognitive 33): sdbl_hir::lower::lower_sdbl_to_hir_with_resolver has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bbf4164dfdf162a95202383ee2cc6cfdc427a319d3e0da6977cbb946fb3e15"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceSetArgs::resolve_extensions (cognitive 32): SourceSetArgs::resolve_extensions has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/source_set.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80c10121d4eb4b8d59c5696eb9297a71eeed896c9bcf4104d16887bb450555a"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeProfile::validate (cognitive 32): NativeProfile::validate has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 8, match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb02b49080929bdb1d3a6991ed78278a15faf83b0d884efca877b4a629a1e7d9"}},{"ruleId":"D2","level":"warning","message":{"text":"Configuration::merge_extension_overlay (cognitive 32): Configuration::merge_extension_overlay has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 5, boolean chains 3, match/switch 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/configuration.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62196d1e2ea88bafcffbd19dd1d21f992f7d54bf36237c35bce0d69b5bd6e52"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::docs::parse_returns (cognitive 32): hir_def::docs::parse_returns has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (27 pts), 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":"crates/hir-def/src/docs.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"673cd62fb66c1e98f0b4e5f25c569a4ba7959c80dd2554934e27ea31ba84044a"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::dispatch_bare_ident_field_call (cognitive 32): InferenceContext::dispatch_bare_ident_field_call has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (16 pts), loops 6 (11 pts), boolean chains 3, match/switch 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":6228}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f433b16d2fb01539887ae542096fa55ee9d1d29b22bdc3e7a4e92b19abda91"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::partitioned_diagnostics_baseline::load_diagnostics_baseline_set_once (cognitive 32): ide::partitioned_diagnostics_baseline::load_diagnostics_baseline_set_once has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 3, loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0e089b8e6e04bbf8abe33e7808b7e7a88fc403b5445d450b1341fe19a86cca"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::latin_and_cyrillic_symbol_in_word::matches_trailing_pattern (cognitive 32): ide_diagnostics::handlers::latin_and_cyrillic_symbol_in_word::matches_trailing_pattern has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d847bbd2716223d74f812db7a2ec9b38a10e6b1ebe02a15bf739b54a220159a"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::utils::nstr::is_variable_used_in_template (cognitive 32): ide_diagnostics::utils::nstr::is_variable_used_in_template has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (25 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/utils/nstr.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f608985fc3b428d560ef4e313c32f5e0a0548c2d3c09b4b6ba3f7ca0282faf8"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_host_core::load::apply_source_batch_cancellable (cognitive 32): ide_host_core::load::apply_source_batch_cancellable has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/load.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8983e502508c58a34f2e93003a1c3c54a2316bb9a569e1cef05cb87df2db4c"}},{"ruleId":"D2","level":"warning","message":{"text":"HubInner::ingest_event (cognitive 32): HubInner::ingest_event has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (6 pts), boolean chains 2, 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":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b9f986e16ac54a1e7824958fcca9652722f3791abada71522c10b43192feaa"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate.embed (cognitive 32): evaluate.embed has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 7, ternaries 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user2/evaluate.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"74379ae5dd2c97d925a4d8042db93f2cae796656471cdcbe8ce9da391551dd73"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_debug::types::responses::parse_targets (cognitive 31): bsl_debug::types::responses::parse_targets has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (24 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/responses.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c2c93ee50ca0a3010082c538ffd5b987c0a11a8278989ea36c6655de4b3e28"}},{"ruleId":"D2","level":"warning","message":{"text":"html_parser::scraper_parser::extract_parameter_descriptions (cognitive 31): html_parser::scraper_parser::extract_parameter_descriptions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (26 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"985aead5b68d1daf0ab7b3d18acf0c1f86a265bea15757fcb8d975e8b0e51061"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_search::publish::validate_source_span_layout (cognitive 31): bsl_search::publish::validate_source_span_layout has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 7, loops 2, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/publish.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a67b427bd1b09c741fa11ed12e2919d38103c0fe020b360afedffa21835581"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::expr::compare_template_and_params (cognitive 31): hir_def::body::lower::expr::compare_template_and_params has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cecd4cde21e12a2920c637f26d231793f0698da60351ec6747c527ac0a6425b"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::incorrect_use_of_str_template::compare_template_and_params (cognitive 31): ide_diagnostics::handlers::incorrect_use_of_str_template::compare_template_and_params has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2c64af7158219d8aa390f002d9fa49297773bdd530af198173e016d7227586"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::privileged_module_method_call::check (cognitive 31): ide_diagnostics::handlers::privileged_module_method_call::check has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/privileged_module_method_call.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d641a526eb5ce2ddfcb17fab0dd8b3c795a7a55599b4ddc215cb2da6dddd43c"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDebt::apply_recovery_publication (cognitive 31): GraphDebt::apply_recovery_publication has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 6, loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/debt.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38744917b855978436392abd34d781d9ea665f7e87bde75602325786f6450c9"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDebt::finish_probe (cognitive 31): GraphDebt::finish_probe has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/debt.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10857bfd79fabac17d28b9c96d956db69ebdc3aea2b595a27a47aa5c088db7f"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedState::refresh_search_roots_after_graph (cognitive 31): SharedState::refresh_search_roots_after_graph has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (18 pts), match/switch 11 (13 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c008031005cbc86ba4b3e025c60407918a2c6f3e4349487364b9cc49af97e73"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::sdbl::expressions::parse_cast_type (cognitive 31): parser::grammar::sdbl::expressions::parse_cast_type has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de50887bc5b14f4f14744f7db01b68c1879f97e3810f23b3dc891aa2eb837cc"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestDispatcher::on_latency_with (cognitive 30): RequestDispatcher::on_latency_with has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 5 (6 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d55767663569a0bf9bd10db7b5c0f63ba045b4df2188660e0c1f63766b5a29d"}},{"ruleId":"D2","level":"warning","message":{"text":"DefinitionIndex::from_body_with_params (cognitive 30): DefinitionIndex::from_body_with_params has cognitive complexity 30 (threshold 15). Drivers by points: loops 9 (19 pts), if/else 3 (9 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/reaching_defs.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22815bedbc07407d07cd5f8371e9ed24e3d543c4df502d3793c4d7efe2141c3"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::graph_index::project_workspace_catalog_edges (cognitive 30): hir_def::graph_index::project_workspace_catalog_edges has cognitive complexity 30 (threshold 15). Drivers by points: loops 10 (20 pts), if/else 3 (10 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb57eb1d961b9e4df827d4d9fa3bbfce71c6a2d0cbd30eeeebf4982c835fdfb"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::config::parsed_override (cognitive 30): ide_diagnostics::config::parsed_override has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 5 (13 pts), loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/config.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd33b4e7fc8e3c1b6281d0e9203d513330644acccaaab796257d1196b81daa50"}},{"ruleId":"D2","level":"warning","message":{"text":"BlindPoll::poll_until_stopped (cognitive 30): BlindPoll::poll_until_stopped has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":4476}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d33ba7539feafa0e6b1fe14f209494980213b4eda6c29f701e5573ef293c4cf"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::server::handle_vfs_msg (cognitive 29): bsl_analyzer::server::handle_vfs_msg has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"0949818a0712cc3251e0efd35a7bbf4995188b2e60e61726d4ace32a354dfd5b"}},{"ruleId":"D2","level":"warning","message":{"text":"LineFacts::collect (cognitive 29): LineFacts::collect has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/method_slab.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d1d473059f178fa1508460ff87fc91bd4267617ec2ceba6fceb4d6b745f919"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::completion::type_string_completion::type_string_completions (cognitive 29): ide::completion::type_string_completion::type_string_completions has cognitive complexity 29 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 8 (10 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/type_string_completion.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5d05a23af506523cad7e3034ab7b8f5c9f870f6ddc7eafbc9706511c8ba35b"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::nested_function_in_parameters::find_last_ident_before_node (cognitive 29): ide_diagnostics::handlers::nested_function_in_parameters::find_last_ident_before_node has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9f3d020c6b5730675583e65a2e5f18c0c7266950a69c551a934863e48cebba"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::utils::nstr::has_template_in_parents (cognitive 29): ide_diagnostics::utils::nstr::has_template_in_parents has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (24 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/utils/nstr.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc1be1e7b42111b9a47e15d54c306bf7e1fafa73da7abdc53f3f7ba35754c25"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::utils::nstr::extract_language_keys (cognitive 29): ide_diagnostics::utils::nstr::extract_language_keys has cognitive complexity 29 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 4 (10 pts), boolean chains 8 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/utils/nstr.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd736f72f329178c850b954e5850eead46f69c7d7d187ecd4b16fbe70c5c641c"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceLease::publish_checkpointed_inner (cognitive 29): WorkspaceLease::publish_checkpointed_inner has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21 (24 pts), match/switch 4, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/workspace_lease.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7cbfcac880a2933f41bb9eacb630751307c36126ba26259bf6d49134050f99"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_order_by (cognitive 29): LoweringContext::lower_order_by has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (26 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/clauses.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9beb73da14302ab76cf4c3fd99107f6cc8eb7283cf3ce5e19e990de5c5c6298e"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::add_metadata_fields (cognitive 29): LoweringContext::add_metadata_fields has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (12 pts), boolean chains 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":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"9130c3d3ef2fd42e7302b865651174a1487015c2f55282aed815eb32e149b18d"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::bench::run_bench (cognitive 28): bsl_analyzer::bin::cli::bench::run_bench has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 9 (21 pts), if/else 2 (7 pts) (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/bench.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"55abaab6cf46cb3b345087f8e052b25ce3aaaeb3b00e5f78fa99a9ed6b42d98d"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::call_hierarchy_index_service::reconcile::reconcile (cognitive 28): bsl_analyzer::call_hierarchy_index_service::reconcile::reconcile has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/call_hierarchy_index_service/reconcile.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9ae40852229d6fd6418848d45a998d6e5343b8ef023d846466a81b042c41e8"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::source::parse_metadata_form_type (cognitive 28): bsl_check_executor::native_check::source::parse_metadata_form_type has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 6, match/switch 2 (5 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"457ea50ec6367750f1de2dddb846dbb13d459fc08d4857ad3b4c87b1a351d5f5"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresBaselineAdapter::populate_serving_semantic_with_progress (cognitive 28): PostgresBaselineAdapter::populate_serving_semantic_with_progress has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (22 pts), 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":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4c7cff6b4d98eb57b92366ae9a9fdf68f20c6c866235cc1400e057eae27cd2"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::apply_overlay_publication_with_token_layout (cognitive 28): Store::apply_overlay_publication_with_token_layout has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":5214}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e1f35a08056ebd05caa396cb5328b5c40ee4895c3954325ed7d0a9a27c6a44"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::subtype::is_coercible_to (cognitive 28): hir_ty::subtype::is_coercible_to has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/subtype.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9d0b64f069915c04289283be0919b639f69ba82ed2de6c849d425834d29284"}},{"ruleId":"D2","level":"warning","message":{"text":"DbScopeProvider::get_scope (cognitive 28): DbScopeProvider::get_scope has cognitive complexity 28 (threshold 15). Drivers by points: loops 9 (19 pts), if/else 5 (8 pts), boolean chains 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/sdbl/infrastructure/scope_provider.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1dc0b7913299bb6b2c37381bb77d6958678bae3aaa6f3ba39a510701633abb6"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::references::resolve_by_text (cognitive 28): ide::references::resolve_by_text has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 3 (4 pts), 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":"crates/ide/src/references.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc1ee965213ae717234d796e6460111735bdf90d507b4cc8b9c25ec6320a621"}},{"ruleId":"D2","level":"warning","message":{"text":"RootDatabaseImpl::enumerate_subsystems_for_file (cognitive 28): RootDatabaseImpl::enumerate_subsystems_for_file has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (9 pts), match/switch 1 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff07af9302305723c0f0d50a6e17340fd29146ea399d339e1a2754d0858cb5b"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_function_call (cognitive 28): LoweringContext::lower_function_call has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/expr/mod.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a84bb7f7034e5c9f472e321d3f461644ca51169ac80d9e2a7203eb664c15a5"}},{"ruleId":"D2","level":"warning","message":{"text":"SdblType::display_name (cognitive 28): SdblType::display_name has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 21 (24 pts), if/else 3 (4 pts) (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":"crates/sdbl-hir/src/types.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1756cfcfe46a532da209fcadbcc8c5ded3a119c691805d80879c74e8d42c056"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_lifecycle.prepare_cache (cognitive 28): runtime_lifecycle.prepare_cache has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, loops 3 (4 pts), error handling 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user2/runtime_lifecycle.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fa38f50f1c72fa03f99798e93657dbb858b63e384c5648f178775171b9b1f7"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceOverlayCache::plan_full_refresh_from_local_scanned_with_embedder (cognitive 27): WorkspaceOverlayCache::plan_full_refresh_from_local_scanned_with_embedder has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (7 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4231531491c3b73cb7c960164b9a43166a50457eeac86884722ddd24a4e0b2f"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::lower_method_with_externals (cognitive 27): hir_def::body::lower::lower_method_with_externals has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/mod.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee47149c28b8744fddee54682622e4ef4f6cfbf2a3729d97725d90c71a92e9a"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::lower_module_code (cognitive 27): hir_def::body::lower::lower_module_code has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/mod.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58d26469d0a0aba5ed10060c4bfd1feff2360ced475fef3a5422ed5b529909d"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::query_fragment::has_foreign_markers (cognitive 27): hir_def::body::lower::query_fragment::has_foreign_markers has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/query_fragment.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85761130747d308eeccd0dcf138fb21356c6cd35ea7d1e79d25895b3b921325"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::graph_index::extract_unresolved_refs (cognitive 27): hir_def::graph_index::extract_unresolved_refs has cognitive complexity 27 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 4 (11 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d9280e915ebcc80b9883d0f25e8938d831698584e7f97c33eee4f0a44a4608"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::internet_access::check_body_for_internet_access (cognitive 27): ide_diagnostics::handlers::internet_access::check_body_for_internet_access has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/internet_access.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c3839a1ad5b95ed1baf9b2d0a6ac304ff3a72292d0dc894e39f431294557d3"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::diagnostics::file_findings (cognitive 27): mcp_server::tools::diagnostics::file_findings has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 4 (5 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"22997c90731101a4251ff4fe85c402b423145244e5de7f505e036025e4000b27"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_lifecycle.lifecycle_root (cognitive 27): runtime_lifecycle.lifecycle_root has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 7, 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":"scripts/user2/runtime_lifecycle.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2544b64959240de6feba2c69c6eb083fff892f218b59669a5a75c269989458"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::handlers::notification::handle_did_save (cognitive 26): bsl_analyzer::handlers::notification::handle_did_save has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, loops 1 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/notification.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab12973e7e392a6e310150417b5bb2ec31cfdf69b17c076d7c68810af4cacc0"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::compiler::run_bounded_with_log (cognitive 26): bsl_check_executor::native_check::compiler::run_bounded_with_log has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 8 (10 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/compiler.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"52335a40ced073c6ffec071d4ff5c2fad76657533eef69f176b3f135f1369c17"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::source::flat_module_export_name (cognitive 26): bsl_check_executor::native_check::source::flat_module_export_name has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 5 (6 pts), boolean chains 4 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"451ace89401735a25c4fbec70ab6713a4e78f94b2fafcfe155008a20c422f1e0"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_metadata::loader::build_configuration (cognitive 26): bsl_metadata::loader::build_configuration has cognitive complexity 26 (threshold 15). Drivers by points: loops 26. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcca228e4ad5b19c9540928df61633272c751bd8460fec3a83c9c974eb0c93e3"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::diagnostics::check_parent_block_for_async (cognitive 26): hir_def::body::lower::diagnostics::check_parent_block_for_async has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/diagnostics.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"929c1550955df0ef0a6159a05c70b15f72acdc735399246ff6abcb678b3d6fad"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::structure_keys::invalidate_expression_escapes (cognitive 26): hir_ty::structure_keys::invalidate_expression_escapes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (6 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/structure_keys.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34e851a64ac017c99135a89df6b4e1b7f2a514c352816bc4699e8d126be6cb8"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::completion::bsl_completion::complete_user_defined_symbols (cognitive 26): ide::completion::bsl_completion::complete_user_defined_symbols has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (23 pts), 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":"crates/ide/src/completion/bsl_completion.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"81eb1065861e17afaf2858a303f4bdd5f43db3c3b67793283d307d3ebc6c2386"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::consecutive_empty_lines::scan_consecutive_empty_lines (cognitive 26): ide_diagnostics::handlers::consecutive_empty_lines::scan_consecutive_empty_lines has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/consecutive_empty_lines.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de23b2ccc99cdd8ea9d1347eda40ed059bb28a919b19fbe34683fa907c578c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::duplicated_insertion_into_collection::check_expr_for_side_effects (cognitive 26): ide_diagnostics::handlers::duplicated_insertion_into_collection::check_expr_for_side_effects has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"141fbdcb7c28e6c7a4bda2d3da267cae70b803f338cc6302463a32d232b0d51f"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::redundant_access_to_object::from_hir (cognitive 26): ide_diagnostics::handlers::redundant_access_to_object::from_hir has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 3 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/redundant_access_to_object.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"93914f253176bfd13ccbaf87d6bfdecccb41c5ba20fc0a4d13b0ec27316570c1"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::rewrite_method_parameter::scan_stmt_before_target (cognitive 26): ide_diagnostics::handlers::rewrite_method_parameter::scan_stmt_before_target has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/rewrite_method_parameter.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc3ba81c9d4aefc7f7c34d0a1a8a8f76a2421b4e0a7c7eb013e74fc3c446578"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticsBaselineSnapshot::load_once (cognitive 26): DiagnosticsBaselineSnapshot::load_once has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 8 (13 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"deab04826ada0b21fab3dc0909169f1d1093c6ef52dc6c6491c2ce07a07b1083"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDebt::standing (cognitive 26): GraphDebt::standing has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/debt.rs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"c713a480e2c0c1f24f4488acccb5da6e0681921b3253aee237d50c49c5081769"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::contract::shape_from_value (cognitive 26): mcp_server::contract::shape_from_value has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (10 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/contract.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"03377fe1093ae0a9a3c78da33dc24099fb2f1c8ddb55ceff8fd2c98026706d77"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::search::lexical::lexical_code_hits (cognitive 26): mcp_server::tools::search::lexical::lexical_code_hits has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 5 (12 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"222b6a61b64433aab834e040b4d5af9b407be6ce61fbf2719b5f7771e3cb9346"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceSetArgs::resolve_externals (cognitive 25): SourceSetArgs::resolve_externals has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/source_set.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a9cc48b54b8b09254e6421cd227d20b6f9b15a6a4a53bbbc3286a06837fd32"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::diagnostics_baseline::validate_set_for_repair (cognitive 25): bsl_analyzer::bin::cli::diagnostics_baseline::validate_set_for_repair has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7c91c0e578a0f52918caa06b075241ab9951f0542610f21f142fa8182a4aae"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::search_baseline::snapshot_id::resolve_parent (cognitive 25): bsl_analyzer::bin::cli::search_baseline::snapshot_id::resolve_parent has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (7 pts), boolean chains 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/search_baseline/snapshot_id.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb74cc6e460e7f2cc2369ba5c7321e470a3fbc1c06cc8d0e00ff91db37097c6"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_platform::db::apply_docs_gap_member_context_overlay (cognitive 25): bsl_platform::db::apply_docs_gap_member_context_overlay has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 6, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/db.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"0291da0229bf8d666e6b1995a3e651e1b2a992711280d91b88a71b84e916c7c9"}},{"ruleId":"D2","level":"warning","message":{"text":"html_parser::scraper_parser::extract_parameter_variants (cognitive 25): html_parser::scraper_parser::extract_parameter_variants has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"643c640ff2d7bfa5448888f74c3dd527b3fb647cbf4043bad8720822ac90964e"}},{"ruleId":"D2","level":"warning","message":{"text":"dataflow::effect_summary::analyze_method_effects (cognitive 25): dataflow::effect_summary::analyze_method_effects has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 3 (9 pts), loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/effect_summary.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08361aa0d95c586bef7e63bd0a1c74cb8586b4e97905d48a89ea6f9f7a89bfe"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::collect_referenced_externals::collect_declared (cognitive 25): hir_def::body::lower::collect_referenced_externals::collect_declared has cognitive complexity 25 (threshold 15). Drivers by points: loops 10 (22 pts), if/else 1 (2 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/mod.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fcf80c93638ebba5f5d839ca8a80d8cdf6c29e33836bc85a8220b21d84fde6"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::types_on_every_path (cognitive 25): InferenceContext::types_on_every_path has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 4 (8 pts), 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":"crates/hir-ty/src/infer.rs"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"d568cf91551c2c9cc1285f508f46b591e148336ada1fb09a56c01eea37ad78ee"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_qualified_call (cognitive 25): InferenceContext::infer_qualified_call has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 3, loops 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":"crates/hir-ty/src/infer.rs"},"region":{"startLine":6072}}}],"partialFingerprints":{"codehealthFindingId/v1":"854168993d21f6cf8b01d7e07bc1191b1f56d961be814d8af72feecf75942108"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::declarations::resolve_declarations (cognitive 25): ide::declarations::resolve_declarations has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (5 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/declarations.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbf6b24e751fdea5d16eb9f6f9118b71bef980105da19f94ab5855b208696e1"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::symbol_info::weaving_sites (cognitive 25): ide::symbol_info::weaving_sites has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/symbol_info.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d6b81bd654288ec30244f7b11b8fdee6a5af9de6c9500223e14c4abfbee823"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::syntax_highlighting::traverse_node (cognitive 25): ide::syntax_highlighting::traverse_node has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00a9eb25c11a6c369fc42afa624543e5f228079915902ffd2e31e3adeb27998"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::line_length::find_method_description_lines (cognitive 25): ide_diagnostics::handlers::line_length::find_method_description_lines has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/line_length.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4299c54147ebb1629af64983488fb7d722f1f14d324b2587cd2e742286d2c495"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::using_hardcode_network_address::check_body_literals (cognitive 25): ide_diagnostics::handlers::using_hardcode_network_address::check_body_literals has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_hardcode_network_address.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b4b1b626d55fffe83f5d5df2bac590cba643a647c4be5d6a73e4e62ce38108"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticsState::apply_metadata_and_body_drift (cognitive 25): DiagnosticsState::apply_metadata_and_body_drift has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/drift.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba874861143194083b628b618294018aa6471a5dba1e94bdc57eae86e9fcd546"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphState::acquire_graph_access (cognitive 25): GraphState::acquire_graph_access has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 2 (4 pts), 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":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"8093c210f3edaa6136160f8cfa3769ba61d30cd79d5b9a2f20f4a171d6650b77"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::check_expr_for_unlimited_string (cognitive 25): LoweringContext::check_expr_for_unlimited_string has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 5 (10 pts), match/switch 2 (3 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e7e820d117bd57501d0bd12bd3df6bfc667fa43b8b82f570f8d2d9e00902b5"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::handlers::notification::handle_did_change_watched_files (cognitive 24): bsl_analyzer::handlers::notification::handle_did_change_watched_files has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/notification.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa40fd112c747e1ec93c058ddf442f54982c3646ebc386d5e38104bc9a307b8"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::profile::cleanup_owned_jobs (cognitive 24): bsl_check_executor::native_check::profile::cleanup_owned_jobs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":3060}}}],"partialFingerprints":{"codehealthFindingId/v1":"e845ed45ec66df5574753df21945ec1e3ca67c0ea0695c8a892c3e9a7db0d7de"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::profile::recover_process_group (cognitive 24): bsl_check_executor::native_check::profile::recover_process_group has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), 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":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":3307}}}],"partialFingerprints":{"codehealthFindingId/v1":"f401faad9d39f05651bcac4d7ee39c110d4d2cd1c29bf0a1d8b335610da06c12"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_metadata::vendor_support::tokenize (cognitive 24): bsl_metadata::vendor_support::tokenize has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4 (8 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/vendor_support.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cdb295663864c8cc333de47989decdc0e4ed298611ffda880cefd1415fa942"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::migrate_structural_schema (cognitive 24): Store::migrate_structural_schema has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 1 (3 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bbe620718d4deba6a31c12c356b3b2c2a4bf3625256ee1ddad9b89d1a24625"}},{"ruleId":"D2","level":"warning","message":{"text":"CfgBuilder::walk_if_statement_hir (cognitive 24): CfgBuilder::walk_if_statement_hir has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (10 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cfg/src/builder.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3673ca2ca085ee4a395b1ed8fbc21ced254ec7fd611d5396f8bb321ed6ae97"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::docs::see_reference_ranges (cognitive 24): hir_def::docs::see_reference_ranges has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 8, loops 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3060f9f5365428f890c2496244dfd2b350150385fac257fe4ece534310c0f7c"}},{"ruleId":"D2","level":"warning","message":{"text":"RootDatabaseImpl::resolve_common_module_files_for_file (cognitive 24): RootDatabaseImpl::resolve_common_module_files_for_file has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"3854c236b039523f050d53136457bdeb19269084318e0307cd12ccab406a07f8"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::duplicated_insertion_into_collection::check_expr_for_insertion (cognitive 24): ide_diagnostics::handlers::duplicated_insertion_into_collection::check_expr_for_insertion has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (23 pts), match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af1c360dfde8da4d88936d67e5829ff6f9a0a880e35434e190defec1f77dc50"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::pairing_broken_transaction::precompute_assigned_vars (cognitive 24): ide_diagnostics::handlers::pairing_broken_transaction::precompute_assigned_vars has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 1 (6 pts), loops 2 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/pairing_broken_transaction.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a70fd9c3311b8be3e24aa9aa21af9c81c0fbadb697cb4643671f04c854bda9"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::structure_key_is_not_identifier::check_body (cognitive 24): ide_diagnostics::handlers::structure_key_is_not_identifier::check_body has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/structure_key_is_not_identifier.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b2d04bfcd6dacf3feacc278dc72c0dd62b644a8212e6303352b1994a973dd7"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::sdbl_utils::extract_string_content (cognitive 24): ide_diagnostics::sdbl_utils::extract_string_content has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/sdbl_utils.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"724c9c4a21dd4c4ae2af732194c3272526867189bde7a5de99a782a42c82a67e"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticsState::run_reload (cognitive 24): DiagnosticsState::run_reload has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/lifecycle.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"465d9552fdc7dd5628f090ee7c49a00f4ac070917151682ffb1b56f4f32f3255"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphState::recovery_proof_with_roots (cognitive 24): GraphState::recovery_proof_with_roots has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts), 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":"crates/mcp-server/src/graph/snapshot.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eac49f57c4f0829657f715b93f2666bc1c9d6b4e2d4291e4f0099522cff6e2c"}},{"ruleId":"D2","level":"warning","message":{"text":"McpServer::graph (cognitive 24): McpServer::graph has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 5 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12ecb3256c92504446c989d714d30502dcdb3f6521c020a44a646bdc61f1d1d"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedState::start_scope_guard (cognitive 24): SharedState::start_scope_guard has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"54653be687d445e3fb16c8e886fd520729157c4d88057d0ab51cc6a5ee32c621"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::metadata::format_metadata_object_structure (cognitive 24): mcp_server::tools::metadata::format_metadata_object_structure has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (12 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"affaa55c411e5580698ed33c291f2cbd41edc12872b9bc4ebac414ebb5b46323"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::query::render_text (cognitive 24): mcp_server::tools::query::render_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 2 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/query.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfea0f98a95c988201f69319a7da31947ef6a9c5bec2bde3a087c0aba6bddd6f"}},{"ruleId":"D2","level":"warning","message":{"text":"NaparnikHttpClient::read_sse_completion (cognitive 24): NaparnikHttpClient::read_sse_completion has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (17 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/naparnik/src/http_client.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"56398581dbf3ed1307b1e366349d122d594f6c97e05b432a755f7a279b6c027c"}},{"ruleId":"D2","level":"warning","message":{"text":"project_model::parse_dotenv_value (cognitive 24): project_model::parse_dotenv_value has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"206aaa38f9fcaa603d75b0eb2dcc9d282ae07d86e9d7e6a802b4a05cb7028fab"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::resolve_table (cognitive 24): LoweringContext::resolve_table has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ccb7f7f0908b9dce3fa7771a83f4fef8378489122a5a4cb53d790361c048f2"}},{"ruleId":"D2","level":"warning","message":{"text":"NullableUses::walk (cognitive 24): NullableUses::walk has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (8 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b59b74e106bc9c25c2abc9a22e6a300dcb55653e3b57af2abe6350ac4666d0"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_acceptance.wait_ready (cognitive 24): runtime_acceptance.wait_ready has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 6, ternaries 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user2/runtime_acceptance.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"99067b70a3bc121b4c7e1b9f40059f9cee6260ffc6835c6fd502fe81201262ac"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::search_baseline::retention::analyze (cognitive 23): bsl_analyzer::bin::cli::search_baseline::retention::analyze has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/search_baseline/retention.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61dcd89df539eac8402d4488220425c79522135dd29401a40db98a014c24fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"DebugSession::handle_event (cognitive 23): DebugSession::handle_event has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/session.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"903f4609dfcf12bde16f219530b8599fb978ab44c6d5239500d9e355105ea69a"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceOverlayCache::finish_publication (cognitive 23): WorkspaceOverlayCache::finish_publication has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (7 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3c28b76f115ad57caadca61b79903cb51c6d6371270ff2e1323b13e64006ee"}},{"ruleId":"D2","level":"warning","message":{"text":"MetricsVisitor::visit_stmt (cognitive 23): MetricsVisitor::visit_stmt has cognitive complexity 23 (threshold 15). Drivers by points: loops 9 (20 pts), if/else 1 (2 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/metrics.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a631701782c1c4019582d975c7f0956f565c872f4f8fc95b2af0a5fecb29a44e"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::stmt::lower_assign_stmt (cognitive 23): hir_def::body::lower::stmt::lower_assign_stmt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/stmt.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"5075932fabaab296ac4154982a665976342cd617ca4a5c8f0182547e4b4c3d35"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::utils::extract_string_content (cognitive 23): hir_def::body::lower::utils::extract_string_content has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (17 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/utils.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1566d5ab401fb37036043de6aadc889e3db858445fe1d408f6082dfa86e2d1"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::graph_index::resolve_summary_via_index (cognitive 23): hir_def::graph_index::resolve_summary_via_index has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 8 (22 pts), 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":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae41dfa79eaf1db67ea6e8ac01a74a8ef8669bd75483d5b1ed8b3d2c4e1cdd87"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::preproc_condition::tokenize (cognitive 23): hir_def::preproc_condition::tokenize has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/preproc_condition.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeaf10ec6361ea22ffec0f9cd2fc298698fc187f24b39d13edc6bc429d75e63d"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::missing_temporary_file_deletion::check_body_resources (cognitive 23): ide_diagnostics::handlers::missing_temporary_file_deletion::check_body_resources has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_temporary_file_deletion.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93b6ff9cc8c4965811dd9896bab41853dd8e07e640b53410d7c42dd310d9796"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::unused_local_variable::check_module_level_code (cognitive 23): ide_diagnostics::handlers::unused_local_variable::check_module_level_code has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 2, match/switch 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_variable.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f85a147471f93ea7d7e12675bca3027fca3c85c5cfebdc56ddc74aef02e0676"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::change_hub::apply_declaration (cognitive 23): mcp_server::change_hub::apply_declaration has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (4 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5071}}}],"partialFingerprints":{"codehealthFindingId/v1":"70348ed27583dd5be70aec16199359fdb06f7a1976dc771ecfdc3fb1e80b73ed"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::graph_db::incremental_safety_check (cognitive 23): mcp_server::graph_db::incremental_safety_check has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 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":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"1696a73a363ce20bfc38e44fbb282542a3d2122e9a7b70e52cd9323004d4fbf2"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::diagnostics::snippet::plan (cognitive 23): mcp_server::tools::diagnostics::snippet::plan has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 6 (9 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics/snippet.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c496a879149e19c491b66829c0e946c8adc8c21ae5d3f66f290165b12929a60"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::metadata::forms_in_container (cognitive 23): mcp_server::tools::metadata::forms_in_container has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (5 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe8146374df6e813dd2145e510a8a93d9a77418a711bdc3008f76418aa88df1"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::search::status::write_summary_block (cognitive 23): mcp_server::tools::search::status::write_summary_block has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/status.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"481f23383b62e7a007bb56afddab3026a2639720ea6f94655e830290809f7f6f"}},{"ruleId":"D2","level":"warning","message":{"text":"SdblHir::collect_resolved_attributes (cognitive 23): SdblHir::collect_resolved_attributes has cognitive complexity 23 (threshold 15). Drivers by points: loops 10 (13 pts), if/else 7 (10 pts) (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":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc682a5bd8200b0f297a203392641f6aeb26ecc62d3aee6fd47446fe3a853fd4"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_value_function_args (cognitive 23): LoweringContext::lower_value_function_args has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/expr/mod.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd02dbb8f398bfbf53c3773e7f5ce0319d807807da2cded890bc0910da79c25"}},{"ruleId":"D2","level":"warning","message":{"text":"symbol_info::presenters::hover::render_hover_markdown (cognitive 23): symbol_info::presenters::hover::render_hover_markdown has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/symbol-info/src/presenters/hover.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"51da5d35e7a502b3f8135e5af8a35eee830e201a23991de2ea89a022197a2e07"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::logging::journal::append_locked (cognitive 22): bsl_analyzer::bin::cli::logging::journal::append_locked has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/logging/journal.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bb0c8a0e460f597f0ae80ef5222c955a3b782fd9cd799089ad33ce9e0aa01d"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::search_baseline::documents::build_workspace_code (cognitive 22): bsl_analyzer::bin::cli::search_baseline::documents::build_workspace_code has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 1 (4 pts), loops 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/search_baseline/documents.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb020afdee68b2d7ae76b371e79d899b8d8d14c430d75371fd470be86cd07e69"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::smoke::run (cognitive 22): bsl_analyzer::smoke::run has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (19 pts), if/else 2, loops 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":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"043d9386af306fd0039a2a97626701daaa23e53acbeecbebdca940e99622a282"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::compiler::safe_message (cognitive 22): bsl_check_executor::native_check::compiler::safe_message has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/compiler.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ea1d55243f0424e40e5710c4eb8cdf2e31793afc8cb0f60704ca583b5261a7"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::runtime::parse_connection_identity (cognitive 22): bsl_check_executor::native_check::runtime::parse_connection_identity has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/runtime.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4bdb8273c7465383f2400e64f764d41622e2b19d860d318e0d215343a1bba8"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_metadata::xml_parser::catalog::parse_metadata_object_xml (cognitive 22): bsl_metadata::xml_parser::catalog::parse_metadata_object_xml has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 3 (6 pts), loops 3 (4 pts), 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":"crates/bsl-metadata/src/xml_parser/catalog.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"684774fe40c1b7c7e5ce5b12a65c6f8232590ea0176b550ed05a409ccc97abe9"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_metadata::xml_parser::role::parse_objects (cognitive 22): bsl_metadata::xml_parser::role::parse_objects has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/role.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60f0d45c38f96a8ba1b50bf917f41de361dceb59353c9bda107136bfb0cc036"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchEngine::run_fenced_embedding_pass (cognitive 22): SearchEngine::run_fenced_embedding_pass has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fce7275eb8dd0a2b311a6a35a79e7b4b8999bae95b2a78c9915a0c95f79fc1"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_search::context::file_path_to_module_path (cognitive 22): bsl_search::context::file_path_to_module_path has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d033f470d3c0fda60e6b2742724c30e8af4d0d5b5b83daab6229c809096f3a7"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_search::hybrid::fuse_smart (cognitive 22): bsl_search::hybrid::fuse_smart has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 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":"crates/bsl-search/src/hybrid.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1878b263c39d5ce04e47b221d25c28b040ea68720a52c77f3001bb35a699d5e1"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::diagnostics::has_code_after_async (cognitive 22): hir_def::body::lower::diagnostics::has_code_after_async has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/diagnostics.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b619dcc87347135f33b2a3a3560c97e897cd061c49a44a67917147a968e352"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::query_fragment::completion_after (cognitive 22): hir_def::body::lower::query_fragment::completion_after has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 6 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/query_fragment.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cbd0344800f4fcc0e6849b2ef81cef6b9655df31087bf7ad6f0a7819f43ade"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::call_graph::field_callee_to_edge (cognitive 22): hir_def::call_graph::field_callee_to_edge has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/call_graph.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"0897e4fc35a03ac90024d4b492e26ad0bf916f21fa0f1af57c95757d56a5408d"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::catch_class::scan_stmts (cognitive 22): hir_def::catch_class::scan_stmts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 pts), match/switch 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/catch_class.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"697231d559b489527a9bd99925541a25c6c4bbfe3ccb94a8670d0df791b529b0"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::docs::parse_method_docs (cognitive 22): hir_def::docs::parse_method_docs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"235411e57c4f3842c85963b84419398e36cf4233eb8c7b065d6c1e50147d0a66"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::query_in_loop::query_in_loop_candidates (cognitive 22): hir_ty::query_in_loop::query_in_loop_candidates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (7 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/query_in_loop.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"679ed1689d3f47af484c7f7ec9716e9ad283fa859707d14b06a8c2007d428142"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::completion::bsl_completion::complete_local_symbols (cognitive 22): ide::completion::bsl_completion::complete_local_symbols has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 4 (5 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/bsl_completion.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"de39b283a3b0489206d46c978b603ea68eec7c7c8e5a04068c9909358e7146e8"}},{"ruleId":"D2","level":"warning","message":{"text":"RootDatabaseImpl::enumerate_event_subscriptions_for_file (cognitive 22): RootDatabaseImpl::enumerate_event_subscriptions_for_file has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (9 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (RootDatabaseImpl::enumerate_roles_for_file) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"922d4b17e7a552e60ea56bf58335c5d1f94986e5aea06ae165ebc935ace423fa"}},{"ruleId":"D2","level":"warning","message":{"text":"RootDatabaseImpl::enumerate_roles_for_file (cognitive 22): RootDatabaseImpl::enumerate_roles_for_file has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (9 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (RootDatabaseImpl::enumerate_event_subscriptions_for_file) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":1886}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2de5bb37d135497cbe4ae3e47d6770638d0cb9b604e8b24d9501056711cc2cf"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::transferring_parameters_between_client_and_server::check (cognitive 22): ide_diagnostics::handlers::transferring_parameters_between_client_and_server::check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/transferring_parameters_between_client_and_server.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fc61085a3f66b7cc9a11ae2024ee2e7bfdb0922e30a8bfcb08231ce9500260"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::utils::literal_context::is_in_structure_constructor (cognitive 22): ide_diagnostics::utils::literal_context::is_in_structure_constructor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (17 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/utils/literal_context.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a17ee01f50c6066acdd800446571010d5afd5bfc973036089f07fde6886c08d"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphState::status_report_with_indexing (cognitive 22): GraphState::status_report_with_indexing has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, match/switch 3 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":2604}}}],"partialFingerprints":{"codehealthFindingId/v1":"e614c1267a39e9b210f5d0df41b47a2b646ad6cb22ecbf6195503aeb52bd417b"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedState::apply_prepared_search_drift (cognitive 22): SharedState::apply_prepared_search_drift has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 5 (8 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/sync.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c290c311f8c016889623a5373c8872abc398f9355e878e145b762ac971fb16"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::metadata::format_form (cognitive 22): mcp_server::tools::metadata::format_form has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 8 (10 pts), 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":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd0fec240ec4755c297818fef7fd58af343616c1c67ad783c403120dadbd15b"}},{"ruleId":"D2","level":"warning","message":{"text":"Project::diagnostics_baseline (cognitive 22): Project::diagnostics_baseline has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), 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":"crates/project-model/src/lib.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c2a044f06c99fa5e83ef98adb25a5527196ad5a525e91bed4698470c1225df"}},{"ruleId":"D2","level":"warning","message":{"text":"Scope::resolve_nested_field_type (cognitive 22): Scope::resolve_nested_field_type has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 5 (7 pts), 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":"crates/sdbl-hir/src/scope.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc202ce57ab23eb78e0660257a9d624a18c53b99b2ae9ae10438539be904e88"}},{"ruleId":"D2","level":"warning","message":{"text":"Handler.do_POST (cognitive 22): Handler.do_POST has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, error handling 3, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user2/serve.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c227b9788bb9c92a4776207606a17be679e7d13e4c14b69e94d381d9ac5fbdaf"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::vfs_file_for_url (cognitive 21): GlobalState::vfs_file_for_url has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/workspace.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d372ad7bf295d4a095b1af66e0c0a06d450a8a0461c4d38de89aef5aa6f61a"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::check_config::build_check_config_report (cognitive 21): bsl_analyzer::bin::cli::check_config::build_check_config_report has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (5 pts), 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":"crates/bsl-analyzer/src/bin/cli/check_config.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3965d0ab7394061d3b1318a3c1ff044903f7ffd94dbfb67c25f8e3db7c2b2e"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_debug::types::responses::parse_call_stack (cognitive 21): bsl_debug::types::responses::parse_call_stack has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (16 pts), if/else 2 (4 pts), loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/responses.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c97323b343a5731072619c0e1ae6421992beb49d13755919d7795420c281b2"}},{"ruleId":"D2","level":"warning","message":{"text":"html_parser::scraper_parser::extract_iter_element_types (cognitive 21): html_parser::scraper_parser::extract_iter_element_types has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adbc4720df8694a70614edca119c064ba336f7e3b891a7a2a2fb7ee8b523331"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::migrate_embed_text_version_checkpointed (cognitive 21): Store::migrate_embed_text_version_checkpointed has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bd1d8d59202a78de1d2a2de17b993ad44a666e0f6046760e8869a63f6704fc"}},{"ruleId":"D2","level":"warning","message":{"text":"DefiniteInitResult::witness (cognitive 21): DefiniteInitResult::witness has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/definite_init.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"513572f27d4f7d5147dc74951101f17d1ed18b01c8adaee9854cf855ebfe2946"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::query_fragment::is_substitution_source (cognitive 21): hir_def::body::lower::query_fragment::is_substitution_source has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/query_fragment.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3c5ebafe12eba2124032d3de29edc1b299f70462da62636e9306e70fcde2f8"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::stmt::branch_end_is_followed_by_try (cognitive 21): hir_def::body::lower::stmt::branch_end_is_followed_by_try has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/stmt.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"3048db999bf04d352efd3f2b8e0cba8da02a306f13b1bafdc25c828bfd1106d1"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::module_structure::standard::is_standard_region (cognitive 21): hir_def::module_structure::standard::is_standard_region has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (17 pts), match/switch 1 (2 pts), 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":"crates/hir-def/src/module_structure/standard.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baede6aa265353144ba8ae1459343dc7205f9cca8914626909408f63ba0ae5b"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::field_lookup::lookup_field_raw (cognitive 21): hir_ty::field_lookup::lookup_field_raw has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/field_lookup.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56aae7382ae83cf744e0c7bce984dab90774a96a0e85a3d52f63d01acab969d"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::platform_global_lookup::bare_global_name_claim (cognitive 21): hir_ty::platform_global_lookup::bare_global_name_claim has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 7, 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":"crates/hir-ty/src/platform_global_lookup.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"107d75672269decff78d813c9748a5f8d91ca7192aeb0fa3f1635b1a6f6f395d"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::query_text_dataflow::executed_query_texts (cognitive 21): hir_ty::query_text_dataflow::executed_query_texts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/query_text_dataflow.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0551a756b63dafe6c839935df001de4512f500435e651c3232a7383241336934"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::query_text_dataflow::value_table_parameters (cognitive 21): hir_ty::query_text_dataflow::value_table_parameters has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/query_text_dataflow.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d735a7e37ffdce936af17ca7020a83318e9043773bca8a50d249f8337a7c118c"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::name_lookup::from_metadata_listing (cognitive 21): ide::name_lookup::from_metadata_listing has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/name_lookup.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2237a1819a4468bbcd0ddd07d744194899c1f387f6a6e8df044ac99ac462f336"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::metadata::get_module_type_from_uri (cognitive 21): ide_db::metadata::get_module_type_from_uri has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, match/switch 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f1508d72c3ce3fea995428d51008543189ea55a3acf7fc7d9a667b84401808"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::object_modified_in_on_write::check_body (cognitive 21): ide_diagnostics::handlers::object_modified_in_on_write::check_body has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/object_modified_in_on_write.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d83dce2fa3c7b8bfb87375ef37591007015111b7cfe2375e1f44fb9b7ac1c37"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::transferring_parameters_between_client_and_server::collect_assigned_from_stmt (cognitive 21): ide_diagnostics::handlers::transferring_parameters_between_client_and_server::collect_assigned_from_stmt has cognitive complexity 21 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 2 (4 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/transferring_parameters_between_client_and_server.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"9310c394f7a594b5562e1f52d820805fbdd3f714028a471e7c6a652f379b326f"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::runner::collect_sdbl_hir_single_pass (cognitive 21): ide_diagnostics::runner::collect_sdbl_hir_single_pass has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/runner.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e0f7e23adc64ced5889706a57418c722c7203a187f275ac2c8460b1d8b3017"}},{"ruleId":"D2","level":"warning","message":{"text":"McpServer::workspace_search (cognitive 21): McpServer::workspace_search has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a5a3686ea8634253e638eab1cbf76ad2a41a3575dc07d081b0f61c226c6d7e"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::mark_graph_stale (cognitive 21): mcp_server::mark_graph_stale has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 1 (3 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb1142cba308d86cae17324f72c5c4be4561b41840f1a5d2760c673bcfa932f"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::diagnostics::catalog (cognitive 21): mcp_server::tools::diagnostics::catalog has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa14cf5727623a94c07818fe3ab20fcca20300ccab10a1ed9a5c9031ce9ae086"}},{"ruleId":"D2","level":"warning","message":{"text":"syntax::sdbl_query::map_range_query_to_literal (cognitive 21): syntax::sdbl_query::map_range_query_to_literal has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/syntax/src/sdbl_query.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0490d496f1e3929aa9ab1031c581043adea224c896a2fe6140dfd9a052b60b"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate-qwen.encode (cognitive 21): evaluate-qwen.encode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user2/evaluate-qwen.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5354b5bd276593cfbf2046913a0b930b06d45fe22f82877847dc4af4b2eb3ec8"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::mcp::shared::serve_lsp (cognitive 20): bsl_analyzer::bin::cli::mcp::shared::serve_lsp has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (10 pts), loops 4 (6 pts), if/else 3 (4 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/mcp/shared.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b48f90dbb8b52aa807b0b08ac4aad84b1b56fea1d012e45e22fee75f8df8976"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::search_baseline::publish::run (cognitive 20): bsl_analyzer::bin::cli::search_baseline::publish::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 7 (9 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/search_baseline/publish.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"393a050ff16ba8a2453a30ae2081266cee3aa190c75dbef94fd8d07add49f240"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckRequest::validate (cognitive 20): CheckRequest::validate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/types.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34a825d6b47ebe05f492e6192f2cacafad056290e5a13c7c239f91c922b5df0"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_debug::dap::handle_request (cognitive 20): bsl_debug::dap::handle_request has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 10 (15 pts), if/else 2 (5 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/dap/mod.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc09e9d6ca6d8fd2da5f36b1f54ddc025c0b8e5ee0b5db464590d3ef65a8ee2"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_debug::module_index::read_command_uuids (cognitive 20): bsl_debug::module_index::read_command_uuids has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/module_index.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b97fb3ecc92b5390760aa7a9982a1fe2bd10593e0322dad1a99cb3ba06b032"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_debug::types::responses::parse_eval_result (cognitive 20): bsl_debug::types::responses::parse_eval_result has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 4 (7 pts), 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":"crates/bsl-debug/src/types/responses.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2ec54b7a254b1f0b3d1b8ae1b29827f7a51aec348d5dcd065ccdf5cef84ebe"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchEngine::embed_documents (cognitive 20): SearchEngine::embed_documents has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 4, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":3266}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdee0ddea92b004cae6ed7c9bbcf895f3670e64ed3ff4179f1cb9740379cf52f"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::hydrate_reusable_embedding_plan_from_conn (cognitive 20): Store::hydrate_reusable_embedding_plan_from_conn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":3446}}}],"partialFingerprints":{"codehealthFindingId/v1":"c333aab75e3d0b98321821bb1148c943eb331967e85971fe336bac6ff145d0c5"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::stmt::lower_if_stmt (cognitive 20): hir_def::body::lower::stmt::lower_if_stmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/stmt.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"951da75d41f5824606d1ab47ee2789818707801cff140a6a88d1466fd413f241"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::execution_env::conditional_env_where (cognitive 20): hir_def::execution_env::conditional_env_where has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 3 (8 pts), loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/execution_env.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6471459046e887f5e933432a7c1dd3412a547ca6751414dfa7c4fa175890b84"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::queries::resolve_dereference_chains (cognitive 20): hir_def::queries::resolve_dereference_chains has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/queries.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"643aa0e4ea6cf5298dec634df4b6828e51acce51ec5ed42e6006d35d8aaf03f2"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::field_enum::enumerate_projected_fields (cognitive 20): hir_ty::field_enum::enumerate_projected_fields has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), 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":"crates/hir-ty/src/field_enum.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7514a481d3d9bebdf43ff3b28fcf89835577c70f9387ac45f6bfa8db358dea50"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::completion::mdo_completion::detect_from_ident_after_dot (cognitive 20): ide::completion::mdo_completion::detect_from_ident_after_dot has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (20 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/mdo_completion.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0005cfa438aeed8a327846f699826e245de7a60696a4fe1effa5a21c6c86e88"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::hover::hover_field (cognitive 20): ide::hover::hover_field has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (20 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/hover.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbc8a90170c08a873c7f0b2b48b6b3de36b217a58eb90229413e3882e13700f"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::missing_parameter_description::check_parameter_descriptions (cognitive 20): ide_diagnostics::handlers::missing_parameter_description::check_parameter_descriptions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), 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":"crates/ide-diagnostics/src/handlers/missing_parameter_description.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"045b7d6d11e7f7b72f3493df1b79366e8ac2d8feccb1f629d0ac7ab2b7538208"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::multilingual_string_using_with_template::check_body (cognitive 20): ide_diagnostics::handlers::multilingual_string_using_with_template::check_body has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 4 (7 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"35db52e6f572a2cb6b9ec76ceb20f86572fffd9518d26d8fdb3c585d56aa2533"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::unused_local_method::check (cognitive 20): ide_diagnostics::handlers::unused_local_method::check has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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":"crates/ide-diagnostics/src/handlers/unused_local_method.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b7bdbff48c6eb2946eb8a6a6237f06985c158a438b3122eeb6a467b11470c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::value_is_filled_of_boolean::local_flag_is_boolean (cognitive 20): ide_diagnostics::handlers::value_is_filled_of_boolean::local_flag_is_boolean has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/value_is_filled_of_boolean.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8586cf85bb89a476cff09c77246cd47dbda68f2c81af7c7beb6ac6877ea3dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticsState::retry_holes_in (cognitive 20): DiagnosticsState::retry_holes_in has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/drift.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"a457f2517d4acc35f8d09cdb4b8b5717f0bf125c3f72df9f32ad2d31582c1aed"}},{"ruleId":"D2","level":"warning","message":{"text":"DiagnosticsState::apply_drained_resident (cognitive 20): DiagnosticsState::apply_drained_resident has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/drift.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c88e4acf9a9791fdf2eece3837237065133eb3a12fcf551a10c016af657270"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::change_hub::collect_subtree_noting (cognitive 20): mcp_server::change_hub::collect_subtree_noting has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4e537ec631e6873f6eb6f8f9108c1d03865a5c7564c79854c5eb34e794dafe"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::symbol_info::card_to_value (cognitive 20): mcp_server::tools::symbol_info::card_to_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (20 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/symbol_info.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d76ce477e31b60053b731354e76c0fb023857317b7c67c7d30f9015ed2b1cc"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::expressions::postfix_expr_with_call_info (cognitive 20): parser::grammar::expressions::postfix_expr_with_call_info has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/expressions.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6566c54d4b3d7fcb2d97b391f3dac83cdd2370b3848d2cb6ea5e796a6fcd366"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::sdbl::select::virtual_table_args_body (cognitive 20): parser::grammar::sdbl::select::virtual_table_args_body has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/select.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6481e9102c7502ee2d38d8039388db070c0b8a7ec40a1811005ceb71754b81"}},{"ruleId":"D2","level":"warning","message":{"text":"SdblHir::collect_resolved_tables (cognitive 20): SdblHir::collect_resolved_tables has cognitive complexity 20 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 6 (8 pts) (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":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6587a2bac021149217431cf0e3ef966d38e34017c1b1e419589a41d5545120"}},{"ruleId":"D2","level":"warning","message":{"text":"SdblHir::collect_dereference_chains (cognitive 20): SdblHir::collect_dereference_chains has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 7 (8 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3292c63cc20d0cfe72c5d749add4e97a98fc262bdafe9ac0b78840d759c31b7"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_literal (cognitive 20): LoweringContext::lower_literal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/expr/mod.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1af048ed554480880c708fc03674fd45476be1e2b0ee79a7a271b91e4d3d936"}},{"ruleId":"D2","level":"warning","message":{"text":"syntax::ast_utils::extract_variable_comments_at_offset (cognitive 20): syntax::ast_utils::extract_variable_comments_at_offset has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/syntax/src/ast_utils.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a72499f1ff9e9caf4cba4c272f036b717769a7e426821705c0431243e1d7e0"}},{"ruleId":"D2","level":"warning","message":{"text":"NotifyActor::classify_event_path (cognitive 20): NotifyActor::classify_event_path has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e77593659d707e17ae395b78c5b5ac59ba6a68a96f561b41a70e1b29ff0b8a8"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::smoke::run_session_edit_loop (cognitive 19): bsl_analyzer::smoke::run_session_edit_loop has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 4 (5 pts), boolean chains 2 (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":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee0f8d53244a4a51e0d591e2191c18b4e9966dfac8b23a6650085f357e9f621"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::profile::signal_verified_leaderless_members (cognitive 19): bsl_check_executor::native_check::profile::signal_verified_leaderless_members has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":3475}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9a8a9afe47dd7a09a38f57d15f414fad6af7022b8070fede9418af05387446"}},{"ruleId":"D2","level":"warning","message":{"text":"Configuration::build_caches (cognitive 19): Configuration::build_caches has cognitive complexity 19 (threshold 15). Drivers by points: loops 13, if/else 3 (6 pts) (nesting depth added 3). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/configuration.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73752d7e7effcf7640a52b20a43b559ee0b370ae14876e353f8b04a43570b53"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_metadata::xml_parser::subsystem::parse_subsystem_xml (cognitive 19): bsl_metadata::xml_parser::subsystem::parse_subsystem_xml has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/subsystem.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee5ab6a058104a8d574112afeb87ce6027263cb7b364990af866c1b66b3c21b"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchEngine::ingest_files_fts (cognitive 19): SearchEngine::ingest_files_fts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2934}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8db47f29a81be28a147f1948accc286ad036271abfc224f5d1d12c3db56f14"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchEngine::embed_missing_overlay_chunks (cognitive 19): SearchEngine::embed_missing_overlay_chunks has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (7 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":5679}}}],"partialFingerprints":{"codehealthFindingId/v1":"082137b3c8c0caf5db6b17cbf45e38a6da917e380b0247fa856a01c3cbae591d"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_search::engine::removed_path_keys (cognitive 19): bsl_search::engine::removed_path_keys has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":6706}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a533bf7672a2adb7e4c3176c23b0e5b0b2e9180087f46d6ca3d4f0630caeb4d"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::diagnostics::check_duplicated_code_blocks (cognitive 19): hir_def::body::lower::diagnostics::check_duplicated_code_blocks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/diagnostics.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a7bfe9d427648ec7a03b1778798f5f6f1ea830774fd501722b9c92f7ca077a"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::expr::lower_new_expr (cognitive 19): hir_def::body::lower::expr::lower_new_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d928f6ab8850a12c81a2d967644b2756e381878a625470867c388b077590d34"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::definite_init::path_kind (cognitive 19): hir_ty::definite_init::path_kind has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/definite_init.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3c3bcb5aff2e78d21f1fe82ea9c0446fc678866814d5ed63da41831c648a7f"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::symbol_info::form::card::form_member_card (cognitive 19): ide::symbol_info::form::card::form_member_card has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/symbol_info/form/card.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cd4f0bfa0d4314e9386a4f4289e97e57f827a8655ad7e3db58cb584636f1c5"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::syntax_highlighting::highlight_token (cognitive 19): ide::syntax_highlighting::highlight_token has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"435fe0a2fbb493ed03fc572a4d85d0ef9d31435f68cc5bc87cd4059e44a9d62e"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::effects::detect_recursive_methods (cognitive 19): ide_db::effects::detect_recursive_methods has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/effects.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"433f03460c495165232d236e1f191364c46ccbabff1fc71634811527fb2c0797"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::queries::module_recursive_methods_query (cognitive 19): ide_db::queries::module_recursive_methods_query has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/queries.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f24ac23ada236b49ccce96835dcd61a24ab221e19751242dc71e38192307c6"}},{"ruleId":"D2","level":"warning","message":{"text":"InsertionTracker::report_duplicates (cognitive 19): InsertionTracker::report_duplicates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce1923dd19ac18a64d6be0902d52d4a5f5fb8fee066ea6f7646c94c26463671"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::missing_space::check_block (cognitive 19): ide_diagnostics::handlers::missing_space::check_block has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_space.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fec657eab6284470bf630e4a6c255f97283bc5f2bcadf8cd3ee36087b0e2d5b"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::rewrite_method_parameter::target_is_inside_while::contains_target_in_loop (cognitive 19): ide_diagnostics::handlers::rewrite_method_parameter::target_is_inside_while::contains_target_in_loop has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/rewrite_method_parameter.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a21d98565f2dd9a3ef1ae4e2be0ec12ddb9d6dfe3bd259905e85ba2cc9e67df"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_host_core::diagnostics_baseline::partitioned_error_observation (cognitive 19): ide_host_core::diagnostics_baseline::partitioned_error_observation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (5 pts), match/switch 1 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59fd63796aa117dc0a30397a69fdf7c142c5cbc4d1de93381c0a79713c55b6e"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalBaselineService::indexing_publication (cognitive 19): ExternalBaselineService::indexing_publication has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 5, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/baseline.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"3609e7c326a0c6ba2b65e62d218bdca93a97709b389416564e7ca23d26c1e056"}},{"ruleId":"D2","level":"warning","message":{"text":"Poller::walk (cognitive 19): Poller::walk has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":3871}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d08c21d8ea191e418bb292613cbc5b2a7e9d8f31fdcf029a46da74708c6b13"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphState::invalidate_scan_on_hub_drift (cognitive 19): GraphState::invalidate_scan_on_hub_drift has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/snapshot.rs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff85afbc0b395686b96f84c184e33f6657193c53c32563c50ddb102fbaa1e191"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphState::kick_first_build_without_a_watcher (cognitive 19): GraphState::kick_first_build_without_a_watcher has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":2854}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b888c62c73234cd11fac317ea7ac47d0cc8cbf9ffb2c266e15e774547c9b9f"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedState::boot_graph_generation (cognitive 19): SharedState::boot_graph_generation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b903a385254cf3c837dbd1323e6ed48f55745524e2d94d78c0a63be24b709b"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::broker::proxy::connect_with_launch (cognitive 19): mcp_server::broker::proxy::connect_with_launch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/broker/proxy.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c36048addb77c502cf1347beb6a977e416a177c94a7f89f55e299972e1cc53"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::graph_db::spawn_build_watchdog (cognitive 19): mcp_server::graph_db::spawn_build_watchdog has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 5 (7 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6922edde153cb8984b62507e66e4ff855e64cd9a7a3a6bdaed8ed37598f427"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::state::bootstrap::resolve_embedding_token_profile_values (cognitive 19): mcp_server::state::bootstrap::resolve_embedding_token_profile_values has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5143246d60faf740624e932f41cfa0a3ac788d8e5aca0f70c6244878ea60ff2"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::search::docs::find_docs (cognitive 19): mcp_server::tools::search::docs::find_docs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (8 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/docs.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5673b220807b259030b22d1d7557dd3e6b849b3aa1561235cc9489dc7cbb7bd"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::workspace_lease::spawn_heartbeat (cognitive 19): mcp_server::workspace_lease::spawn_heartbeat has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/workspace_lease.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"a165a20b7b370013f960fc8b338e7e492c5092fd2c34723ca989827873c67325"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::reparse::merge_errors (cognitive 19): parser::reparse::merge_errors has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/reparse.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"496e42ff51d5c9b4d730916bfb02ebef0f8da93318c427147717d995d558acb7"}},{"ruleId":"D2","level":"warning","message":{"text":"Project::discover_source_path (cognitive 19): Project::discover_source_path has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd849951b5f7c0c229170b2eb173b02bbbe20ded8974c45a79f700dd697d9cd8"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_in_expr (cognitive 19): LoweringContext::lower_in_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/expr/predicates.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"237e1ca132466029e8395b08e451af1620f76822fcdf71622172b6e5752dee57"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_selected_field (cognitive 19): LoweringContext::lower_selected_field has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/select_fields.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"78332872e38c6fbb2ef8f774589d71a1751801877629a95b36fd4a31bb821e4b"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthorFilter::blame_lines (cognitive 19): AuthorFilter::blame_lines has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcs/src/author_filter.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e1faac377c95cedd4c9f6ce14dbaacf45913aa6b1d68ddac5af8f1931d279a"}},{"ruleId":"D2","level":"warning","message":{"text":"base_db::queries::collect_methods_in_regions (cognitive 18): base_db::queries::collect_methods_in_regions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/base-db/src/queries.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41bf205e3c07e6ad6ca3d7ccc814694fe2f07ad5bcd6aeea4f717d485aec743"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::logging::journal::worker_with (cognitive 18): bsl_analyzer::bin::cli::logging::journal::worker_with has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/logging/journal.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e952ea737574779f79ed752a65a6c6139c2b76214dfed630b11ea6542aad365"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::mcp::validate_serve_args (cognitive 18): bsl_analyzer::bin::cli::mcp::validate_serve_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/mcp.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b149e3e03dada810dd0ccd1d8ec79a2ccaf2b5a12fb466ad48562ae583afdea"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::rules::run (cognitive 18): bsl_analyzer::bin::cli::rules::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/rules.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1db406c37fdf3c97e37074fc89ca1ffbca556f1394aac84fff21221bd76156"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::handlers::request::handle_workspace_diagnostic (cognitive 18): bsl_analyzer::handlers::request::handle_workspace_diagnostic has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), 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":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ed2f3c07851aae3db065fdbdab6e7ce2285b5c8f85f34671f9b601273936db"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::source::parse_configuration_boolean (cognitive 18): bsl_check_executor::native_check::source::parse_configuration_boolean has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf078a2866d6922dddb419ef1fae2b72f989e5b8f955ad1fff9ba05bf2c0c89"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::source::resolve_form_kind (cognitive 18): bsl_check_executor::native_check::source::resolve_form_kind has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"8289372314b70cec6ea26b72fd37ee773388ca1ede4bef536d7f028c057f2c08"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataObject::apply_extension_overlay (cognitive 18): MetadataObject::apply_extension_overlay has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 5, boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/metadata_object.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5799fb96302c46e16ac6c6c96c07a4890bfc09f35cc01c0e389a4941b9d5fc"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_metadata::xml_parser::form::parse_form_xml (cognitive 18): bsl_metadata::xml_parser::form::parse_form_xml has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 11, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/form.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"083c767cb01430366095c4301df7b5268db3c41eae024520c714c3fd147ad605"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_platform::overlays::extracted_type_keys (cognitive 18): bsl_platform::overlays::extracted_type_keys has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (5 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/overlays.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd6a0e1dadce78ddfa29fe5d9a30426d541f14bc98f5ebdf8d38f727f767652"}},{"ruleId":"D2","level":"warning","message":{"text":"html_parser::scraper_parser::collect_param_description (cognitive 18): html_parser::scraper_parser::collect_param_description has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73021a07d27fe74271ffd2c4f24d080519ea2b75e068c0c45abe6ae247ce73f"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::apply_context_refresh_batch_with_token_layout (cognitive 18): Store::apply_context_refresh_batch_with_token_layout has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (8 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d88bf841f1a4ff7f17647a5e53f03c2f828b7afae41f54a45c10fd1f6f76f7"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::clear_workspace_overlay_checkpointed (cognitive 18): Store::clear_workspace_overlay_checkpointed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":5465}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77006a539e5cd9443e61400e4c4e0a67dd46c6dd630d2fb3387b4b0e47b4c74"}},{"ruleId":"D2","level":"warning","message":{"text":"cfg::cyclomatic::cyclomatic_complexity (cognitive 18): cfg::cyclomatic::cyclomatic_complexity has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cfg/src/cyclomatic.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"480e1f9eb88e5c540a268e70a1dcacad3b54c75843289bdd578c76b474208493"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSymbolCtx::body_for (cognitive 18): FileSymbolCtx::body_for has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir/src/semantic_symbol.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdf1f01f10d29582092595210b666038cdc250e9cd2d7f156e4725a90fd0bb7"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::expr::lower_binary_expr (cognitive 18): hir_def::body::lower::expr::lower_binary_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccef7a8049749269982a2f82cda78a1750fb76833cd98d897421c872736b014"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::expr::detail_call_arguments (cognitive 18): hir_def::body::lower::expr::detail_call_arguments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (6 pts), match/switch 1 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0e2ac72e450b100f003cff1bd019bea0bf63a683ea8849fe6795b51357ad32"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::query_fragment::concat_role (cognitive 18): hir_def::body::lower::query_fragment::concat_role has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (3 pts), loops 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":"crates/hir-def/src/body/lower/query_fragment.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c54bed901a0c88c9e54002ecc408f6185d0fe493093644f208de5f3006a1d2"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::global_export_map (cognitive 18): InferenceContext::global_export_map has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (7 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"3faeaddc3a475f5ef14e1e3c290637240dbf885cd8f52fecf08894e77a10dc65"}},{"ruleId":"D2","level":"warning","message":{"text":"NarrowingTransfer::apply_guard (cognitive 18): NarrowingTransfer::apply_guard has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/narrow.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbe04f192e2bc2e38e6b460691be3db49e7266bb5905d8157c8cf3ea2ecd722"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::infer::infer_weaving (cognitive 18): hir_ty::infer::infer_weaving has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), 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":"crates/hir-ty/src/infer.rs"},"region":{"startLine":6926}}}],"partialFingerprints":{"codehealthFindingId/v1":"db799047c06153f376e6266abbe4d900780146990e2156c5d90c036906731369"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyEntriesVisitor::visit_seq (cognitive 18): LegacyEntriesVisitor::visit_seq has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e057d701ef2fe7fef4ac79b0cf30405e97209b5f4022a4895bc3d3089eedbd0"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::completion::bsl_completion::bsl_completions (cognitive 18): ide::completion::bsl_completion::bsl_completions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/bsl_completion.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc188114ddaa0683f4fc1675118c829ef6112e21badccb3e76a663ebdcb9a2e0"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::completion::mdo_completion::detect_from_dot (cognitive 18): ide::completion::mdo_completion::detect_from_dot has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (18 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/mdo_completion.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"738e5158887fe18fd83bf0474a6fa99df52210bdf52f2580bbf0f4bd1dc35b86"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::formatting::ir::apply_policy (cognitive 18): ide::formatting::ir::apply_policy has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/formatting/ir.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4021789956f4c4181f89e56551acd4af2101cffb0e0e4daebc94364c676e99"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::graph::accumulate_method_edges (cognitive 18): ide::graph::accumulate_method_edges has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2a3efa9889830dd51ba8d9696e32fd9833a78fe8306cbf7916bddffe291a7f"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::symbol_info::resolve_triple (cognitive 18): ide::symbol_info::resolve_triple has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/symbol_info.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d15bb246e42ad4a45b6f958fccc3aef1331464715a853df8dd50f1b47eb4136"}},{"ruleId":"D2","level":"warning","message":{"text":"BodyScan::stmt (cognitive 18): BodyScan::stmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (5 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/transferring_parameters_between_client_and_server.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"406a5fc71c8b4ecd7b5afaac8429ca19b14749d74badcd0f4ad170e63ea6a341"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphState::indexing_from_inner (cognitive 18): GraphState::indexing_from_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":2406}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a866d497b47a2a71a4ac220299bd193de6ac1acc5d451f308842c67d3b9f38"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedState::workspace_with_cache_and_prefixes_impl (cognitive 18): SharedState::workspace_with_cache_and_prefixes_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ee002f2463c62b274b1227cec53d427544aba4a6da131ce8a61d3c9627c46c"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedState::prepare_search_drift (cognitive 18): SharedState::prepare_search_drift has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (2 pts) (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":"crates/mcp-server/src/state/sync.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"082d6756415e26f3a86b6bc164d703054cb757e28fcc6fc7a2cb09e65349c5ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Owner::round (cognitive 18): Owner::round has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (9 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/overlay_backlog.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe93d793fc2ac5481a2f73025b71195ebf8828aafd50f68e49b0c852bc7664f"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::cache_windows::verify_access (cognitive 18): mcp_server::cache_windows::verify_access has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/cache_windows.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa163c5a9470b1a3c7ef87ebd99a24c7fc21e58a05fb09a35f5923fceefd9f1b"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::graph::scan::hash_xml_node (cognitive 18): mcp_server::graph::scan::hash_xml_node has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/scan.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56fa3de2623cc68e7c75d1898d3e7e46747c2af2459847be5e04bc055f472c8"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::execution::check_syntax (cognitive 18): mcp_server::tools::execution::check_syntax has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/execution.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"999855dd704746c8fc132f7c40d795f340e5785c9b807efae7a057901fe90df1"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::search::docs::search_docs (cognitive 18): mcp_server::tools::search::docs::search_docs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 5 (6 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/docs.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf8a5ef04994f13c33f9dbf990daaebca55a466d88b42cc64e379024fc34fc5"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::symbol_info::fit_card_to_budget (cognitive 18): mcp_server::tools::symbol_info::fit_card_to_budget has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/symbol_info.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab2a6b1ac776447eba0fbcb44e0c54a4626d64a58b965ca807cba34c162518b"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::sdbl::expressions::paren_or_subquery_expr (cognitive 18): parser::grammar::sdbl::expressions::paren_or_subquery_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0a651567da0437b8432a3418f62b09f82d7e86efb867d500700ecfd024b014"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::sdbl::select::totals_by_clause (cognitive 18): parser::grammar::sdbl::select::totals_by_clause has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/select.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"767eaacd1ba83c63e312caa54f2ef8cb213e3cfcfaa69c5af49497340a68aa1d"}},{"ruleId":"D2","level":"warning","message":{"text":"SdblHir::collect_referenced_objects (cognitive 18): SdblHir::collect_referenced_objects has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 5 (6 pts) (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd72fe4aea0233aa2a95c74c0c898653e5d552a02e70155c40ed14e41694ffb"}},{"ruleId":"D2","level":"warning","message":{"text":"SdblPackage::collect_diagnostics_recursive (cognitive 18): SdblPackage::collect_diagnostics_recursive has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 5 (6 pts) (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97f6ca216bcc04363dc40f0170385fa22067b04be1648ef161729a6e9072f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"SdblPackage::collect_expr_diagnostics (cognitive 18): SdblPackage::collect_expr_diagnostics has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f790e3a386c59f21bc6746279555f973cffa1dcc0596aa760ff60fc8b05349a"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::check_expr_for_ref_overuse (cognitive 18): LoweringContext::check_expr_for_ref_overuse has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9a2d07fc8f9f6dae2c6afd6eab17f9d7d22916de2f587fe82d1ff7b8cfc302"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_binary_expr (cognitive 18): LoweringContext::lower_binary_expr has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (7 pts), 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":"crates/sdbl-hir/src/lower/expr/ops.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d7349af8ce9da19052db1cda789b978c3604d76a37568775f6d10c5aa40ed8"}},{"ruleId":"D2","level":"warning","message":{"text":"sdbl_hir::hir::walk_level_expr (cognitive 18): sdbl_hir::hir::walk_level_expr has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f121eb426bb48cd65ee92766aeedcdc25276c7d5c2b4e474d015a4b54bad9e"}},{"ruleId":"D2","level":"warning","message":{"text":"sdbl_hir::hir::collect_expr_tables (cognitive 18): sdbl_hir::hir::collect_expr_tables has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ff15f2f6f06c3c1ba01cd912ad57c87c6d1f7e2bdb42765117df719b4238e6"}},{"ruleId":"D2","level":"warning","message":{"text":"stdx::fs::parallel_read_transform (cognitive 18): stdx::fs::parallel_read_transform has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (stdx::fs::parallel_read_transform_with_progress) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/fs.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"059638cc4d46503d6ebd5e41b22be2eaa6d2ddf3d5e7592f19aa54f03090dc87"}},{"ruleId":"D2","level":"warning","message":{"text":"stdx::fs::parallel_read_transform_with_progress (cognitive 18): stdx::fs::parallel_read_transform_with_progress has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (stdx::fs::parallel_read_transform) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/fs.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82e41574a7a00fd1365fed22d8b4a201d92c4f445b1b7fe2f5d4bc0ef20fe18"}},{"ruleId":"D2","level":"warning","message":{"text":"vcs::collect_file_changes (cognitive 18): vcs::collect_file_changes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcs/src/lib.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6412bb016ac8bada8d493eadd41575b0273d86c1f68e30105e831c81f3d0ab79"}},{"ruleId":"D2","level":"warning","message":{"text":"NotifyActor::watch_visiting (cognitive 18): NotifyActor::watch_visiting has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"be22d8d18560ac18329a0aeb66ff9e279e49b4f42993c34a5d06c4f2a4264b2f"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::readmit_open_documents (cognitive 17): GlobalState::readmit_open_documents has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/workspace.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e04bda33fb8c9c0481249b3dbb98622ed443c2e807a9ea2e44af66e7caf176f"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::contract::arg_surface (cognitive 17): bsl_analyzer::bin::cli::contract::arg_surface has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/contract.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fb3136f0120ce708fd75e85ab7737163e958715d7e22e09fe41bab53d72785"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::mcp::configure_named_onec_connections (cognitive 17): bsl_analyzer::bin::cli::mcp::configure_named_onec_connections has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/mcp.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34a56c04202ba19a590c4ffb5e443d398d9f36ca55f2afd98d664be942ce68e"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::server::run_event_loop (cognitive 17): bsl_analyzer::server::run_event_loop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea711f2a16710032580c11f6033e634c2de90864a58c5e4938107dbeb6f9247"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::profile::add_synthetic_owner (cognitive 17): bsl_check_executor::native_check::profile::add_synthetic_owner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, boolean chains 5, loops 2 (3 pts), 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":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec06be198799e23dd36312011ea16207585c55539b97d98614f567320b8091b"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::profile::leaderless_group_members (cognitive 17): bsl_check_executor::native_check::profile::leaderless_group_members has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":3530}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d065675383933ab6e4cd12e534bd61d086f45fc90bd8a14fe4738f68483138"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::source::parse_compatibility_mode (cognitive 17): bsl_check_executor::native_check::source::parse_compatibility_mode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5545aa9fd72027380a87b2edfbe792069eb6580f0db523994e59c8ba2ca25993"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_debug::dap::spawn_event_listener (cognitive 17): bsl_debug::dap::spawn_event_listener has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/dap/mod.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed30f5bf77891181078f3e0393cf1e336872d4e4c813e0e040b76769718ef0a"}},{"ruleId":"D2","level":"warning","message":{"text":"Register::apply_extension_overlay (cognitive 17): Register::apply_extension_overlay has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), 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":"crates/bsl-metadata/src/register.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e9be87d305ef17386c0dd92e1f24179756db240b8513a02928cacf697b0f87"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_platform::snapshot::check_kind (cognitive 17): bsl_platform::snapshot::check_kind has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, match/switch 1 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/snapshot.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be0d820f4740c72fcafe9f628a76c63830a99b15629398b218950a1bd974d20"}},{"ruleId":"D2","level":"warning","message":{"text":"html_parser::scraper_parser::extract_param_type (cognitive 17): html_parser::scraper_parser::extract_param_type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96864fd3351d19a64e2395f26673b79f87d3664e57ed012429cff7252072e8f"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_search::document::prepare_file_documents_with_context (cognitive 17): bsl_search::document::prepare_file_documents_with_context has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/document.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"660f9755fb0ef32ab61f54e5b385e4d9d0f474755e10def403bdd20a9b02f844"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_search::lifecycle::startup::observe (cognitive 17): bsl_search::lifecycle::startup::observe has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/lifecycle/startup.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a10fd29a7e412d952ccf5271641f7c46c4048b03cb358b072be07406aedbeb"}},{"ruleId":"D2","level":"warning","message":{"text":"dataflow::definite_init::analyze_definite_init (cognitive 17): dataflow::definite_init::analyze_definite_init has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/definite_init.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b836de27bc5b2460952addd4f18a1675fd70951b1768dd4b67ccecb73a95d9"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::diagnostics::check_commit_transaction_in_try (cognitive 17): hir_def::body::lower::diagnostics::check_commit_transaction_in_try has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/diagnostics.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2a1829c3f83acdfddd8025e840e0b0c8f3a1b112473474f53741e99a0ff442"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::call_graph::collect_foreign_handler_bindings (cognitive 17): hir_def::call_graph::collect_foreign_handler_bindings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/call_graph.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f7c29a798ec84c91708c5b773af0a7a68cd698b7d8f27829a0b416c6a96111"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::common_module_ref::common_module_var_bindings (cognitive 17): hir_def::common_module_ref::common_module_var_bindings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3, match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/common_module_ref.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4768ac19c6eb5ca8cb2887414ba8160a460bc5512f5c5756a04ac4bd260cc7ba"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::graph_index::project_workspace_role_edges (cognitive 17): hir_def::graph_index::project_workspace_role_edges has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 4 (7 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c842b6180221a2a7b3437b617aea5d6d531a94543fb1a3b80b55bc4818d922"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::form_items::body_may_change_items (cognitive 17): hir_ty::form_items::body_may_change_items has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (8 pts), boolean chains 7, if/else 1, loops 1 (nesting depth added 3). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/form_items.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cce0b9ec737d28cac07e6fe2e1329add23142d3d294fa08c00b8703b04738c3"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::method_resolution::materialise_signature_enriched (cognitive 17): hir_ty::method_resolution::materialise_signature_enriched has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"331c710c108c69235e4533a3e9b86090e32151179bfe0ec74492f2199ed0dc5a"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::narrow::refine_by_ternary_guard (cognitive 17): hir_ty::narrow::refine_by_ternary_guard has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/narrow.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbbdd11bf18a5add571a0a9b64a8a887c7dff96dee947bdc587c12cdf0cb725"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::completion::platform_completion::find_type_hints (cognitive 17): ide::completion::platform_completion::find_type_hints has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/platform_completion.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f67f11d4e4df6a9985bedb127e28d35bcb0846a5c960b7493a1e51cb0bafd35"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::formatting::ir::decide_inline_gap (cognitive 17): ide::formatting::ir::decide_inline_gap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/formatting/ir.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"630acbcd167ea529993ee53e163d9ea6c3051f6c40fe683b0a1f470b16c7edf1"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::graph::emit_fused_chunks (cognitive 17): ide::graph::emit_fused_chunks has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 2 (7 pts), loops 3 (6 pts), if/else 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b3f1d89ea8072c732b986b3d6b708ad88a412c74dda97a389470dcbd661544"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::graph::classify_graph_id (cognitive 17): ide::graph::classify_graph_id has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":3067}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf7754819d1502e24facb1a25bb456ce77c4dfb2f4796fcd55737d5a66e0371"}},{"ruleId":"D2","level":"warning","message":{"text":"ide::hover::hover_free_name (cognitive 17): ide::hover::hover_free_name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/hover.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a42a271420bc17b95ba1e2665c50611b2227b64cc8ec256783d839ccf55a32"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::effects::module_effect_summaries_query (cognitive 17): ide_db::effects::module_effect_summaries_query has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (5 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/effects.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db3881438e12ffa1efadbf503c34ff6bb5914b00df65d9f2fce3b389f7fab9c"}},{"ruleId":"D2","level":"warning","message":{"text":"BodyScan::bare_call (cognitive 17): BodyScan::bare_call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/transferring_parameters_between_client_and_server.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b33ae567c95ee03f1a312434f15be97e486f36664965b90d137a43e0e745f3"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::data_exchange_loading::check_change_and_validate (cognitive 17): ide_diagnostics::handlers::data_exchange_loading::check_change_and_validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/data_exchange_loading.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e5bf1512aae85a664bd5824b9f35eeca493c7313a5087e362d2407c2c5f4f8"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::duplicate_string_literal::collect_strings (cognitive 17): ide_diagnostics::handlers::duplicate_string_literal::collect_strings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicate_string_literal.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd1647c4060147f3f547c3d0f0a94dc0cb21d6d947f07cc92b466c42016b0e0"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::line_length::process_comments (cognitive 17): ide_diagnostics::handlers::line_length::process_comments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/line_length.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"797e9e6aee399d6e1cbdbd021cec784449b902b3ab2ff09760916ea9b32b103c"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::typo::check_text (cognitive 17): ide_diagnostics::handlers::typo::check_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/typo.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdde044fbe282c8cac9faac30cbdbd9a57498ef4c08d6c4f0e50e666e255bd1"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::unused_local_method::remove_method_fix (cognitive 17): ide_diagnostics::handlers::unused_local_method::remove_method_fix has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 5, loops 3 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_method.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b589b75e12936bab5a9f1008603ed69ae506ffd04085fc45e43f3609b26029dd"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::unused_parameters::remove_parameter::remove_parameter_fix (cognitive 17): ide_diagnostics::handlers::unused_parameters::remove_parameter::remove_parameter_fix has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_parameters/remove_parameter.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4ddb6d8694c276e4897e71203f4e14b8b77cafc9be504cf6c7e2f183b5cc6d"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::value_is_filled_of_boolean::check_body (cognitive 17): ide_diagnostics::handlers::value_is_filled_of_boolean::check_body has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/value_is_filled_of_boolean.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d0ebc2473ce70ebf1b5bb6ec1cb821a4d57bbd087ed45079841bebf0928d12"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::sdbl_utils::sdbl_dialect_attested (cognitive 17): ide_diagnostics::sdbl_utils::sdbl_dialect_attested has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), 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":"crates/ide-diagnostics/src/sdbl_utils.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a1f5dcdf5ced48674534ea9f4a7b4a6e96e761a2a80417078efd26591311f2"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::suppression::parse_directives (cognitive 17): ide_diagnostics::suppression::parse_directives has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/suppression.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dc703db7402729d74bddd8d9cfcc3798211ed056e3fd9a7f17ce8731b2d65b"}},{"ruleId":"D2","level":"warning","message":{"text":"RefreshableExternalBaselineSource::run_with_refresh (cognitive 17): RefreshableExternalBaselineSource::run_with_refresh has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 4 (6 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/baseline.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"16977287f8df2212185b8ea2008ba37c7914f49c32f9dfc90d564a46ad808515"}},{"ruleId":"D2","level":"warning","message":{"text":"Poller::verify (cognitive 17): Poller::verify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":3978}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c00d72b4e0ea4b22f763f7e4991b50e04198d4db7e438cf9cba80f043ff7953"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDebt::record_failure (cognitive 17): GraphDebt::record_failure has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/debt.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"7294583ae8a758424b2cbc40236720bd5992c0a64ea0c7e271b3d2822002a940"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphDebt::decide (cognitive 17): GraphDebt::decide has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/debt.rs"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4138857944d5468f58034089d8c5afcaa1cd38ac92398d60af01f20ca0e43b"}},{"ruleId":"D2","level":"warning","message":{"text":"Watcher::is_project_input (cognitive 17): Watcher::is_project_input has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/watcher.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"107b922b2ffe2de05f0de48220d7fb144f9352aaf5cc7e61ceeb558cfdd6200a"}},{"ruleId":"D2","level":"warning","message":{"text":"Target::native (cognitive 17): Target::native has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/indexing.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec250b22ea0789ce53d11ab7f35d0a2f6db4aa351e539a2003c82b599730448"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceSearchState::new_with_reference_cache_and_deferral (cognitive 17): ReferenceSearchState::new_with_reference_cache_and_deferral has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"01dc46a7eb60a9286a218fcfe1354a088a27702a1007fcf76cb0f2e288bcc84a"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedState::init_reference_search_engine_at (cognitive 17): SharedState::init_reference_search_engine_at has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2812}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01ed6403410127c4bbb9d69a0e3313cd6795d75db9361ba18b222f007bb5c77"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::check_executor::spawn_executor (cognitive 17): mcp_server::tools::check_executor::spawn_executor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/check_executor.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc1902b9016768929bb62e9bb8347ff9bec964d0aace09e6c9ab292a1fcfabc"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::metadata::live_object_completeness (cognitive 17): mcp_server::tools::metadata::live_object_completeness has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc0fb1464b6dbc9a4bb52cce95e1270b7ef0b07190b7e455305ceaf44440f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::references::attach_previews (cognitive 17): mcp_server::tools::references::attach_previews has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/references.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"986ae76e899229a22d488677e22efcb6a8af6ec463fb9604bf1751097245a122"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::search::lexical::merge_direct_lexical_with_refill (cognitive 17): mcp_server::tools::search::lexical::merge_direct_lexical_with_refill has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"5507d2c104039231bdaac562eb0ce86f4c628a394447f1f5a762aced7f17c900"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::search::semantic::merge_direct_semantic_with_refill (cognitive 17): mcp_server::tools::search::semantic::merge_direct_semantic_with_refill has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/semantic.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d0c8cf19a4e74fd83013172d66464c535d0c7ade1c1d56b9c901456bdb4e7e"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::check_column_ref_for_ref_overuse (cognitive 17): LoweringContext::check_column_ref_for_ref_overuse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba28dcfd1c8e3b02ed1aee310d921b3794c5fd94cfab23444a456d017bc92d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Scope::find_tables_with_column (cognitive 17): Scope::find_tables_with_column has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/scope.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9ab819af6457f24bf1cefeed72fdfa359e8f3f8f10fa3d6e3531dd76c744c7"}},{"ruleId":"D2","level":"warning","message":{"text":"ExcludedPaths::with_patterns (cognitive 17): ExcludedPaths::with_patterns has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/path_exclusion.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb2e9064b429e980ef651cf11c65477487edbaf006ba4ac4931ff38a3031a3a"}},{"ruleId":"D2","level":"warning","message":{"text":"syntax::ast_utils::leading_comments (cognitive 17): syntax::ast_utils::leading_comments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, match/switch 2 (3 pts), loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/syntax/src/ast_utils.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8b2ab8c065a3626e18c3862108b3be890c8b9e9a8d2c031375ebbb88becf1a"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::bin::cli::mcp::shared::run_daemon (cognitive 16): bsl_analyzer::bin::cli::mcp::shared::run_daemon has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 1 (2 pts), 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":"crates/bsl-analyzer/src/bin/cli/mcp/shared.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75010c22e85ab9bec770f7e46f06cbfee8b3fcc02cccdecd0bd2d0a4dfc247f"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_analyzer::server::handle_latency_request_finished (cognitive 16): bsl_analyzer::server::handle_latency_request_finished has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"621652dedc7883e78fe25d6c2732a878af74bae0c223e7dd842f9d1aad402784"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::profile::parse_ibcmd_extension_list (cognitive 16): bsl_check_executor::native_check::profile::parse_ibcmd_extension_list has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"544ec0152ea2bc64aa0ea63971066cb920898a2fa10f809602759cf14ec8bafb"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::profile::cleanup_owned_processes (cognitive 16): bsl_check_executor::native_check::profile::cleanup_owned_processes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":3210}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b179b55ea64ff17afd72e12cbb8861aa6599beb48dca53cc9ac5f7a5f7fe49"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::source::parse_script_variant (cognitive 16): bsl_check_executor::native_check::source::parse_script_variant has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (5 pts), 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":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b9da92d5a5dc6c4d491dbb10bd34fe1c70b9d68c0d742ff28d6d7a4a09e8f5"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_check_executor::native_check::windows_acl::verify_private_directory (cognitive 16): bsl_check_executor::native_check::windows_acl::verify_private_directory has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/windows_acl.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fee34ef52e5fed4ca5f2661b5e4d7a9b8b571a0bd9e0d44036d0f3441faa3a"}},{"ruleId":"D2","level":"warning","message":{"text":"EventListener::start (cognitive 16): EventListener::start has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/listener.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8c2e18ba176d63c50835589fe827d6ecad19f92c205d0f0411b9f27682d1c3"}},{"ruleId":"D2","level":"warning","message":{"text":"DebugSession::wait_for_stop (cognitive 16): DebugSession::wait_for_stop has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/session.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d8fa1e5870084d6c64cda349bbc6d9ff6cfb30309055fff10710db6abd2cc5"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_launcher::use_cases::cleanup_versions (cognitive 16): bsl_launcher::use_cases::cleanup_versions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), 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":"crates/bsl-launcher/src/use_cases.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b62e240bfe618c7d6968ba24a56708701611018b79d6846c809a58f71fad58"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_metadata::loader::discover_dir_with_predefined (cognitive 16): bsl_metadata::loader::discover_dir_with_predefined has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a7908419e2c514aa862641baa4c23317efa9def2c64dd2e7abc7cf8792f1da"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_metadata::xml_parser::common_attribute::parse_common_attribute_xml (cognitive 16): bsl_metadata::xml_parser::common_attribute::parse_common_attribute_xml has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (11 pts), if/else 2, loops 1 (2 pts), 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":"crates/bsl-metadata/src/xml_parser/common_attribute.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c8c1dc21df850992dc020b305692c5c8f20253088ac3576e1c786445005c36"}},{"ruleId":"D2","level":"warning","message":{"text":"PlatformSnapshot::validate (cognitive 16): PlatformSnapshot::validate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 5, boolean chains 1 (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/snapshot.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bbc4e9f24b09cbfdb2abafb31ce17aa6cebdbd6dd23f8407876ed00f00246a"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceRootsTransitionSeed::plan (cognitive 16): WorkspaceRootsTransitionSeed::plan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"507d4fea6b15f0c82033cadda5e5f07dda127f0cf68a117c1a1c031fcbc315b3"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchEngine::prime_workspace_overlay_standalone_retrying (cognitive 16): SearchEngine::prime_workspace_overlay_standalone_retrying has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (4 pts), match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":5559}}}],"partialFingerprints":{"codehealthFindingId/v1":"db23341a0e833ae59e2b0fe28e6fb462ddd0f031f9d3287cadb86b886459f10a"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresBaselineAdapter::load_snapshot_documents (cognitive 16): PostgresBaselineAdapter::load_snapshot_documents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a9ad4b050420e30b410f8aac7eba0ba40d18d5119bc4758e5279cb7398eadd"}},{"ruleId":"D2","level":"warning","message":{"text":"Mutation::finish_inner (cognitive 16): Mutation::finish_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/lifecycle.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacecde48285801b207773445362747b21028ff29cbe6124f470c197549415aa"}},{"ruleId":"D2","level":"warning","message":{"text":"PointCapture::prepare (cognitive 16): PointCapture::prepare has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/point_refresh.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4908f8f484155799bd2e0c4e23350e31fa35cec6ebc26add7fc82b4cd94209d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::rebuild_root_keyed_tables (cognitive 16): Store::rebuild_root_keyed_tables has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0e55bf8ec532f84f2fc434ff71293a5cc900c3313ab0653123e8c203be6ce6"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceOverlayCache::transition_roots (cognitive 16): WorkspaceOverlayCache::transition_roots has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db01ab55ce3e35e9464791ac0874b475c0a19cb5baa6c2cf4f2e96ec6dedf63"}},{"ruleId":"D2","level":"warning","message":{"text":"bsl_types::intern::write_type_order_key (cognitive 16): bsl_types::intern::write_type_order_key has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), match/switch 4 (7 pts), if/else 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":"crates/bsl-types/src/intern.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1e4814d0576f1606b4323d5bef811c20a2f31431be8a167b273d27e9ba3387"}},{"ruleId":"D2","level":"warning","message":{"text":"CfgBuilder::walk_preproc_if_statement_hir (cognitive 16): CfgBuilder::walk_preproc_if_statement_hir has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cfg/src/builder.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8a11b989803407cbd466831557edbcd81e2637885c3a82e022e03d203a2926"}},{"ruleId":"D2","level":"warning","message":{"text":"dataflow::guard_predicates::is_guarded_dfs (cognitive 16): dataflow::guard_predicates::is_guarded_dfs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/guard_predicates.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ab681fb712bc52bc468183723dbd1048d1d53b42ac8e109ff07dc921cf0794"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSymbolCtx::resolve_name_to_definition (cognitive 16): FileSymbolCtx::resolve_name_to_definition has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir/src/semantic_symbol.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcdb001ff9cd749ba427e4ef0854b3ce0dd860b4ea7e1acfa7eb8d0fe9a861d"}},{"ruleId":"D2","level":"warning","message":{"text":"MetricsVisitor::visit_expr (cognitive 16): MetricsVisitor::visit_expr has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (7 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/metrics.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8dec5ff0ac6a086e0a7f2d16e9ccb25d31e7defe8a6544150735efac9d7979"}},{"ruleId":"D2","level":"warning","message":{"text":"ModuleIndex::build_from_paths (cognitive 16): ModuleIndex::build_from_paths has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/module_index.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb55f802aa7e5e72845fcd3ef6af073c58ed50ca37631d375cd789cb5c9780a"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::global_common_module_exports (cognitive 16): Resolver::global_common_module_exports has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/resolver.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a952b204e192695d1dd1991a8f9496db8062fa040c0f1a319ac560a5ee0047e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver::application_module_exports (cognitive 16): Resolver::application_module_exports has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/resolver.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5ccc98da8c189d5c4f613a2b44dd4ad9fa0750d3ca8d0abde09302e306f294"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::body::lower::expr::lower_literal (cognitive 16): hir_def::body::lower::expr::lower_literal has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee04a4930d99c2449dea1c64fdaab29a9a671e66e51cd312b67b6813dc9161c5"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::graph_index::project_form_binding_edges (cognitive 16): hir_def::graph_index::project_form_binding_edges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c365f1b92a954369cea56f84b87787f957c9097c56ae857744ff5f79c6ec6ca"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_def::ty::doc_types::parse_type_name (cognitive 16): hir_def::ty::doc_types::parse_type_name has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/ty/doc_types.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fce11b1debe3684263aacfd2fd782f5d96a8ec5d8059e1a4bb56e8f5e357fe2"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::register_records_element_ty (cognitive 16): InferenceContext::register_records_element_ty has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":2854}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd87073fc7eff07c7a56e011cd8e67210eb6553bee952b3e018f09bab58c96c3"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_binary_op (cognitive 16): InferenceContext::infer_binary_op has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4787}}}],"partialFingerprints":{"codehealthFindingId/v1":"5818ffae248cd6fd3b48d6aaaa8691bb368db3562eb9f0791d69359d28ca62b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Forwarder::resolve_callee (cognitive 16): Forwarder::resolve_callee has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/structure_param_keys.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cfc166cd0344473d7d6bdbda65f8cf6dd6a325931cb154732c22517066711a"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::module_implicit::module_implicit_fields (cognitive 16): hir_ty::module_implicit::module_implicit_fields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/module_implicit.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff518195bf559a693d45d168695701604da9c276cd7081a2d0f42f419014b76"}},{"ruleId":"D2","level":"warning","message":{"text":"hir_ty::sdbl_bridge::query_to_projection (cognitive 16): hir_ty::sdbl_bridge::query_to_projection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/sdbl_bridge.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbd5b209200552a45b75c6266573c6b955354c40fcb78f30fd5f558dd506c77"}},{"ruleId":"D2","level":"warning","message":{"text":"RootDatabaseImpl::resolve_metadata_object_over (cognitive 16): RootDatabaseImpl::resolve_metadata_object_over has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (RootDatabaseImpl::resolve_register_over) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":2189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b9a4e1ddfb9784fa1ab3b9737fc13517f39fa89ece34490dab2b18bf787e17"}},{"ruleId":"D2","level":"warning","message":{"text":"RootDatabaseImpl::resolve_register_over (cognitive 16): RootDatabaseImpl::resolve_register_over has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (RootDatabaseImpl::resolve_metadata_object_over) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":2253}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7ca30508d683296ad96f686a8b435d83cc4d58cf9b10c5aefe50a55b94123b"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_db::queries::module_metadata_query (cognitive 16): ide_db::queries::module_metadata_query has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), 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":"crates/ide-db/src/queries.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"160fb0fe040bafa2ee5881c740f5bbe5c7983be21edbc812224d6495c88468cc"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::data_exchange_loading::check_interceptors (cognitive 16): ide_diagnostics::handlers::data_exchange_loading::check_interceptors has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/data_exchange_loading.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1462832ab93cc49aa17916e0f7fe60137a64922ff0cf20f6af2492eda8c83f3"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::deprecated_attributes_8312::get_message_and_replacement (cognitive 16): ide_diagnostics::handlers::deprecated_attributes_8312::get_message_and_replacement has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deprecated_attributes_8312.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"846df6d2ef891f33137e365013cdaf34f1840adc6119a24fc6ee39e79bcd9712"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::incorrect_line_break::check_block (cognitive 16): ide_diagnostics::handlers::incorrect_line_break::check_block has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), 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":"crates/ide-diagnostics/src/handlers/incorrect_line_break.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6778075d83f37db0f9606d3dc1a6a937e935d37039d33e9d5592a27a1638e03"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::line_length::process_code_tokens (cognitive 16): ide_diagnostics::handlers::line_length::process_code_tokens has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/line_length.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e810677c1692188b0f9defd70a33ac91f84e11e57da881be0b50c3a67fa07da"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::magic_date::is_in_date_function_simple_assignment (cognitive 16): ide_diagnostics::handlers::magic_date::is_in_date_function_simple_assignment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 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":"crates/ide-diagnostics/src/handlers/magic_date.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3493eb9ce4fcbd970470937e91541f581998f3ef5446606086cebe596e69553"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::unreachable_code::collect_unreachable_ranges (cognitive 16): ide_diagnostics::handlers::unreachable_code::collect_unreachable_ranges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unreachable_code.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6601b96f01887ff433019e36645f334671c02eebef522c0c1930140bf9a077"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::using_hardcode_secret_information::check_insert_call (cognitive 16): ide_diagnostics::handlers::using_hardcode_secret_information::check_insert_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (16 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_hardcode_secret_information.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6c2b7e339f4c9cd183032cdc4337c5f99d0f071ca2861f20d963e695b6b851"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_diagnostics::handlers::using_service_tag::check_default_tags (cognitive 16): ide_diagnostics::handlers::using_service_tag::check_default_tags has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, 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":"crates/ide-diagnostics/src/handlers/using_service_tag.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0553c03a2a89034c259e9dce83e88e7079f56d3b0336ce0bf370c9c9067db947"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceBackend::reconcile_catalog (cognitive 16): WorkspaceBackend::reconcile_catalog has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/workspace.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"4721545643443046fcc549381855fad5314204a548b22bf9421daa740ba3dc6c"}},{"ruleId":"D2","level":"warning","message":{"text":"ide_host_core::project_config::env_options_from_features (cognitive 16): ide_host_core::project_config::env_options_from_features has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/project_config.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b501df5fc6244e6f69af0f601ef801d2ebbb3dca056b03d072e60d21f00b56"}},{"ruleId":"D2","level":"warning","message":{"text":"Poller::take (cognitive 16): Poller::take has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":3931}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63fd26672f43d2570977450ce158ed6187f4b0ef7f96b8b2dbaf6ed581ae7dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Watcher::watch (cognitive 16): Watcher::watch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/watcher.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15eac8de758b3c480ab4e860a08d87b56587a9391cebe419fb601270f33f620"}},{"ruleId":"D2","level":"warning","message":{"text":"McpServer::reference_search (cognitive 16): McpServer::reference_search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":3164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f60bdf4feab2728e5d84391043405e0dafa927094faa9fc7ad55e05865542a9"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::check_executor::execute (cognitive 16): mcp_server::tools::check_executor::execute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/check_executor.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6810238f3802a43defbb08828e314df217c8f9ae6bb2eec0410674d2dcba2a4"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::debug::debug_attach (cognitive 16): mcp_server::tools::debug::debug_attach has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 3 (5 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/debug.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fa13036b227a2daa7f751c10bd5965e04952fdab08c258ba080d485399b9b8"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::diagnostics::snippet::findings (cognitive 16): mcp_server::tools::diagnostics::snippet::findings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics/snippet.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"004999b312838d60da2daa780279020c4f6a0ac9f8d439fec75ce1be83a0260b"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp_server::tools::references::select (cognitive 16): mcp_server::tools::references::select has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/references.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1823458b8b373dfe3d700eaf671ecb83a9d934c9e774e30375df1acd131f006d"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::sdbl::query_package (cognitive 16): parser::grammar::sdbl::query_package has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e2e038784d91942f85dc3e1f67f001ce4bd853b66711968d100219a0144e03"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::grammar::sdbl::select::totals_periods_modifier (cognitive 16): parser::grammar::sdbl::select::totals_periods_modifier has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/select.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabbabf36f89b3189a22d719f15fddd2cba63c16d719da49538fe34610cf4a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"parser::parser::torn_if::conditionals (cognitive 16): parser::parser::torn_if::conditionals has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/parser/torn_if.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a683e941d6c871d92c03ea1b9903801bfbcaa179f01df4ff166ea20245f1a1fd"}},{"ruleId":"D2","level":"warning","message":{"text":"platform_help::external::scrubbed (cognitive 16): platform_help::external::scrubbed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform-help/src/external.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae36610ee8804fea9f28fe3cad199d38b9c5f1d82ad1c67032111591f25e52ae"}},{"ruleId":"D2","level":"warning","message":{"text":"project_model::file_role::file_role (cognitive 16): project_model::file_role::file_role has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/file_role.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8615a22beaeaed6a5d304b00850e8cb4df1ce8cda0c40d928a7160242c0b961d"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::check_register_recorder_fields (cognitive 16): LoweringContext::check_register_recorder_fields has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 5 (6 pts) (nesting depth added 4). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8423cb6e739202317e9861fd9cdf32b4ed4fa31de2c2e09b15d4c2f41ec90f"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::check_order_by_document_date (cognitive 16): LoweringContext::check_order_by_document_date has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b4ec603486084d64fe445db6f54a6f123e06eee4e0ba74619a931f4d3ca3b4"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::resolve_external_data_source (cognitive 16): LoweringContext::resolve_external_data_source has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32c339ea33c9f6369df2c00aaf92ae08de4fde2b90c95e4ea203fd5d0fa2afd"}},{"ruleId":"D2","level":"warning","message":{"text":"sdbl_hir::context_detector::find_last_as_keyword (cognitive 16): sdbl_hir::context_detector::find_last_as_keyword has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (7 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/context_detector.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac39e6b1f0c2f07831916cb17031347b70776d61865f95f45f4551d018acc448"}},{"ruleId":"D2","level":"warning","message":{"text":"sdbl_hir::lower::from_clause::collect_equality_fields (cognitive 16): sdbl_hir::lower::from_clause::collect_equality_fields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5dd55b1b92f9d3aa40a304e893030a3f3dfc44bb4cd4a28261153a90fd6c0f"}},{"ruleId":"D2","level":"warning","message":{"text":"Patterns::respelled_under (cognitive 16): Patterns::respelled_under has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/path_exclusion.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3c410f8755474929d2547dc01c0a99d0f6637236c8be2b888f0b6251c7a9c4"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_lifecycle.wait_runtime_profile (cognitive 16): runtime_lifecycle.wait_runtime_profile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user2/runtime_lifecycle.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a2d53f58965d214146359ea87a7f0974bdc503ddd86112fbc620b7f743cf30"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SearchEngine: ClassTooLong \u2014 4049 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 189 methods, 3 blocks, lines 457-6660. The bar is 400 significant lines; this is 3649 over it, 10.12\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"866fd8b2bd73d7c84e6efaf45391e8551e536f8637155a5ce9c8a14955040946"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/engine.rs: FileTooLong \u2014 4591 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: SearchEngine (3 blocks, 457-6660). The bar is 500 significant lines; this is 4091 over it, 9.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f009da776393270b3d85aee6e682dd0394db897e108b05d130e7a71fc4fac5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/infer.rs: FileTooLong \u2014 4130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: InferenceContext (2 blocks, 670-6513). The bar is 500 significant lines; this is 3630 over it, 8.26\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed49fad9326a390e6132791b296600b9d489dffb0a9947170d6fab5c7c341150"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InferenceContext: ClassTooLong \u2014 3272 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 133 methods, 2 blocks, lines 670-6513. The bar is 400 significant lines; this is 2872 over it, 8.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"646394265cd108843d65f37614c1b0747dc45abe89bc909ca9219703f9021c53"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/store.rs: FileTooLong \u2014 3983 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 3483 over it, 7.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03f5b9942062f03243a0ec2ad1052a4bb03ea074d3a6f1c9caeae7f8ea5f768"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: external_baseline/postgres.rs: FileTooLong \u2014 3534 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 56 free functions. The bar is 500 significant lines; this is 3034 over it, 7.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ceec00ad1ec71ee6ad33817e2f3a2f12dd05d4e3165977684cfcdf98871ef6b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SearchEngine: TooManyMethods \u2014 189 methods. The bar is 30 methods; this is 159 over it, 6.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8335c30a9a8b18615593b62295d07843e6da3564989c2b3ead192b6c6f7d36c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::bin::cli::analyze::analyze_salsa: FunctionTooLong \u2014 bsl_analyzer::bin::cli::analyze::analyze_salsa runs 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) in one body. The bar is 100 significant lines; this is 485 over it, 5.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"195a408d38fc01a29818bfbb9a7f70a8752d39e108f020e928c01ef35a3fe2e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2896 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 60 free functions. The bar is 500 significant lines; this is 2396 over it, 5.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce87725febbf7e43d508f949d0728364e284d84c94e23dae32cc2396b6b6b24"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RootDatabaseImpl: ClassTooLong \u2014 2316 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 129 methods, 11 blocks, lines 95-4041. The bar is 400 significant lines; this is 1916 over it, 5.79\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1f9665de18d141cf93fedfc0082b711716e7152e79d3c7c5aca860dddb43dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_check/profile.rs: FileTooLong \u2014 2803 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 82 free functions. The bar is 500 significant lines; this is 2303 over it, 5.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5b8d8e1a0444491d4df85c12e4cce40022815bf1e2a90c384b712cc4e57b3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_check_executor::native_check::profile::run_native_check: FunctionTooLong \u2014 bsl_check_executor::native_check::profile::run_native_check runs 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) in one body. The bar is 100 significant lines; this is 453 over it, 5.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"0febf1ac36d96b57b0f69a576cbe187d074e3574652de7ec54b6c8eb4cb6dd7b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Store: TooManyMethods \u2014 156 methods. The bar is 30 methods; this is 126 over it, 5.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44e6bd0d5495fb669dec9ee061f17e8207dd752cf1f12fc4b9dc0943ebac9b5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PostgresBaselineAdapter: ClassTooLong \u2014 2068 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 50 methods, 9 blocks, lines 115-2969. The bar is 400 significant lines; this is 1668 over it, 5.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a89be49e30fd1a9dfcfcdc77a90ab1b589605bb14d0bd8374d9b75506cdadd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/database.rs: FileTooLong \u2014 2433 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 95% of them inside a single declaration: RootDatabaseImpl (11 blocks, 95-4041). The bar is 500 significant lines; this is 1933 over it, 4.87\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7603ad151eb3979091a39d03da904894c2eaa745e1a61f5a1781aeafdbd273fd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InferenceContext: TooManyMethods \u2014 133 methods. The bar is 30 methods; this is 103 over it, 4.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"11726b38aab50c9504e596913b2547f558fc3ca58adaefa1167dec4532cce5ad"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RootDatabaseImpl: TooManyMethods \u2014 129 methods. The bar is 30 methods; this is 99 over it, 4.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"31533a711ae2dabdd9ecc9a46a37aea2d6f9a9a04cd381924c949bfe240c1bc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/change_hub.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), declaring 44 free functions. The bar is 500 significant lines; this is 1550 over it, 4.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d968b8a6976cc7011dd7c79d4fe57c3daaadfed3ff5196a0798f7ab473b1c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1950 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: McpServer (5 blocks, 1254-3467). The bar is 500 significant lines; this is 1450 over it, 3.90\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17529ea0b3ffb9fe54560cfab0d3c28c761ffc1349ad88826d4ace96fbe0d791"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/graph.rs: FileTooLong \u2014 1938 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 1438 over it, 3.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1523ce078c9232396c788f33359b0e258b381656ca4354e1e7d72f515f5c26c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/workspace_overlay.rs: FileTooLong \u2014 1927 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: WorkspaceOverlayCache (3 blocks, 168-2473). The bar is 500 significant lines; this is 1427 over it, 3.85\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8005e2471f1a11bc07f5fdad37f884c8e124728cdfb35dabe3ec864b55cc918b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GraphState: TooManyMethods \u2014 115 methods, declared across 2 files: graph/state.rs (100), graph/snapshot.rs (15). The bar is 30 methods; this is 85 over it, 3.83\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b459c66ccf08126d3a3f4828afb96d2f1f04ea44e7681cc8ea2da7707c40fad4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mcp_server::tools::search::status::search_status_with_cap: FunctionTooLong \u2014 mcp_server::tools::search::status::search_status_with_cap runs 382 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 282 over it, 3.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/status.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2f755abb581be238f704cf051042e23b8ae9425973944d0a76ef5f10f2b0fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/bootstrap.rs: FileTooLong \u2014 1859 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: SharedState (663-3004). The bar is 500 significant lines; this is 1359 over it, 3.72\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c31f0c0cbdf6769aaade4cbdfb867e642b169d6914a1db88a937e2437a8b44e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.infer_call: MethodTooLong \u2014 infer_call runs 369 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 269 over it, 3.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4963}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2067c7c827709823b73de50f44c24ed2ba515e66e90d2b5d2de5f858e1f6622"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::bin::cli::diagnostics_baseline::apply_partitioned: FunctionTooLong \u2014 bsl_analyzer::bin::cli::diagnostics_baseline::apply_partitioned runs 365 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 265 over it, 3.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"b571bfb1cc2872ae31346132f8a7d46d2930541eacdac10f4c2af16c192da739"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SharedState: TooManyMethods \u2014 109 methods, declared across 4 files: state/mod.rs (50), state/bootstrap.rs (37), state/embed.rs (12), state/sync.rs (10). The bar is 30 methods; this is 79 over it, 3.63\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/mod.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"597a8827fa87114c6ce951dd343a3a989f7bfda2fb281ca01c7b9c57f20ca59f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/graph_db.rs: FileTooLong \u2014 1794 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 1294 over it, 3.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff779bb0e396d99ab2f625f69e535667e3a870dd5b330dbc7474cbfd44cd2b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::bin::cli::deps::run_deps: FunctionTooLong \u2014 bsl_analyzer::bin::cli::deps::run_deps runs 348 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 248 over it, 3.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/deps.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ca159284ced04e8333adac36f5410bd3b9b5df4180a4f7d98dfe4173f58a4b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: McpServer: ClassTooLong \u2014 1367 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 5 blocks, lines 1254-3467. The bar is 400 significant lines; this is 967 over it, 3.42\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0746868a748a57aec62dc5c9aedf0c4e9de1a13d2ab40f9572fdb2949de8a37a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorkspaceOverlayCache: ClassTooLong \u2014 1335 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 63 methods, 3 blocks, lines 168-2473. The bar is 400 significant lines; this is 935 over it, 3.34\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b9e3d0913519b2d036715127e20eb819dd75d04b57b07379cf51fbfd889620"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handlers/request.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), declaring 44 free functions. The bar is 500 significant lines; this is 1116 over it, 3.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d88d8a715de9583e6ab034ee0f1ce2ab1c0278ad8d9984606e0f4e6db36624b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LoweringContext: TooManyMethods \u2014 95 methods, declared across 12 files: lower/diagnostics.rs (31), lower/from_clause.rs (20), expr/mod.rs (10), lower/clauses.rs (9), \u002B8 more file(s). The bar is 30 methods; this is 65 over it, 3.17\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/context.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd7bbc9f5428bc250c18d720e6b89dfdf9ab8a5c8ff68c340fd26992034b8cb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: GlobalState: TooManyFields \u2014 95 stored fields beside 88 methods. The bar is 30 stored fields; this is 65 over it, 3.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/global_state.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a7dcd080ef2c90c70fedfaaee8015aa634fd85aef6775334b118dadbcbfd2e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SharedState.init_workspace_search_engine: MethodTooLong \u2014 init_workspace_search_engine runs 311 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 211 over it, 3.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a024a8c86d38ae9b0919b8fdbc56c3c18746c943c28ad6c7f606bfe8c2d972"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/metadata.rs: FileTooLong \u2014 1533 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1033 over it, 3.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8a1c0795428daee1cfe995c20d68cb70808809e86ff8cd4858e2be0275d5a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/graph_index.rs: FileTooLong \u2014 1525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 1025 over it, 3.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"526737dbd74e313f8b48228aa875cfe0aa79f55e42fa2ea819d903d88163fed7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server.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), declaring 47 free functions. The bar is 500 significant lines; this is 986 over it, 2.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc0b7418eee8b04f229611a86ae3946e0791cd373ee801661d8452aa1cd8ea0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GlobalState: TooManyMethods \u2014 88 methods, declared across 6 files: src/global_state.rs (36), src/workspace.rs (33), src/analysis_scope.rs (9), src/diagnostics_state.rs (5), \u002B2 more file(s). The bar is 30 methods; this is 58 over it, 2.93\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/global_state.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e40b6940ac3c75b54b224b4a4754edfde9be0c609b4c39602ad0f4b58ce95f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_diagnostics::handlers::get_metadata: FunctionTooLong \u2014 ide_diagnostics::handlers::get_metadata runs 291 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 191 over it, 2.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d117502c8e7513fb832f82ad87a095a223f50a445f046bfcd54e3f39ee7a976"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mcp_server::graph_db::write_body_patch: FunctionTooLong \u2014 mcp_server::graph_db::write_body_patch runs 282 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 182 over it, 2.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cb48cac063135dff00eea616c3dae8e9123922c0753030bfba320c94efa4f7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SharedState.spawn_embed_pass: MethodTooLong \u2014 spawn_embed_pass runs 274 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 174 over it, 2.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84b2f60926e37b282189379a6779c451a08791e9ad15cefe70f4448203debef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_def::body::lower::expr::lower_call_expr: FunctionTooLong \u2014 hir_def::body::lower::expr::lower_call_expr runs 269 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 169 over it, 2.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ec5d0dc9d97e33e40149a5f5327ab3d628ae0e466cbe9c64073481eb581d51"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/expr.rs: FileTooLong \u2014 1344 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 59 free functions. The bar is 500 significant lines; this is 844 over it, 2.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed4bddf3c2977851ae92d1d6c2e366c4e790b13eaf3c2531ce8d8c2b995ff3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_host_core::metadata::bootstrap_metadata_substrate: FunctionTooLong \u2014 ide_host_core::metadata::bootstrap_metadata_substrate runs 267 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 167 over it, 2.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/metadata.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c09b605658a86fc3925889187c52fe2428e7e7a23ab58279c9ec1d2dc4c3dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/state.rs: FileTooLong \u2014 1308 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 808 over it, 2.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fa282f967c0071fc3c5d2a1a2b70befd36005ab6b081a77bd0e6152e476c74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/baseline.rs: FileTooLong \u2014 1295 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 795 over it, 2.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/baseline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9d4cc247f0eea98608012a58fa595cf2604f238703fd4594ecae3becd3cd7b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SearchEngine.index_directory: MethodTooLong \u2014 index_directory runs 258 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 158 over it, 2.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4d7ccfc0feda1ce6ada191533567ca72e2dd37610bbce1016626bc66280241"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/from_clause.rs: FileTooLong \u2014 1288 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: LoweringContext (2 blocks, 57-1606). The bar is 500 significant lines; this is 788 over it, 2.58\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af172ef206d98f3f34375cead8471129d89695a062838b1ad51ec3ff7e2a309"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_host_core::metadata::refresh_metadata_substrate: FunctionTooLong \u2014 ide_host_core::metadata::refresh_metadata_substrate runs 251 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 151 over it, 2.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/metadata.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a0a788bfb95ede895a5b5d73c3dfc79dd687c04b5fe218758d50e1995f310e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/platform.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), declaring 63 free functions. The bar is 500 significant lines; this is 737 over it, 2.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/platform.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57623efe7b729a82b276a57d7b466cb8fc035c864c10af457bbdb3427b5474e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostgresBaselineAdapter.populate_serving_semantic_with_progress: MethodTooLong \u2014 populate_serving_semantic_with_progress runs 247 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 147 over it, 2.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9af28701e8888ef5809232b336b011b6b76097307e7d03574e973426bdb4159"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.build_accounting_register_table: MethodTooLong \u2014 build_accounting_register_table runs 247 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 147 over it, 2.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/register_tables.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8bdf483cd901a5843885d10264381d998f72be503be1e0f4cb580affafba83"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DiagnosticsState: TooManyMethods \u2014 74 methods, declared across 3 files: diagnostics_state/lifecycle.rs (43), diagnostics_state/drift.rs (28), diagnostics_state/snapshot.rs (3). The bar is 30 methods; this is 44 over it, 2.47\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/lifecycle.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"52854f18c1925d5f6aea31d1ef100dd91b9443a4009f063830562c67e4d0e00a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 74 methods. The bar is 30 methods; this is 44 over it, 2.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/parser.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce4febe3dc9988408c119d1146f1650fcd75f09c86e34c0f34f7e6feb973518"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SearchEngine.refresh_dirty_contexts_fenced: MethodTooLong \u2014 refresh_dirty_contexts_fenced runs 243 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 143 over it, 2.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":4766}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbed1500243ef92c8279a24b83b5561a12d877839b2fdd0098429ba88bdc3ddd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mcp_server::graph_db::compute_body_patch_with_metadata: FunctionTooLong \u2014 mcp_server::graph_db::compute_body_patch_with_metadata runs 243 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 143 over it, 2.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a758653e306ee94a456bff5f69a3be66f71236295f39a3340e948d1a6c0c96"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SharedState.workspace_with_cache_and_prefixes_impl: MethodTooLong \u2014 workspace_with_cache_and_prefixes_impl runs 241 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 141 over it, 2.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"a219986e53e5674a06d74510e36f6a53200ed66256304bcdc74039f776accf77"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AnalysisContext: TooManyMethods \u2014 72 methods. The bar is 30 methods; this is 42 over it, 2.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/context.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06593173f9137ea8ad6e5ea9dc2ed36ff197a184e52a4de715c09ce58254cbd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.infer_expr: MethodTooLong \u2014 infer_expr runs 233 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 133 over it, 2.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":3971}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc80d582e018892d464b05f294744944b6f561219e29b57c7c9ae53afbdf864"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/mcp.rs: FileTooLong \u2014 1155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 49 free functions. The bar is 500 significant lines; this is 655 over it, 2.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/mcp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54e902aebdcc83ef2fa4d0c93c39dfcb72b9d01b97596b926d841cd34f8815d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/symbol_info.rs: FileTooLong \u2014 1155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 46 free functions. The bar is 500 significant lines; this is 655 over it, 2.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/symbol_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"174af7e2a6e3591da0aa2f389ab649a8ed67f8a9ae2fcec11f465560f59d0dbf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.infer_stmt: MethodTooLong \u2014 infer_stmt runs 230 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":3619}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fd09b41558edde3448ecb3da3b4c4547e6831cb532ba3a25d82895f9d6f26d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/graph_query.rs: FileTooLong \u2014 1145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: GraphDb (2 blocks, 390-1733). The bar is 500 significant lines; this is 645 over it, 2.29\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5509ca49d8b62b4d1354722f60e55b1761db4ee5fc8488912f48d39f6afacdb7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SearchEngine.run_embedding_pass_owned: MethodTooLong \u2014 run_embedding_pass_owned runs 221 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 121 over it, 2.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37fb9151d3d209081e4d0c056a5fa5f75742750441b8ed40cd99fe8ff631b57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/diagnostics_baseline.rs: FileTooLong \u2014 1092 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 592 over it, 2.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2a2f04b88d9b9ef90bc8236044bf00cf58a533735e35c2670b0a7dff343c4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/loader.rs: FileTooLong \u2014 1077 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 68 free functions. The bar is 500 significant lines; this is 577 over it, 2.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71013ecbdde2e396fcd9c1949e951543ec50c6b3a5a33fef56c7f1921b241737"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::server::handle_task: FunctionTooLong \u2014 bsl_analyzer::server::handle_task runs 213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe3c285b14de6cecd6851b41cb1881291c0a165fc54d8d780506ba0a0640c41"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GraphDb: ClassTooLong \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), 41 methods, 2 blocks, lines 390-1733. The bar is 400 significant lines; this is 451 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_query.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bcc85a6415be1355f4a4b216ac1c8e4247282b4ebe79173bea9e5bb271c49d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WorkspaceOverlayCache: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff11d4229875b69b1cfeeeeb0a111d4e8b10ad819958e845aceda060ebfcb05"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: ide_db::metadata: TooManyFunctions \u2014 63 free functions. The bar is 30 free functions; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df028b49c4cf301ba4b5dc9053fd34c5cd519ba0a709888eac641b68ff57d37"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/partitioned_diagnostics_baseline.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). The bar is 500 significant lines; this is 522 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccc85b99c85fda881eba366517269fa6880cff44b51059ec3016ea32eca42a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/diagnostics.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). The bar is 500 significant lines; this is 519 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18663b38299ec96464dfb7019f16e3cf7e3e9b3172689969daca704e781e46c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::bin::cli::search_baseline::publish::run: FunctionTooLong \u2014 bsl_analyzer::bin::cli::search_baseline::publish::run runs 202 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/search_baseline/publish.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"63679c77e5df25b6ab202452707a35c7bc445751e80483f73ddbda5926dce088"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SharedState.run_overlay_warmup: MethodTooLong \u2014 run_overlay_warmup runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c9200aa6a9b65fa505788edf0b2647283118f618208637635912c414c34e8a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.resolve_bare_name: MethodTooLong \u2014 resolve_bare_name runs 200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4410}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f48e0531f818028adc3d4315a6548223b16a1f5b2d305d9561fd166efc51a9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: GraphState: TooManyFields \u2014 59 stored fields beside 115 methods. The bar is 30 stored fields; this is 29 over it, 1.97\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f01dd51243f2e95e5a8ffd15f59df5cb5f3bd321b4df6197938aded4a36c1cd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DebugSession: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/session.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c58405814d74c0a844920cf9886f2a7f6b33952c97276950a8d3b670a2f16f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/embed.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), about 91% of them inside a single declaration: SharedState (281-1764). The bar is 500 significant lines; this is 476 over it, 1.95\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c7ebc2ac28125d2985bbeb27976abaadab1294eabc2ea681706fe5bd24f8d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::bin::cli::check_config::build_check_config_report: FunctionTooLong \u2014 bsl_analyzer::bin::cli::check_config::build_check_config_report runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/check_config.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7e9f14238b3d46f7e64b08ca4810046b8ea17f24ba73b7c52bda7814712f5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/snapshot.rs: FileTooLong \u2014 968 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 468 over it, 1.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/snapshot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c514455ae621dfe249bdb88c9ad44a1ac324c4d631ce225021f27c4c2678edd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mcp_server::tools::references::render: FunctionTooLong \u2014 mcp_server::tools::references::render runs 193 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/references.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f766959d62ef38eddec7cf0aa632cc941207aeca5aeb58742969cac02217725"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Project: ClassTooLong \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), 33 methods, 2 blocks, lines 341-1610. The bar is 400 significant lines; this is 366 over it, 1.92\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1f6b18c61ee57b02ab1bf9b5b0ad11adf9ecd77b025fd2d602531305039699"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DebugSession: ClassTooLong \u2014 762 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 59 methods, 2 blocks, lines 19-1322. The bar is 400 significant lines; this is 362 over it, 1.91\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/session.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e593d355a836c47686be9ab1669200092b029a51a2e915e02af656f2d83db44b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SharedState.spawn_search_sink: MethodTooLong \u2014 spawn_search_sink runs 190 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/sync.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"d281f7ee7b0a61a4427b90e83e4583944101b1940b0b9fe94bb87ae4007017e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SharedState.spawn_workspace_search_init: MethodTooLong \u2014 spawn_workspace_search_init runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a2c82f1a1023de2827c4cf0c26113bae71d84c299f43f5d1d7eb85927dc2dd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GraphCtx: ClassTooLong \u2014 750 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 32 methods, 2 blocks, lines 1707-2705. The bar is 400 significant lines; this is 350 over it, 1.88\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"2876a72bc5458a6862dd1ddaccc65497bd85e4820786401f657dcd459288e74e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/debt.rs: FileTooLong \u2014 930 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 430 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/debt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d2c0d2773678fda1e50c0c6e9012deb159de7fa6c532c425b5b468f1b115e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast.rs: FileTooLong \u2014 925 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 425 over it, 1.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/syntax/src/ast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a36465c4c87cc04d79b5cd9649f85d2adc1389e89ac482d64b8d48f0e6ffe71"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_diagnostics::hir_dispatch::dispatch_hir_diagnostic: FunctionTooLong \u2014 ide_diagnostics::hir_dispatch::dispatch_hir_diagnostic runs 185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 85 over it, 1.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/hir_dispatch.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37db047ba321b9a29bd977768018dee0159c11055e490a03794156f4e8828a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SharedState.workspace_indexing: MethodTooLong \u2014 workspace_indexing runs 185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 85 over it, 1.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/mod.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cd86b230578b5ccec4b12fa26091ae0c9b82d24ea90a71b5a84fbe7d74c77c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DbScopeProvider.get_scope: MethodTooLong \u2014 get_scope runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/sdbl/infrastructure/scope_provider.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb54945bade2f474958964fae1acedc22ccfebaf443948e7332ff73aa538833"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/body.rs: FileTooLong \u2014 913 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 413 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"408567a8757a4b8b0f1a5bbb1567c20b3dc262806754762797ac1a19d69b17ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Project.diagnostics_baseline_partition_plan: MethodTooLong \u2014 diagnostics_baseline_partition_plan runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"869facf8c7bd05782d859e63d0ebba727379d352a9207db62f708d02538d2e6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \u2014 893 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: DebugSession (2 blocks, 19-1322). The bar is 500 significant lines; this is 393 over it, 1.79\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c4d062ad163612068322f4fadf0d5bb2b9344f02038625f7e9698059364592"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hir.rs: FileTooLong \u2014 889 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 389 over it, 1.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5332e6f7b8e29a6ed9a618baaa122bb7bf6ff0e08b7a0d8510f70859bd1e831e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/db.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), declaring 31 free functions. The bar is 500 significant lines; this is 387 over it, 1.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/db.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b13440fa0185c72bf940ddf83b421a2031a2f2afd411303b3f980ca5f2c41c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlatformDataInner.from_help: MethodTooLong \u2014 from_help runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/db.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9008b89cacaf2ac2639b6072c5e6e5b8e90b0d78862f31470899f48edd1d05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics_state/drift.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), about 83% of them inside a single declaration: DiagnosticsState (51-1540). The bar is 500 significant lines; this is 381 over it, 1.76\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/drift.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca7042e19e8aec7358689d330185b40718d811de277bcfacb4167feceb7fd47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics_state/resident.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). The bar is 500 significant lines; this is 381 over it, 1.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/resident.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"323c06066350e9e7ef961f9d358240215bbccbd8b60005762e417c495e25b0ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/metadata.rs: FileTooLong \u2014 880 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 42 free functions. The bar is 500 significant lines; this is 380 over it, 1.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e86a158a860f48743803c3bea974b63032897baa548a593127ccaf0fcd44bcc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: McpServer.workspace_search: MethodTooLong \u2014 workspace_search runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac7cd3107502b8bf26d05c5aa3347d8a25c5ae86ce9ee46695f8e5b6f4d587f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeProfile.run_scoped: MethodTooLong \u2014 run_scoped runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"49241bfb6301054fbe220ec1e871e52262fa3b886b6fbd68f2a24aab1e52f450"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BodyDiagnostic.map_range: MethodTooLong \u2014 map_range runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d07b7ac94ebf934894daa4fc47ad9ab2746574de558cb6390a5de783670bff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/metadata_object.rs: FileTooLong \u2014 868 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 368 over it, 1.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/metadata_object.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f9166caf5271c78340d0277a0ca8d77c6a58c2adedfec9de1d8af339a02cee"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Configuration: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/configuration.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fe24de0ce6d5d64c32734ec1794c9312efa66bc2a5e68d47c40af9a060c0ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_diagnostics::handlers::duplicated_insertion_into_collection::check_stmt: FunctionTooLong \u2014 ide_diagnostics::handlers::duplicated_insertion_into_collection::check_stmt runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"a293d9b57efe731e6beb5867d8305702b35a040fecd2122714d938bf7b5e9294"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_debug::types::events::parse_ping_events: FunctionTooLong \u2014 bsl_debug::types::events::parse_ping_events runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/events.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b299ca7a2e61bcd81c9548303cdfeab4caa689b40557e5bea2aecbab2f7f52fd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DiagnosticsState.refresh_saved_path: MethodTooLong \u2014 refresh_saved_path runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/drift.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd95b468ebe657538fbbedd5cd89988875f4f35b8f6c4bba3c019055084cc1d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: hir_def::body::lower::diagnostics: TooManyFunctions \u2014 51 free functions. The bar is 30 free functions; this is 21 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/diagnostics.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d4fedf830a41de5181f32302f637c295d8697e134a2005790b8764c020379c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostgresBaselineAdapter.ensure_schema_statements: MethodTooLong \u2014 ensure_schema_statements runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fdc5c1aac88b6d8864c474010e60418f5e1801f744847532c5274332a90662"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parser::sdbl_token_converter::convert_sdbl_token_kind: FunctionTooLong \u2014 parser::sdbl_token_converter::convert_sdbl_token_kind runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/sdbl_token_converter.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"82be0d2ed8ff01734b48e29fa6fe9eb3bb8c698b1ce7f5587869cb8a91f21b14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower/diagnostics.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). The bar is 500 significant lines; this is 341 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b7d7c468d6de9287c8179472414273c282595598f3c6bf0bf40fbd201c7aa5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkspaceOverlayCache.full_refresh_from_manifest_scanned: MethodTooLong \u2014 full_refresh_from_manifest_scanned runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b6f45852c74bea08fd682ae4be839f95acf711ab54ca239a3f3120df98ef7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/queries.rs: FileTooLong \u2014 836 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 336 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/queries.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad250d9b5ee3ffd93aa9673720d96dfe5c7889ee217a11ba97e425111bdab9c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::server::handle_loader_msg: FunctionTooLong \u2014 bsl_analyzer::server::handle_loader_msg runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd62c6d0f436602a5bb8cdfaead29975faff1f067eb7db4f6444c76b99426de"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PostgresBaselineAdapter: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3923cd1c9123a5319cbb8f88e00e4736537ab6825b5e175ca44f6435f6c360ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::bin::cli::lsp::relay_lsp: FunctionTooLong \u2014 bsl_analyzer::bin::cli::lsp::relay_lsp runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/lsp.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"1620990bd616c482e0befb0e653ae42ee0b9363eb953eb39595b9372c66d212a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::handlers::request::handle_call_hierarchy_incoming: FunctionTooLong \u2014 bsl_analyzer::handlers::request::handle_call_hierarchy_incoming runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"862ca4dc828724de47276e09d3e401cb5358c477d9d6d11a94d4ddceb35450b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphRowEncoder.node_row: MethodTooLong \u2014 node_row runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":2566}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8672218080fca8a02f811089b7d9d013f58496ccabfa8d730259d251e99711"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/analyze.rs: FileTooLong \u2014 824 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 324 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f074562859efea96a886ce8f7531d86742ae0b52b18608f36e5d0483aed2d32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/global_state.rs: FileTooLong \u2014 818 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: GlobalState (2 blocks, 396-1401). The bar is 500 significant lines; this is 318 over it, 1.64\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/global_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb92697853a4a7504891981cc7d41a5517d88345b2f015dca9a25454a4f24897"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NotifyActor.run: MethodTooLong \u2014 run runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e43e57ae064b0e58bcaf5c2e268f736aaccceec4beb4e167054f351bb4b1ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_metadata::loader::load_all_metadata_parallel: FunctionTooLong \u2014 bsl_metadata::loader::load_all_metadata_parallel runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3e90b381a527453bc6e7c9d614ce96fc05cee4ecbae81cfe5d68bbe71ebc98"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DiagnosticsBaselineSnapshot.load_once: MethodTooLong \u2014 load_once runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"40572e92bc308f293294d7a0b1983edea2c9aaf3eefd19993b0880d763e2c68e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/field_enum.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), declaring 37 free functions. The bar is 500 significant lines; this is 300 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/field_enum.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1043ed7303f0f5fd81c0405ef42aadff9b2533b16d7ae3948f0ae8236c6017"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/workspace.rs: FileTooLong \u2014 798 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: GlobalState (45-1308). The bar is 500 significant lines; this is 298 over it, 1.60\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/workspace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"086aa05f9c7ef0f1d55574d1409fcc294c451bfb2dd9d3e84733aadaa568b80d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_table_ref: MethodTooLong \u2014 lower_table_ref runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcfeab1d62be795c695cfaca48f8288d67cf176dfec202ba7bc422afef60769"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: InferenceContext: TooManyFields \u2014 47 stored fields beside 133 methods. The bar is 30 stored fields; this is 17 over it, 1.57\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"519af9ee2a741a3fd3df9c2230513241fb7f39c553a5367f2d5b8e0cc7f3f295"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sdbl/select.rs: FileTooLong \u2014 777 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 59 free functions. The bar is 500 significant lines; this is 277 over it, 1.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/select.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"322b884389574e25c982fe5e0e038ec59a996286cb8156167227efa92ea633a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::bin::cli::mcp::shared::run_daemon: FunctionTooLong \u2014 bsl_analyzer::bin::cli::mcp::shared::run_daemon runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/mcp/shared.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5731acd5af5884e6571d65b693177fe770379ec369b5023bf4914e09526679"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide::completion::sdbl::sdbl_completions: FunctionTooLong \u2014 ide::completion::sdbl::sdbl_completions runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/sdbl/mod.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b966404f654a3f345cbb9a0128582df23e2fcfeaa74ec12203c130e391ea1a5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/mod.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), about 61% of them inside a single declaration: SharedState (2 blocks, 408-1432). The bar is 500 significant lines; this is 270 over it, 1.54\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db2d2e181157881bfa446d3f21680285b2377e1e29c1b6beed680044b5edfef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalState.process_changes: MethodTooLong \u2014 process_changes runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/workspace.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"162b5b9be1f8e5a91195dc5ef5757d030c5b65410d27eb4c97c211b272c55221"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/smoke.rs: FileTooLong \u2014 769 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 269 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b246654a52a5eeda4fbba2cc9271e045b2ff25e0df5566c88b669f564d944e75"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GraphDebt: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/debt.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b33301acf6ccf3f95a5021403532ac617b66954c613bbe22224c4607e67491"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide::graph::build_workspace_graph_rows: FunctionTooLong \u2014 ide::graph::build_workspace_graph_rows runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd89ba5a0212800192e4be0303df3fde10973d4fe37d08d3fdaad3e885561e0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SharedState.refresh_search_roots_after_graph: MethodTooLong \u2014 refresh_search_roots_after_graph runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3627337e428b51d394596db03ab467c495492ad30c5db8ab6a903579e49377e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_debug::dap::handle_request: FunctionTooLong \u2014 bsl_debug::dap::handle_request runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/dap/mod.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7bccf6d82ef6d2759396014069f71c772e1c446027d89e35dd08d07584e2e0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Analysis: TooManyMethods \u2014 45 methods, declared across 2 files: src/lib.rs (39), src/graph.rs (6). The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/lib.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5147c5cbd83596e1d16aafe13ddfa5b560ec72053f209bf0f1c0c15ba7cd2591"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/docs.rs: FileTooLong \u2014 750 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 46 free functions. The bar is 500 significant lines; this is 250 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97355232e1b249f89109548c10553943055bb39f763db688e94be88651ab0e80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SharedEmbeddingPublisher.publish: MethodTooLong \u2014 publish runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/publish.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ab7da70001b39c2c0c6e3b33c4757a2f6789a9a098c4aa8c615f7e65d8652e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NotifyActor.load_entry: MethodTooLong \u2014 load_entry runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fc2afed8da43b354fa94f098a8022029efa4384fefa88762c531e617a28baf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NotifyActor: ClassTooLong \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), 22 methods, 2 blocks, lines 119-1180. The bar is 400 significant lines; this is 196 over it, 1.49\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7022ee7d27e7b94c79b7fa74c2d23756eb3b7ca09f95f0694bb8431e4769f473"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/references.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). The bar is 500 significant lines; this is 239 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/references.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07615d2c3b5b45d3b9ee62fa6c08ac2b87d029528f7bc622498bcc03f82f4cbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.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). The bar is 500 significant lines; this is 236 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f82bdbea1be656b9cc87b3b38b5c023f8543da522134b2d006c9ac8a97f91e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_types::display::render: FunctionTooLong \u2014 bsl_types::display::render runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/display.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6155309ba5723bbffed3ae620f7a7757237b735d88ebaf4424b3dcb2e455a8cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide::partitioned_diagnostics_baseline::classify_partitioned_diagnostics_with: FunctionTooLong \u2014 ide::partitioned_diagnostics_baseline::classify_partitioned_diagnostics_with runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c82e6cc8dbb6462b6509730193cbccc88ce4ea586f734c50ed5a678f4837e45"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mcp_server::tools::search::semantic::semantic_code_hits: FunctionTooLong \u2014 mcp_server::tools::search::semantic::semantic_code_hits runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/semantic.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b769bfabcad0a8b564db55838a4c81f4175dd7e559834fc18f1043a8717b69"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: diagnostics_state/lifecycle.rs: FileTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 222 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/lifecycle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64d63271198d64a7acbf76b25fc0e7f5b600d593425199c4b784c0df0a53b36"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RequestDispatcher.on_latency_with: MethodTooLong \u2014 on_latency_with runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"124177716d2edbab3dfd5f3eb27e80423d4d2bd5ce0c85856d1d07ff1d920287"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/narrow.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), declaring 41 free functions. The bar is 500 significant lines; this is 216 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/narrow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe5196651e34c0bd3484d89e2b386dddd988da4be6f09056053bcf59d8d042d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state/sync.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), about 80% of them inside a single declaration: SharedState (252-1349). The bar is 500 significant lines; this is 216 over it, 1.43\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/sync.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a72b9bf7e450cbaf488333169a30fe4ce01dbf994e6fd4c70719e5205fc3db5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/call_graph.rs: FileTooLong \u2014 702 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 202 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/call_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f2df1e3adfd892ccf0c0745c0227f61ea6cb208775265e17864664ff6cfac3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 695 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: NotifyActor (2 blocks, 119-1180). The bar is 500 significant lines; this is 195 over it, 1.39\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30afb7d4720d2aad2d4a41dad01f1ead1d8fd6214a33dfed3d9adeaea6ac2d2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: McpServer.graph: MethodTooLong \u2014 graph runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6737de28ce292257f5e0ebf99f473b3209945cd1b1cfdabf6e05e67754a5485e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Configuration: ClassTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 52 methods, 3 blocks, lines 20-840. The bar is 400 significant lines; this is 154 over it, 1.39\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/configuration.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"39239f760680886205d6b22a2eb69740a934d201f87e285f2187fe93d77be5c1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GlobalState: ClassTooLong \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), 88 methods, 2 blocks, lines 396-1401. The bar is 400 significant lines; this is 153 over it, 1.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/global_state.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bac8eb1afd464036b9c183123f82c37b687893741a800e81f72d64128854be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SearchEngine.stage_validated_workspace_roots_transition: MethodTooLong \u2014 stage_validated_workspace_roots_transition runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":3556}}}],"partialFingerprints":{"codehealthFindingId/v1":"c370ddd139bb8c099f9d6a0219016e409bf89b4cb71be781c2688026f07883bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mcp_server::tools::check_executor::execute: FunctionTooLong \u2014 mcp_server::tools::check_executor::execute runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/check_executor.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"307b0369f363f77392b54b3985daf6a48d4db2526cb0ae79728aa9edafad65fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GraphDb: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_query.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c4e0acd5976e48a426cda7a5237c972c3f03d0ea3d96d722843205a7ca0c85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/workspace_lease.rs: FileTooLong \u2014 670 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 170 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/workspace_lease.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1af86e4110120f17d9e779c21677ac2dcdb9da1670599bd4e8ddbb207e079f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide::partitioned_diagnostics_baseline::load_diagnostics_baseline_set_once: FunctionTooLong \u2014 ide::partitioned_diagnostics_baseline::load_diagnostics_baseline_set_once runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93b3ce03769af2bbf46f4db013b5ed630d254614aa914127eff6c25775901fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: completion/bsl_completion.rs: FileTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 159 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/bsl_completion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1e98000bd70a4e20dc3486e3179e425aae831719a7708f1041ff5d47850513"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handlers/duplicated_insertion_into_collection.rs: FileTooLong \u2014 658 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 158 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e69a9da28106f5ebee80b59d94f35da7f12786f2d5358c2bad1672884be917"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics_baseline.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), about 67% of them inside a single declaration: DiagnosticsBaselineSnapshot (2 blocks, 17-627). The bar is 500 significant lines; this is 156 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09b18f72435936b2d8c9663ce28429ece40cbd70d3d57abe9e577b5f8022caf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/name_lookup.rs: FileTooLong \u2014 652 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 152 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/name_lookup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e68bd45f45df9a543a8ba7a4694a346c923da4fcca1e16b659eca31e78d1d3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: ide_db::metadata::heap_estimate: TooManyFunctions \u2014 39 free functions. The bar is 30 free functions; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"249f8747cb365ead8a1569a71482db264b9cf7989244c8064c25efdd92a8cbd5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Scope: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/scope.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"932561e3dc7910ddca7e6dbe884bf0b0d5728436cf5b1fbe1b39b948137d7909"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp_install/adapters.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), declaring 40 free functions. The bar is 500 significant lines; this is 150 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mcp_install/adapters.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bda64aebfb6b3b3a531dd51a4ffbb97399e7399207aa32f3230fd82f1216e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::bin::cli::diagnostics_baseline::apply: FunctionTooLong \u2014 bsl_analyzer::bin::cli::diagnostics_baseline::apply runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a20fa18b648e4005786a4c8101851608047e376ada4f804c0de15e5263ede1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostgresBaselineAdapter.publish_snapshot: MethodTooLong \u2014 publish_snapshot runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a247955e87df62dee05d2ddbb1fec1d22c04ffec5bcdbf76fd5984d6e44be6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::diagnostics_baseline::transaction::publish_set_with_hook: FunctionTooLong \u2014 bsl_analyzer::diagnostics_baseline::transaction::publish_set_with_hook runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37c27a1b1fc9b034fe19276d15066698be56f78f2d6f82c817068afeabdd8a8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphDb.neighbors: MethodTooLong \u2014 neighbors runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_query.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"af80b9244ddbb96da9c436047a5a182c13afc944a6a110bbfd2deeb745d8849a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/reaching_defs.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). The bar is 500 significant lines; this is 140 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/reaching_defs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2a856c205600dac6bf72f87e42dc5a0967e784a7bb2fbaa8b01f5d0843b64d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Resolver: ClassTooLong \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), 37 methods, 2 blocks, lines 10-920. The bar is 400 significant lines; this is 111 over it, 1.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/resolver.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ffa26706cd20b6a27621af584cf72e9959c1ed349b0f3bde292edcc3de96ec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WorkspaceChangeHub: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33b9cbb5a7f4e226209b4ef6f39f94952a823ce5295e26bf46d37d60c6ef06d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: user2/runtime_lifecycle.py: FileTooLong \u2014 632 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 132 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user2/runtime_lifecycle.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c97d7a9b065458a9740af41c5123f03f89b9c89c50e94d03cd603470eeba4c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphCtx.node_ref: MethodTooLong \u2014 node_ref runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c91ef9b81a1e46f914fc9fea2ea5b70258d99fa4cd1304dacde694b60fb187"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: search/status.rs: FileTooLong \u2014 628 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 128 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/status.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe52c311d3e74b0dbb30c76a217dd1ef64bcddaece4cceaa06dbf90dc45c5d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lifecycle.rs: FileTooLong \u2014 627 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 127 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/lifecycle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e165cf3b634af589499ce86008bf65eb0eab08d04f250d200718cc329c586b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdbl_hir::context_detector::detect_context: FunctionTooLong \u2014 sdbl_hir::context_detector::detect_context runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/context_detector.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"443bb0cf4a0d0537f1f18f00d25dbe538d158fe8fee9ecb3e558e6f01531ab17"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdbl_hir::lower::lower_sdbl_to_hir_with_resolver: FunctionTooLong \u2014 sdbl_hir::lower::lower_sdbl_to_hir_with_resolver runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca4c3b27636e568b22aea3b7d6737d3fa2f73ece711794e55e9a0fb32fa3086"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DebugSession.handle_event: MethodTooLong \u2014 handle_event runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/session.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c49bd79622e97195198f831b00c9936e1e50edba7ddd02439ff2d299d7c07b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/resolver.rs: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 83% of them inside a single declaration: Resolver (2 blocks, 10-920). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/resolver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"515b9701c460d572add2e72e0fd64035854fa357922033c50b6e14af0e705ab3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Resolver: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/resolver.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddf75922a1687d2daab244691d24fc95bce48560c11de0f2724cd9ba86866f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.dispatch_bare_ident_field_call: MethodTooLong \u2014 dispatch_bare_ident_field_call runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":6228}}}],"partialFingerprints":{"codehealthFindingId/v1":"192fa735ce982e033407cf5c46af37ce5192f9635db2c9aee060b44d527cf9d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: completion/platform_completion.rs: FileTooLong \u2014 614 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 114 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/platform_completion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3db568634b2e83a3680dadbadb73b4dd07ff915ee0467a4575d746e35e8cbd7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_diagnostics::hir_inference_dispatch::dispatch_inference_diagnostic: FunctionTooLong \u2014 ide_diagnostics::hir_inference_dispatch::dispatch_inference_diagnostic runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/hir_inference_dispatch.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"39115f0778b91f2daf32a677bfab6b4a0da29f46bc3e52d05511802665dae86e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/symbol_info.rs: FileTooLong \u2014 608 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 108 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/symbol_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62bdc14021ab9102327f0ef52bd4b9282f659426a73073f962481074301e83a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: McpServer.symbol_info: MethodTooLong \u2014 symbol_info runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":2374}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a77b21f9289a2ac3eaa3c6cea01e84b2ff04d6ed4f91dc55c3d2141cdd872e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 599 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 99 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc77b128a61d1d2630793f8b377a05ad1e550315372c848dbb526629ce67ea4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/metadata.rs: FileTooLong \u2014 599 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 99 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"954762f04cf1bef1ec87e6ea1e85a0dde9a0d41770431bc8b6105727331e7c66"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config.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). The bar is 500 significant lines; this is 98 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdbc965077098b939d396e666937002bf0ff51e4e5f3b3f5fd8ec7777adefc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_def::graph_index::resolve_summary_via_index: FunctionTooLong \u2014 hir_def::graph_index::resolve_summary_via_index runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacde7cc89f80ab2734e894f05fd3ab495480efdc255bd06ab8a3bb16a70f788"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SdblDiagnostic.message: MethodTooLong \u2014 message runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/diagnostics.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a22cc004edb99da7e4fb06f3a255861c98dccb57fddebb5d9e0d2ad106cbd78"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_function_call: MethodTooLong \u2014 lower_function_call runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/expr/mod.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7257c2dcbcdf0e3824d03695aba1c382461b8d79aace349a711735d9a277f59c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.resolve_table: MethodTooLong \u2014 resolve_table runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"165ea2628c7553da1a4addbf88a1ac28dd8938fe8ae9887b54b7d92679866ac2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sdbl/expressions.rs: FileTooLong \u2014 592 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 92 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8117850a99ba20afebf40db784e7d65dec58c0a31f3f6895eb00e0e9c799100"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: McpServer.metadata: MethodTooLong \u2014 metadata runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"818762f9e375ded2a8a950cf4c15949774dddc75e5dfd321e2f3a80eff638c5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handlers/transferring_parameters_between_client_and_server.rs: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 88 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/transferring_parameters_between_client_and_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4c93b6f298bdaf1bd0a0d50c6c23a4ac43c4285ae801ef7c441120f20435c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/configuration.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), about 94% of them inside a single declaration: Configuration (3 blocks, 20-840). The bar is 500 significant lines; this is 87 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/configuration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d56615fac21c09ff3a6ae029f5735563b1ef7b46a5b1abf2a26324d453b3baa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/check_executor.rs: FileTooLong \u2014 587 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 87 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/check_executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76624c67d113fd16ffd105653fe9f723d9bc2863c0927d769be5ea8e8d96a2b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SharedState: ClassTooLong \u2014 468 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 109 methods, 2 blocks, lines 408-1432. The bar is 400 significant lines; this is 68 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/mod.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2a624cd079ea887243ea64e334370c68457ba94564bbe1cbdbb01c0f861ce9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mcp_server::graph_db::build_graph_database_inner: FunctionTooLong \u2014 mcp_server::graph_db::build_graph_database_inner runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e49e502cce1ffc2b26f01ecaa8fd4c0c33a82028a450d22a578a66ab7b52198"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DiagnosticsState: TooManyFields \u2014 35 stored fields beside 74 methods. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/lifecycle.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6b801aa3059daadb3336a37c6faf51cec5b607217a417f7814a0f366d569fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/shared.rs: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 83 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/mcp/shared.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"714c97138492760008a8355eed503bfcaede870c711d00b33b5400e30887bf18"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/references.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). The bar is 500 significant lines; this is 82 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/references.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"952b988a79d234cde2566974b32c0c0ef2ddd863424e8fcaca9437d833ad4569"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SearchEngine.sync_indexed_documents_in_collection_with_embeddings: MethodTooLong \u2014 sync_indexed_documents_in_collection_with_embeddings runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":6372}}}],"partialFingerprints":{"codehealthFindingId/v1":"2585e33d763ed64d8982e2ffef69bd1d008ec0d93b372ac33c01fc4e6ff8a9e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mcp_server::tools::diagnostics::snippet::plan: FunctionTooLong \u2014 mcp_server::tools::diagnostics::snippet::plan runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics/snippet.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fd01cb2f8d39937797e288e24e1dd9cab51027fb12677ebf59402b047ec7c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/semantic_symbol.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), about 71% of them inside a single declaration: FileSymbolCtx (2 blocks, 129-809). The bar is 500 significant lines; this is 68 over it, 1.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir/src/semantic_symbol.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"837f3b0fa3f09bc4ba52cdba556be9f8841b5df67951e3525aa2a4ecfb1ce274"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hover.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). The bar is 500 significant lines; this is 67 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/hover.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8434c03d525f2e7f27c320640922f16bb79d083a6a66a6d2b434eb355ad664"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::bin::main::run: FunctionTooLong \u2014 bsl_analyzer::bin::main::run runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/main.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a98e8134e1bdb53b66955c0a8dc5cfefd3ca4162ccbd4fb59b8988e7ac58e6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::call_hierarchy_index_service::reconcile::reconcile: FunctionTooLong \u2014 bsl_analyzer::call_hierarchy_index_service::reconcile::reconcile runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/call_hierarchy_index_service/reconcile.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf5b842125320cc91dcc4349055d1035e9702d97c154500f6ca89d7cac27a5b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.rebuild_for_virtual_table: MethodTooLong \u2014 rebuild_for_virtual_table runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a950477babbd95a28412c2f709387d9ccfddf39454d024c74dd4b8d28e14ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: broker/daemon.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). The bar is 500 significant lines; this is 60 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/broker/daemon.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cd3ff5bcd92954d01ed586f7188035d64f33f49fa6914fe4af35164005690c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostgresBaselineAdapter.garbage_collect: MethodTooLong \u2014 garbage_collect runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef2dbb106833c7edc9bbfb50afec96944d369841e06dc1ded511a6e19e40d2f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mcp_server::graph_db::plan_caller_delta: FunctionTooLong \u2014 mcp_server::graph_db::plan_caller_delta runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7c8a5c30757f700d5875e4b846b20f64867833eba0e1652d2385612e7cf075"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_check/source.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). The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedeb2ddc87a7fa88c70e11cfbba52c49e7dd9e8483c63e78218d1b6905fbf8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_def::graph_index::project_batch_form_edges: FunctionTooLong \u2014 hir_def::graph_index::project_batch_form_edges runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79ee69336173432e3bbe241f0a82d3e54096a0ecad60115c9d3c2e37cc3275f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handlers/notification.rs: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 51 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/notification.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b763b5bcfe84f8a093f682ae82203d3bbbc0e00eb5c1aed347364772b84d720b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/workspace.rs: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 51 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/workspace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a01a76c8f4ad9fb4c8b74228ae257d6e765e76dfb1f4e89efc059b229d3c8b5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Project: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88575077536fb696c9582f9144411308a1877098d0088785f336497b5b48807"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DiagnosticsBaselineSnapshot: ClassTooLong \u2014 440 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods, 2 blocks, lines 17-627. The bar is 400 significant lines; this is 40 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"482c634b3c64fe9cf5b9a1f592a8b0f355ca7088be02450c57cabdd1d2389fee"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Record: TooManyFields \u2014 33 stored fields beside 4 methods. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/lifecycle.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff6506f4c61c53ed1786fa2e82e82a1248e4fc64d7b16f06e59ffe2cac2a5fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/scraper_parser.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), declaring 33 free functions. The bar is 500 significant lines; this is 50 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"612214eb151b5f4c702ddd6b1d5cbbedcf5d28bda2edd9545ab2feb152566bfb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BodyDiagnostic: ClassTooLong \u2014 436 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 4 blocks, lines 531-1369. The bar is 400 significant lines; this is 36 over it, 1.09\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"21de41d9d3f986be121be8e417deb1c9b91495c0fdd88ee583382241cf2a131c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::bin::cli::mcp::run_mcp_install: FunctionTooLong \u2014 bsl_analyzer::bin::cli::mcp::run_mcp_install runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/mcp.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e791fe5733d1466a14f1980886af378b36af2123a01032cf3cf9e89a498e77ae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobalState.with_loader: MethodTooLong \u2014 with_loader runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/global_state.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"59740bcbb5e84681bec60a94e36ba9885678b86575defa1ac726374e564c3dff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostgresBaselineAdapter.load_snapshot_documents: MethodTooLong \u2014 load_snapshot_documents runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"df44cc3d6a31e512df6033243326a1749f5fb84c410fa5148984aacebd3279bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hir_ty::field_enum::enumerate_register_fields: FunctionTooLong \u2014 hir_ty::field_enum::enumerate_register_fields runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/field_enum.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b4b5a6f22ff80d464568b78afa6eb1979fae9669b597ba7db8b2f1483e20e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/overlay_schema.rs: FileTooLong \u2014 537 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/overlay_schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5d292e41c84b3e7684464f918cd7e95dc9c18d168b677441eb95d08b83ffd0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkspaceOverlayCache.full_refresh_scanned: MethodTooLong \u2014 full_refresh_scanned runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01adedbdf8219c521000f3d9554305a1d3b3e7c593a440f879e98ad868e9934"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkspaceOverlayCache.apply_plan_in_memory: MethodTooLong \u2014 apply_plan_in_memory runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94aeb4ed15ffffd34f70fe36fdafd7a97d0cd5dfb6e4aa1f79c8dc7acf190e5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PlatformDataInner: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/db.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f2e65dd6b420c911bec7bb12543019787b5d5c1d6111c888ac87cf980eee51"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GraphCtx: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c43c423e1481d4ccc583dd5ba73ec1bb20379f77c9b7c1f99903ed2244638e8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WorkspaceLease: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/workspace_lease.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5423ca4da67abd76b632e0f838ebd9f9a9cae850958bd6ff2d1fea646aa9c5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Scope: ClassTooLong \u2014 425 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 39 methods, 3 blocks, lines 32-784. The bar is 400 significant lines; this is 25 over it, 1.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/scope.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b43d2eec4ca1ffeeb16cf5dd49ee576e14916362ef35fe14f79c0e794070034"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide_diagnostics::handlers::latin_and_cyrillic_symbol_in_word::collect_and_check: FunctionTooLong \u2014 ide_diagnostics::handlers::latin_and_cyrillic_symbol_in_word::collect_and_check runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41617688d53437605a5743920bf36f121b9ca1479e33bf1f8e64781fd29f7f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/method_lookup.rs: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 28 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/method_lookup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d9689cefb3d24542fd776affbd74faa561388255cedd6dc65999e8ccde93d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/handlers.rs: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 24 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93ad6d6b7f8b62fccef8c3f0b327e2f3f8371d7e85c1d526132c6aef9ae6d2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/deps.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). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/deps.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf203a589ede93b612790f65abf5c2bb0065b16c560c610573f663b9dae4f39"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::handlers::notification::handle_did_close: FunctionTooLong \u2014 bsl_analyzer::handlers::notification::handle_did_close runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/notification.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13c76e556968643301f00e389f129cbe6142d100774e6804d1c9e4881d869ac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PlatformDataInner: TooManyFields \u2014 31 stored fields beside 32 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/db.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"49285a5842b4f0bf3a2b997e189fee7e9cee5f99e23bd4089156196d80d6f8fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bsl_analyzer::handlers::notification::schedule_diagnostics: FunctionTooLong \u2014 bsl_analyzer::handlers::notification::schedule_diagnostics runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/notification.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b300e239e45ff0b0a6709c85bbd9379c7025bc50d2de90bfd884bc7f99ddc71f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphCtx.neighbors: MethodTooLong \u2014 neighbors runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37752e5cb46dc302bb59eea13f2680b5f438c89006ed51113e2caaf0a964bcf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ide::references::resolve_by_text: FunctionTooLong \u2014 ide::references::resolve_by_text runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/references.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f1ec31141b8c8adf3ccd6a5d75a23860630391ba26c3c13b5a2a9ec6e24349"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FileSymbolCtx: ClassTooLong \u2014 406 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 29 methods, 2 blocks, lines 129-809. The bar is 400 significant lines; this is 6 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir/src/semantic_symbol.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a30a5744d057bdbbc2f56527cf40788cd630c8a779d35d2b33a7c9dc50efbf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scope.resolve_nested_field_type: MethodTooLong \u2014 resolve_nested_field_type runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/scope.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cd2b4cda807a60e1fc94096b420ca3d6f977c546467147074247ef0301b9eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 6 shared lines): crates/bsl-search/src/store.rs:2839-2910 | crates/bsl-search/src/store.rs:3059-3134 | crates/bsl-search/src/store.rs:4877-4978 \u2014 These 3 members are variants of one another: a block of 6 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2839}}}],"partialFingerprints":{"codehealthFindingId/v1":"36212844480cac232697983a2a33f6f67da95f262aebd30e105a4e7127b50c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (82 shared lines): crates/bsl-search/src/workspace_overlay.rs:970-1122 | crates/bsl-search/src/workspace_overlay.rs:1448-1694 \u2014 These two members are variants of one another: 82 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"192c6a2fde01d7707e6dd1cc3ce3a01a2013123e5e401a42e5b170d3b704671b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (76 shared lines): crates/mcp-server/src/lib.rs:1571-1784 | crates/mcp-server/src/lib.rs:3168-3286 \u2014 These two members are variants of one another: 76 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bb90799d8e9a131206dbb09b72ac7f4333ac613eb9cdf7f9d25799c5d09f33"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (47 shared lines): crates/mcp-server/src/state/bootstrap.rs:2060-2109 | crates/mcp-server/src/state/bootstrap.rs:2116-2167 \u2014 These two members are variants of one another: 47 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c7ec52895f565eb463dc0123297c93d89c785f53f016a4f7ea37e948ad1e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (41 shared lines): crates/ide-diagnostics/src/handlers/unused_local_method.rs:135-260 | crates/ide-diagnostics/src/handlers/unused_parameters.rs:31-190 \u2014 These two members are variants of one another: 41 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_method.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"524f9095022b875e932eeeac29ae9b1e08484301a666c9866fb3fbedcff23a08"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (33 shared lines): crates/bsl-search/src/engine.rs:573-645 | crates/bsl-search/src/engine.rs:1143-1191 \u2014 These two members are variants of one another: 33 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa89a87d425367a7c8c295e223d6bdb80ef51ea9b5aa5acb1b92e47e2daca7e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (33 shared lines): crates/bsl-platform/tools/html-parser/src/lib.rs:627-695 | crates/bsl-platform/tools/html-parser/src/lib.rs:981-1052 \u2014 These two members are variants of one another: 33 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"5041d9e1cb35a6a473d0620ae20b7d16c2f4588e07a0e82b3a5c34a539c98f57"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (23 shared lines): crates/ide/src/partitioned_diagnostics_baseline.rs:628-659 | crates/ide/src/partitioned_diagnostics_baseline.rs:1042-1070 \u2014 These two members are variants of one another: 23 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"31484f106289dce884f1da1ed8132095ac01e398fc6a085298d03c8440a9b160"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/parser/src/grammar.rs:97-142 | crates/parser/src/grammar.rs:348-388 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec105672f2dfd266c39bd79e33aed03f0db1ce45f3c4c1e2e9029902cd7878b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): crates/bsl-analyzer/src/handlers/request.rs:41-113 | crates/bsl-analyzer/src/handlers/request.rs:118-170 | crates/bsl-analyzer/src/handlers/request.rs:175-220 | crates/bsl-analyzer/src/handlers/request.rs:225-264 | crates/bsl-analyzer/src/handlers/request.rs:269-348 | crates/bsl-analyzer/src/handlers/request.rs:353-439 | crates/bsl-analyzer/src/handlers/request.rs:724-781 | crates/bsl-analyzer/src/handlers/request.rs:786-842 | crates/bsl-analyzer/src/handlers/request.rs:944-991 | crates/bsl-analyzer/src/handlers/request.rs:996-1061 | crates/bsl-analyzer/src/handlers/request.rs:1066-1119 | crates/bsl-analyzer/src/handlers/request.rs:1124-1145 | crates/bsl-analyzer/src/handlers/request.rs:1150-1194 | crates/bsl-analyzer/src/handlers/request.rs:1285-1318 | crates/bsl-analyzer/src/handlers/request.rs:1363-1475 \u2014 These 15 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 15 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 15 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"620d4f9a8dadca92804681f7eea769943cb7b61f6fb0d10a715868755229d95b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (12 members, 50\u002B identical tokens): crates/bsl-metadata/src/loader.rs:602-659 | crates/bsl-metadata/src/loader.rs:1287-1311 | crates/bsl-metadata/src/loader.rs:1313-1337 | crates/bsl-metadata/src/loader.rs:1346-1370 | crates/bsl-metadata/src/loader.rs:1403-1427 | crates/bsl-metadata/src/loader.rs:1432-1456 | crates/bsl-metadata/src/loader.rs:1458-1502 | crates/bsl-metadata/src/loader.rs:1507-1531 | crates/bsl-metadata/src/loader.rs:1536-1573 | crates/bsl-metadata/src/loader.rs:1578-1615 | crates/bsl-metadata/src/loader.rs:1620-1645 | crates/bsl-metadata/src/loader.rs:1651-1675 \u2014 These 12 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 12 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 12 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"437b2729fe6962cd0568ddf1fab735a2c4b98d45dcbe7444850a8c51e8f60ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/bsl-platform/src/overlay_schema.rs:118-136 | crates/bsl-platform/src/overlay_schema.rs:143-163 | crates/bsl-platform/src/overlay_schema.rs:176-192 | crates/bsl-platform/src/overlay_schema.rs:199-232 | crates/bsl-platform/src/overlay_schema.rs:239-270 | crates/bsl-platform/src/overlay_schema.rs:277-307 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/overlay_schema.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6cec8f1b36e2ec9059577e02215b0cdad66ffc51e6016c7774f49c593d45a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/bsl-search/src/external_baseline/postgres.rs:3756-3808 | crates/bsl-search/src/external_baseline/postgres.rs:4049-4075 | crates/bsl-search/src/external_baseline/postgres.rs:4081-4124 | crates/bsl-search/src/external_baseline/postgres.rs:4130-4171 | crates/bsl-search/src/external_baseline/postgres.rs:4177-4203 | crates/bsl-search/src/external_baseline/postgres.rs:4210-4274 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":3756}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b4c8d558eaabb94829054083512316c4e96729c565e347e73f294d78c8d6a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/bsl-search/src/store.rs:1040-1089 | crates/bsl-search/src/store.rs:1989-2058 | crates/bsl-search/src/store.rs:2224-2439 | crates/bsl-search/src/store.rs:2569-2811 | crates/bsl-search/src/store.rs:5220-5296 | crates/bsl-search/src/store.rs:5469-5547 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"917220455e856530d6d809c80229aefcaee0150da279883076068c473eea9890"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/bsl-metadata/src/loader.rs:1083-1097 | crates/bsl-metadata/src/loader.rs:1102-1115 | crates/bsl-metadata/src/loader.rs:1120-1133 | crates/bsl-metadata/src/loader.rs:1138-1151 | crates/bsl-metadata/src/loader.rs:1268-1285 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4bcf761e1ddf0f10e8b317cf45526ee938ff9c2bc8fe0173b1359c13b1c954"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/hir-def/src/body/lower/expr.rs:368-383 | crates/hir-def/src/body/lower/expr.rs:969-979 | crates/hir-def/src/body/lower/stmt.rs:822-871 | crates/hir-def/src/body/lower/stmt.rs:1042-1052 | crates/hir-def/src/body/lower/stmt.rs:1054-1064 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf85f3111c7af569a976768c2c78b699cfed72acccecb1729d57f54babaecbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/hir-def/src/body/lower/stmt.rs:26-44 | crates/hir-def/src/body/lower/stmt.rs:46-64 | crates/hir-def/src/body/lower/stmt.rs:128-146 | crates/hir-def/src/body/lower/stmt.rs:148-166 | crates/hir-def/src/body/lower/stmt.rs:168-186 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/stmt.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c16221c1e5bc740eaf046a4b471232f09a43d4d5b0c3e17ebf0300390dac6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/stdx/src/fs.rs:59-107 | crates/stdx/src/fs.rs:112-152 | crates/stdx/src/fs.rs:157-199 | crates/stdx/src/fs.rs:209-254 | crates/stdx/src/fs.rs:266-313 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/fs.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9114d2b25e197313ea52b702b0bf5b16ce11a2be835d6e90409c429c13e795"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/bsl-analyzer/src/frozen_context.rs:35-49 | crates/ide-host-core/src/workspace.rs:358-380 | crates/ide-host-core/src/workspace.rs:382-417 | crates/ide-host-core/src/workspace.rs:435-483 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/frozen_context.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e7d8038a7b713f31418d70c6b9c83a47e360b0d3572c3d733fa8d14679a678"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/bsl-check-executor/src/native_check/source.rs:21-64 | crates/bsl-check-executor/src/native_check/source.rs:66-108 | crates/bsl-check-executor/src/native_check/source.rs:113-162 | crates/bsl-check-executor/src/native_check/source.rs:539-597 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cb36493f4dbd008ac425bc81fb3f1b02dfcfb001be37c02a98d3beb453a0cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/bsl-search/src/store.rs:1557-1590 | crates/bsl-search/src/store.rs:2569-2811 | crates/bsl-search/src/store.rs:3059-3134 | crates/bsl-search/src/store.rs:4877-4978 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4aaf7fcc7c226e056d3e3d23dd9c18961b7d30309d06a9e56c6187542ebbfff"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/hir-def/src/conditional_tree.rs:90-106 | crates/hir-def/src/conditional_tree.rs:108-124 | crates/hir-def/src/region_tree.rs:82-98 | crates/hir-def/src/region_tree.rs:100-116 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/conditional_tree.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1994ad0619e1537c30e14a1d5c16d5a48f88459d555298a80d57823ac3d60f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/hir-ty/src/method_resolution.rs:39-55 | crates/hir-ty/src/method_resolution.rs:162-181 | crates/hir-ty/src/method_resolution.rs:189-208 | crates/hir-ty/src/method_resolution.rs:216-233 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7060d300e9d8b33b8ad40965254340534c41dc43fbab31f3d77819af063d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ide-db/src/metadata.rs:1467-1491 | crates/ide-db/src/metadata.rs:1582-1597 | crates/ide-db/src/metadata.rs:1672-1687 | crates/ide-db/src/metadata.rs:1762-1777 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"7422884400a84cd8e94305247ba1c33210418eff5c18f4e87ba0073386970009"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/ide-diagnostics/src/handlers/deny_incomplete_values.rs:24-63 | crates/ide-diagnostics/src/handlers/wrong_data_path_for_form_elements.rs:27-67 | crates/ide-diagnostics/src/handlers/wrong_http_service_handler.rs:24-119 | crates/ide-diagnostics/src/handlers/wrong_web_service_handler.rs:24-91 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deny_incomplete_values.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"deee86d16479a96b008187ca68cb30e5e58cbfe235822c777982359985abe18e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (113 corresponding lines): crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs:82-225 | crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs:26-138 \u2014 These two members are one piece of code written twice and then edited apart: 113 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"48584536b09e7f84f0c7540148e98f2be92470c4530c8b3b6b064277f9b96adf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (83 corresponding lines): crates/bsl-analyzer/src/mcp_install/adapters.rs:181-263 | crates/bsl-analyzer/src/mcp_install/adapters.rs:402-496 \u2014 These two members are one piece of code written twice and then edited apart: 83 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mcp_install/adapters.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0635b618f4a35fd42a5c8e257718133b7be65e853c4be6ffd9dbff6b77cd27c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (75 corresponding lines): crates/bsl-check-executor/src/native_check/windows_acl.rs:73-156 | crates/mcp-server/src/cache_windows.rs:137-211 \u2014 These two members are one piece of code written twice and then edited apart: 75 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/windows_acl.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a187e99e73e8ab34a4b3ae48b299818c774497d4929c15145efac0367c7b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): crates/bsl-metadata/src/xml_parser/http_service.rs:8-80 | crates/bsl-metadata/src/xml_parser/web_service.rs:8-70 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/http_service.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f279c8e1ae5db3e19a832259e8e04b9d259054c48d0457b5b826cf025003d747"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): crates/hir-def/src/metrics.rs:224-277 | crates/hir-def/src/metrics.rs:279-328 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/metrics.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad42c19f5e72d40d9488ee7700d4d56702f8c3eb0bb782da04a034fceb1796d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (79 corresponding lines): crates/sdbl-hir/src/lower/diagnostics.rs:591-669 | crates/sdbl-hir/src/lower/diagnostics.rs:762-853 \u2014 These two members are one piece of code written twice and then edited apart: 79 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d476c43df4ebaff8691d3055c2cd0878bd6be31463da7e3103c9f5b53eb3598"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): crates/sdbl-hir/src/hir.rs:448-505 | crates/sdbl-hir/src/hir.rs:509-568 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4ffd442a233d6ccb77a50261de5c2cbc7a8f3589238d608c205b49be332b6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/hir-def/src/graph_index.rs:1749-1797 | crates/hir-def/src/graph_index.rs:1888-1957 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea07945c31365a63c971865d56a1d5f89ca5d5437d7b8bad6c8185fa2ae35207"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 53\u002B corresponding lines): crates/symbol-info/src/adapters/common_module.rs:42-106 | crates/symbol-info/src/adapters/local_method.rs:21-73 | crates/symbol-info/src/adapters/manager_module.rs:17-84 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 53 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/symbol-info/src/adapters/common_module.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc09c90f48d32cf78cb9c661b89f71cd1700e6ea62f41735b212d6d17611c688"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/ide-db/src/database.rs:1735-1781 | crates/ide-db/src/database.rs:1886-1925 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ae28a0bc93012342322b13d5295fe57d0c57b05915521aede11fbe49f7ba89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/bsl-metadata/src/metadata_object.rs:1147-1191 | crates/sdbl-hir/src/types.rs:305-354 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/metadata_object.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03ec1c35662b6f6af4f6464e8c52d46c0deb97ef886eefd7bbe6ac74b92059f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 59\u002B corresponding lines): crates/bsl-analyzer/src/mcp_install/adapters.rs:112-176 | crates/bsl-analyzer/src/mcp_install/adapters.rs:269-334 | crates/bsl-analyzer/src/mcp_install/adapters.rs:339-397 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 59 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mcp_install/adapters.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7dc3bae50404e27ba3ffd2240e5949370f0dd7ad1b3c73742d93536258128d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/dataflow/src/security_state.rs:396-442 | crates/dataflow/src/temp_resource.rs:193-236 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/security_state.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b4b6406fffa0b20f871d795fdfb659698988735e8498c1c43b793554401182"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/hir-def/src/module_interface.rs:378-409 | crates/hir-def/src/symbol_tree.rs:247-282 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/module_interface.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe4f6738bb35c1314ad63cf66f3b9aabb98a2d85fc7fd8c8b634afdb46e9ede"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/ide-db/src/database.rs:2194-2231 | crates/ide-db/src/database.rs:2258-2296 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d94831793d0bc828f3ee78221708af8cb19bd880727589b16aa1fda454adbbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): crates/mcp-server/src/tools/search/lexical.rs:257-310 | crates/mcp-server/src/tools/search/semantic.rs:380-433 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"133a46ae5cea7b35bc8865b081170927cfee8f2fa71c306b0ffea924a4dd21ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/hir-ty/src/infer.rs:1506-1562 | crates/ide-diagnostics/src/hir_inference_dispatch.rs:112-137 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ba542fc20ac2e4c6ee104933116fcf3ec55079c18ab78826890d8a8f6df99c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/hir-def/src/item_tree/lower.rs:75-107 | crates/hir-def/src/item_tree/lower.rs:109-141 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/item_tree/lower.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7fb6c94cfe2a9acd13d2567d2d98797edeae6d03782aa237b84a30324aeecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/mcp-server/src/state/bootstrap.rs:1574-1606 | crates/mcp-server/src/state/bootstrap.rs:1608-1638 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ccf9b1bc027e1c23f39230efa075cebd7f106eed56b7d440a95e11bdd25e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/hir-def/src/graph_index.rs:1146-1174 | crates/mcp-server/src/graph/byte_budget.rs:28-50 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cbf98773fc46c4899cdaabcfde480ff6c326b5e969d109a8d4d4202faeae3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/bsl-search/src/merge.rs:97-130 | crates/bsl-search/src/merge.rs:137-170 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/merge.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e246d36c740fdb1f6a3da002efef54440595329441316c73f4178f46f6b003"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/bsl-platform/src/overlays.rs:238-283 | crates/bsl-platform/src/overlays.rs:292-327 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/overlays.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d28218d3b5e388fd7dfd0e393b188fd958dd572d0350beccc3bac31216c46d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/hir-ty/src/platform_manager_lookup/record_resolution.rs:22-65 | crates/hir-ty/src/platform_manager_lookup/record_resolution.rs:71-110 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/platform_manager_lookup/record_resolution.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee14d3379680345090ff4d6ecd39f1b3e3c84aeefc01b47d6055277e99fadd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): crates/ide/src/completion/sdbl/use_cases/complete_cast_fields.rs:17-75 | crates/ide/src/completion/sdbl/use_cases/complete_nested_fields.rs:14-67 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/sdbl/use_cases/complete_cast_fields.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c8d772270c8513e8104cffa6ed65336c4feec1738571d4e2492871be784c7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs:999-1035 | crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs:1197-1227 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b078400f32fa6ca7266c6e92289a94b7cbce3b297ef07eeaace3b71ba9648a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:149-186 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:479-518 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a974f7f3541fa75800c78d4b9a7d56e998ad81bf2fd33dee069c51b65eab2a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 41\u002B corresponding lines): crates/ide-db/src/database.rs:1252-1293 | crates/ide-db/src/database.rs:1305-1345 | crates/ide-db/src/database.rs:1354-1408 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 41 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8afc51d92b320e812e7491621c15bb6159096aa567d511287765f1734ca969"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/hir-ty/src/field_lookup.rs:50-79 | crates/hir-ty/src/field_lookup.rs:89-121 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/field_lookup.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5babf2d11e3708e30b340e19f327feaba4d5c59db07d0acc57d1fbcffcf170"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/ide-db/src/effects.rs:277-306 | crates/ide-db/src/queries.rs:677-711 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/effects.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0986cf84e0a957c9448f8c939e9df37b3c282853d80b0e3ded86c5118d6e101"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/bsl-search/src/store.rs:4377-4409 | crates/bsl-search/src/store.rs:5025-5057 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":4377}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e389f54af18f2386b02a83740c7a837fc4308dc61784320b47d5d44615ce17c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): crates/hir-def/src/body/lower/expr.rs:1777-1829 | crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs:261-313 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9409e4208f96ff49d5b4cead5570973b1910e3b35a1eb1dccf719cadded045d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/ide-diagnostics/src/handlers/forbidden_metadata_name.rs:192-225 | crates/ide-diagnostics/src/handlers/forbidden_metadata_name.rs:232-260 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/forbidden_metadata_name.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e023417f3616d48dfd9fc1005e654964739223974e86888fe7d84f242c542d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs:58-110 | crates/ide-diagnostics/src/handlers/scheduled_job_handler.rs:64-121 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e7e27f1d956d3c83bb3b4269fa3045e6186b14bd08c7853b8c6408294f0811"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/bsl-search/src/workspace_overlay.rs:856-896 | crates/bsl-search/src/workspace_overlay.rs:910-947 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e410573ba19e73c49791b1fcf06b4f7191bd0fca34f2a2061516f269deba8c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/ide-diagnostics/src/handlers/weaving_annotation_not_applicable.rs:25-62 | crates/ide-diagnostics/src/handlers/weaving_signature_mismatch.rs:26-69 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/weaving_annotation_not_applicable.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfdd643d4ad2b2697a51f4d55009e0141ea1e15eff3165a37322ba2eacff17f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/bsl-analyzer/src/bin/cli/source_set.rs:344-371 | crates/bsl-analyzer/src/bin/cli/source_set.rs:492-520 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/source_set.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"02afb683e616b3fa949ac58577a681efbe8f72599d91166db3489022b8b5c6b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/sdbl-hir/src/hir.rs:65-104 | crates/sdbl-hir/src/hir.rs:264-300 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00e588f3563acb950d08bcb673d3a39cdf1f38443a6109511d0dfbf7d2e6fd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/bsl-debug/src/module_index.rs:239-288 | crates/bsl-debug/src/module_index.rs:297-336 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/module_index.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5b0ca0e295017156f080ebc591da87bfc53dec19e0e96b5a58cd37ce944d33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/hir-ty/src/narrow.rs:757-778 | crates/hir-ty/src/narrow.rs:890-912 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/narrow.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6fe1d2c1da70a865abc00e3b348370d77bc1d3e5b571dd288b4f6ee57b7611"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/ide/src/completion/bsl_completion.rs:945-977 | crates/ide/src/hover.rs:799-840 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/bsl_completion.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"791a6585670a553854a15b2af6451a1f139197460c190096f101983a03ee2358"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/hir-def/src/graph_index.rs:236-260 | crates/hir-def/src/graph_index.rs:274-295 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e506cd993bfc51c4ebc8674130fd3dfa8cb2bda0f9ad587e433c268b816fd711"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/parser/src/grammar/items.rs:109-143 | crates/parser/src/grammar/items.rs:158-186 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/items.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1f20df6c7b3c692e33fb369a4738a391260bdeea0d758ca6a9926ac0905e54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/bsl-check-executor/src/native_check/profile.rs:2350-2375 | crates/bsl-check-executor/src/native_check/profile.rs:2377-2405 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"063dfd0eb31cc738e068a60cecf495040159a1cff5e31336bbf498cab03908d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/mcp-server/src/broker/daemon.rs:805-844 | crates/mcp-server/src/broker/daemon.rs:885-941 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/broker/daemon.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d007bdd891fbc5e09069d427baa69954804f325f2f95386788fdab9d05ac89b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:320-359 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:587-621 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4c1b490e052d492c79583b4273b7c463091e4e7575d2648f4780387657cc93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/ide/src/symbol_info.rs:609-657 | crates/ide/src/symbol_info.rs:664-695 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/symbol_info.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"871163ad1a4bd7ab7f21bf2a973ff213fea0a2b5d321b92c71671fa541c8e4d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/bsl-check-executor/src/native_check/profile.rs:2762-2790 | crates/bsl-check-executor/src/native_check/profile.rs:2842-2871 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":2762}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c73710a2d12f1456b410288702444fdf492e9f6fa9a4f4fc20ca97014fe4b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs:169-220 | crates/ide-diagnostics/src/handlers/scheduled_job_handler.rs:272-338 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a5a7130d583aa47af473835ed0ef29f971f9ab2c8037a1dcb367e1e6781fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/bsl-platform/src/types.rs:61-71 | crates/bsl-platform/src/types.rs:107-116 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/types.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d927cb9c8a6cf1534a62d5e225fde0abff9188f6f3dd4d0460dc3bf2de0368"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/bsl-search/src/engine.rs:6116-6150 | crates/bsl-search/src/engine.rs:6249-6279 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":6116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6297c9b9cb930cfed193b25acc4054ecc6c627b480de2df67210b20815264902"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 37\u002B corresponding lines): crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs:300-342 | crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs:357-393 | crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs:408-446 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 37 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0f18b5045d906e9ed877ff904b899e13452758ac084a32281a20c7b9052c88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/mcp-server/src/change_hub.rs:3498-3519 | crates/mcp-server/src/change_hub.rs:3730-3745 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":3498}}}],"partialFingerprints":{"codehealthFindingId/v1":"5542be809a865a2dab92a464e5cd4110f2b369050f1e55160bd53992e6945fe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/bsl-search/src/workspace_overlay.rs:1388-1420 | crates/bsl-search/src/workspace_overlay.rs:2357-2402 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3501764fec75a0b30830dba54fbe4d8de12904000f349bc7d30768bee65f8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/bsl-launcher/src/entities.rs:32-56 | crates/bsl-launcher/src/entities.rs:58-82 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-launcher/src/entities.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f7239213048f3b4587f54468fa87446b7f80bf0e567c9f820628a809450ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/bsl-analyzer/src/smoke.rs:585-605 | crates/bsl-analyzer/src/smoke.rs:713-733 | crates/bsl-analyzer/src/smoke.rs:770-798 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"64802c140a504eabf0411a353b686b5185277b6f960c3cc6b4d6e7290d370726"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/bsl-platform/src/db.rs:511-531 | crates/bsl-platform/src/db.rs:598-618 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/db.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d1674266ea4f1bf6eeb61f7e4da54260388494b0dd5f0ff210992aadabeff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/mcp-server/src/tools/metadata.rs:692-724 | crates/mcp-server/src/tools/metadata.rs:726-756 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac9a2e543a3859ee90b42f3b8e6fa80f8ef32c7dfd82feb1fdf98309d2e94e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/mcp-server/src/tools/platform.rs:1419-1440 | crates/mcp-server/src/tools/platform.rs:1445-1465 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/platform.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61c6bd75b2c5570b6e255a2f3e2433970751edd999b92591e17eeb96dfd6841"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/mcp-server/src/workspace_lease.rs:697-726 | crates/mcp-server/src/workspace_lease.rs:841-862 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/workspace_lease.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac9282a449f33f6beadca7003756ffb472f476482f33771ec48acd777bd982e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/bsl-metadata/src/form.rs:415-425 | crates/bsl-metadata/src/register.rs:448-465 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/form.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8aa975954e30003c1c200a0c1b44cd5f2f3737b58202383122e8ff65253c2d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/bsl-metadata/src/xml_parser/register.rs:170-191 | crates/bsl-metadata/src/xml_parser/register.rs:196-219 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/register.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c813ae290a85f0d857f3e0316e8f7894c166ca8625bbc409aa45c10168eb726"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/bsl-platform/tools/html-parser/src/lib.rs:729-752 | crates/bsl-platform/tools/html-parser/src/lib.rs:790-813 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f4ea876d664883f1e985a44d6e838547be3ff49354bb11c4dcc2a03238e2a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/bsl-metadata/src/xml_parser/role.rs:9-33 | crates/bsl-metadata/src/xml_parser/scheduled_job.rs:6-37 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/role.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7304f56af94848d7432c06b1aad6d03276f828c7e1d54e39d105bc6bea7bda0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/bsl-metadata/src/metadata_object.rs:617-645 | crates/bsl-platform/src/standard_mdo_attributes.rs:55-84 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/metadata_object.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb81b2a8389b332e8c8613269adcd0138497de7009aef41c4561e6ecee32322"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/bsl-metadata/src/metadata_object.rs:647-675 | crates/bsl-platform/src/standard_mdo_attributes.rs:86-115 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/metadata_object.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d89943347362edde8cab0d15a0e60facfa9ea705163a909cb004bd6138b095c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/sdbl-hir/src/lower/from_clause.rs:1670-1697 | crates/sdbl-hir/src/lower/from_clause.rs:1912-1936 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"c440ced32125a04b3f2131d4a5b81a3336afa34c83d11cf8747537d60a2fdd2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): crates/ide-diagnostics/src/common_module_helpers.rs:58-91 | crates/ide-diagnostics/src/handlers/common_module_invalid_type.rs:24-79 | crates/ide-diagnostics/src/handlers/common_module_name_words.rs:28-62 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 34 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/common_module_helpers.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdec0783999fe58a03b5d311b6262aac5febe9ef19e2f3e14d5644a28e2c7f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): crates/mcp-server/src/tools/search/render.rs:661-688 | crates/mcp-server/src/tools/search/render.rs:697-733 | crates/mcp-server/src/tools/search/render.rs:738-772 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/render.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c4a63585d3d3912baaa8bab7e79c843f82f01dfcc042067381d83ecb851477"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/bsl-search/src/store.rs:3814-3836 | crates/bsl-search/src/store.rs:5096-5115 | crates/bsl-search/src/store.rs:5366-5389 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":3814}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f4a71b0ca52fa0b1473b5e82719825e5eccc378aa2da29a18de6aa5c4430d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/bsl-search/src/engine.rs:6156-6179 | crates/bsl-search/src/engine.rs:6188-6211 | crates/bsl-search/src/engine.rs:6286-6308 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":6156}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae2c08572f205b5d2347653b903923bc0dd9f8d09bb350b4bf0f54ced7506ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/bsl-types/src/testing.rs:32-53 | crates/ide-db/src/type_kernel.rs:32-53 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/testing.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0884b0ca1c619179f3b428c55a9143981bf473250893c3be82c0315adb44e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ide/src/hover.rs:717-737 | crates/symbol-info/src/adapters/mod.rs:68-92 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/hover.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e15b3bc6abc7656f3637b3a4521063603a86771c04634f0039854e9977cd2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/bsl-debug/src/module_index.rs:344-377 | crates/bsl-debug/src/module_index.rs:446-479 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/module_index.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a59bdf04a6618c19f28e2be715f7734a1bcf6db86a1d3e31f41e4386f8534f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/sdbl-hir/src/lower/clauses.rs:12-42 | crates/sdbl-hir/src/lower/clauses.rs:47-75 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/clauses.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa63e94e446c598c7e293f62027dee2d22787a854224133f30a79e860216eb6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/bsl-check-executor/src/native_check/compiler.rs:1054-1073 | crates/bsl-check-executor/src/native_check/profile.rs:3388-3408 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/compiler.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f22d87216e5c5c8abb31fc452ce42274a7b48bd0362b1d65cda9f39f35a267d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/bsl-search/src/store.rs:4422-4448 | crates/bsl-search/src/store.rs:4679-4704 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":4422}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f8d404febbdb27f5112a4ea9e0377916bc328d5c91a92cc6ac9d7fd7a23d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/hir-def/src/conditional_tree.rs:325-352 | crates/hir-def/src/conditional_tree.rs:359-385 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/conditional_tree.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"745967c3e74321c1cfb96c1bf63b9679408d42ee8996fff2d37a4795365a3cc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/bsl-debug/src/session.rs:509-530 | crates/bsl-debug/src/session.rs:537-555 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/session.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f21035b5fed263c067ffc68b7495fe5cf66803a54104331381fd77ba3d0c0fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 23\u002B corresponding lines): crates/ide-db/src/database.rs:1540-1572 | crates/ide-db/src/database.rs:1574-1602 | crates/ide-db/src/database.rs:1655-1685 | crates/ide-db/src/database.rs:1810-1838 | crates/ide-db/src/database.rs:1862-1884 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe30db79639a11eb996038247354280365cb03484d94bb9216986033781fdfe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): crates/ide-diagnostics/src/handlers/at_client_at_server_form_method.rs:30-65 | crates/ide-diagnostics/src/handlers/command_module_export_methods.rs:20-49 | crates/ide-diagnostics/src/handlers/compilation_directive_lost.rs:20-57 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/at_client_at_server_form_method.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e3df4352792d5e3cb9ca22157d39512902bec6e999452135d0694a91dbae4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/bsl-search/src/engine.rs:4113-4137 | crates/bsl-search/src/engine.rs:4382-4406 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":4113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9657e30555cdf48314bc8cb040bf8bbe752c19ddade40ad877592357dc3add42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ide/src/hover.rs:652-666 | crates/ide/src/hover.rs:675-690 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/hover.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"464f0f90c84a00974058b1de7cdd73bbc4973c58f10cf2afda2f9e945b3e9856"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/bsl-analyzer/src/server.rs:568-586 | crates/ide-host-core/src/workspace.rs:808-824 | crates/mcp-server/src/diagnostics_state/lifecycle.rs:1663-1680 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"07949bcf9a94b6de0ed8788808c9f544c489f6bfe53abb7bab1b521650f79ae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ide-diagnostics/src/handlers/order_of_params.rs:20-45 | crates/ide-diagnostics/src/handlers/reserved_parameter_names.rs:22-52 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/order_of_params.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cf764497e4294a5fd7a5d0df7bf436f5b70afd5648a1fbe7cbda57b4358602"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/vcs/src/lib.rs:63-84 | crates/vcs/src/lib.rs:92-113 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcs/src/lib.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa35c52b8e5da71b61e506d2d35a19a30fd424236a516dbc03dd7cec26d0a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/bsl-check-executor/src/native_check/profile.rs:1880-1910 | crates/bsl-check-executor/src/native_check/profile.rs:1927-1961 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f14a0e9d6b8fc9d1b0f914628380ef2d6fb39817d71a090aee1f0d457d4f348"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/hir-ty/src/this_object.rs:68-85 | crates/hir-ty/src/this_object.rs:90-107 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/this_object.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8c13ba5df279ab2949c85d7fd04c8948c6188018546ff89f41786db817d40c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/bsl-check-executor/src/native_check/profile.rs:3006-3024 | crates/bsl-check-executor/src/native_check/profile.rs:3030-3045 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":3006}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb3fc9cc88664c49726a21a30afb760f6536d84dd5bb925315f12e0bd53f71a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): crates/ide-diagnostics/src/handlers/cognitive_complexity.rs:20-53 | crates/ide-diagnostics/src/handlers/cyclomatic_complexity.rs:20-51 | crates/ide-diagnostics/src/handlers/method_size.rs:23-50 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/cognitive_complexity.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f302ddface412092a4f010a2f01bc007b4833718dea91a79938e436c9e223dc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/bsl-debug/src/types/xml.rs:347-368 | crates/bsl-debug/src/types/xml.rs:376-393 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59f0eafbe619d5a6550d406ff6157a6d169ec556e1323c55b3027dd9071433c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/bsl-search/src/external_baseline/postgres.rs:412-424 | crates/bsl-search/src/external_baseline/postgres.rs:433-449 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a9c2b8753d6f8a7743aa58c6c194f40d53fd556d597408ca8aa072b44255e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/mcp-server/src/tools/platform.rs:513-531 | crates/mcp-server/src/tools/platform.rs:580-597 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/platform.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eda954e98337edac3873ac0bb73729c65bafa1ddbb6dd66466925b7742915e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/mcp-server/src/tools/platform.rs:1621-1643 | crates/mcp-server/src/tools/platform.rs:1721-1739 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/platform.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c59f3e50bf3bcad2c4bb877ba9dc2956bf5ae162f5d84cfc4a23ab4e069705f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/hir-def/src/resolver.rs:234-251 | crates/hir-def/src/resolver.rs:253-267 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/resolver.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdb86209d719dfcaf26b2eb4cd64b9301638395a1ddac29b474687ab9f6b5e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/mcp-server/src/baseline.rs:201-222 | crates/mcp-server/src/baseline.rs:227-254 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/baseline.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca5c511d09612ef5ac5cbba8f4cde25270c41c1ecf8078e4c8074e116c78c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/bsl-check-executor/src/native_check/windows_acl.rs:56-71 | crates/mcp-server/src/cache_windows.rs:72-93 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/windows_acl.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8138a4d86762443588a9fe6cff90448aa404f4ac4ec8562b25de0209d185126d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ide-diagnostics/src/handlers/same_metadata_object_and_child_names.rs:70-93 | crates/ide-diagnostics/src/handlers/same_metadata_object_and_child_names.rs:101-121 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/same_metadata_object_and_child_names.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7de0fa4611327c5ffb7c981d1edd28ad805c15685249b07ad5ad593b14b68e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/bsl-search/src/engine.rs:2391-2405 | crates/bsl-search/src/workspace_overlay.rs:2614-2628 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2391}}}],"partialFingerprints":{"codehealthFindingId/v1":"01aac9d4c6d64fecde0d03437e09b542dcf75b62de83c381c21c5bf9be659509"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/bsl-check-executor/src/main.rs:174-197 | crates/bsl-check-executor/src/wire_api.rs:176-196 | crates/mcp-server/src/tools/check_executor.rs:680-705 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/main.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a19166f9145a4e414954357ff7f953503737209fb96738bd2572c47c702487"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/bsl-metadata/src/loader.rs:771-798 | crates/bsl-metadata/src/loader.rs:874-889 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8632b810fe916acc376477272d28f672c3386e60fc1bc9ebcc212320117501"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/mcp-server/src/tools/search/gating.rs:115-152 | crates/mcp-server/src/tools/search/gating.rs:157-185 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/gating.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfa816c4ed34416088f430cdf6afcc96a4fd7f4f05490d374595a176fcad0d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/project-model/src/diagnostics_baseline_fs.rs:42-59 | crates/project-model/src/diagnostics_baseline_fs.rs:162-181 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/diagnostics_baseline_fs.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a80933bfd6b8a9dcc5d6509351a5e5a6c98d1bb3deecb9e292056fb00a943b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/bsl-analyzer/src/task_pool.rs:170-189 | crates/vfs-notify/src/lib.rs:41-59 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/task_pool.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6377b01e298a1b3d18886c0d75c107ca8d56a15c71587faa78c54b0fbf9a407d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/bsl-search/src/engine.rs:1742-1762 | crates/bsl-search/src/engine.rs:1988-2011 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f198b744ab4633d768679f2f5474150edf6a7d83a0cf3eeeb53d1c923336633"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/hir-def/src/conditional_tree.rs:513-529 | crates/hir-def/src/region_tree.rs:373-386 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/conditional_tree.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"904f0cba3e7167f86f5f34a38df9e4376446dd49694b7ac2a7567875926fbc36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/ide-db/src/database.rs:2484-2504 | crates/ide-db/src/database.rs:2509-2528 | crates/ide-db/src/database.rs:2533-2554 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":2484}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12f7197961d01e66c36696312b96a0911140cd02bbf0e68a6faa801059c0a64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ide-diagnostics/src/handlers/using_hardcode_network_address.rs:78-90 | crates/ide-diagnostics/src/handlers/using_hardcode_path.rs:82-94 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_hardcode_network_address.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fc4e67dd5bb11b4dce27c9fdbca94090af93e9be078f97b0229bf73b3802cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/ide-diagnostics/src/handlers/number_of_optional_params.rs:22-48 | crates/ide-diagnostics/src/handlers/number_of_params.rs:22-47 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/number_of_optional_params.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd782c8ec99f616bdeb57d13376c9c2a37961734d5c19db285d377a1a0fa829"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ide/src/graph.rs:3228-3237 | crates/mcp-server/src/graph_query.rs:54-63 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":3228}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd96d4d89d639f4b5ca11d6ffd835fc86fb8d5d494f056e2e2414ea72a146573"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/bsl-metadata/src/metadata_object.rs:853-876 | crates/bsl-metadata/src/metadata_object.rs:883-906 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/metadata_object.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"4842f06d134c0a5affc73cfc5dceaa62b0389be99f81d132904493328a316d67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/bsl-search/src/engine.rs:5908-5924 | crates/bsl-search/src/engine.rs:5932-5945 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":5908}}}],"partialFingerprints":{"codehealthFindingId/v1":"385a25f8c18051079ff487487315e938b242cebeeeb892114176f30fdb2699f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/ide/src/symbol_info.rs:964-981 | crates/ide/src/type_definition.rs:141-159 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/symbol_info.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd4bf28bbbfdd7833e553f51556ae3132e58a9169e023f5c2b360cf9beaab70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/mcp-server/src/tools/debug.rs:472-488 | crates/mcp-server/src/tools/execution.rs:210-230 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/debug.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3635660d2ce0e4b70ac65ecc586bde68cc0563ab4c799ff3d9d1907ff744a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/bsl-search/src/engine.rs:5223-5253 | crates/bsl-search/src/engine.rs:6327-6359 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":5223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9de632041112b271e171a39ab608c376ccb2a5f401beed853fe295d16ae677"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/ide-diagnostics/src/runner.rs:161-188 | crates/ide-diagnostics/src/runner.rs:301-335 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/runner.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"384c44f793fe662da037dfaca7584b9895820dc19e3fbc938c0e3a28c6d755cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/bsl-check-executor/src/native_check/windows_acl.rs:35-54 | crates/mcp-server/src/cache_windows.rs:45-63 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/windows_acl.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1509b39435a5bee1feed3f455f11a860e24dbb9f2cb1ddbc6dbaa44bfb1efedb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/ide-diagnostics/src/handlers/forbidden_metadata_name.rs:150-172 | crates/ide-diagnostics/src/handlers/metadata_object_name_length.rs:24-51 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/forbidden_metadata_name.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b669fa1f6762bfcfacfbee2f08355a7949959760543edd3b21107e3efd1a5d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/bsl-debug/src/session.rs:903-924 | crates/bsl-debug/src/session.rs:991-1011 | crates/bsl-debug/src/session.rs:1018-1040 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/session.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6fdc69ea47ab3e55403dcd9cdd5b4933f00a3534a059202c8ad55de536ebc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ide-db/src/database.rs:655-675 | crates/ide-db/src/metadata.rs:537-552 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"2321cc762e5867a68c2f618d73d6bef945b5e466ce50a8695bc9929b2c4070b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ide/src/completion/sdbl/use_cases/complete_value_elements.rs:79-97 | crates/ide/src/completion/sdbl/use_cases/complete_value_elements.rs:102-121 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/sdbl/use_cases/complete_value_elements.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd54ccd4f44a33598719295869c0cbdc2bf6949d9f0eb1d5a15973fb5f24658d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/mcp-server/src/workspace_lease.rs:1130-1147 | crates/project-model/src/lib.rs:1218-1231 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/workspace_lease.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14f652c857249f47e8b20c4d23992eaa02bc3b672b119026bdc98483ad74702"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/bsl-analyzer/src/bench/discover.rs:452-468 | crates/bsl-analyzer/src/smoke.rs:643-659 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bench/discover.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c576ba49f995f85feca5e58ee96e4d5f444886d3b04eebc6eb53d0746ad53c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): crates/parser/src/grammar/expressions.rs:35-50 | crates/parser/src/grammar/expressions.rs:52-67 | crates/parser/src/grammar/expressions.rs:103-118 | crates/parser/src/grammar/expressions.rs:120-135 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/expressions.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de4ad69a9602404fb0759792486ff9ace57cbdfa8b1103b8fb9fe246c790444"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/dataflow/src/reaching_defs.rs:279-291 | crates/dataflow/src/reaching_defs.rs:415-430 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/reaching_defs.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fd00840963414ebb5efcfe0728583280096578611f4d22d50201f28851ae4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/bsl-platform/tools/html-parser/src/lib.rs:697-723 | crates/bsl-platform/tools/html-parser/src/lib.rs:907-932 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"c243d4fb258b55037fcaff817603cd6e41ff9fc8519ff44e2f8a1ea9d2ee649a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/hir-def/src/region_tree.rs:260-270 | crates/hir-def/src/region_tree.rs:272-287 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/region_tree.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf615db8e25a07621c624da804663cae1170bc7abe5c63502c3e301f7ecae5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/mcp-server/src/tools/search/lexical.rs:223-246 | crates/mcp-server/src/tools/search/semantic.rs:340-369 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9608491cb617ff0c5ccc530780512dc5e6668ec3ae90d8eddd24351fa2c79d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/ide/src/graph.rs:1932-1944 | crates/ide/src/graph.rs:1954-1968 | crates/ide/src/graph.rs:1978-1992 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":1932}}}],"partialFingerprints":{"codehealthFindingId/v1":"4797017e12779abe41425841094e62b088294ab3effbc94ee63dfc29db2fea3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/bsl-analyzer/src/mcp_install/adapters.rs:556-570 | crates/bsl-analyzer/src/mcp_install/adapters.rs:594-608 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mcp_install/adapters.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d21edd12415624482a508f9fb49acd87fff3c7753bb12e7da8f50f1964fe009"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/hir-def/src/graph_index.rs:2522-2532 | crates/ide/src/graph.rs:1804-1816 | crates/ide/src/graph.rs:1818-1828 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0d04e15430d45eff3899433d4e25aff0f814c655fdcef0c48a27699ea7bab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/hir-ty/src/this_object_attr.rs:17-31 | crates/hir-ty/src/this_object_attr.rs:37-44 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/this_object_attr.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1622792be3f498becd292f0bd16ec9533eb8e30631c272e9ee19b0378feeaa82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ide/src/completion/mdo_completion.rs:533-547 | crates/ide/src/completion/mdo_completion.rs:552-568 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/mdo_completion.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa3273f801933842da9d549a3e967f75243bdd39091bc426e96fd740879fde7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/base-db/src/lib.rs:260-288 | crates/base-db/src/lib.rs:438-456 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/base-db/src/lib.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae4967f30339487422b890daace50f4c3dec0091c2fed48c0221f2bba3f4da6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/bsl-analyzer/src/bin/cli/search_baseline/inspect.rs:96-119 | crates/bsl-analyzer/src/bin/cli/search_baseline/inspect.rs:170-191 | crates/bsl-analyzer/src/bin/cli/search_baseline/inspect.rs:195-222 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/search_baseline/inspect.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f23f66626584c6b57e5da2ada7eabcbdc95cfdc680c1773f9f68c76b12f67ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dataflow/src/security_state.rs:45-53 | crates/dataflow/src/security_state.rs:55-67 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/security_state.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1f621edb808f16a0e28e38ad2049552419a0c8d6c0a6ffe7f7d20a169684b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ide-db/src/salsa_events.rs:167-182 | crates/ide-db/src/salsa_events.rs:226-242 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/salsa_events.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a316523f15b8274c6a4c0d9c29bc96ebab7ac6f1568d7848202d5018dd5cb4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/bsl-analyzer/src/global_state.rs:848-865 | crates/bsl-analyzer/src/workspace.rs:590-607 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/global_state.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65d5b700984c3acf3b63a473fb8d0703cb32a4534b8f04cf42cd82a385d7f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/bsl-platform/src/db.rs:499-509 | crates/bsl-platform/src/db.rs:577-587 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/db.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"9128f7bd1f4eb757c342ea2cff03230549ccb42cc46307231acb8bd45c5f12ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/hir-def/src/body/lower/diagnostics.rs:223-242 | crates/hir-def/src/body/lower/diagnostics.rs:290-309 | crates/hir-def/src/body/lower/diagnostics.rs:373-392 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/diagnostics.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"4176cfd056817c6971e5f7cf90caed674af872a4e20ad62d3359d169d7146fb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ide/src/completion/mdo_completion.rs:308-330 | crates/ide/src/completion/mdo_completion.rs:375-391 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/mdo_completion.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebdea5f1216058f4a065a1474c989efc1e194dd5a0dc2fb16fe0bdd4c6c2fac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/bsl-search/src/store.rs:1734-1753 | crates/bsl-search/src/store.rs:1764-1780 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"8664ee4fedf13b989e25898ec5e1968b1d46407acbfe1aa84b63411aaf4a35ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/sdbl-hir/src/lower/diagnostics.rs:328-342 | crates/sdbl-hir/src/lower/diagnostics.rs:345-355 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cabc2cb470fb3c371b3b944cdc30dfc330a5f2dc572370996eaef8ac25ee9ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/hir-ty/src/lower/type_string.rs:25-41 | crates/hir-ty/src/lower/type_string.rs:43-59 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/lower/type_string.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e88c0404ff7cc79510afbc4057c7da872e714c32a0a3174de3e4e07e0b02d91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/hir-def/src/body/lower/diagnostics.rs:721-735 | crates/hir-def/src/body/lower/diagnostics.rs:737-751 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/diagnostics.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eaab0642384562f6046b94338b0ad0d289be4fc56597d7065bde7fd5a9e5c0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ide-db/src/metadata.rs:938-955 | crates/ide-db/src/metadata.rs:1265-1276 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24662d307bce6b0288833930d5460817fcb7cb8806e15bc7c5703f4acc81b6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/parser/src/lib.rs:69-84 | crates/parser/src/lib.rs:86-102 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/lib.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c240d01d256ebc7ba24917d9a06267e7d4359e150774be0c6fab83c7100d01b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/bsl-analyzer/src/smoke.rs:569-583 | crates/bsl-analyzer/src/smoke.rs:661-676 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf4dd189f834781d61d99bb265dec354a0fba4b199e3d93598b1d0d7d7bd697"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/bsl-platform/src/types.rs:144-150 | crates/bsl-platform/src/types.rs:171-178 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/types.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc450bd79dddfb39de15f5492215adf8758e13937096f0cdba2497b15eef2f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/bsl-metadata/src/loader.rs:962-972 | crates/bsl-metadata/src/loader.rs:980-988 | crates/bsl-metadata/src/loader.rs:996-1004 | crates/bsl-metadata/src/loader.rs:1184-1192 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6d4a640a43639d42e53a62f917cdd05507bebbb602b4de5c59d3b331bdd2f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/hir-ty/src/arg_diagnostics.rs:323-341 | crates/hir-ty/src/arg_diagnostics.rs:350-367 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/arg_diagnostics.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea1919cba1dcd172cc4126f1bd596711a1f560bf01f69af2ec37e4956b1aad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/ide/src/graph.rs:1911-1923 | crates/ide/src/graph.rs:2002-2014 | crates/ide/src/graph.rs:2025-2039 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a37b15a83783cb80ef866b60dda42e90707cbffa82739f04f1969b50694bca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/bsl-analyzer/src/mcp_install/adapters.rs:498-508 | crates/bsl-analyzer/src/mcp_install/adapters.rs:514-524 | crates/bsl-analyzer/src/mcp_install/adapters.rs:530-546 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mcp_install/adapters.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"219c0257c86959a29c46f4e3164bc9c356bf3bfa28935a306f0649e2aa50effd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/bsl-platform/tools/html-parser/src/lib.rs:371-379 | crates/platform-help/src/package.rs:140-148 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"799f6452fd5fdc17a4406ac99fee9537b9b2ba0ce0131cf5fc17d334304168ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/bsl-metadata/src/event_subscription.rs:67-82 | crates/bsl-metadata/src/scheduled_job.rs:74-89 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/event_subscription.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2a3c6d7c88e39b3b0c3d28d528c79fe044c39bc0e2bd3710f61be8a646db96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:186-202 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:204-213 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8537eaa6c553704863b4da9e3f63dc6ca30ca6095a46bb37525e4b2c1f4b922"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/mcp-server/src/change_hub.rs:5296-5311 | crates/mcp-server/src/change_hub.rs:5476-5491 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5296}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3a81e86c93cee946cc5d9207c3424efa3fee72e6a8e5a73edde145349c3313"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/mcp-server/src/graph_query.rs:1781-1798 | crates/mcp-server/src/graph_query.rs:1806-1821 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_query.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51e03fc4c2a3efe3095900b2b73c9d76fbaab76d023ac5fa98648de8f5a8145"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/mcp-server/src/tools/metadata.rs:16-31 | crates/mcp-server/src/tools/metadata.rs:39-53 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"217d34f8d9a0d79022acc9d0e5ba3fa6c5bccd8352c97733c83ce4299299b8a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/hir-def/src/graph_index.rs:2225-2242 | crates/ide/src/graph.rs:3279-3298 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"752bf5ddf3fd11a886d6d5383af20f434996c058eaecd8aea4110bb7c5d1581a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/hir-def/src/resolver.rs:646-661 | crates/hir-def/src/resolver.rs:716-726 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/resolver.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"1165a340cb5d2bfaccc1bbdf1b86824e29b3980d179cad41509e9a4aeeb0fb6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/line-index/src/lib.rs:176-189 | crates/line-index/src/lib.rs:269-282 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/line-index/src/lib.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58e5b47be390af907912cde4fd82de6311942a96bf6c9017d8666a49daabb69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/parser/src/grammar/items.rs:23-40 | crates/parser/src/grammar/items.rs:188-205 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/items.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb718175fc5ad37d48eb0a5c90ed953b6fe832bb134d8a1d80d4ce6810a7f08f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ide-diagnostics/src/handlers/unused_local_method.rs:412-419 | crates/mcp-server/src/graph_query.rs:82-89 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_method.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"de18fea8cd7bf5e071ec3e417b48fd0aeacbd450bab871965cd8b9f340359a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/mcp-server/src/broker/name.rs:113-133 | crates/mcp-server/src/broker/name.rs:243-256 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/broker/name.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fa5cc35a68bfbbd5eafa64602f8920654e0726238fe90625589ad5ce9f9caa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/bsl-analyzer/src/global_state.rs:1136-1155 | crates/bsl-analyzer/src/global_state.rs:1160-1175 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/global_state.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f812dd6f204636ee14e533903f105e0ee0a9dde93086868178e06309b9d87760"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/sdbl-hir/src/context_detector.rs:527-542 | crates/sdbl-hir/src/context_detector.rs:544-560 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/context_detector.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0a6e28d77f169211f45cff28ea0a0dffaa272bc1e6f3cb85b1b7f82e144f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ide-diagnostics/src/handlers/disable_safe_mode.rs:42-61 | crates/ide-diagnostics/src/handlers/set_privileged_mode.rs:40-55 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/disable_safe_mode.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f392e69925ef9b4033d4358e6574cc20fcb376571784466b92213a41a1d6cfc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/bsl-analyzer/src/bin/cli/rules.rs:157-175 | crates/ide/src/diagnostics_catalog.rs:136-153 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/rules.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"034ea7cf57c725df21350eaba38fff5ad094c6eb9325fafef9285179953ece47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/bsl-search/src/store.rs:3736-3749 | crates/bsl-search/src/store.rs:3754-3765 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":3736}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a662d5550ea2e3fa526abefba99cbb92d2506dc85acf18b640a51abc07e610"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/ide-db/src/metadata.rs:1245-1254 | crates/ide-db/src/metadata.rs:1288-1297 | crates/ide-db/src/metadata.rs:1310-1319 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4687cfc16f9f90792f721f062e81a8d4bb6f76fef741f75d3d0041c2a3983bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): crates/ide-diagnostics/src/handlers/deprecated_current_date.rs:16-37 | crates/ide-diagnostics/src/handlers/deprecated_find.rs:16-37 | crates/ide-diagnostics/src/handlers/deprecated_message.rs:16-37 | crates/ide-diagnostics/src/handlers/deprecated_type_managed_form.rs:15-36 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deprecated_current_date.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"23155bea25954409474cfe8aa30be758881c582afd3f09151f951df3b2408694"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/hir-def/src/method_slab.rs:481-490 | crates/hir-def/src/method_syntax.rs:68-79 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/method_slab.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9154493e457570687c6a070e6f51f9dc9e90b079a29c2af3bb1ffa26a407efd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/hir-def/src/queries.rs:235-244 | crates/hir-def/src/workspace_index.rs:181-196 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/queries.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"843cbb04f6bc5e91c202f5c58f89cb1f48e161ae83a15cad77389dd1aeab8f7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/parser/src/grammar/sdbl/select.rs:908-927 | crates/parser/src/grammar/sdbl/select.rs:929-948 | crates/parser/src/grammar/sdbl/select.rs:1065-1084 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/select.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"265eee18e2fa204d51399ac30938ee2aabf572981867c8caea88439edf385589"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/dataflow/src/reaching_defs.rs:604-612 | crates/dataflow/src/reaching_defs.rs:620-632 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/reaching_defs.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"5948a462a552d05733bcb0367e93725f317a31a8b9be58b5988a7b9232e86291"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/bsl-analyzer/src/handlers/dispatch.rs:138-151 | crates/bsl-analyzer/src/handlers/dispatch.rs:161-175 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc3f1d64059286d708bd993f3f96946b428ef94fef90b2ff43f5c0981c3da74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/bsl-check-executor/src/native_check/compiler.rs:277-292 | crates/bsl-check-executor/src/native_check/profile.rs:2150-2163 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/compiler.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"565f680c1d1b6902d833f2cc322252e8de64b42e0d7fdf6687a2b07c653aada4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/bsl-search/src/store.rs:3925-3934 | crates/bsl-search/src/store.rs:3939-3952 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":3925}}}],"partialFingerprints":{"codehealthFindingId/v1":"3237cc26b714849a9395b3b8f359dc40dac736fe716d3b627514c0ed4d3c84ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 17\u002B corresponding lines): crates/ide-db/src/database.rs:1500-1516 | crates/ide-db/src/database.rs:1522-1538 | crates/ide-db/src/database.rs:1608-1624 | crates/ide-db/src/database.rs:1792-1808 | crates/ide-db/src/database.rs:1844-1860 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc82f7296e8b48f39573212346802a86a6e5e948904196b98ffcc2c63c03a2c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ide-db/src/queries.rs:168-181 | crates/ide-db/src/queries.rs:196-209 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/queries.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6d056c0817a78d71ae3fddcba5d7c329d24173418565750434c56027764b8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/bsl-analyzer/src/tracing/hprof.rs:28-41 | crates/bsl-analyzer/src/tracing/json.rs:33-46 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/tracing/hprof.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9463ac0ad379d24cad0f57e461a939ebf8d97c4eb302220c419ffb685d5d2db0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/bsl-metadata/src/common_attribute.rs:226-239 | crates/bsl-metadata/src/common_attribute.rs:247-264 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/common_attribute.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2498d65bf7c8dac73cf4b512c71bfe7ee46477fc4338d55c4b298a1cc1a45ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/bsl-search/src/engine.rs:100-113 | crates/bsl-search/src/engine.rs:115-127 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2601aa246c54206d3d9397f4421a8b32a70717327ec8f743826cecc868a1e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/ide-diagnostics/src/handlers/type_mismatch.rs:71-86 | crates/ide-diagnostics/src/handlers/type_mismatch_by_doc_comment.rs:27-48 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/type_mismatch.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"758353a4f38992414c921d2baed5fc42e4ad3f96633f1faab8de18f486f25f85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ide-diagnostics/src/handlers/unknown_preprocessor_symbol_corpus.rs:10-21 | crates/mcp-server/src/tools/outline.rs:422-433 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unknown_preprocessor_symbol_corpus.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2413cce8ad831ba215aee4c97bbc3eaf19f4fb84db42d372d1961d613c8b6924"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/symbol-info/src/presenters/signature_help.rs:92-104 | crates/symbol-info/src/presenters/signature_help.rs:119-132 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/symbol-info/src/presenters/signature_help.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf5e7650b33bd146033e3fd230c46a275360e4053b1f88db168d68a76138339"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/hir/src/semantic_symbol.rs:526-534 | crates/hir/src/semantic_symbol.rs:536-544 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir/src/semantic_symbol.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf9973ed6ecae937955ecb6c22d73d72a0bfe273763a54fb446287f80e37c3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/hir-ty/src/form_attr.rs:109-118 | crates/hir-ty/src/form_attr.rs:124-136 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/form_attr.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d2a698ecba1b81620190ded550c94e32dbebb361c92e37c0e17c4e8f54a964"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/hir-def/src/body/lower/mod.rs:260-276 | crates/hir-def/src/body/lower/mod.rs:305-322 | crates/hir-def/src/body/lower/mod.rs:324-337 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/mod.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"448b127beb9ab5c9cb903927b4e055765bae6267c45c6bad2d6cdad6f946b55a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/hir-ty/src/min_platform.rs:69-78 | crates/hir-ty/src/min_platform.rs:81-90 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/min_platform.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00ceff54f28c88b4433536d2187a81e63f60bbd96e86563c84dd70046b70814"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ide-diagnostics/src/handlers/empty_statement.rs:21-39 | crates/ide-diagnostics/src/handlers/semicolon_presence.rs:21-39 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/empty_statement.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cacc6809dc0e546dd8eedb94c8c7197fb31df7ee73f37be201e9e2dc946298a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/mcp-server/src/tools/debug.rs:259-267 | crates/mcp-server/src/tools/debug.rs:452-466 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/debug.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"db66b6777b015dadb9c37071ecae950293bf74c4666776f0dc9a4a4fc5d95307"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/hir-ty/src/infer.rs:1714-1733 | crates/hir-ty/src/infer.rs:1743-1764 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fe97fd5feebe12dca52c360bb2cbe23b15ba488045f23c1d17191893ccc23d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ide-db/src/database.rs:437-450 | crates/ide-db/src/database.rs:476-491 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"455be8c0d1d2a1a04ebd555a0067df1fb7d875e875956bd165fde1603da26adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ide-diagnostics/src/handlers/commented_code.rs:35-48 | crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs:38-58 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/commented_code.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9e4bf033b7386cdd56587c604cae5c0cdbcd26bf82e0aa650d086cd74df6f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/ide-diagnostics/src/runner.rs:337-358 | crates/ide-diagnostics/src/runner.rs:360-382 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/runner.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12b732b64a16a323ecc96bfc3b210d7244ee139592d71732b39003c0d840e94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ide/src/graph.rs:625-633 | crates/mcp-server/src/graph_db.rs:585-599 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"4987153ab66f4a55168ecb7c3f960fc82b497fe84d68edbf1c6b006246aafbdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ide/src/symbol_info.rs:1569-1584 | crates/symbol-info/src/adapters/common_module.rs:21-35 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/symbol_info.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"64daa22e8616d6c26a88453caf623c3909f0acc71bdd730223e205cc9ba7687e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ide-diagnostics/src/handlers/deprecated_current_date.rs:50-60 | crates/ide-diagnostics/src/handlers/deprecated_find.rs:47-57 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deprecated_current_date.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9649a7e3cffc21fbb191aedcac5494e06423f1858a394c0335e140214a9443f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/bsl-check-executor/src/native_check/compiler.rs:1076-1080 | crates/bsl-check-executor/src/native_check/profile.rs:3621-3629 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/compiler.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f702c11867cfb74e83a63f100fce34c9cef581835c9455465d59e56f4065e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/bsl-platform/src/snapshot.rs:631-642 | crates/bsl-platform/src/snapshot.rs:644-654 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/snapshot.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bae58a02174f4209535cf57e7caf117558f693960c8cfdc0b6460875fcfd81f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/bsl-search/src/lifecycle.rs:573-580 | crates/bsl-search/src/lifecycle.rs:693-700 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/lifecycle.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6fb662e912147fd5a9f452bff56df0b3b45ffabe3f897b90c41d1b1a534a4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/ide-db/src/metadata.rs:1850-1859 | crates/ide-db/src/metadata.rs:1923-1932 | crates/ide-db/src/metadata.rs:1995-2007 | crates/ide-db/src/metadata.rs:2069-2078 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"510090947128bb9f1efa923b16f460f407306e1af4d7b26738ce18926717c5e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/bsl-platform/src/capability/mod.rs:39-51 | crates/bsl-platform/src/deprecation/mod.rs:27-39 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/capability/mod.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"055e3c5e82c2dddf7e5820493dd8788220ce044c678d1ebf6480f3cd0cf767cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/hir-def/src/resolver.rs:668-679 | crates/hir-def/src/resolver.rs:907-919 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/resolver.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f45893b2d228bd8285af8db486e0898c50e9e45b8e279baf1b5a792df313e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/hir-ty/src/infer.rs:896-910 | crates/hir-ty/src/infer.rs:930-943 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"700cd47e7c7b59f9abb472beae2dd907a30ffef4ad4883dc9a3c8a9768cbf2b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ide-diagnostics/src/body_context.rs:146-161 | crates/ide-diagnostics/src/body_context.rs:166-180 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/body_context.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87250dbb3455cc51620051f6310bc3ea9b54162c0d3228d68bdd67b0632c44f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs:878-889 | crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs:405-415 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"5876fa206b1bc3b5518683e6b2109bb4447974936607bf1b41768679270f17ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/hir-ty/src/query_text_dataflow.rs:201-210 | crates/hir-ty/src/structure_keys.rs:404-415 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/query_text_dataflow.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb9f7cb88e4cc72bc70c9319e741126a74f8b110aef97df70d17c0eb8802f1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 13\u002B corresponding lines): crates/ide-diagnostics/src/handlers/duplicate_alias_in_query.rs:26-41 | crates/ide-diagnostics/src/handlers/invalid_virtual_table_parameters.rs:26-40 | crates/ide-diagnostics/src/handlers/query_to_missing_metadata.rs:29-44 | crates/ide-diagnostics/src/handlers/unavailable_alias_in_query.rs:26-40 | crates/ide-diagnostics/src/handlers/unknown_field_in_query.rs:26-41 | crates/ide-diagnostics/src/handlers/unknown_query_function.rs:26-38 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicate_alias_in_query.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"971ca042cd5fd49b35bd1b855dd245351bebf09b7510f75ac32a9d434188cb05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/mcp-server/src/broker/name.rs:738-753 | crates/mcp-server/src/broker/name.rs:765-777 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/broker/name.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"89931d98240a77718d2dad54b83dfa96bcaa7a68de826c94daecdf5db619cd1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/parser/src/grammar/statements.rs:433-448 | crates/parser/src/grammar/statements.rs:450-465 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4e68b0fad38777c411a90984acf739fa45dab84ab82ff33ebfde256d3eb488"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/syntax/src/ast_utils.rs:475-487 | crates/syntax/src/ast_utils.rs:489-501 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/syntax/src/ast_utils.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"616612d6b4364677799c29aea3d63de842a1c7656991108a1998809f07a4cd7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/bsl-types/src/builders.rs:92-100 | crates/bsl-types/src/builders.rs:103-114 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/builders.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8cef7da5126fa13da6c5755b99c8f9bf8288492ddbda7243359d450083492d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 10\u002B corresponding lines): crates/ide-db/src/metadata.rs:1387-1396 | crates/ide-db/src/metadata.rs:1502-1512 | crates/ide-db/src/metadata.rs:1869-1878 | crates/ide-db/src/metadata.rs:1943-1952 | crates/ide-db/src/metadata.rs:2014-2023 | crates/ide-db/src/metadata.rs:2090-2099 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b3150d435afaa82b7d05940bc3989733e9829bde0056b1cbe85c4856814108"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/parser/src/grammar/sdbl/expressions.rs:326-341 | crates/parser/src/grammar/sdbl/expressions.rs:343-358 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9235d7a5500ae7d9cbfa354a4b220f4930a7a4e62d05714ed493ee75256b8a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/bsl-analyzer/src/reporters/codequality.rs:25-34 | crates/bsl-analyzer/src/reporters/sarif.rs:19-28 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/reporters/codequality.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c267e722019e319995a079446a5b8f86901a187a2ec043c46686ba0b2916cf10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/bsl-metadata/src/xml_parser/form.rs:153-161 | crates/bsl-metadata/src/xml_parser/form.rs:163-171 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/form.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13cfd2d82757be70c67ee70ae28af944d97def50ece86cf55aaddb18fd50adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/bsl-metadata/src/xml_parser/role.rs:109-123 | crates/bsl-metadata/src/xml_parser/subsystem.rs:66-83 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/role.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3365de3464e31ed7663b283f8cc0cbf4b9384f77f34dcea7e49efd3569356c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/bsl-search/src/embedder.rs:307-318 | crates/bsl-search/src/embedder.rs:581-592 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/embedder.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d4d13741d264771e5b5418f927c7091175885934a567f7bacdef17b9e309b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/hir-def/src/conditional_tree.rs:430-437 | crates/hir-def/src/region_tree.rs:357-364 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/conditional_tree.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bd2995acff220fe1f66bbad571c3384c7506e2e3080fec8ef97748b291ee64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/hir-def/src/preproc_condition.rs:358-366 | crates/hir-def/src/preproc_condition.rs:368-376 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/preproc_condition.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2b8310f47b2f52f60ae9ae63d66094f9ec2ac291d5979673d6d07480b1db31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/hir-ty/src/object_resolver.rs:248-260 | crates/hir-ty/src/object_resolver.rs:262-273 | crates/ide-db/src/provider.rs:76-88 | crates/ide-db/src/provider.rs:98-110 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/object_resolver.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08314c84ecdbd4ac873ff2fb6f88199b85976397eb1eb2a6ae691baeb613295"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/ide/src/diagnostics_baseline.rs:348-361 | crates/ide/src/partitioned_diagnostics_baseline.rs:1326-1338 | crates/ide/src/partitioned_diagnostics_baseline.rs:1343-1356 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/diagnostics_baseline.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9f21ad390d4316f69faf8253689bffe97f86bd77e75d149e951c7d066d7bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/bsl-check-executor/src/native_check/root_lock.rs:334-351 | crates/bsl-launcher/src/cache.rs:166-179 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/root_lock.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd3793919b970a2453862d6cc9e648fb588d6af372d5c32c22423f8e519366d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/syntax/src/ast.rs:60-73 | crates/syntax/src/ast.rs:124-137 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/syntax/src/ast.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c33993218807db213fa7fd7facd9a3495ea16ca5b4fb9cd5253fc1b5f341a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/bsl-platform/src/types.rs:77-81 | crates/bsl-platform/src/types.rs:122-126 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/types.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"780494e860c79355f82425bc060509f75fb782750c973529781fa191f8c99007"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ide-db/src/salsa_events.rs:82-91 | crates/ide-db/src/salsa_events.rs:93-100 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/salsa_events.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3125ec4c00bba85a653c856fa56e6f29ae6963b063d04f38e6f0185fcfdff5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ide-diagnostics/src/handlers/if_condition_complexity.rs:23-37 | crates/ide-diagnostics/src/handlers/nested_statements.rs:25-38 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/if_condition_complexity.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d81966fe700928a16d37a631b2f76cf337c71718d4d11478c994c034e3b300"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/bsl-analyzer/src/mem_report.rs:21-34 | crates/bsl-analyzer/src/mem_report.rs:39-52 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mem_report.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b229f9f1cace6c907113419aa62d578b9629d5037970893af932f342fae1da9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/bsl-metadata/src/http_service.rs:62-72 | crates/bsl-metadata/src/web_service.rs:56-62 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/http_service.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"280340df0b625fb8ebd32290488a4ca8b11037c2a2ddf0d863e65df9dae006a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/bsl-search/src/workspace_overlay.rs:403-417 | crates/bsl-search/src/workspace_overlay.rs:425-438 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10e501c5696b63995c2a8919b4ed5f5d6111197dbf6bdd219b8e3179b86b507"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs:221-238 | crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs:240-253 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cce0fbf4f0b09c47e59ec084353bbefe98962bdd6a08ba6f90b57436f424fe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/sdbl-hir/src/lower/diagnostics.rs:394-403 | crates/sdbl-hir/src/lower/diagnostics.rs:405-414 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"17686c1ae73ed0fafc32b6af96b88755380b76bec5c4505b68e3ddcf01927c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/hir-def/src/body.rs:274-282 | crates/hir-def/src/body.rs:284-292 | crates/hir-def/src/body.rs:294-302 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b7c33c03d27e1717f5305379035183865a03de9fcbaafda85909a101912112"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ide-host-core/src/workspace.rs:546-557 | crates/ide-host-core/src/workspace.rs:559-572 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/workspace.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b36fd5c49972f84b470242ea4d05104060d479d3b3764c02e1733fefbd8394"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/mcp-server/src/broker/name.rs:65-79 | crates/mcp-server/src/broker/name.rs:176-182 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/broker/name.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"06645176aaac8b92425df5efeec0ef3b66194665861ce788757ed02fabb1cf95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/mcp-server/src/tools/diagnostics.rs:358-371 | crates/mcp-server/src/tools/graph.rs:334-347 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"52544b57ecbe6a59500d6c620198fbd6531d66ace730c7347483683a535bfbf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/bsl-analyzer/src/reporters/sarif.rs:250-265 | crates/bsl-analyzer/src/reporters/sarif.rs:277-292 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/reporters/sarif.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"2354aad93e0bab9b418232b7ddd46ddaed11d0bfb7e700432f31a8729fc0ec33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/bsl-metadata/src/scoped_fs.rs:81-94 | crates/bsl-metadata/src/scoped_fs.rs:96-108 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/scoped_fs.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4128ea4b43fedc8cd608f03734e2b846da3cfc660432827b5f531001187f124c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/bsl-search/src/store.rs:2194-2213 | crates/bsl-search/src/store.rs:2477-2493 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5afa07ca8648dbc702016b3b401f4d4c69522297be756d3e51c3a23907884f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/mcp-server/src/broker/name.rs:423-431 | crates/mcp-server/src/broker/name.rs:491-498 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/broker/name.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ce4161981aa3f828780088bf4b50d6ff357874db2525c59fa2fbc74b148c4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/mcp-server/src/state/bootstrap.rs:1827-1845 | crates/mcp-server/src/state/bootstrap.rs:1847-1862 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"621d20c333e52e022d4e8517373a00ee139f0aa4258a00fb4bebbb0db723a2d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/parser/src/grammar.rs:447-458 | crates/parser/src/grammar.rs:460-471 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"442595f497342bddeb09c330a132a16152e55e40a76519f3de0714c7a8a44118"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/bsl-search/src/store.rs:4472-4483 | crates/bsl-search/src/store.rs:4488-4509 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":4472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4266503e997ffaa6d27e81ab1e2b59badbd62fc4e193a049f33fcc83cfa8c3eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/hir-def/src/workspace_index.rs:89-99 | crates/hir-def/src/workspace_index.rs:101-111 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/workspace_index.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a2e26d129e647ab1decd372b39ab4c39bb0487569b26acc9fbc73c4a2b6feb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/ide-db/src/provider.rs:143-158 | crates/ide-db/src/provider.rs:187-195 | crates/ide-db/src/provider.rs:216-231 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/provider.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa41a2791910e3b8a92b62cc60aa7b295a7328529d6d8cd17a4aac2bb2b3b66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/parser/src/parser.rs:667-681 | crates/parser/src/parser.rs:687-699 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/parser.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e574de2cd04289b056a0b4197cbc0e2c64f44731f8f46ebc0797b0aa495faed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/stdx/src/case.rs:100-110 | crates/syntax/src/ast_utils.rs:462-473 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/case.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b90ff6fdd7bde8f6a9e729a098a7966fc9b5f406d38e881478fbf8b700055a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/bsl-analyzer/src/mcp_install/adapters.rs:576-588 | crates/bsl-analyzer/src/mcp_install/adapters.rs:614-626 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mcp_install/adapters.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6e0e5e584e66e950cb60fe04273243d044810a04eb6babf98f91bd1afa4a0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/hir-ty/src/narrow.rs:402-411 | crates/hir-ty/src/narrow.rs:413-422 | crates/hir-ty/src/narrow.rs:428-437 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/narrow.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"08411448558228835bfa52d834822c441aa1b64193e90fb526a31d9b4ac261b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/mcp-server/src/broker/daemon.rs:792-803 | crates/mcp-server/src/broker/daemon.rs:846-858 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/broker/daemon.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f398a6c5e659d929d23d1f54325b0c27865e77ce021fb5b7ce5046455ceffd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/parser/src/lib.rs:45-54 | crates/parser/src/lib.rs:56-67 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/lib.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebcc0f07c9fb27725a56c642afc935d5eba945361f330b07d20c1a63a69c0cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/hir-def/src/body/lower/control_flow.rs:27-50 | crates/ide-diagnostics/src/handlers/code_block_before_sub.rs:100-120 | crates/ide-diagnostics/src/handlers/using_hardcode_network_address.rs:100-121 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/control_flow.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d03d24e94c0f612016ee1a543018c52866688eb684494c1b6885b9798661131"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/hir-def/src/preproc_condition.rs:195-210 | crates/hir-def/src/preproc_condition.rs:215-228 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/preproc_condition.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0da18f6c435c78ac18da65e0fd6219774280feb035c3eb18549aafea1d466b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/line-index/src/lib.rs:154-163 | crates/line-index/src/lib.rs:165-174 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/line-index/src/lib.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fa2a1bac88fa9b534e7b203022c443cc30ce540f9d12976e6b5f7d8066b506"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/bsl-search/src/embedder.rs:39-45 | crates/bsl-search/src/embedder.rs:60-66 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/embedder.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95f2c325080912aa18990a52430c9a2f2203ff23c046ca6a9e27ed9fb8b9978"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/hir-def/src/graph_index.rs:2433-2439 | crates/ide/src/graph.rs:2307-2313 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b424dfd5ee9908e6500f0794d91296bf68715129816581dd3dead6b80d79f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/mcp-server/src/diagnostics_state/resident.rs:711-718 | crates/mcp-server/src/diagnostics_state/session.rs:84-102 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/resident.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e0666bfbb1c5a7bebc0d1a58aa63aacc1364cbf58c45842c94249977953a5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/hir-def/src/name_usage_index.rs:129-137 | crates/hir-def/src/name_usage_index.rs:180-189 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/name_usage_index.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c8dc85d0d083375122794a07adf33650027af5d7f6ca35ecd5f61db2720b5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/hir-ty/src/infer.rs:128-141 | crates/hir-ty/src/infer.rs:143-155 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9bf414951023ff2463625bc96bc92242f625182d9bc81d0055fe7e4926cc30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ide-host-core/src/workspace.rs:190-204 | crates/ide-host-core/src/workspace.rs:206-213 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/workspace.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea16e6b8fd244690562cb9b4a3c29fb2a60b975735139dbf1fb49b6edf81f34d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/mcp-server/src/diagnostics_state/lifecycle.rs:600-610 | crates/mcp-server/src/diagnostics_state/lifecycle.rs:623-633 | crates/mcp-server/src/diagnostics_state/lifecycle.rs:637-647 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/lifecycle.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"527fb7b2151fe70c8c0ded06ef1e81d49c13c74124dd71b42d75232c52fbaabd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/mcp-server/src/tools/platform.rs:1494-1502 | crates/mcp-server/src/tools/platform.rs:1504-1513 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/platform.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3aa8534224cde4616ed66921dd9fbc51f797e53fbd73c9965953cbd2839c269"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/project-model/src/diagnostics_baseline_fs.rs:99-104 | crates/project-model/src/diagnostics_baseline_fs.rs:106-111 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/diagnostics_baseline_fs.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5bd4abc1f867c02864f484972307e3f8c96df556db70c500b6b74de729aa59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/hir-ty/src/doc_see.rs:387-397 | crates/hir-ty/src/lower/doc_structure.rs:187-199 | crates/hir-ty/src/lower/doc_structure.rs:202-211 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/doc_see.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"7231ec7f4c2878b6ad4ab41d45b17d819591d3c7f29440f719c348355481768e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/ide-db/src/metadata.rs:1522-1530 | crates/ide-db/src/metadata.rs:1618-1626 | crates/ide-db/src/metadata.rs:1708-1716 | crates/ide-db/src/metadata.rs:1798-1806 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba1906c36bcf2ac9463a3c2254349817561ce80cb44479f1254d4d74a94c5c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/ide-diagnostics/src/handlers/deprecated_method.rs:14-34 | crates/ide-diagnostics/src/handlers/temp_files_dir.rs:26-43 | crates/ide-diagnostics/src/handlers/using_modal_windows.rs:26-51 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deprecated_method.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d9433b42041c10affd5a2ee84c4a238009f45adae4bb41eca44ed5d81781b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/hir-def/src/resolver.rs:863-875 | crates/hir-def/src/resolver.rs:883-899 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/resolver.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b90fbee12595f1685c9b57d570e7d2c212baba2086de290dbc4a8111586c183"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs:833-844 | crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs:341-349 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd72b179d3733c610f4ede25e4248a72d71523d7c16e36c4891d15c807debf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/bsl-analyzer/src/bin/cli/logging/journal.rs:261-274 | crates/mcp-server/src/broker/name.rs:303-315 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/logging/journal.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"1975b5c6c96d0e01d718dc05ed9ce5eae9502c171a7e2d7f56556c84624a3214"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/bsl-metadata/src/vendor_support.rs:284-293 | crates/bsl-metadata/src/vendor_support.rs:295-304 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/vendor_support.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"85067bb8a4614fba746403dc3b1f292469f1a00e4ce1bfd4461f567ff165e08d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/bsl-search/src/engine.rs:5192-5204 | crates/bsl-search/src/engine.rs:5207-5216 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":5192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68b410a508c856f84f3edb0192b768ad64a25ede8b1af1a1e725f80d5018d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/bsl-search/src/external_baseline/postgres.rs:3358-3366 | crates/bsl-search/src/external_baseline/postgres.rs:3579-3590 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":3358}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9becd437a0ac647d87e2a08ae6de0c0b914288cc3fe870efbf6a3c8df209cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/ide-db/src/metadata.rs:1548-1555 | crates/ide-db/src/metadata.rs:1638-1645 | crates/ide-db/src/metadata.rs:1728-1735 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"332cd081598bb92a60c92faa6810a38b81bf1e853a1eca554064f526f8bb524f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ide-diagnostics/src/handlers/deprecated_platform_facts.rs:56-65 | crates/ide-diagnostics/src/handlers/deprecated_platform_facts.rs:70-80 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deprecated_platform_facts.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb378a2fb953592daa26c7e9c04f9200422c31173fe3610cbede26ff90a46df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/project-model/src/lib.rs:3014-3021 | crates/project-model/src/lib.rs:3029-3036 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":3014}}}],"partialFingerprints":{"codehealthFindingId/v1":"f748ad25dc921df2b2bcf46e9032f9d1228690a3524697dd567d296ae55b0493"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/bsl-debug/src/types/xml.rs:130-134 | crates/bsl-debug/src/types/xml.rs:136-142 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceac4d919ef070a07186db90e6470d07a36684eaec3de84dd48d3fcd89cf6bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/cfg/src/builder.rs:239-246 | crates/cfg/src/builder.rs:248-255 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cfg/src/builder.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4117470265d714fb3cee0978d1fd8eb5ac53aa94054c3fea61a5e1f424893cc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ide-db/src/salsa_provider.rs:387-394 | crates/ide-db/src/salsa_provider.rs:400-407 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/salsa_provider.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"48940feacbb524345ae052a86f5c440b5bc4a42e71f20b4bb45b9a2e30661576"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ide-diagnostics/src/handlers/disable_safe_mode.rs:24-33 | crates/ide-diagnostics/src/handlers/set_privileged_mode.rs:22-31 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/disable_safe_mode.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ee8aba6c819905cb72a7b99da028106145c87b3b6a1485c3035b1fa4adfc8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/bsl-search/src/store.rs:1520-1533 | crates/bsl-search/src/store.rs:4516-4532 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e59ceadfd96a1c7617e62b0f0fbdceef185e5bbde3e161e0d260b6248c61e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/hir-def/src/queries.rs:162-168 | crates/hir-def/src/symbol_tree.rs:293-299 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/queries.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ddea73e50047c9e1202406d2f8ad58408c4e659abb4ca011f0e5eeaba953dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/bsl-search/src/progress.rs:174-181 | crates/bsl-search/src/progress.rs:199-207 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/progress.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4033caca7b1a6defbb525cbc86c6cc65ca31fd26241c1d574225ac142789fba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/hir-def/src/docs.rs:836-847 | crates/hir-def/src/ty/doc_types.rs:292-298 | crates/hir-ty/src/lower/type_string.rs:160-167 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13ab5ea0d332918d3bc90c6fd151a113e83562201d460185c4325f757f36199"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/ide-diagnostics/src/handlers/deprecated_current_date.rs:62-70 | crates/ide-diagnostics/src/handlers/deprecated_find.rs:59-67 | crates/ide-diagnostics/src/handlers/deprecated_type_managed_form.rs:38-52 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deprecated_current_date.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0a95a1fd03d96e80254e88d4fe44e3eb5e7ce9708d08fe2f02d9cc1c3dc7bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ide-diagnostics/src/handlers/double_negatives.rs:85-101 | crates/ide-diagnostics/src/handlers/double_negatives.rs:103-119 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/double_negatives.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0be8051a150ad525c12107f5f241036a3ff11445338d8a9097247028c007b40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/ide-diagnostics/src/handlers/missing_code_try_catch_ex.rs:25-38 | crates/ide-diagnostics/src/handlers/number_of_values_in_structure_constructor.rs:24-37 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_code_try_catch_ex.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea92bd4e77b1e4d5757fcfae44df226f1320079bd954cedad255dd88c2e14450"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ide/src/completion/templates.rs:266-279 | crates/ide/src/completion/templates.rs:281-292 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/templates.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"f872e80333c17ba17a30bba17ef2ae9fc4723e87f803a8b40a62ba291f333c96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/syntax/src/ast.rs:1126-1135 | crates/syntax/src/ast.rs:1284-1293 | crates/syntax/src/ast.rs:1295-1305 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/syntax/src/ast.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb8e8c3d6d60b550461db38adbdd5dba1a08c7152d5fb272de06aabd5bc2727"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/bsl-search/src/engine.rs:6008-6020 | crates/bsl-search/src/engine.rs:6026-6036 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":6008}}}],"partialFingerprints":{"codehealthFindingId/v1":"870f878745f8eb5d97acf805d3e3ad9ededfc6a830cd6266c2988e5d0bc81dc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/hir-def/src/conditional_tree.rs:535-540 | crates/hir-def/src/region_tree.rs:392-397 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/conditional_tree.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"3976753fb4bd395b1f2a7cf33e109edcbb3c8ae6d0f9359a09aaafd28f675b5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/hir/src/definition.rs:118-126 | crates/hir/src/definition.rs:149-155 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir/src/definition.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4df60b8fec35c8cfa9ef954496fa85abb68313c9ee8e3d65ae4e8c35a5d48a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/ide-diagnostics/src/handlers/forbidden_metadata_name.rs:265-281 | crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs:22-39 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/forbidden_metadata_name.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"105283dcdb248d7fa6d40500accdad9716caddc2ed16d276919cbb69c5e64ef9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/parser/src/grammar/sdbl/expressions.rs:41-55 | crates/parser/src/grammar/sdbl/select.rs:516-529 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7e0489b7cb10a2bedf454cf64e595afa02f3421e5e497cf83bb6105702f4f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/base-db/src/queries.rs:255-262 | crates/ide/src/name_lookup.rs:364-369 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/base-db/src/queries.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"913a63bf7c0bd996e71ef9d9717c2a2f775bce206cfe914aa1b3d93149e44816"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/dataflow/src/lib.rs:29-35 | crates/ide-db/src/queries.rs:32-38 | crates/stdx/src/heap.rs:18-27 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/lib.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c445bd45ddd025c10e090a263ef040dc190d3120de112e4985151038cfb2b1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/hir-def/src/module_interface.rs:234-239 | crates/hir-def/src/symbol_tree.rs:202-207 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/module_interface.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"0769e7ab025017d01bfb73c69ff7dfcd6a1b6517d575fd1068e0e958bb9b8d78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ide-diagnostics/src/handlers/missing_temporary_file_deletion.rs:64-75 | crates/ide-diagnostics/src/handlers/missing_temp_storage_deletion.rs:24-33 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_temporary_file_deletion.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7704ba51a0fba28864f5455701d70b83157382381bae46ae61e339a9ff884b9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/mcp-server/src/graph/debt.rs:1827-1834 | crates/mcp-server/src/graph/debt.rs:1836-1845 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/debt.rs"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b175075f0867daec0a8edf9356de51983c64eb8fb239351ae8a162587144fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/hir-ty/src/method_lookup.rs:246-254 | crates/hir-ty/src/method_lookup.rs:259-267 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/method_lookup.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57f65a631237f1634ee16285bd69c14f00f1ef7a1d20522cfa6bd64d89a8e3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/hir-ty/src/field_enum.rs:185-198 | crates/hir-ty/src/field_lookup.rs:478-488 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/field_enum.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a1361786aa31f7cd4eeeb42bdda57262ec2ab6fb7d8a6e35e7f5e24df43b76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ide-diagnostics/src/handlers/unused_local_method.rs:395-409 | crates/ide-diagnostics/src/handlers/unused_parameters/remove_parameter.rs:209-215 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_method.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd13d7e8cc5d75750a3de1af0a643cd535899f9cbc7eba195e7cfdf4d1319830"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ide-diagnostics/src/runner.rs:148-159 | crates/ide-diagnostics/src/runner.rs:508-522 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/runner.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc33241c4e289322dab9b52595e71475a50216e49e694dda1d6500d6401418f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/stdx/src/case.rs:145-154 | crates/ide-diagnostics/src/handlers/invalid_character_in_file.rs:158-167 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/case.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1551a8a7dd641677a87545e12a084714d7f3c3817ef83a49deb2c611668684"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/hir-ty/src/field_enum.rs:601-610 | crates/sdbl-hir/src/lower/register_tables.rs:35-41 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/field_enum.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"6950df5663e38511c6728bf92b1f08e823627426b954672a949052bb64a5fc76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ide-diagnostics/src/handlers/canonical_spelling_keywords.rs:26-41 | crates/ide-diagnostics/src/utils/literal_context.rs:4-16 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/canonical_spelling_keywords.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fd4a56f1be2b4d05bbdc38ce48fe8d35559d51f8fd71e67262f1bad050d933"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs:66-85 | crates/ide-diagnostics/src/handlers/timeouts_in_external_resources.rs:85-95 | crates/ide-diagnostics/src/handlers/using_hardcode_network_address.rs:193-203 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17718445851111730ea9b8d73fff76ba6fac584e31f8fa68d50a1039e102965"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/syntax/src/comment_run.rs:236-242 | crates/sdbl-hir/src/lower/expr/mod.rs:729-734 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/syntax/src/comment_run.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"774209af832858b88aabb798c276492669ddc70519da56ebd6e95bb3481aad06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/bsl-analyzer/src/mcp_install/adapters.rs:850-860 | crates/bsl-analyzer/src/mcp_install/adapters.rs:867-875 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mcp_install/adapters.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab97897e7f2c1b4406613d84d1d50efa33342b9cd0112900d4e888fc8de02f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/bsl-launcher/src/cache.rs:57-61 | crates/bsl-search/src/vector_persist.rs:357-363 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-launcher/src/cache.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0360c9f9e68ebfc5f45b5024dfa6c577f4cd3b5d6f7abf9fba11a00b9275ad18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/bsl-search/src/store.rs:526-533 | crates/bsl-search/src/engine.rs:652-658 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dffc511fe80bf0221c43ca51554290145cb63a3bede41540cc3be1773d347b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/syntax/src/ast.rs:797-807 | crates/hir-def/src/body/lower/diagnostics.rs:488-493 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/syntax/src/ast.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5a8e7fa470a1616b210b8404957a894a1838d30cc4cde70739c2bd622c2c01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/hir-def/src/ty/doc_types.rs:303-308 | crates/hir-def/src/docs/type_expr.rs:244-248 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/ty/doc_types.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf81d858bfe54bde05b818bde0923a7d0452033cbb4e6d8599cac7c0ed0dc23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ide-diagnostics/src/handlers/structure_key_is_not_identifier.rs:144-149 | crates/hir-ty/src/lower/type_string.rs:148-154 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/structure_key_is_not_identifier.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78a2ebafe441f1288df2b931a4b182a668115a4ae6aa2ad5f8b4ec26d8cbc08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/base-db/src/queries.rs:158-161 | crates/ide-diagnostics/src/slab.rs:266-269 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/base-db/src/queries.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"930962d104468f90cf2e3cd5cc344cfc4cdcc7c285fd63d38fbd5a6cc475bc8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/hir-def/src/body/lower/query_fragment.rs:329-332 | crates/ide-diagnostics/src/handlers/query_to_missing_metadata.rs:242-245 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/query_fragment.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"015c2d6a1b4c6721c29a9e23031ae014a0fc9eeab4bcda563e02eadf88682be9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ide/src/completion/bsl_completion.rs:938-943 | crates/ide/src/completion/platform_completion.rs:687-692 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/bsl_completion.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39403f5e2b0fb3e3c715479256868e748769beabaaaf4fe08262db2df74f6b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ide-diagnostics/src/handlers/register_recorder_field_in_query.rs:25-37 | crates/ide-diagnostics/src/handlers/unlimited_length_string_usage_in_query.rs:26-38 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/register_recorder_field_in_query.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69375098ba890abf976e8195d0f74f36e95445da0ae41868d38bf1492f85ff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/mcp-server/src/tools/references.rs:1297-1301 | crates/mcp-server/src/tools/search/types.rs:231-235 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/references.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e7c8d35874adf8c7a9f4952dcc3214dd00ef564824d4982298cec747b94a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/bsl-metadata/src/dimension.rs:86-94 | crates/bsl-metadata/src/register.rs:81-89 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/dimension.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f2dd1ffa0e67ecc05e38ddc025f47170f05d728e2890927ccc63c990ca0448"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/ide/src/convert_method.rs:206-211 | crates/mcp-server/src/tools/diagnostics/snippet.rs:587-593 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/convert_method.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44ea185d12641e2115b663ea0ecf409793c56ceb41dfa15839ecc4a003f005f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/ide-diagnostics/src/handlers/read_only_property.rs:33-40 | crates/ide-diagnostics/src/handlers/unresolved_field.rs:27-34 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/read_only_property.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"04acf2afdb4a1c77d46e3c31dda02ec77d3d9caf64f83b099b16e40f481c3da4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/code-chunk/src/lib.rs:231-239 | crates/ide-diagnostics/src/sdbl_utils.rs:448-458 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/code-chunk/src/lib.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99ba94e220febf1b6e87b34f4ded95d81406e354d67484c453b6c2cd9f6ad99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/base-db/src/queries.rs:62-65 | crates/ide-db/src/metadata.rs:270-275 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/base-db/src/queries.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"20391689f99999745a7e93d4f746323d6c316b09eec7e5c190cc3c97b723f2ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/bsl-metadata/src/configuration.rs:850-853 | crates/ide-db/src/metadata.rs:256-259 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/configuration.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"916df1f10894727c5c67851d53a28af7d73037e0aa273b6511e1f887f7651e4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/ide-diagnostics/src/handlers/forbidden_metadata_name.rs:283-298 | crates/ide-diagnostics/src/handlers/metadata_object_name_length.rs:92-104 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/forbidden_metadata_name.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f690ef5f9f77b4e2f2e83d175d8ef7b429fb1b84151d88061343b04e6c55a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ide-diagnostics/src/handlers/redundant_access_to_object.rs:112-121 | crates/ide-diagnostics/src/lib.rs:93-105 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/redundant_access_to_object.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"621b3e5554b877740869a4ce22af7cb960109977479dd0f9126954ac5ae6a054"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): scripts/user2/choose-prefix.py:14-17 | scripts/user2/compare.py:15-18 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user2/choose-prefix.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1ae7119a59af077e2eea648b57e1ee619654a2be8f0f69f4f4dd3e5a95fd5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/ide-diagnostics/src/handlers/identical_expressions.rs:24-33 | crates/ide-diagnostics/src/handlers/internet_access.rs:27-35 | crates/ide-diagnostics/src/handlers/nested_constructors_in_structure_declaration.rs:22-30 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/identical_expressions.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e498d953aa317ccfcf5e68019c1f8413f4b46f5f8f3dd4794f4c0179782c1c03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/ide-diagnostics/src/handlers/internet_access.rs:41-50 | crates/ide-diagnostics/src/handlers/nested_ternary_operator.rs:75-84 | crates/ide-diagnostics/src/handlers/timeouts_in_external_resources.rs:234-243 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/internet_access.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3373479469514bf3318462d77667355c91d5adeebb3e35664e2b2aec58ec58ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/bsl-analyzer/src/handlers/workspace_batch.rs:115-121 | crates/bsl-analyzer/src/server.rs:708-713 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/workspace_batch.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdde639e0715ae27ed10f57a4cf17c6ea7cc7d7882de66138590183d614e4b29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/bsl-platform/src/capability/mod.rs:138-146 | crates/bsl-platform/src/deprecation/mod.rs:163-171 | crates/bsl-platform/src/security/mod.rs:130-138 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/capability/mod.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a86e2fd2546ba57409f01d13786ecc28a6a96351881b2857ef2accebcd97fa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/hir-ty/src/field_lookup.rs:466-471 | crates/ide/src/completion/mdo_completion.rs:332-338 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/field_lookup.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95d21a23d18b9d88a66a3d8362fae24b861e94c77fd929b528aac0cd2d31efa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/ide/src/graph.rs:1729-1732 | crates/ide/src/symbol_info.rs:1726-1730 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"273f0c158521839c75252e4628e960e3e45fac00b3bcc95d589913f965139525"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/ide/src/symbol_info.rs:1526-1528 | crates/symbol-info/src/presenters/hover.rs:101-103 | crates/symbol-info/src/presenters/signature_help.rs:151-153 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/symbol_info.rs"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ae3dd1ed6cc2319f8a6e808201323dff6194d7353a3180863feeb839889b25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/hir-def/src/module_interface.rs:229-232 | crates/hir-def/src/symbol_tree.rs:197-200 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/module_interface.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"40940e0d20e1b3c62975a02007d246a1c510b19d0b305083313268a776d406d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/hir-def/src/body/lower/diagnostics.rs:124-128 | crates/hir-def/src/body/lower/expr.rs:1213-1217 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/diagnostics.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"547ace74d86d7d0bc8dda312ec8a72ae2f93ce4eeee9e2afdf4482a4ad7b1929"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/ide/src/folding.rs:141-155 | crates/ide/src/formatting/ir.rs:316-327 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/folding.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4052442292769bc61070679bc7fe66165ca322b462dceeb683e84acc6d18d19c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/bsl-debug/src/module_index.rs:578-580 | crates/hir-ty/src/map_keys.rs:460-462 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/module_index.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"138c25c3e727f1198c5f00cb67092fae921bac8bd9db47c1332509fe5c38349d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/hir-def/src/call_hierarchy_index.rs:199-204 | crates/hir-def/src/graph_index.rs:2333-2338 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/call_hierarchy_index.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"57095c4dd3de028179b3c82e9a0c4b6243574155e6fa4028f6b8257ba0ce904a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/ide-diagnostics/src/handlers/calculation_register_virtual_table_without_recorder.rs:72-77 | crates/syntax/src/ast_utils.rs:447-451 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/calculation_register_virtual_table_without_recorder.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f0649a83c4b8944fc1b978190d00fd6f699711551a93e5c220622244ead5f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/mcp-server/src/diagnostics_state/drift.rs:26-30 | crates/mcp-server/src/diagnostics_state/lifecycle.rs:83-85 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/drift.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e054f53b7326f992f82f50ff7b64af6f3d1de0b568dbeaf261954642acdfe37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs:986-991 | crates/ide/src/partitioned_diagnostics_baseline.rs:975-979 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"db04ee603a04c5cfa99d40320a4df5e77fec61ba2f1f1a7e6c16402cc4afd278"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs:368-372 | crates/ide/src/partitioned_diagnostics_baseline.rs:1005-1010 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0b3f301b81075531c473b3e3d88b464524e72000bc0f57a7115afe0531215a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/bsl-metadata/src/form.rs:334-337 | crates/hir-ty/src/method_resolution.rs:452-456 | crates/hir-ty/src/proc_signature.rs:79-82 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/form.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9101561ff638b904d8b2f725bbac58048d4660eda980dc2b00804058b5dfdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/hir-def/src/graph_index.rs:74-79 | crates/vcs/src/author_filter.rs:386-390 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"776edc207413cf65e4b1a5e3fa494223c7df741ecde7edda60325a91b3a6ca36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/ide-diagnostics/src/handlers/typo.rs:367-371 | crates/ide-diagnostics/src/handlers/unused_parameters/remove_parameter.rs:189-191 | crates/ide/src/convert_method.rs:77-79 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/typo.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c1804ffdd2fad3a3fce162c61ce26da832384beaf0a8cbff0d853edf22fa7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/mcp-server/src/graph/content_hash.rs:144-149 | crates/mcp-server/src/tools/platform.rs:261-267 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/content_hash.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4eef21a498b2225273986d60b456c26f01fa63fce47aef85f753b7cd40cb89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/bsl-analyzer/src/bin/cli/rules.rs:269-271 | crates/bsl-analyzer/src/reporters/junit.rs:139-146 | crates/test-fixture/src/cfe.rs:286-293 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/rules.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efa115a8d5f9840f2250a5a8408f21b463b81a8cd79f8c0b08b3981620768cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2): crates/hir-def/src/graph_index.rs:2459-2517 | crates/ide/src/graph.rs:1744-1802 \u2014 before extracting anything, compare \u0060crates/hir-def/src/graph_index.rs\u0060 and \u0060crates/ide/src/graph.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/graph_index.rs:2459\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36e31a579f21a188e727797022b5666ccd463bf5a61487514f6d331beab9e33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): crates/hir-def/src/body/lower/utils.rs:89-140 | crates/ide-diagnostics/src/sdbl_utils.rs:505-556 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/sdbl_utils.rs:505\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/utils.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c47bf10dfade130cc02e0ef8dde1658ae824df8b25964f222330bd74640ebf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): crates/bsl-search/src/workspace_overlay.rs:993-1037 | crates/bsl-search/src/workspace_overlay.rs:1516-1560 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/workspace_overlay.rs:993\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"6164eaf8c845fcab1337b42dc5c1ab29265cdb16c03ee91242e4b08aba9897ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs:176-217 | crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs:89-130 \u2014 before extracting anything, compare \u0060crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs:176\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f719abc5ac764fcacc155719806af886301cb471705b93cd6cbd2e771047bf05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201341 lines \u00D7 2): crates/hir-def/src/graph_index.rs:501-539 | crates/hir-def/src/queries.rs:534-574 \u2014 before extracting anything, compare \u0060crates/hir-def/src/graph_index.rs\u0060 and \u0060crates/hir-def/src/queries.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/graph_index.rs:501\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32eb8f70efcb0cf4e5e969ac5106cc8e5941d184c7d3a4162f1189335871319"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/hir-def/src/body/lower/expr.rs:1795-1829 | crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs:279-313 \u2014 before extracting anything, compare \u0060crates/hir-def/src/body/lower/expr.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 115 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/body/lower/expr.rs:1795\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"076b6d78971fd02000c430909f9572e088e7e081d91e317b4561ade2f430a734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201334 lines \u00D7 2): crates/symbol-info/src/adapters/common_module.rs:52-85 | crates/symbol-info/src/adapters/manager_module.rs:32-61 \u2014 before extracting anything, compare \u0060crates/symbol-info/src/adapters/common_module.rs\u0060 and \u0060crates/symbol-info/src/adapters/manager_module.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/symbol-info/src/adapters/manager_module.rs:63\u0060 calls \u0060russian_plural\u0060, \u0060as_str\u0060 and \u0060crates/symbol-info/src/adapters/common_module.rs:87\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/symbol-info/src/adapters/common_module.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e3a427f1c448e07025d2c7a78deb96ce43dec27684fafbae43723645aeca3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201332 lines \u00D7 2): crates/bsl-search/src/workspace_overlay.rs:1570-1600 | crates/bsl-search/src/workspace_overlay.rs:1811-1842 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/workspace_overlay.rs:1570\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/bsl-search/src/workspace_overlay.rs:1601\u0060 calls \u0060remove_entry\u0060 and \u0060crates/bsl-search/src/workspace_overlay.rs:1843\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e7273dbc0b9f0866471146ca5babb50f355c70ab72e81e076b6e71dea2fd0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/bsl-search/src/external_baseline/postgres.rs:1916-1946 | crates/bsl-search/src/external_baseline/postgres.rs:1948-1978 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a26da9571e1bac45a9df950177ba0a2a5adcb4881e2c9cbf861cdd06d514485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/mcp-server/src/lib.rs:1746-1776 | crates/mcp-server/src/lib.rs:3237-3267 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/lib.rs:1746\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/mcp-server/src/lib.rs:1744\u0060 calls \u0060unwrap_or\u0060, \u0060min\u0060 and \u0060crates/mcp-server/src/lib.rs:3236\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"038b6d0802f7016f04f0e6fe96d8ab54b8a316f2c292221a44ab2eabd9818cf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/bsl-search/src/workspace_overlay.rs:1086-1115 | crates/bsl-search/src/workspace_overlay.rs:1637-1666 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc685dfd86eab2f7d8703f601957a216a33f7a9ed6412137ab0ee2ea526a926c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201330 lines \u00D7 2): crates/hir-def/src/graph_index.rs:408-433 | crates/hir-def/src/graph_index.rs:458-487 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/graph_index.rs:408\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"b959785b062f7c4906c6e0d79dd049c7c53078b675decb0e2b834127c4cd7c48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/bsl-analyzer/src/server.rs:2283-2311 | crates/bsl-analyzer/src/smoke.rs:477-505 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/server.rs:2283\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40bf9e2a6190bae5f4189d74e2cf25418185daf8e4ac34abb63e9b12b6534e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/mcp-server/src/diagnostics_state/drift.rs:932-960 | crates/mcp-server/src/diagnostics_state/drift.rs:1049-1077 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/diagnostics_state/drift.rs:932\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/drift.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75068afce238e4a60326f60dc880ac86ead508638991a66e41b64be3487c303"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): crates/bsl-search/src/store.rs:2691-2718 | crates/bsl-search/src/store.rs:3071-3097 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2691}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d6ef5d6e4fbd4ceac1d6e91a08f8b8cef1daecbd49f63a30157143d861535e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/ide/src/completion/mdo_completion.rs:158-184 | crates/ide/src/completion/mdo_completion.rs:204-230 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/completion/mdo_completion.rs:158\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/mdo_completion.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cfbae12c71449f3d78e367e8ff5028de30ec915e75d5d89665b11280be6e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/mcp-server/src/tools/search/lexical.rs:284-310 | crates/mcp-server/src/tools/search/semantic.rs:407-433 \u2014 before extracting anything, compare \u0060crates/mcp-server/src/tools/search/lexical.rs\u0060 and \u0060crates/mcp-server/src/tools/search/semantic.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/tools/search/lexical.rs:284\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3cd67952cb2cdbac4bcf0da5880d912358e8d39c6139b383f9189e1c58f500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/sdbl-hir/src/lower/mod.rs:110-135 | crates/sdbl-hir/src/lower/mod.rs:187-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sdbl-hir/src/lower/mod.rs:110\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e189f0f5aaf7eb53c3972e3f476fdb5b0de574bbe34e7c3883cdd9f1609f756"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/bsl-analyzer/src/mcp_install/adapters.rs:223-247 | crates/bsl-analyzer/src/mcp_install/adapters.rs:455-479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/mcp_install/adapters.rs:223\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mcp_install/adapters.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ad6e8eda751e4070206cf9aa48ef4dfa0f5b20861211681dfde0981efef208"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201330 lines \u00D7 2): crates/bsl-platform/src/overlays.rs:333-360 | crates/bsl-platform/src/overlays.rs:421-450 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/overlays.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"900ca9639e400947c7ff1c92c4d1bc67883136b7ee3bda4989a77a57318d34db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/mcp-server/src/lib.rs:1715-1739 | crates/mcp-server/src/lib.rs:3206-3230 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/mcp-server/src/lib.rs:1714\u0060 calls \u0060ensure_reference_loading\u0060 and \u0060crates/mcp-server/src/lib.rs:3205\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5031347cf59d42634a59044bbb103e7488fa5f1728cce6ecaeff0451d4683a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): crates/mcp-server/src/state/bootstrap.rs:2567-2590 | crates/mcp-server/src/state/bootstrap.rs:2672-2696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/state/bootstrap.rs:2567\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2567}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b729d83a08183e5faf66d819da015c1d580440ea92b17ac0e2921c19104bec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): crates/parser/src/grammar/sdbl/expressions.rs:649-672 | crates/parser/src/grammar/sdbl/expressions.rs:677-698 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/parser/src/grammar/sdbl/expressions.rs:649\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"b923379e53e5f845c29670f8c39dabaaa12222f70a3f3fd98ad4e4f2839407ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): crates/sdbl-hir/src/lower/clauses.rs:22-42 | crates/sdbl-hir/src/lower/clauses.rs:53-75 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sdbl-hir/src/lower/clauses.rs:22\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn lower_where_clause( \u0026mut\u0060 in one and \u0060super) fn lower_having_clause( \u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/sdbl-hir/src/lower/clauses.rs:20\u0060 calls \u0060report_or_in_where\u0060, \u0060syntax\u0060, \u0060children\u0060 and \u0060crates/sdbl-hir/src/lower/clauses.rs:53\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/clauses.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a4e468b3c407bc24ac39f40d99f5dcb6c51f577e580b51745110fd3cb1fd70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/bsl-check-executor/src/native_check/profile.rs:1884-1905 | crates/bsl-check-executor/src/native_check/profile.rs:1931-1952 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1aa695ceee377cf029deffc22a325023bbe0e97841b76de55231a3c2fe6cbd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): crates/bsl-search/src/workspace_overlay.rs:1872-1893 | crates/bsl-search/src/workspace_overlay.rs:2002-2021 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/workspace_overlay.rs:1872\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6a6ec87761c529290fc5ab941a4d02d44904620ce6ae2fe36ed9f82ff51875"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/ide/src/completion/bsl_completion.rs:950-971 | crates/ide/src/hover.rs:816-837 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/bsl_completion.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"5414bf335961e9ec17a623a85c835fb59b2338ca521a1f3ff2d91cc20e87c737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): crates/parser/src/grammar.rs:104-139 | crates/parser/src/grammar.rs:352-387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/parser/src/grammar.rs:104\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb6a655b6c5ea8f19e3c2151ba7b8276eec8646ab7d9f13b389e4a9b9a82b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs:301-321 | crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs:358-378 | crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs:409-429 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs:431\u0060 calls \u0060as_ref\u0060, \u0060as_str\u0060, \u0060unwrap_or\u0060 and \u0060crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs:380\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e264113037b8a48bd79dfb30bfd3e8babf75dfa1a2f59c33fdaa8c34de22e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/bsl-analyzer/src/mcp_install/adapters.rs:134-154 | crates/bsl-analyzer/src/mcp_install/adapters.rs:292-312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/mcp_install/adapters.rs:134\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mcp_install/adapters.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f010ac8472d4d997ac745a5ecb714c969735cb60dbcb8a362ef0dfe559e1fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201321 lines \u00D7 2): crates/hir-ty/src/platform_manager_lookup/record_resolution.rs:41-61 | crates/hir-ty/src/platform_manager_lookup/record_resolution.rs:91-107 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-ty/src/platform_manager_lookup/record_resolution.rs:41\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/platform_manager_lookup/record_resolution.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebec110ffc7e53a16828d9e16903c4e740a969915a94c94fc286d19344073d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ide-diagnostics/src/handlers/unused_local_method.rs:79-99 | crates/ide-diagnostics/src/handlers/unused_local_method.rs:102-122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/unused_local_method.rs:79\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_method.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a372fd2ef6bfafc3588c1b2deb1a132f3ad18e9326ae495b7c80e28f04161e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/ide/src/completion/sdbl/use_cases/complete_cast_fields.rs:55-75 | crates/ide/src/completion/sdbl/use_cases/complete_nested_fields.rs:47-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/completion/sdbl/use_cases/complete_cast_fields.rs:55\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/sdbl/use_cases/complete_cast_fields.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d10b1701bc2c226013f2e6b580ec9f70012dab17b2f7c2e3d6aa08df45ecb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/sdbl-hir/src/lower/expr/mod.rs:378-398 | crates/sdbl-hir/src/lower/expr/mod.rs:666-685 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sdbl-hir/src/lower/expr/mod.rs:666\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/expr/mod.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26f55b082535360731846f0ae6b3ba77f0d8fc52428b1307e89b3c9cab91cd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/bsl-debug/src/session.rs:559-578 | crates/bsl-debug/src/session.rs:586-605 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-debug/src/session.rs:559\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/session.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cc79669b583a41f06a0dcdde6b3302a49803703023b3eb302ad855d260b435"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/hir-ty/src/infer.rs:1509-1528 | crates/ide-diagnostics/src/hir_inference_dispatch.rs:114-133 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e53934cc2cb2486830068e9459e9dea95fee9d415cc7af13454585c3a098747"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/mcp-server/src/state/mod.rs:687-706 | crates/mcp-server/src/state/mod.rs:748-767 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/state/mod.rs:687\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/mod.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd547ea6d40338a490f0421eb6b8c2966e7de5eb2434c868eafc9152158ab485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201321 lines \u00D7 2): crates/sdbl-hir/src/lower/register_tables.rs:330-342 | crates/sdbl-hir/src/lower/register_tables.rs:457-477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sdbl-hir/src/lower/register_tables.rs:330\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/register_tables.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5ebd1baf1f52f47f13c29fd16f0a33be9704c860b67b1b3d4cfb2db603b17c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): crates/bsl-analyzer/src/handlers/request.rs:80-98 | crates/bsl-analyzer/src/handlers/request.rs:152-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"92820b21dcd06d5c853eb9e7842a83f893dc2476f75b6d62fb3bbeab27180863"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/bsl-check-executor/src/native_check/profile.rs:3247-3264 | crates/bsl-check-executor/src/native_check/profile.rs:3272-3290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":3247}}}],"partialFingerprints":{"codehealthFindingId/v1":"898c6e5feba8709528416298d205ba0da95c50a207a4059f3015b1e3ce0f2839"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/hir-def/src/body/lower/expr.rs:1740-1774 | crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs:220-254 \u2014 before extracting anything, compare \u0060crates/hir-def/src/body/lower/expr.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 115 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs:256\u0060 calls \u0060is_valid_placeholder\u0060, \u0060contains\u0060 and \u0060crates/hir-def/src/body/lower/expr.rs:1777\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b3551158213c005afba300dadc3a2fbba6a738fe789d3efc38be56e175478b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ide-diagnostics/src/handlers/forbidden_metadata_name.rs:193-211 | crates/ide-diagnostics/src/handlers/forbidden_metadata_name.rs:306-324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/forbidden_metadata_name.rs:193\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/forbidden_metadata_name.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efc1c6786d7d51b420b65bc39a7688f7251b9dc8a25dd81a33afed635f64aea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs:91-109 | crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs:32-50 \u2014 before extracting anything, compare \u0060crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs:91\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"084ecceb7c9cc6266dea5f9ca5bb6290f830536e17c7976c42d8ab3bcdf39822"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/ide-diagnostics/src/handlers/unused_local_method.rs:239-257 | crates/ide-diagnostics/src/handlers/unused_parameters.rs:75-91 \u2014 before extracting anything, compare \u0060crates/ide-diagnostics/src/handlers/unused_local_method.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/unused_parameters.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/unused_local_method.rs:239\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_method.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf267933c85d5b0a292193751821b20cd5e32c86e58f608e2a6582ff685e442a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/ide-diagnostics/src/handlers/weaving_annotation_not_applicable.rs:27-45 | crates/ide-diagnostics/src/handlers/weaving_signature_mismatch.rs:28-46 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/weaving_annotation_not_applicable.rs:27\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/weaving_annotation_not_applicable.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"992cb163ee37b234e6685d1ac825d8713b10d772c4d971ba2f2b028ab72eaa11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/mcp-server/src/state/bootstrap.rs:2091-2109 | crates/mcp-server/src/state/bootstrap.rs:2149-2167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/state/bootstrap.rs:2091\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"7263b69438e5662c9951089fb3c5cb2e69703590902c2c724c8b19feb2f45741"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): crates/mcp-server/src/tools/resident.rs:57-75 | crates/mcp-server/src/tools/resident.rs:168-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/resident.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa7830f20ae8faee9be919b727a8c8a01bd2c0c59f30821eb7098d27536c2fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 5): crates/stdx/src/fs.rs:80-97 | crates/stdx/src/fs.rs:125-142 | crates/stdx/src/fs.rs:170-187 | crates/stdx/src/fs.rs:223-240 | crates/stdx/src/fs.rs:281-298 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/stdx/src/fs.rs:80\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/stdx/src/fs.rs:76\u0060 calls \u0060is_some_and\u0060, \u0060load\u0060 and \u0060crates/stdx/src/fs.rs:124\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/fs.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64faddb04f08b9ee5b56d4026dc266f44703a7f2239133de816bec798a086cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): crates/bsl-search/src/store.rs:2705-2722 | crates/bsl-search/src/store.rs:2869-2885 | crates/bsl-search/src/store.rs:3085-3101 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:2705\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc64be9afc7d86ef49a6826bb76b39ba579e67f159e7c5c09cea0d38a3475cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/bsl-analyzer/src/diagnostics_baseline.rs:115-132 | crates/mcp-server/src/tools/diagnostics.rs:837-854 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/diagnostics_baseline.rs:115\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/diagnostics_baseline.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83007238336cd0e1ab312e3d53a5ed009a464f416a6f480f14a8f3f11c33cf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/bsl-debug/src/module_index.rs:178-195 | crates/bsl-debug/src/module_index.rs:240-257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-debug/src/module_index.rs:178\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/module_index.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0286be83d9475d00ce6441c130b555c51fb5aa1ce4afbd0856b4526e82ca2d2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/bsl-metadata/src/metadata_object.rs:859-876 | crates/bsl-metadata/src/metadata_object.rs:889-906 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/metadata_object.rs:859\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/metadata_object.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c74967e482e0e13fafc365bfef644c522fd74bb98e734af8b7b459cd8a95f28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/bsl-types/src/testing.rs:33-50 | crates/ide-db/src/type_kernel.rs:33-50 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/testing.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b10aff3d79d325f5110351500652473008f165804cf2cb4c348c607fd1cf559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/ide-db/src/database.rs:1329-1345 | crates/ide-db/src/database.rs:1391-1408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-db/src/database.rs:1329\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff18446f8c7698d723eb0b0fc5dbafa8b654b84e7bb11f1cd39d3d389c834e53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/mcp-server/src/state/bootstrap.rs:2073-2089 | crates/mcp-server/src/state/bootstrap.rs:2130-2147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/state/bootstrap.rs:2073\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c069ef6a80af7b2653888682238185791508c1c41240af1695492608158a8f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/bsl-analyzer/src/smoke.rs:587-603 | crates/bsl-analyzer/src/smoke.rs:715-731 | crates/bsl-analyzer/src/smoke.rs:772-788 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27980a47763e1c727550fcf79df6850fe5752264a7b7db603a61c3699d0c485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:716-732 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:735-751 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:754-770 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"934a229ae88a13ee761b40bb30ae376a061dfd31657b7e88cd7c81cbcfd99579"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/bsl-analyzer/src/bin/cli/rules.rs:159-175 | crates/ide/src/diagnostics_catalog.rs:137-153 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/bin/cli/rules.rs:159\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060tag\u0060 to \u0060\u0026ide::MetadataTag\u0060 in one and \u0060MetadataTag\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/rules.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d45e4b4305f43cfa2853be62ad78353fdf121169cf6fe8c61ab71326f227f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/bsl-check-executor/src/native_check/windows_acl.rs:38-54 | crates/mcp-server/src/cache_windows.rs:47-63 \u2014 before extracting anything, compare \u0060crates/bsl-check-executor/src/native_check/windows_acl.rs\u0060 and \u0060crates/mcp-server/src/cache_windows.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/windows_acl.rs:38\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/windows_acl.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e2d7773198b3c5c64e8dcb24204795fe61043d2bcf36ba7949fb1fbc3f7b54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/bsl-debug/src/session.rs:908-924 | crates/bsl-debug/src/session.rs:1024-1040 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-debug/src/session.rs:908\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/session.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa617dd25670ee2d658e0369753e88f26319d88fdf865cb7c69adf97a94f44d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): crates/bsl-metadata/src/loader.rs:782-798 | crates/bsl-metadata/src/loader.rs:877-889 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/loader.rs:782\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c1aeecd6679b40aa17998095d15770b08bbddee798c42d9349e89a339a999a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/bsl-search/src/store.rs:2010-2026 | crates/bsl-search/src/store.rs:2308-2324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:2010\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40bf550040c31b8a36ee2bd42d6b098dd2fcb0d300029d720cfc76fec13c899"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/bsl-search/src/store.rs:5189-5205 | crates/bsl-search/src/store.rs:5241-5257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:5189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":5189}}}],"partialFingerprints":{"codehealthFindingId/v1":"28069c8ab93df3526d67ab1ba09c2571caf9c2e96f0874b9f1e4abe1d861eb46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/hir-def/src/graph_index.rs:2226-2242 | crates/ide/src/graph.rs:3282-3298 \u2014 before extracting anything, compare \u0060crates/hir-def/src/graph_index.rs\u0060 and \u0060crates/ide/src/graph.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":2226}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9c6392819397131accc86029e59e6ae1e60c4d7cc9eb8d68cedd5ae8e6639f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs:85-101 | crates/ide-diagnostics/src/handlers/scheduled_job_handler.rs:95-111 \u2014 before extracting anything, compare \u0060crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/scheduled_job_handler.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs:85\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ide-diagnostics/src/handlers/scheduled_job_handler.rs:93\u0060 calls \u0060entry\u0060, \u0060clone\u0060, \u0060or_default\u0060 and \u0060crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs:83\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2446264d29f08342dfafac2bb67b306b365b8468957f7de6375d11d189d416ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/ide-diagnostics/src/handlers/unused_local_method.rs:202-218 | crates/ide-diagnostics/src/handlers/unused_parameters.rs:131-146 \u2014 before extracting anything, compare \u0060crates/ide-diagnostics/src/handlers/unused_local_method.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/unused_parameters.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/unused_local_method.rs:202\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_method.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4c9bf3bcc7da184f82f66f39fd7e57d4d1f21b4cffaa34d5165f6bad72543f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/mcp-server/src/diagnostics_state/resident.rs:946-962 | crates/mcp-server/src/diagnostics_state/resident.rs:1183-1196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/diagnostics_state/resident.rs:946\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/resident.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b2289cb9da5c61d75ea046514b69d394bb0bf56ab47acb5b4e563802af2ce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/mcp-server/src/tools/search/lexical.rs:258-274 | crates/mcp-server/src/tools/search/semantic.rs:381-397 \u2014 before extracting anything, compare \u0060crates/mcp-server/src/tools/search/lexical.rs\u0060 and \u0060crates/mcp-server/src/tools/search/semantic.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/tools/search/lexical.rs:258\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"838b21c897fa9761d77c642aa01c5fadb48c772bfda89ce9d16f83cb79ab860a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 3): crates/bsl-search/src/engine.rs:2228-2243 | crates/bsl-search/src/engine.rs:3342-3356 | crates/bsl-search/src/publish.rs:262-275 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2228}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4d7bac7b4e1050bdc519e042d9f09aac1078595dbd316df025b5d0b3377b78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): crates/bsl-search/src/store.rs:2422-2436 | crates/bsl-search/src/store.rs:2793-2808 | crates/bsl-search/src/store.rs:5279-5293 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:2422\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2422}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e400d8f01335bd8f7fe68de173ae2102315eba8734182891d1de875b7ad3bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/hir-def/src/body/lower/diagnostics.rs:224-239 | crates/hir-def/src/body/lower/diagnostics.rs:291-306 | crates/hir-def/src/body/lower/diagnostics.rs:374-389 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/diagnostics.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ed72304a137c8eb82cc82538e95bf05cd6c7f54d67177720c1eaf8e16e5a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/bsl-analyzer/src/bench/runner.rs:1431-1445 | crates/bsl-analyzer/src/handlers/dispatch.rs:468-483 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/bench/runner.rs:1431\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bench/runner.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cd3267ebc60efacfc0c4eca39feefc8141dc18b386368dfd092557ad2625cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/bsl-debug/src/dap/mod.rs:459-474 | crates/bsl-debug/src/dap/mod.rs:498-513 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-debug/src/dap/mod.rs:459\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/dap/mod.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"67efbc156d59f7cbe094331784e0602f7cfc4fdcaea5f9eb77fcd8bcceee457c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/bsl-debug/src/module_index.rs:345-360 | crates/bsl-debug/src/module_index.rs:447-462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-debug/src/module_index.rs:345\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/module_index.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eaed2f607aebc58e95f31981bc1ee80c532a692a4b6104102abe389e6baf121"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/bsl-debug/src/session.rs:512-527 | crates/bsl-debug/src/session.rs:540-553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-debug/src/session.rs:512\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/session.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7a355cfa58d0588c219cdd422c41bcdde4c9ac4a24647b5513cea120bc1a2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/bsl-platform/tools/html-parser/src/lib.rs:731-746 | crates/bsl-platform/tools/html-parser/src/lib.rs:792-807 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/lib.rs:731\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec6c0c4c955bd3f67cab42562ad0f42d4a3f7c70ea7d3bbc10d15c74a9ba895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/hir-def/src/conditional_tree.rs:337-352 | crates/hir-def/src/conditional_tree.rs:370-385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/conditional_tree.rs:337\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/conditional_tree.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"9902138d3409069eece6e9f3527227b9bca97b06fd7fa2e6f9eafc7b255d2185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/hir-def/src/graph_index.rs:245-260 | crates/hir-def/src/graph_index.rs:283-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/graph_index.rs:245\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0808789ea56b5ab61da3b9941906831c694f879c190d9043e16371dcd8327f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ide-diagnostics/src/handlers/at_client_at_server_form_method.rs:33-48 | crates/ide-diagnostics/src/handlers/server_side_export_form_method.rs:29-44 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/at_client_at_server_form_method.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f825400f5dfa25aa6f1bb5ca09d442a94298cadcd88447591c7b09e275567292"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/ide-diagnostics/src/handlers/metadata_object_name_length.rs:113-128 | crates/ide-diagnostics/src/handlers/metadata_object_name_length.rs:160-175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/metadata_object_name_length.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb9ba8e34cdb3529ffdac266ee9d3b8b6def8e546fce96c16506aebf5dd343c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201316 lines \u00D7 2): crates/ide-diagnostics/src/handlers/missing_form_event_handler.rs:39-54 | crates/ide-diagnostics/src/handlers/unbound_form_event_handler.rs:61-71 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/missing_form_event_handler.rs:39\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_form_event_handler.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3455707bfcbf4bdf1f85e8bde5ac699e6c8cb40a1a714b8759263be9e15968fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/ide-host-core/src/metadata.rs:206-221 | crates/ide-host-core/src/metadata.rs:514-527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-host-core/src/metadata.rs:206\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/metadata.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cbb48dee34e96eb33b816c51c769e2710fc3d80ce998858298e7bfccf77e1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/ide-host-core/src/metadata.rs:323-338 | crates/ide-host-core/src/metadata.rs:632-645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-host-core/src/metadata.rs:323\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/metadata.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e28bba7c2244fa3a50a452cdf698aa80b0783e519416d6c339608fe30afb845"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/mcp-server/src/lib.rs:1697-1712 | crates/mcp-server/src/lib.rs:3266-3281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/lib.rs:1697\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7efb60fbe9d21533e3daf632ed9413e16c765e6afc81f9797665f6f5e9480b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/mcp-server/src/tools/metadata.rs:314-329 | crates/mcp-server/src/tools/metadata.rs:1241-1254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"5288e70cd156456865eea2eade6e2a8cc8a30314be69dc232d2c398b9a365512"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/parser/src/grammar/sdbl/expressions.rs:104-116 | crates/parser/src/grammar/sdbl/select.rs:32-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/parser/src/grammar/sdbl/expressions.rs:104\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c397bda7e2260923059f4ad9dec7dbc17c7cc393e3d29f33f2cb1957972415c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/sdbl-hir/src/lower/expr/predicates.rs:104-119 | crates/sdbl-hir/src/lower/expr/predicates.rs:174-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sdbl-hir/src/lower/expr/predicates.rs:104\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn lower_in_expr(\u0026mut\u0060 in one and \u0060super) fn lower_in_hierarchy_expr(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/expr/predicates.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06185ed708eb2373418f284d69b5cf2f9436198fdf51a1614b3e0f160422ba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 4): crates/bsl-search/src/store.rs:2373-2385 | crates/bsl-search/src/store.rs:2705-2719 | crates/bsl-search/src/store.rs:2869-2882 | crates/bsl-search/src/store.rs:3085-3098 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:2373\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcfd84c6da9a1095901dfaab6327e22c6ed766ecefa9f233f07f2c7e505fcdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 4): crates/hir-ty/src/method_resolution.rs:42-55 | crates/hir-ty/src/method_resolution.rs:167-181 | crates/hir-ty/src/method_resolution.rs:194-208 | crates/hir-ty/src/method_resolution.rs:219-233 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-ty/src/method_resolution.rs:42\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d92d4db8466eedddc7bc1a93b923dbc0307e4320c5cb7ecd23daf08a8ac978a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/bsl-analyzer/src/mcp_install/adapters.rs:130-144 | crates/bsl-analyzer/src/mcp_install/adapters.rs:288-302 | crates/bsl-analyzer/src/mcp_install/adapters.rs:358-372 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/mcp_install/adapters.rs:130\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mcp_install/adapters.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbb6ef5a6cbec8e47d6eb9ac5f9bea6bb4092dbc14ee74dc44748b66ee5ec66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): crates/bsl-search/src/engine.rs:1613-1626 | crates/bsl-search/src/engine.rs:3103-3116 | crates/bsl-search/src/engine.rs:6520-6534 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:1613\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"2958c1698f65a844e2677cb221c7e8c48b5783e114f77409e6394fe1ee67b13a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs:389-403 | crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs:411-425 | crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs:433-447 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs:389\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e9816f90aede9310c085576efee9901d0cc0500e1abcdcd9ffae22280416e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs:206-220 | crates/ide-diagnostics/src/handlers/scheduled_job_handler.rs:324-338 | crates/ide-diagnostics/src/handlers/set_permissions_for_new_objects.rs:78-92 \u2014 before extracting anything, compare \u0060crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/scheduled_job_handler.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs:206\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de687b370d4ece01614a0b3bcc145011613751ef389055af67271ddacbdf574"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/bsl-check-executor/src/native_check/profile.rs:2522-2535 | crates/bsl-check-executor/src/native_check/profile.rs:2610-2624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/profile.rs:2522\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"df36f8d0a2d89c69b4145e2be679b658dc9a041874b1f3ead87dd895743c7792"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/bsl-metadata/src/metadata_object.rs:629-643 | crates/bsl-platform/src/standard_mdo_attributes.rs:67-81 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/metadata_object.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"636ec5b0dade6b725eccd12a92b52045246881517f04469538d240fdf20c6d1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/bsl-metadata/src/metadata_object.rs:659-673 | crates/bsl-platform/src/standard_mdo_attributes.rs:98-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/metadata_object.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbf76cc7a7c9b635fb37982263ae2c2b9b6dabd6429b12ff60b1991336e5479"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/bsl-search/src/external_baseline/postgres.rs:3827-3841 | crates/bsl-search/src/workspace_overlay.rs:2960-2974 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/external_baseline/postgres.rs:3827\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":3827}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4df4288c16a60a8892d9a457efc6e70363a78718add4c823f531ef53b75eaf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/bsl-search/src/store.rs:4572-4586 | crates/bsl-search/src/store.rs:4684-4697 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:4572\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":4572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9793327e0e63abd32e1558b0778bc2b1c51c188cf8e03f8ae09492d5f46169a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/bsl-search/src/workspace_overlay.rs:1401-1415 | crates/bsl-search/src/workspace_overlay.rs:2373-2387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c78d15c48f8d5413068ed9bb93dd07ad360096f42b0c03f00f30da92ad31c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/hir-ty/src/platform_manager_lookup/record_resolution.rs:23-37 | crates/hir-ty/src/platform_manager_lookup/record_resolution.rs:72-86 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/platform_manager_lookup/record_resolution.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff050052a39e0c79723294124bfe614c50cbeb87f7ef103903ad76199315cfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ide-db/src/database.rs:1385-1399 | crates/ide-db/src/database.rs:2272-2286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-db/src/database.rs:1385\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ide-db/src/database.rs:2287\u0060 calls \u0060Some\u0060 and \u0060crates/ide-db/src/database.rs:1400\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a323e2c3e52d55d72f1f156bf5f491bcf3c626e8cbfc1b404feda8bcf953273"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ide-db/src/database.rs:1758-1772 | crates/ide-db/src/database.rs:1904-1918 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-db/src/database.rs:1758\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c6ef6f778c73ad9d58cc4986f56e7a9e7ba6501861112058d8565eb302b85e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ide-diagnostics/src/handlers/metadata_object_name_length.rs:72-86 | crates/ide-diagnostics/src/handlers/metadata_object_name_length.rs:137-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/metadata_object_name_length.rs:72\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/metadata_object_name_length.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac4d34fce06ae9551b36c4769815e16fb3305c73ac27399bdfd4910360f0b1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ide/src/completion/sdbl/use_cases/complete_cast_fields.rs:109-123 | crates/ide/src/completion/sdbl/use_cases/complete_nested_fields.rs:70-84 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/sdbl/use_cases/complete_cast_fields.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3b64e57410bfa28da7b5f61c5572dc5833feeb4eecd4a584b31df9bd1fd4ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ide/src/lib.rs:340-354 | crates/ide/src/lib.rs:440-454 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/lib.rs:340\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/lib.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"57563205d78cf220e3e8c7344471955078988384b258daf74ad2e2a26078223b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/mcp-server/src/tools/platform.rs:1623-1637 | crates/mcp-server/src/tools/platform.rs:1723-1737 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/platform.rs"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8665a80b5f7645f2b6cea84630cf480cf87c04263a69d57ae7c89bb7e57f03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/mcp-server/src/tools/search/render.rs:674-688 | crates/mcp-server/src/tools/search/render.rs:719-733 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/tools/search/render.rs:674\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/render.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"334e68d585043654a2cdb8facd2138ed7d4b74e90e34094b97e2af2ec31ec493"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/mcp-server/src/workspace_lease.rs:698-712 | crates/mcp-server/src/workspace_lease.rs:842-856 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/workspace_lease.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce8729b9b10f81882cf0e83f2ede9b8a32c0c3534250f042426e00e44378316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 9): crates/bsl-analyzer/src/handlers/request.rs:53-66 | crates/bsl-analyzer/src/handlers/request.rs:130-143 | crates/bsl-analyzer/src/handlers/request.rs:187-200 | crates/bsl-analyzer/src/handlers/request.rs:234-247 | crates/bsl-analyzer/src/handlers/request.rs:282-295 | crates/bsl-analyzer/src/handlers/request.rs:359-372 | crates/bsl-analyzer/src/handlers/request.rs:798-811 | crates/bsl-analyzer/src/handlers/request.rs:956-969 | crates/bsl-analyzer/src/handlers/request.rs:1297-1310 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/handlers/request.rs:53\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f0aef98dd362cc1e1e3096d4df8f3b09fb810280429a850e70f1a8cef1489a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs:353-366 | crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs:394-407 | crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs:416-429 | crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs:438-451 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs:353\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"5051d5ee08fa851d6295b1605c329686f0571ab881c26d0bd2426928517f5141"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/bsl-metadata/src/loader.rs:1544-1557 | crates/bsl-metadata/src/loader.rs:1586-1599 | crates/bsl-metadata/src/loader.rs:1628-1641 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/loader.rs:1544\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85c8ceba6c816be07f2c7852de896e1f5f1d84d0265eb06de645641cee9a88a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/mcp-server/src/lib.rs:2867-2880 | crates/mcp-server/src/lib.rs:2956-2969 | crates/mcp-server/src/lib.rs:3053-3066 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/lib.rs:2867\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":2867}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c5942361634ef69044925bc8dd4ce8d487984746ded4bd82156c1df5fc1635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/bsl-analyzer/src/handlers/request.rs:2275-2288 | crates/bsl-analyzer/src/handlers/request.rs:2365-2378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0b87f2beaa3703b69158da155d0a240b75acf8e3b3ba6a500268b77c7bc89c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/bsl-check-executor/src/native_check/windows_acl.rs:57-69 | crates/mcp-server/src/cache_windows.rs:73-86 \u2014 before extracting anything, compare \u0060crates/bsl-check-executor/src/native_check/windows_acl.rs\u0060 and \u0060crates/mcp-server/src/cache_windows.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/windows_acl.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ed50534866b4351e0784828bfd0764f2fffb2f058aee2dacaa69cc0a085e81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/bsl-platform/tools/html-parser/src/lib.rs:660-673 | crates/bsl-platform/tools/html-parser/src/lib.rs:1013-1026 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/lib.rs:660\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f40d6179a54c9252b2f8728e1faca7af3d01dd3dc3717d1144234d0ebd13915"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:655-668 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:705-718 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:655\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"62adcb3eea18ae4316036e1ef427440aa0ac78cb1f06d494f24e11e15feade5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/bsl-search/src/engine.rs:577-590 | crates/bsl-search/src/engine.rs:1147-1160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:577\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffab78d46fcf85c66c8fa5930b02c48eb764a78e61ca247653191253944b628"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/bsl-search/src/engine.rs:1085-1098 | crates/bsl-search/src/engine.rs:1161-1174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:1085\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d659b099ffe3a6596efabf5d818cec955f2510a672776f31c3bfa32c25e9f13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/bsl-search/src/engine.rs:1936-1949 | crates/bsl-search/src/engine.rs:2268-2281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:1936\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1936}}}],"partialFingerprints":{"codehealthFindingId/v1":"39561ff101b7ea4f4140feedf399b2654aab61c81ad4b3d0b3e4bfc29c52e874"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/bsl-search/src/store.rs:2840-2853 | crates/bsl-search/src/store.rs:2941-2954 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2840}}}],"partialFingerprints":{"codehealthFindingId/v1":"8574f1a9161aac6a9c9d86d75ad9c4a2bc27f2b8f5aca195e15acec456f266c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/hir-def/src/body/lower/expr.rs:640-653 | crates/hir-def/src/body/lower/expr.rs:997-1010 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/body/lower/expr.rs:640\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66ae16371e41eb37997b99fde9599f5e91ef56507b1d68237c8a07ce72e0e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/hir-def/src/body/lower/expr.rs:1778-1791 | crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs:262-275 \u2014 before extracting anything, compare \u0060crates/hir-def/src/body/lower/expr.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 115 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/body/lower/expr.rs:1778\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"6553f44c2bb901b25d9377eda74d58ae0d1b046d3cea79670dc58753069eb0ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/hir-def/src/graph_index.rs:2633-2646 | crates/hir-def/src/graph_index.rs:2708-2721 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/graph_index.rs:2633\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":2633}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f05d89b0ec5e9c73c44ef8c47aba80d40d690a43fe28126db7e6146b5b19dc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/hir-def/src/graph_index.rs:2668-2681 | crates/hir-def/src/graph_index.rs:2688-2701 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/graph_index.rs:2668\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":2668}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d117d141524036de019c38d680d0579cb3df26650057b82655ea82c27930b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/ide-db/src/salsa_events.rs:168-181 | crates/ide-db/src/salsa_events.rs:227-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ide-db/src/salsa_events.rs:239\u0060 calls \u0060sort_by_key\u0060, \u0060Reverse\u0060, \u0060truncate\u0060 and \u0060crates/ide-db/src/salsa_events.rs:181\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/salsa_events.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0bb7c10efd48dc4b04eff18c0edce91bd0c6901ca28a1cda758ff9000bb81d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ide-diagnostics/src/handlers/deprecated_method_call.rs:70-83 | crates/ide-diagnostics/src/handlers/deprecated_method_call.rs:105-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/deprecated_method_call.rs:70\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ctx\u0060 to \u0060\u0026AnalysisContext) -\u003E (bool\u0060 in one and \u0060\u0026AnalysisContext\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deprecated_method_call.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3031b499d04f4533b6a1cd9f99c35df982d01b07119d2b887cccc6c20f66c0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:700-713 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:808-821 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:700\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7840956999d4e6c6ef02b0cf2486d1c6181fbcfa01563edae058289b22db65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs:147-160 | crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs:173-186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs:147\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e89bebc1e92b51eb499b943fbee6e5f2670f974163826181ed0d6e184f78e2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs:60-73 | crates/ide-diagnostics/src/handlers/scheduled_job_handler.rs:66-79 \u2014 before extracting anything, compare \u0060crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/scheduled_job_handler.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs:60\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d40f4714ae43c8afbab801df83f157eb02f030c7c7c663e20089f7d5c28111"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ide-diagnostics/src/handlers/posting_while_data_exchange_loading.rs:55-68 | crates/ide-diagnostics/src/handlers/structure_key_is_not_identifier.rs:82-95 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/posting_while_data_exchange_loading.rs:55\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/posting_while_data_exchange_loading.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef517b577862945c09e7d15736ae7f233abed533c3389817ebba3c3d0800ce4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/mcp-server/src/baseline.rs:2076-2089 | crates/mcp-server/src/tools/search/render.rs:775-788 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/baseline.rs"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0202a43648fe635f2a0335f25aa492eab20a66d067b4e207069505e9077eca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/mcp-server/src/state/bootstrap.rs:1593-1606 | crates/mcp-server/src/state/bootstrap.rs:1625-1638 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/state/bootstrap.rs:1593\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb54f117128f21f56748d2f2a4886f44dcc4e34627618742e5637eb54a50a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 7): crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:681-693 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:698-710 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:717-729 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:736-748 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:755-767 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:773-785 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:788-800 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:697\u0060 calls \u0060Some\u0060 and \u0060crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:788\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"63df16d5170f69d847a70e65ebee23df4d9cd7847e7522fb3524ccbcfa6bc19a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6): crates/bsl-metadata/src/loader.rs:1295-1307 | crates/bsl-metadata/src/loader.rs:1321-1333 | crates/bsl-metadata/src/loader.rs:1354-1366 | crates/bsl-metadata/src/loader.rs:1411-1423 | crates/bsl-metadata/src/loader.rs:1440-1452 | crates/bsl-metadata/src/loader.rs:1515-1527 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/loader.rs:1295\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"7458acc516ef3e85329b4ad8d6a5dfa28740677fd11269342c0c70f6bda9982c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 5): crates/bsl-analyzer/src/handlers/request.rs:727-734 | crates/bsl-analyzer/src/handlers/request.rs:1070-1082 | crates/bsl-analyzer/src/handlers/request.rs:1127-1139 | crates/bsl-analyzer/src/handlers/request.rs:1154-1161 | crates/bsl-analyzer/src/handlers/request.rs:1366-1376 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/handlers/request.rs:1070\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060InlayHintParams\u0060 in one and \u0060SemanticTokensParams\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/bsl-analyzer/src/handlers/request.rs:1067\u0060 calls \u0060now\u0060 and \u0060crates/bsl-analyzer/src/handlers/request.rs:1124\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"2489b8dc4872a93034b0b2407a06dc6a3386dea906c44fabbf325a010206f0b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:683-695 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:700-712 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:790-802 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:808-820 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:683\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:680\u0060 calls \u0060iter\u0060 and \u0060crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:786\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"a837d5dc41346b98650c3ca490983ecfd9624cf053eafd4ee6495d1438abc425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/bsl-search/src/external_baseline/postgres.rs:1928-1940 | crates/bsl-search/src/external_baseline/postgres.rs:1960-1972 | crates/bsl-search/src/external_baseline/postgres.rs:1997-2009 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/external_baseline/postgres.rs:1928\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":1928}}}],"partialFingerprints":{"codehealthFindingId/v1":"226ca20bc74012eb430dd1926f574b5d95b22df29f52f08fc43394574e665d0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/ide-host-core/src/metadata.rs:285-297 | crates/ide-host-core/src/metadata.rs:302-314 | crates/ide-host-core/src/metadata.rs:319-331 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/metadata.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1c186f65cfbe33331a3160c5c6fbea1139dcdc1c7a672f59503435df9d678a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/sdbl-hir/src/lower/clauses.rs:23-34 | crates/sdbl-hir/src/lower/clauses.rs:56-67 | crates/sdbl-hir/src/lower/clauses.rs:397-409 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/sdbl-hir/src/lower/clauses.rs:20\u0060 calls \u0060report_or_in_where\u0060, \u0060syntax\u0060 and \u0060crates/sdbl-hir/src/lower/clauses.rs:53\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/clauses.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b82fc268b5ff37a1c077d7046e0fe0b345784bf1c0a8b919cfa3376796f16ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs:124-136 | crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs:167-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe93e1cae96ee8cc89d8ee7623b9870c5d928f7aabffb8970c9dd4d1b119564f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/bsl-check-executor/src/native_check/windows_acl.rs:92-104 | crates/mcp-server/src/cache_windows.rs:147-159 \u2014 before extracting anything, compare \u0060crates/bsl-check-executor/src/native_check/windows_acl.rs\u0060 and \u0060crates/mcp-server/src/cache_windows.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/windows_acl.rs:92\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/windows_acl.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d482fcf1fea5aba8bde33850c589df9fba64e3b182d993d8716e959f8de05b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/bsl-search/src/engine.rs:1868-1880 | crates/bsl-search/src/engine.rs:1911-1923 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:1868\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed3e82620fbe40146c990c7320269279e13e50f5e3cfc5b58ecc74419a446c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/bsl-search/src/store.rs:4436-4448 | crates/bsl-search/src/store.rs:5334-5346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:4436\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":4436}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd66b3afd46eabea138646a36b4ee8334290dbb09ff43c59b95a53e4a0868d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/hir-def/src/body/lower/expr.rs:1978-1990 | crates/ide-diagnostics/src/utils/literal_context.rs:35-47 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060node\u0060 to \u0060\u0026SyntaxNode\u0060 in one and \u0060\u0026syntax::SyntaxNode\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1978}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5adda55def7e3973e28da48798e6d7a7b46130364eb3eee11bf845fe42593c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): crates/hir-def/src/graph_index.rs:837-845 | crates/hir-def/src/graph_index.rs:853-865 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/graph_index.rs:837\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"3baedab0c55553e58a68ee60d524c0a74be2010c90fa4958cf3d4a7f78b13ca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ide-db/src/effects.rs:292-304 | crates/ide-db/src/queries.rs:697-709 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-db/src/effects.rs:292\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/effects.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"30326a93d0062d61b6acb84101e8ef3eac30627972adb11ac69fdf11372fa0ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ide-diagnostics/src/handlers/deny_incomplete_values.rs:51-63 | crates/ide-diagnostics/src/handlers/wrong_web_service_handler.rs:79-91 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/deny_incomplete_values.rs:51\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deny_incomplete_values.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6ad8c511f931af81a62cd7cf35346005528090f490197ed68fc2749099d248"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ide-diagnostics/src/handlers/wrong_http_service_handler.rs:59-71 | crates/ide-diagnostics/src/handlers/wrong_web_service_handler.rs:57-69 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/wrong_http_service_handler.rs:59\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/wrong_http_service_handler.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0963bea4abb5de59d0e94ab454dd1c6b290c60f0a06f9f5ea4f10cc214f8b358"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201313 lines \u00D7 4): crates/bsl-analyzer/src/frozen_context.rs:38-41 | crates/ide-host-core/src/workspace.rs:363-375 | crates/ide-host-core/src/workspace.rs:388-400 | crates/ide-host-core/src/workspace.rs:438-441 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/frozen_context.rs:38\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060db\u0060 to \u0060\u0026ide::RootDatabaseImpl\u0060 in one and \u0060\u0026RootDatabaseImpl\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ide-host-core/src/workspace.rs:386\u0060 calls \u0060Some\u0060, \u0060try_source_root_input\u0060, \u0060root\u0060 and \u0060crates/ide-host-core/src/workspace.rs:438\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/frozen_context.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78f0934b1501114e0fa3a04da81ab52d2b8cdee231d042e6c54f5f271c020e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/ide/src/partitioned_diagnostics_baseline.rs:701-714 | crates/ide/src/partitioned_diagnostics_baseline.rs:1099-1112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/partitioned_diagnostics_baseline.rs:701\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f548e5fbde660280c503be2abdffb2b2fc3b6ea88f75b78367b2184a1a8052a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/mcp-server/src/broker/daemon.rs:726-738 | crates/mcp-server/src/broker/daemon.rs:744-755 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/broker/daemon.rs:726\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/mcp-server/src/broker/daemon.rs:723\u0060 calls \u0060socket_path\u0060, \u0060display\u0060, \u0060remove_file\u0060 and \u0060crates/mcp-server/src/broker/daemon.rs:740\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/broker/daemon.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbeccc664c40c9522a4824c5a006b056d4f6593965f2586c026b007fdfd68b85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/mcp-server/src/graph_db.rs:396-408 | crates/mcp-server/src/graph_db.rs:1519-1531 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/graph_db.rs:396\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/mcp-server/src/graph_db.rs:411\u0060 calls \u0060commit\u0060, \u0060context\u0060 and \u0060crates/mcp-server/src/graph_db.rs:1532\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"081b7bfd3753a7efd2ea3a14b732c5a28399681e7195b668034c3821a2a279be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/mcp-server/src/state/mod.rs:668-680 | crates/mcp-server/src/state/mod.rs:717-727 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/mod.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"e631df6a72230d65ef47bdb60415315ae22f4eb0fde6476792b04e16716c968a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/naparnik/src/http_client.rs:117-129 | crates/naparnik/src/http_client.rs:215-227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/naparnik/src/http_client.rs:117\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/naparnik/src/http_client.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aad660ddadfcb120b3c48024500a26e6a31d91402dde5b1dc97118efac873ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/parser/src/grammar/sdbl/expressions.rs:609-620 | crates/parser/src/grammar/sdbl/expressions.rs:887-899 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/parser/src/grammar/sdbl/expressions.rs:887\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/parser/src/grammar/sdbl/expressions.rs:605\u0060 calls \u0060at_property_name\u0060 and \u0060crates/parser/src/grammar/sdbl/expressions.rs:880\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a49540f0b9099916be5b50a47c43dc351f2715274f4ce0f282bf209df90ae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/sdbl-hir/src/context_detector.rs:528-539 | crates/sdbl-hir/src/context_detector.rs:545-557 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/context_detector.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c982d740bffd7b060177de8f28b84dd2143c5ef888aba5526b3881273d68b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/sdbl-hir/src/lower/from_clause.rs:965-977 | crates/sdbl-hir/src/lower/from_clause.rs:991-1003 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sdbl-hir/src/lower/from_clause.rs:965\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0297117feda2be1b51da6236ba4c254527fcebfa576ba6558ac05d38c49dddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 9): crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:667-678 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:683-694 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:700-711 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:719-730 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:738-749 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:757-768 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:775-786 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:790-801 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:808-819 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:680\u0060 calls \u0060iter\u0060 and \u0060crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:788\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9bac7c656d66bca028c1c54aac8741fed32b0648020c83942cff0ce4264e17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 7): crates/bsl-metadata/src/loader.rs:1294-1305 | crates/bsl-metadata/src/loader.rs:1320-1331 | crates/bsl-metadata/src/loader.rs:1353-1364 | crates/bsl-metadata/src/loader.rs:1410-1421 | crates/bsl-metadata/src/loader.rs:1439-1450 | crates/bsl-metadata/src/loader.rs:1465-1476 | crates/bsl-metadata/src/loader.rs:1514-1525 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/loader.rs:1294\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d88e06d75c7524d82d591647d945e75eda30941423bb35025a13652f7514b15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 6): crates/ide-diagnostics/src/handlers/deny_incomplete_values.rs:48-58 | crates/ide-diagnostics/src/handlers/wrong_data_path_for_form_elements.rs:53-63 | crates/ide-diagnostics/src/handlers/wrong_http_service_handler.rs:56-66 | crates/ide-diagnostics/src/handlers/wrong_http_service_handler.rs:78-89 | crates/ide-diagnostics/src/handlers/wrong_web_service_handler.rs:53-64 | crates/ide-diagnostics/src/handlers/wrong_web_service_handler.rs:75-86 \u2014 there are 6 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/wrong_http_service_handler.rs:78\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deny_incomplete_values.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f6918a7796eae05ef1e2b0a64f7cff2cb7379ed635ff77d5d619195788aafd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/bsl-metadata/src/loader.rs:1543-1554 | crates/bsl-metadata/src/loader.rs:1585-1596 | crates/bsl-metadata/src/loader.rs:1627-1638 | crates/bsl-metadata/src/loader.rs:1658-1669 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/loader.rs:1543\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1cbc096ec8d67e97a832fa613c6fcba2ad931b9f34b27d56758aa0214bdd0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/hir-def/src/conditional_tree.rs:95-106 | crates/hir-def/src/conditional_tree.rs:113-124 | crates/hir-def/src/region_tree.rs:87-98 | crates/hir-def/src/region_tree.rs:105-116 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/conditional_tree.rs:95\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/conditional_tree.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5eddc2de4fe6fddc3bb3179bf04ec9d4633d7346ee5aa363275f7c9fea1018d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/bsl-check-executor/src/native_check/source.rs:24-37 | crates/bsl-check-executor/src/native_check/source.rs:69-82 | crates/bsl-check-executor/src/native_check/source.rs:122-135 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/source.rs:24\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea8956c1a891e7d2721e2714fbb745f7278ac7c8dea003f9168a90f5e7d2b91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/bsl-check-executor/src/native_check/source.rs:53-64 | crates/bsl-check-executor/src/native_check/source.rs:97-108 | crates/bsl-check-executor/src/native_check/source.rs:151-162 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/source.rs:53\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6365c961775a673bc9d3d6d14b6d26a7c6c77b20073d4ddec1b05bee702d007d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/ide-diagnostics/src/common_module_helpers.rs:59-70 | crates/ide-diagnostics/src/handlers/common_module_invalid_type.rs:27-38 | crates/ide-diagnostics/src/handlers/common_module_name_words.rs:31-42 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/common_module_helpers.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8685a111e3e5b34afcfd4e03fc11f74159d3363ad909a3359ab600ae2e14ffac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/ide-host-core/src/metadata.rs:595-606 | crates/ide-host-core/src/metadata.rs:611-622 | crates/ide-host-core/src/metadata.rs:627-638 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/metadata.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbfb5fc9f1b7e98d153495b1ddac4203b14bd59436b7919d908eafdded70157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/symbol-info/src/adapters/common_module.rs:70-81 | crates/symbol-info/src/adapters/local_method.rs:36-47 | crates/symbol-info/src/adapters/manager_module.rs:46-57 \u2014 before extracting anything, compare \u0060crates/symbol-info/src/adapters/common_module.rs\u0060 and \u0060crates/symbol-info/src/adapters/manager_module.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/symbol-info/src/adapters/common_module.rs:70\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/symbol-info/src/adapters/common_module.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"40701c70f008d2d3631dd5d7494c8875447e8c700173051b0664323b7de7d7f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/syntax/src/sdbl_query.rs:218-229 | crates/syntax/src/sdbl_query.rs:239-250 | crates/syntax/src/sdbl_query.rs:270-281 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/syntax/src/sdbl_query.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec76ad14ae2b225f31a6e32ce3c1e76af2b2bae121fab09bac0917b973bffb2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/bsl-analyzer/src/handlers/request.rs:182-191 | crates/bsl-analyzer/src/handlers/request.rs:1007-1018 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/handlers/request.rs:1007\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060ReferenceParams\u0060 in one and \u0060CompletionParams\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71fea0aae00611d804e21ebf470acf9d861803edba35afbae96aa41fc53b278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/bsl-check-executor/src/native_check/profile.rs:3426-3437 | crates/bsl-check-executor/src/native_check/profile.rs:3449-3460 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/profile.rs:3426\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":3426}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc965d0c93dfecc859b12ea665be40b0489e4a043a395663624b6e835e2f622"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/bsl-launcher/src/use_cases.rs:359-373 | crates/bsl-launcher/src/use_cases.rs:449-463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-launcher/src/use_cases.rs:359\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-launcher/src/use_cases.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ccbe868d726194cc6458b62b03ada58ede246e2d02c29775b06cbd9557c546"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/bsl-metadata/src/form.rs:447-458 | crates/bsl-metadata/src/tabular_section.rs:94-105 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/form.rs:447\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060overlay\u0060 to \u0060\u0026Form\u0060 in one and \u0060\u0026TabularSection\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/bsl-metadata/src/tabular_section.rs:90\u0060 calls \u0060take\u0060 and \u0060crates/bsl-metadata/src/form.rs:445\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/form.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c8e73eef83c3509674cd2c23d31ebd4c267acd8aa83806e24064bd1b00aada"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/bsl-search/src/engine.rs:2419-2430 | crates/bsl-search/src/workspace_overlay.rs:2636-2647 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:2419\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2419}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac76f31ac48566048bf28d9217c7c75075c16c8f2077ba2f33f594e57678b90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/bsl-search/src/engine.rs:3167-3178 | crates/bsl-search/src/engine.rs:3223-3236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:3167\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":3167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05d44134301996394b64c46e0c8b67354e22581cb807594a4badbe4dcba96ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/bsl-search/src/engine.rs:4645-4656 | crates/bsl-search/src/engine.rs:4702-4713 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:4645\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":4645}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b88a7dc3f6a3c88215bac230e6c92fbb36dda2dda12eccba94ce8afc6dab03c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/bsl-search/src/engine.rs:6189-6202 | crates/bsl-search/src/engine.rs:6287-6298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":6189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0be6c3ed0a39a1d9cc76d857932f18a97232b2c8c6c9af2ad432ded3c4edd7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/bsl-search/src/external_baseline/postgres.rs:4143-4154 | crates/bsl-search/src/external_baseline/postgres.rs:4244-4255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/external_baseline/postgres.rs:4143\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":4143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f206eb1b78af6731e149213b4af5d6a49285f3c76849c8149ce8ff7f3deb358"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/bsl-search/src/store.rs:803-814 | crates/bsl-search/src/store.rs:1055-1066 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:803\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6fd739032d3ad5a89dfe5af79a9eeb70e82bf77f679dcc062b469e330c341a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dataflow/src/lib.rs:210-221 | crates/dataflow/src/lib.rs:324-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dataflow/src/lib.rs:210\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/lib.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5eff81e6d81ed05f4180ea4b735b87192d8eaa2e40a7122ae6fdc797358ac3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/hir-def/src/body/lower/expr.rs:1725-1737 | crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs:205-217 \u2014 before extracting anything, compare \u0060crates/hir-def/src/body/lower/expr.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 115 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabb3da7f778cf550c341cecd760e6668fe5e41164f4a297e04c61f0f8915356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/hir-def/src/graph_index.rs:786-795 | crates/hir-def/src/queries.rs:1206-1217 \u2014 before extracting anything, compare \u0060crates/hir-def/src/graph_index.rs\u0060 and \u0060crates/hir-def/src/queries.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/graph_index.rs:786\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2c8767f3fd91530329fd398db53551f34adcc5e4eef3d89b9bb467b09e7804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/hir-def/src/metrics.rs:177-187 | crates/hir-def/src/metrics.rs:211-222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/metrics.rs:177\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/metrics.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14436852884ef2cb2da064ed9cf46d778ef8748600bc4ad8bd3efe57ca69d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/hir-def/src/scope.rs:93-104 | crates/hir-def/src/scope.rs:107-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/scope.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"96edbce24ce9eb723cb79e689ca4fab1ef1d3ec2424fa26713a3f586a7e34332"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:299-310 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:314-324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"364c0657e7f3b55508adebce02f16bffa631e1a3ad5eb13139eeb7c51b491734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ide-diagnostics/src/sdbl_utils.rs:355-366 | crates/ide-diagnostics/src/sdbl_utils.rs:368-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/sdbl_utils.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cfee1649c4484a0fd91a36d1c224222015b56e307b26ad24955f71401e7902"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/ide-host-core/src/metadata.rs:289-300 | crates/ide-host-core/src/metadata.rs:600-609 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-host-core/src/metadata.rs:289\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/metadata.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bf669e99494dddc1b438e395911483f1b87d7ca5a38bbb4fced6e9840451f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/ide-host-core/src/metadata.rs:306-317 | crates/ide-host-core/src/metadata.rs:616-625 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-host-core/src/metadata.rs:306\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/metadata.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1110906c9d4925594d9e58e6a161498676faf5aae5c3960bc52a4b591cd46f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ide/src/completion/bsl_completion.rs:790-802 | crates/ide/src/completion/bsl_completion.rs:830-841 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/completion/bsl_completion.rs:790\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/bsl_completion.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0dcadcae4774c8ac116c88fdebb8007e48685716fea9bb50b6a743d59d60a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/mcp-server/src/broker/name.rs:739-750 | crates/mcp-server/src/broker/name.rs:766-774 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/broker/name.rs:739\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060key\u0060 to \u0060\u0026BackendKey\u0060 in one and \u0060\u0026SharedBackendKey\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/broker/name.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"f083e17674770837d25eb449b415a376d3836d5b163a7020f302d504b02544fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mcp-server/src/diagnostics_state/drift.rs:969-980 | crates/mcp-server/src/diagnostics_state/drift.rs:1103-1114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/diagnostics_state/drift.rs:969\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/drift.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d03784a3884607f886c5858e7c4d5c3704d24a71665f78909c0f1fd08ca285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mcp-server/src/state/bootstrap.rs:1759-1770 | crates/mcp-server/src/state/bootstrap.rs:1775-1786 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a85d20be4367156285e17a24d74f2a1aa347bd78b065a9ae3d8881d697b07b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/parser/src/grammar/statements.rs:434-445 | crates/parser/src/grammar/statements.rs:451-462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"32641545aaaa0ffe34230d8a52677e4003478e01fd07dc99b6ab2b5b844bc876"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/symbol-info/src/adapters/global_function.rs:20-31 | crates/symbol-info/src/adapters/platform_method.rs:23-34 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060docs\u0060 to \u0060Option\u003C\u0026MethodDocs\u003E\u0060 in one and \u0060Option\u003C\u0026bsl_platform::MethodDocs\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/symbol-info/src/adapters/global_function.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe68f9491e273e9c26f370f9c612613890478de1fbf7ce20d674c3683594136"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:107-117 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:486-496 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:1508-1518 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:107\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d9beb87a6b3733e89ddca3a8978fc5aa0bcc3dada99ca9bad6ecba646c31dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/hir-def/src/body/lower/expr.rs:636-646 | crates/hir-def/src/body/lower/expr.rs:993-1003 | crates/hir-def/src/body/lower/expr.rs:1026-1035 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f07428e3c7148cff9b52c167e1febe6faf0563d0a7e8c04610946d27f873497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/hir-def/src/body/lower/utils.rs:90-100 | crates/ide-diagnostics/src/sdbl_utils.rs:506-516 | crates/syntax/src/sdbl_query.rs:205-215 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/body/lower/utils.rs:90\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/utils.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"83876f901ec92fb5083bb3db20bb0313183b56d71df7d0e5cd200ad51b091ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ide-db/src/database.rs:2492-2502 | crates/ide-db/src/database.rs:2516-2526 | crates/ide-db/src/database.rs:2542-2552 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-db/src/database.rs:2492\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"4055c50e6884eb858bcb9db7ba55344dee04c36fe2899b5a1d830af06ef6d623"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/bsl-analyzer/src/bin/cli/search_baseline/documents.rs:98-108 | crates/mcp-server/src/project.rs:107-117 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/search_baseline/documents.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2f849c0829f4bfb99f18ccb79d7a630bdf6e7eb0d0f344b1bd7c3b71a87dcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/bsl-analyzer/src/handlers/request.rs:445-455 | crates/bsl-analyzer/src/handlers/request.rs:652-662 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060CallHierarchyIncomingCallsParams\u0060 in one and \u0060CallHierarchyOutgoingCallsParams\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/bsl-analyzer/src/handlers/request.rs:650\u0060 calls \u0060entered\u0060 and \u0060crates/bsl-analyzer/src/handlers/request.rs:444\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"645ebf0d3514dfa16ee8a0e62a35fdec05744611271b98b70d9907a698bf16be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/bsl-check-executor/src/native_check/profile.rs:249-259 | crates/bsl-check-executor/src/native_check/profile.rs:2880-2890 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b296300d35a51a601462d59672ccc52968f316fc7cbccdd26b9a5bace38bc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/bsl-check-executor/src/native_check/profile.rs:1001-1011 | crates/bsl-check-executor/src/native_check/profile.rs:1052-1062 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/profile.rs:1001\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"553e7ec3440e882d5f808bb321efbe32d6e28126d50aac3988434d93febef450"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/bsl-check-executor/src/native_check/windows_acl.rs:120-130 | crates/mcp-server/src/cache_windows.rs:181-191 \u2014 before extracting anything, compare \u0060crates/bsl-check-executor/src/native_check/windows_acl.rs\u0060 and \u0060crates/mcp-server/src/cache_windows.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/bsl-check-executor/src/native_check/windows_acl.rs:132\u0060 calls \u0060get_current_user_sid\u0060, \u0060map_err\u0060, \u0060last_os_error\u0060 and \u0060crates/mcp-server/src/cache_windows.rs:192\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/windows_acl.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5471557715c57afc50f0568efb4ae3faa79abae834b315a65a42572233c38eed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/bsl-platform/tools/html-parser/src/lib.rs:648-658 | crates/bsl-platform/tools/html-parser/src/lib.rs:1000-1010 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/lib.rs:648\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe56ebcb5e5a6671a7142c547a1ef48a601418a8569734b3a8ebe8f78bfda0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:326-336 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:589-598 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:326\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13522b6095408da9e60caa3591382b34cd1afae2c9dfa4e120c1a036f055e32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/bsl-search/src/engine.rs:635-645 | crates/bsl-search/src/engine.rs:1181-1191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:635\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"d334055e963aa6ab88827c6075f0afe06bebef1094fb20b2c724ebe016b65232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/bsl-search/src/external_baseline/postgres.rs:3991-4001 | crates/bsl-search/src/external_baseline/postgres.rs:4094-4104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/external_baseline/postgres.rs:3991\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":3991}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4f42c9cae8e0052f1fc81b733ee21819f816a2d87181ec987d5c283424b5c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): crates/bsl-search/src/store.rs:2066-2073 | crates/bsl-search/src/store.rs:4934-4944 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1151739e83c41c9cbddf5b42104b3b4f5b8a7a8e38e0f71d47d9dd34e3be49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/bsl-search/src/store.rs:2885-2895 | crates/bsl-search/src/store.rs:2995-3004 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:2885\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2885}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae63aea53a6ba9f1b9cfe0fdcd0cdbba504ed56603660368d4c0659ec21b06f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/hir-def/src/docs.rs:295-305 | crates/hir-def/src/docs.rs:310-320 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/docs.rs:295\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"2421820581205da9fee78e63d10787a6a26b1029f93e677412249822aee75f74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/hir-def/src/docs.rs:720-730 | crates/hir-def/src/docs.rs:872-882 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/docs.rs:720\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e423ea91fbb020784e00a0274ee15868fa0a13a32df8e586671897ba228712a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/hir-def/src/queries.rs:489-497 | crates/hir-def/src/queries.rs:514-524 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/queries.rs:489\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/queries.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"022009412a53b40fd9916fe6807bd807069772ea5601938454d7da37b8f150d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ide-db/src/database.rs:1739-1749 | crates/ide-db/src/database.rs:1890-1900 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-db/src/database.rs:1739\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"7018d8b25a2bc6b995c1f82f23729f394f452be168e75ad1e727f35656751ddc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ide-diagnostics/src/handlers/deprecated_current_date.rs:27-37 | crates/ide-diagnostics/src/handlers/deprecated_find.rs:27-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/deprecated_current_date.rs:27\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deprecated_current_date.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93b775e1dac3b414bc197dd083f6cc3fbf5299be8cb6e9af391d1f2be7d15da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:842-852 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:855-865 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:855\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4326a5babb7becf21a0469aeb5bcb291906b374812da5959401bfb58ed7fa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ide-diagnostics/src/handlers/missing_form_event_handler.rs:34-44 | crates/ide-diagnostics/src/handlers/ordinary_form_dialog_unread.rs:33-43 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_form_event_handler.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe68f94815b9fbdcfc445b763ab029f4af52f70e52be0c0817aff9a8cdd6c71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs:123-133 | crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs:70-80 \u2014 before extracting anything, compare \u0060crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs:123\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cd18728b51e94941424688b2c18807e82980e623363f435cc4be9adbeea8f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/ide-host-core/src/workspace.rs:809-818 | crates/mcp-server/src/diagnostics_state/lifecycle.rs:1664-1674 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/workspace.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"7830fb563d9390e2a1806b079227bbee0e2da70ee1ee3422d2c76853eaddaa3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/ide/src/graph.rs:1230-1238 | crates/ide/src/graph.rs:1539-1549 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e62b709f8274411d36eb7d3a9a90c95e58c315c10b2718a570734491e841a72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/mcp-server/src/graph_db.rs:1168-1178 | crates/mcp-server/src/graph_db.rs:1746-1756 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b3b3e66b5c586fc9d0ad6e968b04b6acf2fb52276f00a84e859859e7e930be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/mcp-server/src/state/bootstrap.rs:2061-2071 | crates/mcp-server/src/state/bootstrap.rs:2117-2127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/state/bootstrap.rs:2061\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2061}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8471b737235222a1c6db50c6e987a0c4755fd9e2e242d91b7f185f6226ee2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/mcp-server/src/state/embed.rs:1583-1593 | crates/mcp-server/src/state/embed.rs:1651-1661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b10b6157e03b0f7703b76fba82ffbba0141b591ea215cd384bb335b29a16b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/parser/src/grammar/statements.rs:243-253 | crates/parser/src/grammar/statements.rs:278-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/parser/src/grammar/statements.rs:243\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d459d0ebb8e0b03ac0a4ce4429848ae9605a2860fd9efb4a63075f54322c52f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/hir-def/src/body/lower/stmt.rs:35-44 | crates/hir-def/src/body/lower/stmt.rs:55-64 | crates/hir-def/src/body/lower/stmt.rs:137-146 | crates/hir-def/src/body/lower/stmt.rs:157-166 | crates/hir-def/src/body/lower/stmt.rs:177-186 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/body/lower/stmt.rs:35\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/stmt.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"36272f24a8a046e9378272f2456ee20ee0b3386ba49c48ab6fbb6383be3b28b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/stdx/src/fs.rs:113-122 | crates/stdx/src/fs.rs:158-167 | crates/stdx/src/fs.rs:210-219 | crates/stdx/src/fs.rs:267-276 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/stdx/src/fs.rs:113\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/fs.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b434475c9dd8dee7e3ee730f46f2feb2803a6273fd8b472bbd784b4f738259"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/ide-db/src/database.rs:1736-1746 | crates/ide-db/src/database.rs:1887-1897 | crates/ide-db/src/database.rs:2008-2018 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-db/src/database.rs:1736\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba47f89b45ce77d8ce414b5a130855824a2ee88b353b0a6df6bcb048c27b99e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs:168-177 | crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs:62-71 | crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs:81-90 \u2014 before extracting anything, compare \u0060crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs:168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6e476d9570e2cf7b00de7d6cfa3a3e23592139f0d560ab0b078adc6fb4b37c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs:1000-1009 | crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs:1198-1207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs:1000\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c97536416e16d36ee3ffa70e1b6de5244f9b72f5da116040497e9cd42a78a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/bsl-analyzer/src/handlers/request.rs:1598-1606 | crates/bsl-analyzer/src/handlers/request.rs:1962-1971 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/handlers/request.rs:1598\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5be17fe99f5f3c18f4d01cfe0c1081d28373243c34ec8d95e6d9e626b4b31e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/bsl-check-executor/src/native_check/profile.rs:1013-1022 | crates/bsl-check-executor/src/native_check/profile.rs:1064-1073 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/profile.rs:1013\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"740c8f108d502f49a16563c99bc824fe7f58f4a043749e03c814b5337586a7c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/bsl-check-executor/src/native_check/profile.rs:2360-2369 | crates/bsl-check-executor/src/native_check/profile.rs:2387-2396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/profile.rs:2360\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":2360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4102ac38d8ba5eb5bdf896c250d7d7df9d841f2d2d898a6e99636960cc60071d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/bsl-check-executor/src/native_check/profile.rs:3015-3024 | crates/bsl-check-executor/src/native_check/profile.rs:3036-3045 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/profile.rs:3015\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/bsl-check-executor/src/native_check/profile.rs:3012\u0060 calls \u0060file_name\u0060 and \u0060crates/bsl-check-executor/src/native_check/profile.rs:3035\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":3015}}}],"partialFingerprints":{"codehealthFindingId/v1":"929bcea588203b6536e0cafd10bc50b8f6ec466548471e6b58009ce4cd86fe7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/bsl-debug/src/session.rs:1194-1203 | crates/bsl-debug/src/session.rs:1290-1299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/session.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0318af8290b542495416c4cba689e69f3c33ba37fe7c7c0171e7a7b599c19f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/bsl-platform/tools/html-parser/src/lib.rs:600-609 | crates/bsl-platform/tools/html-parser/src/lib.rs:938-947 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/lib.rs:600\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c884f0aaceffb7b1a0e220f10853bd998afe9c90a9236c6a5cd6ec002658b9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/bsl-search/src/store.rs:3564-3573 | crates/bsl-search/src/store.rs:3649-3658 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":3564}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6e9c2ad25ff6793801d50aae8bfbedaf83066649c1d71aacb4a626d278c1d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/bsl-search/src/store.rs:5504-5513 | crates/bsl-search/src/store.rs:5527-5536 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:5504\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":5504}}}],"partialFingerprints":{"codehealthFindingId/v1":"856fa2b2f27545236883a2d8135905cbe207069c30fd87effe73aca421478bdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/hir-def/src/body/lower/mod.rs:306-313 | crates/hir-def/src/body/lower/mod.rs:325-334 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/body/lower/mod.rs:306\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/mod.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a207f39199e446472927e246c33d9ba0f6f0ed821952185405c2ca25405f7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/hir-def/src/body/lower/stmt.rs:823-832 | crates/hir-def/src/body/lower/stmt.rs:874-883 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/stmt.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca65900dde755ec2cc697f42475b6773eb238504664239000265ce1dc3a2e76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/hir-ty/src/platform_resolution.rs:216-225 | crates/hir-ty/src/platform_resolution.rs:249-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-ty/src/platform_resolution.rs:216\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/platform_resolution.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16cf20c780b65c0c675841ba82ac3a9827aa5270b4daa88057653f5452a4c8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ide-diagnostics/src/handlers/order_of_params.rs:24-33 | crates/ide-diagnostics/src/handlers/reserved_parameter_names.rs:31-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/order_of_params.rs:24\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/order_of_params.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b544f1ad75f89fd35d22df38ee1971604f8c6b26d6b029a06e7ffc72f117e6e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ide-diagnostics/src/handlers/unused_local_method.rs:33-42 | crates/ide-diagnostics/src/handlers/unused_parameters.rs:38-47 \u2014 before extracting anything, compare \u0060crates/ide-diagnostics/src/handlers/unused_local_method.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/unused_parameters.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_method.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebf470807ea3076181450e37db6b332b2a64c02d3e83edcfffd7a4bfb9a537f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ide-diagnostics/src/handlers/unused_local_variable.rs:362-371 | crates/ide-diagnostics/src/handlers/unused_local_variable.rs:421-430 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/unused_local_variable.rs:362\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_variable.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9350f76dca0aeb0e78e2a18d5bca0b348cc18f2264c2af9918f0e2df07de7ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ide-diagnostics/src/handlers/weaving_annotation_not_applicable.rs:67-76 | crates/ide-diagnostics/src/handlers/weaving_signature_mismatch.rs:74-83 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/weaving_annotation_not_applicable.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e4bfc0ffaadb317ede6b67359331b1f807450907de5033fdda467f31db885a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ide-diagnostics/src/sdbl_utils.rs:330-339 | crates/ide-diagnostics/src/sdbl_utils.rs:341-350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/sdbl_utils.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"1570d25fbc11a2b4f4eb7ff3913624b63641205bfdc50614908e2368f978a6c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ide/src/document_highlight.rs:50-59 | crates/ide/src/references.rs:30-39 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/document_highlight.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0039f4a4fdba98f4af1c00dfbb956a6074a23734a4382868606039c0278f57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ide/src/goto_definition.rs:305-314 | crates/ide/src/goto_definition.rs:316-325 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/goto_definition.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4c386eced05f83bfdc97f0d513bdbc8a504e0101dd2f3f4aced16b4e5693c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ide/src/hover.rs:657-666 | crates/ide/src/hover.rs:681-690 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/hover.rs:657\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/hover.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a51f99df4a3f0a2701a8c7a6f81acf76c800b9e46e18438a0f6adfff445e16a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mcp-server/src/tools/diagnostics.rs:341-350 | crates/mcp-server/src/tools/diagnostics.rs:362-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/tools/diagnostics.rs:341\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f23404027f0100397e404796eedc6fa4e2a0bfb1285a60c46cc74d263473ddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mcp-server/src/tools/search/docs.rs:197-206 | crates/mcp-server/src/tools/search/docs.rs:231-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/docs.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b807033ba5cca30130e63811f2484175d44da25f29df70fe732f5901c29432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mcp-server/src/tools/search/semantic.rs:51-60 | crates/mcp-server/src/tools/search/semantic.rs:233-242 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/semantic.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3805a3741a093e2bf83d0445501524b422165b9f6604024dbc0a378ff4f800fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mcp-server/src/workspace_lease.rs:1011-1020 | crates/mcp-server/src/workspace_lease.rs:1028-1037 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/workspace_lease.rs:1011\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/workspace_lease.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"a883a5bf84041984561cd93395a6bf8f29ae4a584a6e45ce03b41bfaba6fe52a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/parser/src/lib.rs:70-79 | crates/parser/src/lib.rs:87-95 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/lib.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"795da59c7ee5dce7be3af60015ef142cae812fe08c94b7396c5bca3147054ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/sdbl-hir/src/literal.rs:151-160 | crates/sdbl-hir/src/literal.rs:181-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sdbl-hir/src/literal.rs:151\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/literal.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"107f1764a128c2cfa38cca2aeb172aaed9e77b6b999fc45d02d7f666c26a4d13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/symbol-info/src/presenters/signature_help.rs:95-104 | crates/symbol-info/src/presenters/signature_help.rs:123-132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/symbol-info/src/presenters/signature_help.rs:95\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/symbol-info/src/presenters/signature_help.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cb44152b47094fd4dd6e609fb53b27136dbc57344735b0957a66078e9162fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 11): crates/bsl-metadata/src/loader.rs:1292-1300 | crates/bsl-metadata/src/loader.rs:1318-1326 | crates/bsl-metadata/src/loader.rs:1351-1359 | crates/bsl-metadata/src/loader.rs:1408-1416 | crates/bsl-metadata/src/loader.rs:1437-1445 | crates/bsl-metadata/src/loader.rs:1463-1471 | crates/bsl-metadata/src/loader.rs:1512-1520 | crates/bsl-metadata/src/loader.rs:1541-1549 | crates/bsl-metadata/src/loader.rs:1583-1591 | crates/bsl-metadata/src/loader.rs:1625-1633 | crates/bsl-metadata/src/loader.rs:1656-1664 \u2014 all 11 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/loader.rs:1292\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6cfff982ca9e20c3d6ccf8f1ddf7a625f262b6eaf25fd37a1067ed3decce21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 6): crates/bsl-search/src/store.rs:1068-1076 | crates/bsl-search/src/store.rs:2046-2052 | crates/bsl-search/src/store.rs:2430-2436 | crates/bsl-search/src/store.rs:2802-2808 | crates/bsl-search/src/store.rs:5287-5293 | crates/bsl-search/src/store.rs:5538-5544 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:1068\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/bsl-search/src/store.rs:1067\u0060 calls \u0060pragma_update\u0060 and \u0060crates/bsl-search/src/store.rs:2429\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a86e3638f327afabf287c80e3422d3df6a43b486853e5f4b954ee711214008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs:123-131 | crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs:176-184 | crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs:70-78 | crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs:89-97 \u2014 before extracting anything, compare \u0060crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs:123\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ddd533ae198b1e56e7574c436df798e70a045a85a3c74f8e9a68b056f84f77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/bsl-analyzer/src/server.rs:576-583 | crates/ide-host-core/src/workspace.rs:814-821 | crates/mcp-server/src/diagnostics_state/lifecycle.rs:1669-1677 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/server.rs:576\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ide-host-core/src/workspace.rs:812\u0060 calls \u0060Some\u0060, \u0060var_os\u0060, \u0060create_dir_all\u0060 and \u0060crates/bsl-analyzer/src/server.rs:575\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28cfc80c77926824b788d46a6de63a27adc53a65120490433d1a35ff6bebcdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/hir-def/src/body/lower/expr.rs:1785-1793 | crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs:269-277 | crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs:319-327 \u2014 before extracting anything, compare \u0060crates/hir-def/src/body/lower/expr.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 115 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/body/lower/expr.rs:1785\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca585a8cef0db0e7d1f2706684c37b836db08102e06b7c0f9f37f014d669660"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/hir-ty/src/object_resolver.rs:252-260 | crates/ide-db/src/provider.rs:80-88 | crates/ide-db/src/provider.rs:102-110 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-ty/src/object_resolver.rs:252\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/object_resolver.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"439e312cd746e885b0535c3761de5d7f79dc77ae72b575dc27ab60d214768713"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/sdbl-hir/src/lower/expr/predicates.rs:102-110 | crates/sdbl-hir/src/lower/expr/predicates.rs:172-179 | crates/sdbl-hir/src/lower/expr/predicates.rs:264-272 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sdbl-hir/src/lower/expr/predicates.rs:102\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn lower_in_expr(\u0026mut\u0060 in one and \u0060super) fn lower_in_hierarchy_expr(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/expr/predicates.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"223122d978d46ce0aa3fb493fb7632d190a9d3fb0706fc28db1cd2470e43519b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/stdx/src/fs.rs:67-75 | crates/stdx/src/fs.rs:116-124 | crates/stdx/src/fs.rs:161-169 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/stdx/src/fs.rs:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/stdx/src/fs.rs:76\u0060 calls \u0060is_some_and\u0060, \u0060load\u0060 and \u0060crates/stdx/src/fs.rs:125\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/fs.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc77860aa288cdb3ccfab686716840680ee22a614e174b5f8aa6ec738a0f9ac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs:321-329 | crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs:356-364 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3955cf6d97be055ae74dbb2adc9aef7d3fc749acc485eb486593141e1f74b35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/bsl-check-executor/src/native_check/profile.rs:3349-3357 | crates/bsl-check-executor/src/native_check/profile.rs:3364-3372 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/bsl-check-executor/src/native_check/profile.rs:3347\u0060 calls \u0060now\u0060, \u0060saturating_duration_since\u0060 and \u0060crates/bsl-check-executor/src/native_check/profile.rs:3363\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":3349}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0994e3cb12138741a2642a98b26d7d12eb9d56cf255448912e88bdb2f8d6a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/bsl-launcher/src/entities.rs:48-56 | crates/bsl-launcher/src/entities.rs:74-82 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-launcher/src/entities.rs:48\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-launcher/src/entities.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44cefba2633b3b04824fe3b47baa8caaba1c920bd545d52b95198a40c4f1a7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/bsl-launcher/src/use_cases.rs:533-541 | crates/bsl-launcher/src/use_cases.rs:589-596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-launcher/src/use_cases.rs:533\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-launcher/src/use_cases.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"8446462e3ea5ad35c7522053304d27614c51b2dd6d86604b6ffc111cc1339e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/bsl-platform/src/db.rs:251-271 | crates/bsl-platform/src/db.rs:317-336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/src/db.rs:251\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/db.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed26ed10d3e4010e18a1f8bdfd15d297c0187c49cca822c9ec6053b9bb67071"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/bsl-platform/src/db.rs:909-917 | crates/bsl-platform/src/db.rs:1007-1017 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/src/db.rs:909\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/db.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8e42a88f7a985c61703286b641ec45261bdd347c2be57f57b157e7315d676e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/bsl-platform/tools/html-parser/src/lib.rs:607-613 | crates/bsl-platform/tools/html-parser/src/lib.rs:959-967 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/lib.rs:607\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c84035f9a5be987f697376176bb5d080db29941d83742c85c299687946612b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/bsl-search/src/engine.rs:286-294 | crates/bsl-search/src/engine.rs:392-400 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:286\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"af46dfc753e4e6aaec18dbffb1ded32dd40eaf5bf60b42bc2fa6b60d28af9a05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/bsl-search/src/store.rs:568-576 | crates/bsl-search/src/store.rs:654-662 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd436cc33fb7346b763a89068189fd810982d51467ae0a4d0361fc62501de639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): crates/bsl-search/src/store.rs:1735-1743 | crates/bsl-search/src/store.rs:1765-1770 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"405eb1626e978177b4141a68e1d2c0828cb93e4e11c0e0d24d175655ca8b0e9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/bsl-search/src/store.rs:2730-2736 | crates/bsl-search/src/store.rs:4931-4939 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:2730\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2730}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b66c77990e68f5232db203a69c08fa9f3e6ccbc6cada0aedb0626f0411fa77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/bsl-search/src/workspace_overlay.rs:867-875 | crates/bsl-search/src/workspace_overlay.rs:885-892 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/workspace_overlay.rs:885\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"3091ab32e94d424dbdb2ef96fef6a1df4c9379492dc7709e54be7462b55be3b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/bsl-search/src/workspace_overlay.rs:917-925 | crates/bsl-search/src/workspace_overlay.rs:936-943 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/workspace_overlay.rs:936\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/bsl-search/src/workspace_overlay.rs:915\u0060 calls \u0060full_refresh\u0060, \u0060is_empty\u0060 and \u0060crates/bsl-search/src/workspace_overlay.rs:935\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e28d6cdf7dc486bab802d07126b66338c54530c12fa5b4aa3440d2532f0f1e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/hir-def/src/conditional_tree.rs:222-228 | crates/hir-def/src/conditional_tree.rs:280-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/conditional_tree.rs:222\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/conditional_tree.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"288d8d556e05984fd3cc697785ef30452532512f1f7ba3fa4b406c9b4d50af41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/hir-ty/src/infer.rs:899-907 | crates/hir-ty/src/infer.rs:933-941 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f4ff9cba9089952dc210467853117d2d6456db3ce6d0f52ce8ccbe53199a63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/hir-ty/src/infer.rs:5022-5029 | crates/hir-ty/src/infer.rs:6309-6317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-ty/src/infer.rs:5022\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":5022}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21797168c3d7d405a273c193cbbde11defdcb8f95a8833e06945fb0bbb3dac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ide-db/src/database.rs:1278-1286 | crates/ide-db/src/database.rs:2214-2223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-db/src/database.rs:1278\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ide-db/src/database.rs:2224\u0060 calls \u0060Some\u0060 and \u0060crates/ide-db/src/database.rs:1287\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33084f349edf7950111d06d11a567955433f41458782eadae039e496b545ec8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ide-diagnostics/src/handlers/deprecated_platform_facts.rs:57-65 | crates/ide-diagnostics/src/handlers/deprecated_platform_facts.rs:72-80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/deprecated_platform_facts.rs:72\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deprecated_platform_facts.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40f85727befc127895658e899837521c8133888087473d639bb0583c57e5dbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ide-diagnostics/src/utils/nstr.rs:69-77 | crates/ide-diagnostics/src/utils/nstr.rs:111-119 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/utils/nstr.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bde21db18dd3fb93901b6707e25891bc26ff43c4423a0f82292ea060971a04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/ide-host-core/src/metadata.rs:83-91 | crates/ide-host-core/src/metadata.rs:462-468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/metadata.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53c02ccaa2a7b2fb5aaac9d3742edd8fdae2241571b0994d9930b9cfe7b3b98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ide-host-core/src/workspace.rs:547-555 | crates/ide-host-core/src/workspace.rs:561-569 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/workspace.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"2608efdc621e1bb4bbb8dfadbd80bf003d623e543a9f970c777af8125ce8a1da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ide/src/completion/mdo_completion.rs:81-89 | crates/ide/src/completion/mdo_completion.rs:96-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/mdo_completion.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94f7bd0fad0221dae0ef7adec70a305cc9e302da360de91e23dd2f886bcab94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mcp-server/src/change_hub.rs:3508-3519 | crates/mcp-server/src/change_hub.rs:3734-3745 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/change_hub.rs:3508\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":3508}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cf48096da453ef9d1a7c845a6f3c4ae22056951553f0bb9cb558ec43c55417"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mcp-server/src/graph/debt.rs:1287-1295 | crates/mcp-server/src/graph/debt.rs:1850-1858 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn change_answered(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/debt.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"019360dfade551992cdd6b4dbd20677be8d40ab8d13e205e846dbcd113a8fac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/mcp-server/src/graph/state.rs:1292-1300 | crates/mcp-server/src/graph/state.rs:1327-1333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/graph/state.rs:1292\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb8711f8e09ab05676dca538e8de5f58057aaf3ef5b72e1b7be25781b3ad55d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mcp-server/src/graph_db.rs:2800-2808 | crates/mcp-server/src/graph_db.rs:2850-2858 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/graph_db.rs:2800\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"4298edb6cacb154564ecc256e10cd033703397c3199ba126336d8c834ff030fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mcp-server/src/lib.rs:2856-2864 | crates/mcp-server/src/lib.rs:3042-3050 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/lib.rs:2856\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":2856}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adfe475f5d8cdce6947dccbcf149ee916e3d55ed6085ea6ef7d8b92b3b4e0a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mcp-server/src/tools/platform.rs:515-523 | crates/mcp-server/src/tools/platform.rs:581-589 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/tools/platform.rs:515\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060item\u0060 to \u0060\u0026bsl_platform::PlatformMethod\u0060 in one and \u0060\u0026bsl_platform::GlobalFunction\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/mcp-server/src/tools/platform.rs:514\u0060 calls \u0060owner_identity\u0060, \u0060as_str\u0060 and \u0060crates/mcp-server/src/tools/platform.rs:580\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/platform.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0552f4dd0058bdf493ecb688a57b12b891ae351985e00683899e6fadc4635d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/mcp-server/src/tools/platform.rs:1482-1489 | crates/mcp-server/src/tools/platform.rs:1525-1533 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/platform.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3db6d2d1199996ec2e673591f0b17d8c5f92cacdaac6fffd69f6faae5dd26b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/project-model/src/diagnostics_baseline_fs.rs:47-57 | crates/project-model/src/diagnostics_baseline_fs.rs:168-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/diagnostics_baseline_fs.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e2164a168cc83818db89ec87c8bc741418803a396675e836fd32b0e14b5dac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/project-model/src/source_set.rs:176-185 | crates/project-model/src/workspace_walk.rs:110-119 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/project-model/src/source_set.rs:176\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/project-model/src/source_set.rs:175\u0060 calls \u0060max_depth\u0060 and \u0060crates/project-model/src/workspace_walk.rs:109\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/source_set.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"2186a49ce75e5ef4e63da3be279036c2ac4b8410d1cad77929619e2e14546646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/symbol-info/src/adapters/global_function.rs:71-79 | crates/symbol-info/src/adapters/platform_method.rs:91-99 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/symbol-info/src/adapters/global_function.rs:71\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060docs\u0060 to \u0060Option\u003C\u0026MethodDocs\u003E\u0060 in one and \u0060Option\u003C\u0026bsl_platform::MethodDocs\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/symbol-info/src/adapters/global_function.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba67cc6c882a6a54a4530c5e0474283b034e013423be1a28db6e61e5a00c77c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/symbol-info/src/presenters/completion.rs:42-49 | crates/symbol-info/src/presenters/hover.rs:41-49 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/symbol-info/src/presenters/completion.rs:42\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/symbol-info/src/presenters/completion.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f8f0a577b04f29efce2ca19074dcc46f8c094cb9fb05cc7ce468c80dce9422"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 12): crates/bsl-analyzer/src/handlers/request.rs:53-60 | crates/bsl-analyzer/src/handlers/request.rs:130-137 | crates/bsl-analyzer/src/handlers/request.rs:187-194 | crates/bsl-analyzer/src/handlers/request.rs:234-241 | crates/bsl-analyzer/src/handlers/request.rs:282-289 | crates/bsl-analyzer/src/handlers/request.rs:359-366 | crates/bsl-analyzer/src/handlers/request.rs:798-805 | crates/bsl-analyzer/src/handlers/request.rs:956-963 | crates/bsl-analyzer/src/handlers/request.rs:1078-1083 | crates/bsl-analyzer/src/handlers/request.rs:1135-1140 | crates/bsl-analyzer/src/handlers/request.rs:1297-1304 | crates/bsl-analyzer/src/handlers/request.rs:1372-1377 \u2014 all 12 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ee06a8d4a00c0182ce534c6f5ebc47e1cf92a25a62aba5b4b4ed73623ea9c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 6): crates/bsl-platform/src/overlay_schema.rs:119-126 | crates/bsl-platform/src/overlay_schema.rs:144-150 | crates/bsl-platform/src/overlay_schema.rs:177-183 | crates/bsl-platform/src/overlay_schema.rs:200-206 | crates/bsl-platform/src/overlay_schema.rs:240-246 | crates/bsl-platform/src/overlay_schema.rs:278-284 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/overlay_schema.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d785856a5f579f68086634c7d416b765162070807b91f5136f7b7b792cbc04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:108-115 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:487-494 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:553-560 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:1509-1516 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:108\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"682f4dfcc4e4d518671516cb9fc7efe2beaef63b7a8c51c3cf9d1040f0e73ba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/bsl-search/src/store.rs:1559-1566 | crates/bsl-search/src/store.rs:2575-2582 | crates/bsl-search/src/store.rs:3061-3068 | crates/bsl-search/src/store.rs:4880-4887 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc8e9211afc114cd74be67e3b6d8b0fccfef9795593a29119f9ced1107f10bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/mcp-server/src/state/embed.rs:1516-1523 | crates/mcp-server/src/state/embed.rs:1573-1580 | crates/mcp-server/src/state/embed.rs:1639-1646 | crates/mcp-server/src/state/embed.rs:1718-1725 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/state/embed.rs:1639\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"c938c7c5570a4a635c37111ec7a630c903739d91187ddfb8133f6f6caea2430f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/bsl-platform/tools/html-parser/src/lib.rs:560-567 | crates/bsl-platform/tools/html-parser/src/lib.rs:628-635 | crates/bsl-platform/tools/html-parser/src/lib.rs:982-989 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/lib.rs:560\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"471554af768c127ddd6c1c0072d9083b93f401e2bc1e494d98856c8dec04a3de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:166-172 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:491-498 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:602-609 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:166\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:163\u0060 calls \u0060name\u0060 and \u0060crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:490\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"44666e46f0c208b1c8f56625f126ac81d69fd5b41e30b2add82f48d4b259ecba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/bsl-search/src/engine.rs:613-620 | crates/bsl-search/src/engine.rs:1088-1095 | crates/bsl-search/src/engine.rs:1164-1171 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/bsl-search/src/engine.rs:622\u0060 calls \u0060startup_context_pending\u0060 and \u0060crates/bsl-search/src/engine.rs:1097\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8f916fa1b634c5f41f361c67a5cf94cb375236aaf9741e2c66141d37441bc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ide-db/src/database.rs:1554-1564 | crates/ide-db/src/database.rs:1587-1594 | crates/ide-db/src/database.rs:1823-1830 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-db/src/database.rs:1554\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8b02c90f368d8230ba3d8c06402d66e557ac3fe58d5f0e25c7d2c648b37e50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/bsl-analyzer/src/bin/cli/source_set.rs:364-371 | crates/bsl-analyzer/src/bin/cli/source_set.rs:512-520 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/bin/cli/source_set.rs:364\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/source_set.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e493ad385038c379454af7fe3f6b0a4492dfa6bb75f2e01bbff029a8643bd69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/bsl-analyzer/src/handlers/request.rs:1566-1573 | crates/bsl-analyzer/src/handlers/request.rs:1945-1950 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/handlers/request.rs:1566\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9221e17d4902561828be5d5246e1cabdf9eb5ad8723b1b291dc947171f748bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/bsl-analyzer/src/handlers/request.rs:2257-2264 | crates/bsl-analyzer/src/handlers/request.rs:2403-2410 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"a964c6351ac83229fe42741eecceefc44da8094a6ddf5b44b0a8581189912f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/bsl-analyzer/src/workspace.rs:1155-1162 | crates/bsl-analyzer/src/workspace.rs:1171-1178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/workspace.rs:1155\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/bsl-analyzer/src/workspace.rs:1164\u0060 calls \u0060common_modules\u0060 and \u0060crates/bsl-analyzer/src/workspace.rs:1180\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/workspace.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"108e1e5576bb8b9e8bca806c32a2bda69c04e7f7a05fe8c22ef886e13bfd0f52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/bsl-check-executor/src/native_check/runtime.rs:156-163 | crates/bsl-check-executor/src/native_check/runtime.rs:182-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/runtime.rs:156\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/runtime.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"144fb7371e11d3bf4bcda5cd003ef7852661d704ffde9b5b0920594bae146165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/bsl-check-executor/src/native_check/source.rs:39-46 | crates/bsl-check-executor/src/native_check/source.rs:137-144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/source.rs:39\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"641d5e88c9360ee4f697e43c08baabd87507f36740cbf4c7936cddd55fce694c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/bsl-launcher/src/use_cases.rs:547-554 | crates/bsl-launcher/src/use_cases.rs:601-608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-launcher/src/use_cases.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a52de70cf01387edda2b29bc77ebed8e9ba017d7eeaf879743b92c37ed8331"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/bsl-metadata/src/loader.rs:1559-1573 | crates/bsl-metadata/src/loader.rs:1601-1615 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/loader.rs:1559\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d321f473b0504ebfb97032958a6939c0cd669969a2cce1c4de5f41b76eb2c01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/bsl-platform/src/capability/mod.rs:128-135 | crates/bsl-platform/src/security/mod.rs:36-43 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/capability/mod.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2b9fa01ecc3c6477c66612bdf9ba4b46480463ee79c7c09e942c1d0b5480f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:555-562 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:642-649 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:555\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"0728f038c84a381259bf1f018c299b266589b19fdb00c1fc33288d20f08bd6aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/bsl-search/src/engine.rs:2614-2621 | crates/bsl-search/src/engine.rs:2650-2657 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:2614\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/bsl-search/src/engine.rs:2624\u0060 calls \u0060Ok\u0060, \u0060Continue\u0060, \u0060owe_graph_contexts\u0060 and \u0060crates/bsl-search/src/engine.rs:2658\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2614}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3634da7ca8016dfa2a559c3707ec223e9caf0615d280e3e5b1feb4e5cd83d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/bsl-search/src/engine.rs:3797-3804 | crates/bsl-search/src/engine.rs:5839-5846 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:3797\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":3797}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6a6a48b8ca4c65e1492d70551a3f9b5271f62a3938d6795acd904a3fd4b998"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/bsl-search/src/external_baseline/postgres.rs:1568-1584 | crates/bsl-search/src/external_baseline/postgres.rs:1614-1629 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7507cd88a2a472ec7cda60bd9a1f4a3ecef40b35612630116c755b09ea572a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/bsl-search/src/external_baseline/postgres.rs:3785-3792 | crates/bsl-search/src/external_baseline/postgres.rs:4253-4260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/bsl-search/src/external_baseline/postgres.rs:3793\u0060 calls \u0060push\u0060 and \u0060crates/bsl-search/src/external_baseline/postgres.rs:4261\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":3785}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b190950b294dea90f98acf122d14d36fcecc9371788959f9845ffdfa6c2a4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/bsl-search/src/merge.rs:112-119 | crates/bsl-search/src/merge.rs:152-159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/merge.rs:112\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/merge.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4831bbd99895e4b95b7829fab0933c59637eaac97171a7d177215a73e3fef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/bsl-search/src/workspace_overlay.rs:1039-1048 | crates/bsl-search/src/workspace_overlay.rs:1939-1946 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ef69f4738c043b3cf804ea55e64e9fa27a382f26943261ef3168a20a0e5b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/hir-def/src/body/lower/expr.rs:677-684 | crates/hir-def/src/body/lower/expr.rs:706-713 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/body/lower/expr.rs:677\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac8343fb8040269ccaf24f861052d07e273992ac1477da296cb44ab10093a77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/hir-def/src/graph_index.rs:2009-2014 | crates/hir-def/src/queries.rs:900-907 \u2014 before extracting anything, compare \u0060crates/hir-def/src/graph_index.rs\u0060 and \u0060crates/hir-def/src/queries.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/graph_index.rs:2009\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffada4767e063dd1862393091e39f7d55755b8fe84c40a560b8feee57853995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/hir-ty/src/field_lookup.rs:496-503 | crates/hir-ty/src/iteration_lookup.rs:110-117 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/field_lookup.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"5874e0e04a98c3af55d0f530f18113c1a2490d74896a769f2b013e7a95ad389f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/hir/src/semantic_symbol.rs:832-839 | crates/hir/src/semantic_symbol.rs:846-853 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir/src/semantic_symbol.rs:832\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir/src/semantic_symbol.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72031bbe26c7e4da604ba129741805fc22c2b6dab1f74c7a4561b1bc15fdf8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ide-db/src/database.rs:666-673 | crates/ide-db/src/metadata.rs:543-550 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-db/src/database.rs:666\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060path\u0060 to \u0060\u0026Path\u0060 in one and \u0060\u0026std::path::Path\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4980bcd8b51e13b73004f0825c8c04aa592fc3e793df7847abce3cb3ba83e2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ide-db/src/database.rs:2217-2224 | crates/ide-db/src/database.rs:2280-2287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-db/src/database.rs:2217\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":2217}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8b8ccbbae1c5546da313f64b3e9cba80a4431d0d66859662d299093a59cdd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/ide-db/src/queries.rs:169-176 | crates/ide-db/src/queries.rs:197-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/queries.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a8c06db401e6073b39da495e7f0242f3d32932c0cae23c04491e3155e3a1ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ide-diagnostics/src/handlers/deprecated_current_date.rs:63-70 | crates/ide-diagnostics/src/handlers/deprecated_find.rs:60-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deprecated_current_date.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bad65632639c6da2abbcf110bc8ec0df3598bec83a6dae3752d2f44fdd60c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ide-diagnostics/src/handlers/unused_local_method.rs:229-237 | crates/ide-diagnostics/src/handlers/unused_parameters.rs:66-73 \u2014 before extracting anything, compare \u0060crates/ide-diagnostics/src/handlers/unused_local_method.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/unused_parameters.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/unused_local_method.rs:229\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_method.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"911195fe8fbe03058a454041bcaf6a30160242728b860e0ebd06073d2558198c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ide-diagnostics/src/handlers/using_hardcode_network_address.rs:79-88 | crates/ide-diagnostics/src/handlers/using_hardcode_path.rs:83-92 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_hardcode_network_address.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b69f9396cc564f40be6f44b9f68bd6ae869200c7a7c3dd8f8b60037e8ac738"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ide/src/completion/sdbl/use_cases/complete_value_elements.rs:85-92 | crates/ide/src/completion/sdbl/use_cases/complete_value_elements.rs:108-115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/completion/sdbl/use_cases/complete_value_elements.rs:85\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/sdbl/use_cases/complete_value_elements.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1a38552d695bb595c2af5c6960a5c3bfe70455ce099e4fd9b268d5908337b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ide/src/graph.rs:1961-1968 | crates/ide/src/graph.rs:1985-1992 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/graph.rs:1961\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"805f20aa8458bfaa0a4e3eccdad05304ab0c9f8affab26f6ba8f3d8abc59ce0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ide/src/graph.rs:2557-2564 | crates/mcp-server/src/graph_query.rs:1362-1369 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/graph.rs:2557\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"9756e3fc0f119686ccd39ce5ff8aebade24920ee383c14a7079d4ed8be61dfa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ide/src/partitioned_diagnostics_baseline.rs:629-636 | crates/ide/src/partitioned_diagnostics_baseline.rs:1043-1050 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/partitioned_diagnostics_baseline.rs:629\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b54b45acd47a3436d6b15da226c9101616147bfe52227c335b6d1a0baf0ac21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ide/src/symbol_info.rs:610-618 | crates/ide/src/symbol_info.rs:665-672 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/symbol_info.rs:610\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/symbol_info.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eff5d0d199a0762b7699df1da9fca3a15404c1a630f9c9334e506e74b3a2858"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/ide/src/symbol_info.rs:1595-1601 | crates/symbol-info/src/adapters/common_module.rs:22-29 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/symbol_info.rs"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe33b7c8ffc43b18b5d952f42717cee60c99e757f00b418426401790d896960"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/parser/src/grammar/items.rs:58-65 | crates/parser/src/grammar/sdbl/expressions.rs:9-15 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/parser/src/grammar/items.rs:58\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/items.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70fe21b14668c1399a9ba9a4d52b287558fed2d6f4b7002da2585549da42470"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/parser/src/grammar/sdbl/select.rs:852-859 | crates/parser/src/grammar/sdbl/select.rs:898-905 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/select.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"33eb5e2c4fcacc546fccb84f3fa7d537a38f404bf2af1b7ce91965f141751c34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/project-model/src/lib.rs:2323-2330 | crates/project-model/src/lib.rs:2414-2421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/project-model/src/lib.rs:2323\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":2323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d769f3b3f283e3f0365ea2bd7ee99af4ad5b994649d462595fc0c844b79c2089"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/sdbl-hir/src/context_detector.rs:79-86 | crates/sdbl-hir/src/context_detector.rs:112-119 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/context_detector.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ab838a329626d7748fd7c16d2ac5a7eca4e2540cb8bca653d0a718c4bdb98d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/sdbl-hir/src/lower/from_clause.rs:1114-1123 | crates/sdbl-hir/src/scope.rs:627-634 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sdbl-hir/src/lower/from_clause.rs:1114\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffd38fbb0869b970eda7226f953c3daad9d83452e83c47a05fbe158854757cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 15): crates/bsl-analyzer/src/handlers/request.rs:51-58 | crates/bsl-analyzer/src/handlers/request.rs:128-135 | crates/bsl-analyzer/src/handlers/request.rs:185-192 | crates/bsl-analyzer/src/handlers/request.rs:232-239 | crates/bsl-analyzer/src/handlers/request.rs:280-287 | crates/bsl-analyzer/src/handlers/request.rs:357-364 | crates/bsl-analyzer/src/handlers/request.rs:728-735 | crates/bsl-analyzer/src/handlers/request.rs:796-803 | crates/bsl-analyzer/src/handlers/request.rs:954-961 | crates/bsl-analyzer/src/handlers/request.rs:1012-1019 | crates/bsl-analyzer/src/handlers/request.rs:1076-1083 | crates/bsl-analyzer/src/handlers/request.rs:1133-1140 | crates/bsl-analyzer/src/handlers/request.rs:1155-1162 | crates/bsl-analyzer/src/handlers/request.rs:1295-1302 | crates/bsl-analyzer/src/handlers/request.rs:1371-1377 \u2014 all 15 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e542dfe866ff3679efbe6e27622ef86f5e58adfaa8e063cbb9d0c2c0a933678e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 12): crates/bsl-metadata/src/loader.rs:603-609 | crates/bsl-metadata/src/loader.rs:1288-1294 | crates/bsl-metadata/src/loader.rs:1314-1320 | crates/bsl-metadata/src/loader.rs:1347-1353 | crates/bsl-metadata/src/loader.rs:1404-1410 | crates/bsl-metadata/src/loader.rs:1433-1439 | crates/bsl-metadata/src/loader.rs:1459-1465 | crates/bsl-metadata/src/loader.rs:1508-1514 | crates/bsl-metadata/src/loader.rs:1537-1543 | crates/bsl-metadata/src/loader.rs:1579-1585 | crates/bsl-metadata/src/loader.rs:1621-1627 | crates/bsl-metadata/src/loader.rs:1652-1658 \u2014 all 12 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/loader.rs:603\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1a02a7f7e81204b4451a3ec5a7e0e63bf435fef462536e34897954854d829d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/bsl-debug/src/types/xml.rs:349-355 | crates/bsl-debug/src/types/xml.rs:378-384 | crates/bsl-debug/src/types/xml.rs:407-413 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/bsl-debug/src/types/xml.rs:385\u0060 calls \u0060end_prefixed\u0060 and \u0060crates/bsl-debug/src/types/xml.rs:356\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f215d31fca7d52d5bbf2d0e380fa82e2df7c48a68357abfe4cabb7f6d0979b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): crates/bsl-platform/src/db.rs:912-918 | crates/bsl-platform/src/db.rs:969-974 | crates/bsl-platform/src/db.rs:1013-1018 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/src/db.rs:912\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/db.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e0ccb97bb79d54e9a8188eefe6c20ead7378142bd4a7c2a95ecdf8cca66951"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/ide-db/src/database.rs:1769-1776 | crates/ide-db/src/database.rs:1915-1922 | crates/ide-db/src/database.rs:2050-2057 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"351503bd24b6b6798ced335f1ac8db3790eed77c0d83a43c28333f33aa3faf29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/symbol-info/src/adapters/common_module.rs:63-69 | crates/symbol-info/src/adapters/local_method.rs:28-34 | crates/symbol-info/src/adapters/manager_module.rs:39-45 \u2014 before extracting anything, compare \u0060crates/symbol-info/src/adapters/common_module.rs\u0060 and \u0060crates/symbol-info/src/adapters/manager_module.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/symbol-info/src/adapters/common_module.rs:63\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/symbol-info/src/adapters/common_module.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e498f22d881db0ae40271c665e1472f3b7e1bce03400d243f90b3640b61ae5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs:197-203 | crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs:221-227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs:197\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abacdb8ac77bcde57ec672e6bc99d97f1dedf573acc35f847b4183a353c4122"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/bsl-analyzer/src/mcp_install/adapters.rs:406-412 | crates/bsl-analyzer/src/mcp_install/adapters.rs:716-721 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/mcp_install/adapters.rs:406\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mcp_install/adapters.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d82914d30734914dd83efad0e7df997816d969ff25bc90c11188ba08f7b22c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/bsl-check-executor/src/native_check/source.rs:84-90 | crates/bsl-check-executor/src/native_check/source.rs:566-572 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/source.rs:84\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb32a3b8c2ef65602dd600c8e13e81dc043493d2170ecbdbec097e1bd19ce592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/bsl-platform/src/db.rs:512-518 | crates/bsl-platform/src/db.rs:599-605 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/db.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"f350a0f4e84a989ab48efd93f6683d71e91028bc763070a27f11becaa7dcfef9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/bsl-search/src/engine.rs:102-108 | crates/bsl-search/src/engine.rs:117-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/bsl-search/src/engine.rs:109\u0060 calls \u0060clone\u0060 and \u0060crates/bsl-search/src/engine.rs:124\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad0ca8e20797c2dce98fdc2bbc7a6abd3e17fb0dd99f857cd858cec3896d4f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/bsl-search/src/external_baseline/postgres.rs:418-424 | crates/bsl-search/src/external_baseline/postgres.rs:443-449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/external_baseline/postgres.rs:418\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efaaa6a875da10b79888b14ebb16b0066e918581f70fc771c231d42990ad3df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/bsl-search/src/store.rs:3818-3824 | crates/bsl-search/src/store.rs:5100-5105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":3818}}}],"partialFingerprints":{"codehealthFindingId/v1":"729dbaf70fcf62b44f071677bf1c82a9f45e7d75cba260a4cac9aa849b1bcd78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/bsl-search/src/store.rs:4052-4067 | crates/bsl-search/src/store.rs:4070-4085 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:4052\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":4052}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f0da658c3b04c85fa52d5e20f97c8892c993119dd4571b834cdc71d5d2b7a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/bsl-search/src/workspace_overlay.rs:980-986 | crates/bsl-search/src/workspace_overlay.rs:1486-1494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cd11e9db531458deb305c45923c22c27f5492abd3c101e6bd16f51d9e4d603"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/hir-def/src/body/lower/expr.rs:686-692 | crates/hir-def/src/body/lower/expr.rs:716-722 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/body/lower/expr.rs:686\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"74be1eb4ec3c557768d9fcb47f0bc33f337c4be73bfacbfe3d8869b2d272f774"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/hir-def/src/body/lower/expr.rs:734-740 | crates/hir-def/src/body/lower/expr.rs:756-762 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/body/lower/expr.rs:734\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e84e3c1dcbd09bb98c1e8a0d13cbfbc3c73522af52792f52fe7c40856d0aec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/hir-def/src/body/lower/stmt.rs:853-859 | crates/hir-def/src/body/lower/stmt.rs:920-926 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/body/lower/stmt.rs:853\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/stmt.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ee0d3f60d76df1d0d4279b8007a45491f671e6b6dbdca6d78c4722920a720d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/hir-def/src/graph_index.rs:1764-1771 | crates/hir-def/src/graph_index.rs:1838-1844 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/graph_index.rs:1764\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/hir-def/src/graph_index.rs:1762\u0060 calls \u0060sort\u0060, \u0060dedup\u0060 and \u0060crates/hir-def/src/graph_index.rs:1837\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a814cf3a32ecbb116512c08f387fa2026b2dd2659cdf650dd1dcdd0d3426c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 3): crates/hir-def/src/item_tree/lower.rs:78-84 | crates/hir-def/src/item_tree/lower.rs:112-118 | crates/hir-def/src/item_tree/lower.rs:175-179 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/item_tree/lower.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e55baf23f5284af5f31c2b2d5407c6c509fa1fd9068ccfa378349f9caeb843"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/hir-def/src/name_usage_index.rs:196-204 | crates/hir-def/src/workspace_index.rs:182-188 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060source_root_input\u0060 to \u0060SourceRootInput\u0060 in one and \u0060base_db::SourceRootInput\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/name_usage_index.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a6e9b69d8d041137e581c3f97c6dfe9ee46344e86033c048ff214cca7994ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/hir-ty/src/field_lookup.rs:54-60 | crates/hir-ty/src/field_lookup.rs:93-99 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-ty/src/field_lookup.rs:54\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/field_lookup.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dd9a64b44843adfc3762a7dec8a291eb3159444c8656a0609feae256e4d096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/hir/src/lib.rs:930-936 | crates/hir/src/lib.rs:938-944 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir/src/lib.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b690f1997026486403a8c1437ac2d637cd470f5d2d659d39e522795680380a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:885-893 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:899-907 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:885\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f71889ddc761d79a670146032f01493ea6bc4d764569dee029ae1f39c56d3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ide/src/syntax_highlighting.rs:348-354 | crates/ide/src/syntax_highlighting.rs:359-365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3408c0f82bfea4b574dc8b348099d174921164f1f61abe2fd1ff6df973e0af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/mcp-server/src/lib.rs:1572-1578 | crates/mcp-server/src/lib.rs:3169-3174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060Parameters\u003CWorkspaceSearchParams\u003E\u0060 in one and \u0060Parameters\u003CReferenceSearchParams\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b3bfe75b143f982b188fc07c5f556884fb25cf7b28f2656881ab0b67dd13fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mcp-server/src/state/bootstrap.rs:1578-1584 | crates/mcp-server/src/state/bootstrap.rs:1610-1616 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/state/bootstrap.rs:1578\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e5a0399dc8b289928415f7c9de5481b39768faf3b04d73a0b72fd587bfe344"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/bsl-metadata/src/loader.rs:1091-1097 | crates/bsl-metadata/src/loader.rs:1110-1115 | crates/bsl-metadata/src/loader.rs:1128-1133 | crates/bsl-metadata/src/loader.rs:1146-1151 | crates/bsl-metadata/src/loader.rs:1280-1285 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/loader.rs:1091\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67a2efdc41dfba1cb37946b229df1ab67b1869777a706387e95d87b3e025b2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:110-115 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:489-494 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:555-560 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:642-647 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:1511-1516 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3705acf28bef824129d4a544a9dc87857b66d7fb3bd54dbe3d25e361cdea8fe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 5): crates/hir-def/src/body/lower/expr.rs:371-376 | crates/hir-def/src/body/lower/expr.rs:970-975 | crates/hir-def/src/body/lower/stmt.rs:845-848 | crates/hir-def/src/body/lower/stmt.rs:1043-1048 | crates/hir-def/src/body/lower/stmt.rs:1055-1060 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4bca830d4438f086ece0780b5a4e4ebe59220932106199cfd3432fbab31801"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/bsl-search/src/engine.rs:1409-1414 | crates/bsl-search/src/engine.rs:2122-2127 | crates/bsl-search/src/engine.rs:3291-3296 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:1409\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"9837831b011713b270ddfb8406385e9c1f9bdd1ee332570212e37850dd30ae44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/bsl-search/src/store.rs:2889-2895 | crates/bsl-search/src/store.rs:2999-3004 | crates/bsl-search/src/store.rs:3105-3111 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:2889\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2889}}}],"partialFingerprints":{"codehealthFindingId/v1":"486a5cc43a3d01c90515068fcf43b7ec3eb7be433454560dcbcfa310330e8630"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/bsl-search/src/store.rs:2905-2910 | crates/bsl-search/src/store.rs:3129-3134 | crates/bsl-search/src/store.rs:4973-4978 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:2905\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2905}}}],"partialFingerprints":{"codehealthFindingId/v1":"44800586d6a047c56319baa101f5f7a7221f9451a4933d174ec9c22ff63e4ff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/bsl-search/src/store.rs:3698-3703 | crates/bsl-search/src/store.rs:3737-3742 | crates/bsl-search/src/store.rs:3755-3760 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:3698\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":3698}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1784fe1003fb503f782e111b4bec549e9c8cff4f547e66f3266b6075c36488"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/ide-db/src/metadata.rs:1586-1595 | crates/ide-db/src/metadata.rs:1676-1685 | crates/ide-db/src/metadata.rs:1766-1775 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd37e7d7873dabfdfb5f9e44132a2c6549745cfbc29915623bcdc2bcf4756f5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs:606-611 | crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs:672-677 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"829d1d841e071b03286df61606b2e717ea31bb285010fa8b0242848a8aa4a12d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-analyzer/src/mcp_install/adapters.rs:165-170 | crates/bsl-analyzer/src/mcp_install/adapters.rs:323-328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/mcp_install/adapters.rs:165\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mcp_install/adapters.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfddca90c4a0a74816d80272a3935e11d9f5970ba0112edd7de4285dad0d1e0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-check-executor/src/native_check/profile.rs:3085-3090 | crates/bsl-check-executor/src/native_check/profile.rs:3241-3246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/profile.rs:3085\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":3085}}}],"partialFingerprints":{"codehealthFindingId/v1":"868aa684a492f0c0d91d7d1fa01c40ef1e976f1b2dbb3546e097e3d09d32daa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-check-executor/src/native_check/windows_acl.rs:134-139 | crates/mcp-server/src/cache_windows.rs:192-197 \u2014 before extracting anything, compare \u0060crates/bsl-check-executor/src/native_check/windows_acl.rs\u0060 and \u0060crates/mcp-server/src/cache_windows.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/windows_acl.rs:134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/bsl-check-executor/src/native_check/windows_acl.rs:132\u0060 calls \u0060get_current_user_sid\u0060, \u0060map_err\u0060, \u0060last_os_error\u0060 and \u0060crates/mcp-server/src/cache_windows.rs:191\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/windows_acl.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95fdfb0f55c535c22572d8a7a4662d5bcb1fb6078a2c207980ca45e830d0c8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-debug/src/dap/mod.rs:446-451 | crates/bsl-debug/src/dap/mod.rs:489-494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-debug/src/dap/mod.rs:446\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/dap/mod.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c22640edf5d7a0e0df5939687e4d2b481aab2e76326617f43ee19cabf5a3f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-metadata/src/common_attribute.rs:227-232 | crates/bsl-metadata/src/common_attribute.rs:248-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/common_attribute.rs:227\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/common_attribute.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a62fe1ff20a4c714e44802a89ffc4d4e5c1c5a2449bcae5d8c3158928c12088"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-metadata/src/configuration.rs:262-267 | crates/bsl-metadata/src/configuration.rs:361-366 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/configuration.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"16af1f116fdfd27fd10e59be70e01468c05a8aa0f3127153264c03721eb5c97d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-metadata/src/metadata_object.rs:1168-1173 | crates/sdbl-hir/src/types.rs:327-332 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/metadata_object.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2e7b8dfd7dfaf8a493824cbf55118338321202e9d80a87db74d7165069dc07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-metadata/src/xml_parser/form.rs:27-33 | crates/bsl-metadata/src/xml_parser/form.rs:475-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/xml_parser/form.rs:27\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/form.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3efcc59b293713f3df4c4a8ee5fd79fc8e9ef3df28bc354e7c868ad6b77b428"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-metadata/src/xml_parser/form.rs:35-40 | crates/bsl-metadata/src/xml_parser/form.rs:499-504 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/xml_parser/form.rs:35\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/form.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"10903883602aade73d0d615422e95972165679ba8f7d8bff041cc56980888d40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/bsl-search/src/engine.rs:748-755 | crates/bsl-search/src/engine.rs:814-821 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:748\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac814bc602c2a4b617b47d95709a28eb0d2abd1b0f0b2860cae3dbbf40a2991"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-search/src/engine.rs:2396-2401 | crates/bsl-search/src/workspace_overlay.rs:2619-2624 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:2396\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"5924cef9233e382552c99870424cf0a89003806a7ce30572ee280c04fb8daae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-search/src/engine.rs:2866-2871 | crates/bsl-search/src/engine.rs:2927-2932 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:2866\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2866}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e76dbd6c0e13eb81d33758a17b97d8d036ef1da54bc9c30ee7b81402984080"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-search/src/engine.rs:5882-5887 | crates/bsl-search/src/engine.rs:5937-5942 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:5882\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":5882}}}],"partialFingerprints":{"codehealthFindingId/v1":"feee9924ddddc2cc0bd395696eac544eeec3027b0785103d2e0330ec8d778384"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-search/src/lifecycle.rs:575-580 | crates/bsl-search/src/lifecycle.rs:695-700 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/lifecycle.rs:575\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/lifecycle.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1248130b16afa348aa81cc6b8cc5a2ffbd278d732231e602e247d6e3652642"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/bsl-search/src/store.rs:3851-3864 | crates/bsl-search/src/store.rs:5079-5091 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:3851\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcf4c7ab15dacce9e92ed9fb13247886aea376617eb6bac0f514ce378fa64a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/bsl-search/src/store.rs:4402-4409 | crates/bsl-search/src/store.rs:5050-5057 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:4402\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":4402}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf01cff4b2d72b62e7cfedcf72c346b80ecfb14490afb5e0403bd7a585f561b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-search/src/workspace_overlay.rs:1482-1487 | crates/bsl-search/src/workspace_overlay.rs:1789-1794 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/workspace_overlay.rs:1482\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcd64f72ccbdc8e56da62828526c2f466d628726a15efd9d37907c3467f0b3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/hir-def/src/body/lower/mod.rs:657-662 | crates/hir-def/src/body/lower/mod.rs:664-669 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/mod.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d35712d71162f3adfb5d34c2872197008226f43db16120ca23871ddb639cea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/hir-def/src/graph_index.rs:237-242 | crates/hir-def/src/graph_index.rs:275-280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/graph_index.rs:237\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/hir-def/src/graph_index.rs:281\u0060 calls \u0060hash\u0060 and \u0060crates/hir-def/src/graph_index.rs:243\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"707d94236e769b368b869906ad2cf0bdb1a13f49b924adcc375479e1af736b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/hir-def/src/symbol_tree.rs:255-260 | crates/hir-def/src/workspace.rs:59-64 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/symbol_tree.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd549bcb8c346bfcf4f2a0db896dfb21d94106d57901948ad22f78391ca36813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/hir-ty/src/method_lookup/union.rs:17-23 | crates/hir-ty/src/platform_resolution.rs:111-117 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/method_lookup/union.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"126674c7b74d690d209d9b14b9130471e4d7a4a6ac8f6a2e8f265b5cc6ef8525"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ide-diagnostics/src/handlers/identical_expressions.rs:213-218 | crates/ide-diagnostics/src/handlers/identical_expressions.rs:239-244 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/identical_expressions.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"39171c310a096da3e4184d3d4fc131a0505bc8a6ef772ddd95bff533dc9f85a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): crates/ide/src/diagnostics_baseline.rs:350-354 | crates/ide/src/partitioned_diagnostics_baseline.rs:1345-1350 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/diagnostics_baseline.rs:350\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/diagnostics_baseline.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"6430db2ecfd41307d90d7d1be9ec3dbf4ef12dc7ecd463bca5f9b5dd27c9ea84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ide/src/diagnostics_baseline.rs:418-423 | crates/ide/src/partitioned_diagnostics_baseline.rs:354-360 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/diagnostics_baseline.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c2c0b5db34daec3bce7fd855e617d2428c80b78bdfb992f9160a04c7713d87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ide/src/graph.rs:1133-1139 | crates/ide/src/graph.rs:1483-1489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf09f4018e23f48d59f51cec4ca6d0125dfe7f49f07124da08e1ae7a4dc5525"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mcp-server/src/change_hub.rs:5136-5146 | crates/mcp-server/src/change_hub.rs:5888-5893 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/change_hub.rs:5136\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5136}}}],"partialFingerprints":{"codehealthFindingId/v1":"406985a01299e8d18c9c233f54c37102846e936539d79f447eba2959f0e056d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mcp-server/src/state/embed.rs:1519-1524 | crates/mcp-server/src/state/embed.rs:1657-1662 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/state/embed.rs:1519\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"defc0d6c1caedcccbf6f0520c02d97d7590e14b815f816c44f239c3109bc3b4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/ide-db/src/metadata.rs:1473-1480 | crates/ide-db/src/metadata.rs:1587-1594 | crates/ide-db/src/metadata.rs:1677-1684 | crates/ide-db/src/metadata.rs:1767-1774 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-db/src/metadata.rs:1473\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3764bf63798c1c334a0b871d1e2d6bd647b29323a86fa2bf2d90ffcf220e3ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 4): crates/hir-ty/src/infer.rs:6701-6705 | crates/hir-ty/src/infer.rs:6716-6718 | crates/hir-ty/src/infer.rs:6826-6830 | crates/hir-ty/src/infer.rs:6976-6980 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-ty/src/infer.rs:6701\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/hir-ty/src/infer.rs:6706\u0060 calls \u0060insert\u0060, \u0060clone\u0060 and \u0060crates/hir-ty/src/infer.rs:6719\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":6701}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fba47d21967a0419e27ed67abc4d1a8f6e1f826f5839c8731efe53498e71596"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ide/src/name_lookup.rs:1132-1136 | crates/ide/src/symbol_info.rs:965-969 | crates/ide/src/type_definition.rs:144-148 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/name_lookup.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9333cd008ddfbdb62151f7d9fcaea068fc4bde4d29401780c42b3481f05eddea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/mcp-server/src/change_hub.rs:5137-5146 | crates/mcp-server/src/change_hub.rs:5212-5216 | crates/mcp-server/src/change_hub.rs:5889-5893 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/change_hub.rs:5137\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5137}}}],"partialFingerprints":{"codehealthFindingId/v1":"131da8e1515ae9a9ceb518550b9754cd1487d95ec0a752afbda449f61ac4e895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/mcp-server/src/tools/search/lexical.rs:40-44 | crates/mcp-server/src/tools/search/semantic.rs:50-54 | crates/mcp-server/src/tools/search/semantic.rs:232-236 \u2014 before extracting anything, compare \u0060crates/mcp-server/src/tools/search/lexical.rs\u0060 and \u0060crates/mcp-server/src/tools/search/semantic.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/tools/search/lexical.rs:40\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d031d15efb22f2fb8663f4e556da2359d9d662493344cb9a975822e72a9605"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-analyzer/src/handlers/notification.rs:298-303 | crates/bsl-analyzer/src/handlers/notification.rs:494-499 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/bsl-analyzer/src/handlers/notification.rs:295\u0060 calls \u0060insert\u0060 and \u0060crates/bsl-analyzer/src/handlers/notification.rs:491\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/notification.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"028f55ce663624418c6446ada09680115f498ab8842af48ffd2c38aae9858a85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/bsl-check-executor/src/native_check/profile.rs:3007-3011 | crates/bsl-check-executor/src/native_check/profile.rs:3031-3035 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/profile.rs:3007\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/bsl-check-executor/src/native_check/profile.rs:3012\u0060 calls \u0060file_name\u0060 and \u0060crates/bsl-check-executor/src/native_check/profile.rs:3036\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":3007}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25535cbf45311b46dc7f89c93c5672c712b18720fbbc262053c50b22cd5b7d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/bsl-metadata/src/xml_parser/form.rs:116-120 | crates/bsl-metadata/src/xml_parser/form.rs:165-169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/form.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f0ca3d3ff86d2a10be6cc3b5aa672f7f7d1dcef17eee7407f4477a5fd4e12d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-platform/tools/html-parser/src/lib.rs:372-377 | crates/platform-help/src/package.rs:141-146 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"92300d132487f384a713789c2a6c52c211a0c2437e9517dc60b77099d50dba1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:130-135 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:534-539 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:130\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7079fe78c99e9be687d600bd36fefac9952ff90c3eb56647d2db8796cc4e088"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/bsl-search/src/engine.rs:1929-1933 | crates/bsl-search/src/engine.rs:2043-2049 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf59dacbc3d4c7a7584b4bdfc6808014ebbe9197f6d30a629f8dbe0bb7b6df2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/bsl-search/src/external_baseline/postgres.rs:3854-3863 | crates/bsl-search/src/workspace_overlay.rs:2981-2990 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":3854}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3678671967751bdcd3fbe3beb5a6ddd89aaac0104fb8ae716dba11508b3c2d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/bsl-search/src/merge.rs:98-102 | crates/bsl-search/src/merge.rs:138-142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/merge.rs:98\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/merge.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2384407854c4b4a26d9f92f5e4a8efae18422c1d4d6a1b28439c8c8865509f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/bsl-search/src/store.rs:3490-3494 | crates/bsl-search/src/store.rs:4295-4299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:3490\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":3490}}}],"partialFingerprints":{"codehealthFindingId/v1":"25753caf75bf4cfff68b9da9d9456062b730f9c766725ab5abd27c2d1baa93c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-search/src/store.rs:3829-3834 | crates/bsl-search/src/store.rs:5108-5113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:3829\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":3829}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddafb3cd44f48e849d902794c57529c61959931ea3970f49d48b4de102d729f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/bsl-search/src/store.rs:4378-4396 | crates/bsl-search/src/store.rs:5026-5044 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:4378\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":4378}}}],"partialFingerprints":{"codehealthFindingId/v1":"551e1b97ad0ebb0913ad45257d157bf2ba637d47322e85bf18ba0ec35c0f28b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/dataflow/src/lib.rs:30-35 | crates/ide-db/src/queries.rs:33-38 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/lib.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5d4250a46f38f640d321b9f0f9d3bc7bff8b9aaf95f6eeba75dae619fde92a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/hir-def/src/body/lower/diagnostics.rs:722-726 | crates/hir-def/src/body/lower/diagnostics.rs:738-742 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/body/lower/diagnostics.rs:722\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/diagnostics.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6b2028d928f20f7a060b8f94e9179ede1cd5300292d25e90345e1916e5f03d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/hir-def/src/body/lower/stmt.rs:149-156 | crates/hir-def/src/body/lower/stmt.rs:169-176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/body/lower/stmt.rs:149\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/stmt.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e009e5e98364d5a1495fa22d023acd383cc48a6ca44fcb002cdf265cd7ee76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/hir-def/src/body/lower/stmt.rs:716-720 | crates/hir-def/src/body/lower/stmt.rs:737-741 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/body/lower/stmt.rs:716\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/stmt.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cd615dd379934980768228ddfceca7f30f36252a73c5fa66670f666f18d97e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/hir-def/src/graph_index.rs:2434-2439 | crates/ide/src/graph.rs:2308-2313 \u2014 before extracting anything, compare \u0060crates/hir-def/src/graph_index.rs\u0060 and \u0060crates/ide/src/graph.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":2434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef8d0342369e1bdb6a0d3e1e692789e3c81163bd692cb22fed84aa34cf98947"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/hir-def/src/item_tree.rs:350-357 | crates/hir-def/src/item_tree.rs:361-368 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/item_tree.rs:350\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/item_tree.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"1496b7efdf462722fea5b14be14026adb8bb5e8637fbc1c1d86b3a4d04af0290"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/hir-def/src/module_index.rs:55-59 | crates/hir-def/src/module_index.rs:66-70 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/module_index.rs:55\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/module_index.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a15f72effd5c70d58f803e0f81c32cce5fbec7e751d30ebb4bbf7a3e625cf94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/hir-def/src/resolver.rs:432-436 | crates/hir-def/src/resolver.rs:447-451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/resolver.rs:432\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/resolver.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c3324f2162d7f39283f6e1c3c96749fb547597509273c685b5427f43b26980"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 4): crates/hir-ty/src/infer.rs:6709-6710 | crates/hir-ty/src/infer.rs:6721-6722 | crates/hir-ty/src/infer.rs:6835-6839 | crates/hir-ty/src/infer.rs:6985-6989 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-ty/src/infer.rs:6835\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/hir-ty/src/infer.rs:6835\u0060 calls \u0060extend\u0060, \u0060iter\u0060, \u0060cloned\u0060 and \u0060crates/hir-ty/src/infer.rs:6709\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":6709}}}],"partialFingerprints":{"codehealthFindingId/v1":"6582415f1b744adadbd2b26baa0464e26b95f898968214ff10f94ca967e84738"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/hir-ty/src/this_object.rs:73-80 | crates/hir-ty/src/this_object.rs:95-102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-ty/src/this_object.rs:73\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/this_object.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac4450c9e2fdcb774bb7dc1c32117dc53854cd652279b02b3818aed2fc20c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ide-db/src/metadata.rs:1293-1297 | crates/ide-db/src/metadata.rs:1315-1319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-db/src/metadata.rs:1293\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"823698d15ed0b67cccf9288c62e48d72c4d8aaccad2657fa979e4ddec379427f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ide-diagnostics/src/handlers/unused_local_method.rs:415-419 | crates/mcp-server/src/graph_query.rs:85-89 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/unused_local_method.rs:415\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_method.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"73474aba72721b1140ad429a92d8acd75bfb7f918e4a31cea345d3537708cafe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ide-diagnostics/src/handlers/unused_local_variable.rs:299-303 | crates/ide-diagnostics/src/handlers/unused_local_variable.rs:335-339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/unused_local_variable.rs:299\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_variable.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3baf7cd68f799f61a82ae95f84ce57d3f735ff69fa71391215d93cc6ad334c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ide/src/hover.rs:267-271 | crates/ide/src/hover.rs:494-498 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/hover.rs:267\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/hover.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"0893b5e33d51bb666fbdec31b4f1f5aaa5283eb5eaca262341017e0d22acc7c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ide/src/symbol_info/form/card.rs:153-158 | crates/ide/src/symbol_info/form/card.rs:188-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/symbol_info/form/card.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcb7b1e265eae189b64ff2962e6fa0eb8e358dea1bf9a2d235194dab95af936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mcp-server/src/graph/state.rs:1974-1978 | crates/mcp-server/src/graph/state.rs:2011-2019 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9775e38a6508c67642540e4e86206d2a2df26c3268bf111e48e256e5f575d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mcp-server/src/graph/state.rs:2931-2935 | crates/mcp-server/src/graph/state.rs:3002-3006 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/graph/state.rs:2931\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":2931}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ffc51f54b6b9f053cbc8199bedd49b461c79a4f0d79b10b9074c94560ec189"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mcp-server/src/graph_db.rs:1225-1232 | crates/mcp-server/src/graph_db.rs:1830-1837 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca7b4b754ac24c99b6dd90551555c2dbb5580f7620c121260776d05484e589c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mcp-server/src/state/bootstrap.rs:2013-2018 | crates/mcp-server/src/state/bootstrap.rs:2044-2049 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/state/bootstrap.rs:2013\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f386adebe9375f6bf159746631bf3af908fdeac607d87dece92446e1d23c63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mcp-server/src/state/embed.rs:1576-1580 | crates/mcp-server/src/state/embed.rs:1589-1593 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/state/embed.rs:1576\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdc4b60518d328b89baeead3f5a2d4d9b49f7e7fbfb42be660f3ca47c697e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/mcp-server/src/tools/metadata.rs:969-973 | crates/mcp-server/src/tools/metadata.rs:980-984 | crates/mcp-server/src/tools/metadata.rs:990-997 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/tools/metadata.rs:969\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ca67dcd5f1232909dcaf2a1bf627694cdcf6de338446583f48fbd4f44c3df5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mcp-server/src/tools/platform.rs:1433-1437 | crates/mcp-server/src/tools/platform.rs:1458-1462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/tools/platform.rs:1433\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/platform.rs"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a821e1668f680139412ce389b16b71059c8ca60a3e42db30e025131b74c16d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/stdx/src/fs.rs:240-245 | crates/stdx/src/fs.rs:298-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/stdx/src/fs.rs:240\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/stdx/src/fs.rs:304\u0060 calls \u0060on_progress\u0060 and \u0060crates/stdx/src/fs.rs:246\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/fs.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1af32e516bf3d1069d223e4f53f404c2b6212bc1eea46df8edd312cccc703c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/symbol-info/src/adapters/global_function.rs:65-69 | crates/symbol-info/src/adapters/platform_method.rs:85-89 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/symbol-info/src/adapters/global_function.rs:65\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060docs\u0060 to \u0060Option\u003C\u0026MethodDocs\u003E\u0060 in one and \u0060Option\u003C\u0026bsl_platform::MethodDocs\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/symbol-info/src/adapters/global_function.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cc40b3f4a509184de88d2826fe723ce7682d2bd94f8fc5b592cd3f7b46b6a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/base-db/src/queries.rs:323-327 | crates/hir-def/src/region_tree.rs:147-151 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/base-db/src/queries.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05c62dc3f3cceded430fcb0b8fe24370687c09ae93dafda1b2f1595e4fdee46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/bsl-analyzer/src/bin/cli/source_set.rs:617-623 | crates/project-model/src/lib.rs:2138-2144 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/source_set.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"212e1c5989137892df8dd0405ed5dc2f0b24863d023f86c3d42b54ea2bd181bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-debug/src/module_index.rs:571-576 | crates/bsl-debug/src/types/xml.rs:181-186 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/module_index.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28759b8d1f0dc79978e8f86b71350cef40449524ef618dcaf148da02ff2ba80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/bsl-metadata/src/metadata_object.rs:513-517 | crates/bsl-metadata/src/tabular_section.rs:150-154 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/metadata_object.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf76ee37e8dbb88f5a25b83fb3171b14dd17b00e986b4c9a2cc7e2e0b594651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/hir-def/src/body/lower/expr.rs:1714-1722 | crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs:194-202 \u2014 before extracting anything, compare \u0060crates/hir-def/src/body/lower/expr.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 115 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b262389d469c997ada8e1a4e141a1db7988a9d6e13ef47c6a9f8de74ca8c3b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/hir-def/src/body/lower/query_fragment.rs:260-266 | crates/ide-diagnostics/src/handlers/query_to_missing_metadata.rs:201-207 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/query_fragment.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2835c3ac2b5cd2cfd9db109da82bd93fcee784218dab34591e4bf7cf1ff77570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/hir-def/src/body/lower/query_fragment.rs:282-291 | crates/ide-diagnostics/src/handlers/query_to_missing_metadata.rs:222-231 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/query_fragment.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98b1f330f518bd396db7c4bc322714ee3aff5efafa634eff3c9ea65f2c0ed82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/hir-def/src/graph_index.rs:2214-2223 | crates/ide/src/graph.rs:3239-3248 \u2014 before extracting anything, compare \u0060crates/hir-def/src/graph_index.rs\u0060 and \u0060crates/ide/src/graph.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":2214}}}],"partialFingerprints":{"codehealthFindingId/v1":"617ea2fb03b86a1ba06b35e8630f7392afbdc564dcf2dbcdaa6febf25fe1c5e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/hir-ty/src/narrow.rs:120-125 | crates/ide-diagnostics/src/handlers/timeouts_in_external_resources.rs:223-228 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060body\u0060 to \u0060\u0026Body\u0060 in one and \u0060\u0026hir::Body\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/narrow.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc66353566611b18a33e0afb798e95ad280e9867d75586e1787f7f864cf62de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs:41-51 | crates/ide-diagnostics/src/handlers/ordinary_app_support.rs:72-82 | crates/ide-diagnostics/src/handlers/protected_module.rs:63-72 | crates/ide-diagnostics/src/handlers/scheduled_job_handler.rs:46-56 \u2014 before extracting anything, compare \u0060crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/scheduled_job_handler.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_event_subscription_handler.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5884feb3ff412b8b8daee514641884e0d957d0af727e147735234d89a7facfa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ide-diagnostics/src/handlers/missing_parameter_description.rs:241-250 | crates/ide-diagnostics/src/handlers/missing_returned_value_description.rs:165-174 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/missing_parameter_description.rs:241\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_parameter_description.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb1ab9026271643c98b5721f531a21045b7c0ed4f943039b53f70462bd43c50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ide-diagnostics/src/handlers/nested_constructors_in_structure_declaration.rs:79-86 | crates/ide-diagnostics/src/handlers/number_of_values_in_structure_constructor.rs:79-86 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/nested_constructors_in_structure_declaration.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82e18a47ddfddc9ff36f85acfba6dfd2206f315de4c1213ae0b49c4867166c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ide/src/graph.rs:3323-3332 | crates/mcp-server/src/graph_query.rs:1887-1896 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":3323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c108567ee4fcb81cb3db82ed84f35b113818caef830679b1314207dd97c1b371"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ide/src/partitioned_diagnostics_baseline.rs:1186-1194 | crates/project-model/src/lib.rs:1784-1792 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f5a8b5546562b762e081a48815b4d74255bab95351a877924373a2bd80546e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/bsl-search/src/hybrid.rs:53-61 | crates/bsl-search/src/merge.rs:174-182 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060hit\u0060 to \u0060\u0026SearchHit\u0060 in one and \u0060\u0026MergedHit\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/hybrid.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec2e7b5be95d97bce8b4d45ac1697e9e7f788f869ce10b09afd7d5bbf0fa559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/hir-def/src/body/lower/diagnostics.rs:610-614 | crates/hir-def/src/body/lower/diagnostics.rs:616-620 | crates/ide-diagnostics/src/handlers/double_negatives.rs:121-125 | crates/ide-diagnostics/src/handlers/double_negatives.rs:127-131 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/diagnostics.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"4603524d02a2793a0d7b127f37e6757d061cd8789a3aaeb11842725b1577d47e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/hir-def/src/call_graph.rs:1293-1298 | crates/ide-diagnostics/src/handlers/structure_key_is_not_identifier.rs:128-133 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/call_graph.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bfeda460a5a6907bc5a24d3a1c0cd4db6e0b397178a7c064f508a94eb59002"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/ide-diagnostics/src/handlers/form_data_has_no_metadata_method.rs:83-87 | crates/ide-diagnostics/src/handlers/value_is_filled_of_boolean.rs:123-127 | crates/ide-diagnostics/src/handlers/value_is_filled_of_boolean.rs:129-133 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/form_data_has_no_metadata_method.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca4f635db13df385fdb18eb3cbd6a17f21cd7b8e682c13bbec4349cf6576e3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ide-diagnostics/src/handlers/platform_member_hidden_by_compatibility_mode.rs:53-60 | crates/ide-diagnostics/src/handlers/platform_member_newer_than_min_version.rs:48-55 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/platform_member_hidden_by_compatibility_mode.rs:53\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/platform_member_hidden_by_compatibility_mode.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cb889fd2d255e068d3b20957764e563c657f9979baeef7413f40d22e233891"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ide-diagnostics/src/handlers/query_condition_without_index.rs:25-38 | crates/ide-diagnostics/src/handlers/query_order_by_document_date.rs:25-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/query_condition_without_index.rs:25\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/query_condition_without_index.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3e775395c6ccf46953fc5e8dd93776f95a32f30adf8c03cfe58635d7ca15ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/mcp-server/src/tools/search/gating.rs:137-152 | crates/mcp-server/src/tools/search/gating.rs:170-185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/tools/search/gating.rs:137\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/gating.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"436465286b011492de4ac0ceb9e06935b864c2b80e17bc8ee470a2251754242d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mcp-server/src/graph_db.rs:180-191 | crates/mcp-server/src/graph_db.rs:231-246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb04e3281e4b17c10e9450e7a2ff4cc7b195387075048e9e198ba65ce2bafd4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/ide-diagnostics/src/handlers/cognitive_complexity.rs:39-53 | crates/ide-diagnostics/src/handlers/cyclomatic_complexity.rs:37-51 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/cognitive_complexity.rs:39\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/cognitive_complexity.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dffce6bb8eb34a6eaa372ed4c882d36a874d2ee819128adb1084af48bf5819"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/mcp-server/src/tools/diagnostics.rs:632-645 | crates/mcp-server/src/tools/diagnostics/snippet.rs:418-430 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/tools/diagnostics.rs:632\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcb0b558913a8b604dc255d901c5599282230c21331f223dfdfa3e8f832dad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/mcp-server/src/baseline.rs:1477-1490 | crates/mcp-server/src/baseline.rs:1505-1518 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/baseline.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c460ff45c44802aa47814de3b5c3617cf7633ab993ea6a016032221e9af3eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201313 lines \u00D7 6): crates/bsl-search/src/external_baseline/postgres.rs:3768-3780 | crates/bsl-search/src/external_baseline/postgres.rs:4057-4060 | crates/bsl-search/src/external_baseline/postgres.rs:4088-4091 | crates/bsl-search/src/external_baseline/postgres.rs:4137-4140 | crates/bsl-search/src/external_baseline/postgres.rs:4184-4187 | crates/bsl-search/src/external_baseline/postgres.rs:4237-4250 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/external_baseline/postgres.rs:3768\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/bsl-search/src/external_baseline/postgres.rs:3766\u0060 calls \u0060with_capacity\u0060, \u0060iter\u0060, \u0060enumerate\u0060 and \u0060crates/bsl-search/src/external_baseline/postgres.rs:4057\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":3768}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9afced05dcf999441b76e8cb8744bffc36f2b6e0836a9f05b13476fd444f81e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/bsl-search/src/store.rs:4474-4483 | crates/bsl-search/src/store.rs:4496-4509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:4474\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":4474}}}],"partialFingerprints":{"codehealthFindingId/v1":"986dff0c4d3e72ea963f6e7236c811f71745e04d32e2351fffb6f4d0a61073bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/ide/src/graph.rs:2097-2109 | crates/ide/src/graph.rs:2118-2130 | crates/ide/src/graph.rs:2139-2151 | crates/ide/src/graph.rs:2160-2172 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/graph.rs:2097\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":2097}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb3367c93641b5951bee3b0e112d3d28054b9411ae81b2b5d51242fb644a727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/mcp-server/src/diagnostics_state/lifecycle.rs:1242-1265 | crates/mcp-server/src/diagnostics_state/lifecycle.rs:1413-1436 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/diagnostics_state/lifecycle.rs:1242\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/lifecycle.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f431183a809ce4b68b6503d260e03c4a01dae6080ffd1adaa361bbc9d42eb058"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ide-diagnostics/src/handlers/query_to_missing_metadata.rs:32-44 | crates/ide-diagnostics/src/handlers/unknown_query_function.rs:29-38 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/query_to_missing_metadata.rs:32\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/query_to_missing_metadata.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4f8ef85dd5e0c80b5f729f0bba487cfbdbd59c5e5ee1874077c68199ac5d5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/ide-diagnostics/src/handlers/duplicate_alias_in_query.rs:29-41 | crates/ide-diagnostics/src/handlers/unavailable_alias_in_query.rs:29-40 \u2014 before extracting anything, compare \u0060crates/ide-diagnostics/src/handlers/duplicate_alias_in_query.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/unavailable_alias_in_query.rs\u0060 as WHOLE FILES: 86% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/duplicate_alias_in_query.rs:29\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicate_alias_in_query.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6554f56efd7d0af5baab39b698f415fb09fdf545ae1ff553016d78e2947f0e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ide-diagnostics/src/handlers/order_of_params.rs:60-72 | crates/ide-diagnostics/src/handlers/reserved_parameter_names.rs:73-85 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/order_of_params.rs:60\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/order_of_params.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"969deec231f6191ac4179596b5c6460f7a49350097b9716c24c4a4850778e6b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): crates/ide/src/graph.rs:2097-2109 | crates/ide/src/graph.rs:2118-2130 | crates/ide/src/graph.rs:2139-2151 | crates/ide/src/graph.rs:2160-2172 | crates/ide/src/graph.rs:2187-2199 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/graph.rs:2097\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":2097}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e47e4dc6615d5db819a886456bafb8337e73a45af86b1960c5bcb2825ae4ede"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs:329-341 | crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs:433-445 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"87833feaf28fd2af453b2f789de6df813f6cd2f8dc440d6b316f4c7015f5353d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ide/src/completion/bsl_completion.rs:776-788 | crates/ide/src/completion/bsl_completion.rs:809-819 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/completion/bsl_completion.rs:776\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/bsl_completion.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41eb0883b5f79ddd3f72869b1056cc076c7cad0300fdf2656d4db582531cd7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/bsl-debug/src/module_index.rs:277-288 | crates/bsl-debug/src/module_index.rs:325-336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-debug/src/module_index.rs:277\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/module_index.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"4343eee3f3d6ca239b311ee2ec0776581360ea06004cf34011381c8f96d90504"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/bsl-search/src/external_baseline/postgres.rs:2464-2475 | crates/bsl-search/src/external_baseline/postgres.rs:2560-2571 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/external_baseline/postgres.rs:2464\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b067df951f796c66b744264427f4a368992ba02118b9fa71f962577ab749a52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/ide-diagnostics/src/handlers/magic_date.rs:283-294 | crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs:208-216 | crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs:121-129 | crates/ide-diagnostics/src/handlers/unknown_preprocessor_symbol.rs:36-44 \u2014 before extracting anything, compare \u0060crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs\u0060 and \u0060crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/magic_date.rs:283\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/ide-diagnostics/src/handlers/unknown_preprocessor_symbol.rs:34\u0060 calls \u0060text\u0060, \u0060to_string\u0060, \u0060is_known\u0060 and \u0060crates/ide-diagnostics/src/handlers/magic_date.rs:281\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/magic_date.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d257f6cabb30e055f30a79e332094e87cbe029080c6a7639520751decbf250"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/mcp-server/src/graph_db.rs:1046-1056 | crates/mcp-server/src/tasks.rs:84-95 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/graph_db.rs:1046\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dd048fb09f75eebdd7ec74043c3d05a7b7501639af5b6904a21d864dfd07a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/bsl-search/src/store.rs:2691-2701 | crates/bsl-search/src/store.rs:3071-3081 | crates/bsl-search/src/store.rs:4894-4904 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2691}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4badb16aa436f85a9a135a075d7ccb6a715ada1ee3cbb6012e182defcfd31c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ide-diagnostics/src/handlers/usage_write_log_event.rs:45-55 | crates/ide-diagnostics/src/handlers/usage_write_log_event.rs:56-66 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/usage_write_log_event.rs:45\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/usage_write_log_event.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b495e3ccf92bb91396a184f473c50799efad1bd32439666fa3b1a7cfce23d1bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/bsl-metadata/src/xml_parser/role.rs:113-123 | crates/bsl-metadata/src/xml_parser/subsystem.rs:73-83 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/xml_parser/role.rs:113\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/role.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d34dcd7cf200ede230335f00273125c85118b5e437cb417df9df2dfac8a5dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/bsl-search/src/store.rs:4680-4690 | crates/bsl-search/src/store.rs:5323-5333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":4680}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9d94f96b94856078122f1efa6c44c7aab76ecf40ff23a1b2cda371b79a2fe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mcp-server/src/state/sync.rs:920-929 | crates/mcp-server/src/state/sync.rs:1300-1309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/state/sync.rs:920\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/mcp-server/src/state/sync.rs:919\u0060 calls \u0060extend\u0060, \u0060iter\u0060, \u0060cloned\u0060 and \u0060crates/mcp-server/src/state/sync.rs:1299\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/sync.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"294ed33783c2b2c8fc987d03ba2114c29324c461d17641dcbf0a8201b0307fbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ide-diagnostics/src/handlers/missing_space.rs:210-219 | crates/ide-diagnostics/src/handlers/missing_space.rs:269-278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/missing_space.rs:210\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_space.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e53beaebe246f846fd435e1d721228fba2bc0d1e98046e0f1c194f53944861"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mcp-server/src/tools/debug.rs:475-482 | crates/mcp-server/src/tools/execution.rs:215-224 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/debug.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff286da6c97922f670681ef1c8d5e7e9cbf64156c1d75cdd90cbf17c2669047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ide/src/graph.rs:1365-1374 | crates/ide/src/graph.rs:1376-1385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/graph.rs:1365\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ddf5a161d9aebd89c8951e9fd75e488accdb16cc3c3f0b03518fc827ed1425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/bsl-check-executor/src/native_check/source.rs:53-62 | crates/bsl-check-executor/src/native_check/source.rs:97-106 | crates/bsl-check-executor/src/native_check/source.rs:583-592 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/source.rs:53\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/bsl-check-executor/src/native_check/source.rs:594\u0060 calls \u0060Err\u0060 and \u0060crates/bsl-check-executor/src/native_check/source.rs:63\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4a75bf3e2ed972909cd9af14ca43226ced1d681d788696010df95b9e0b1ad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mcp-server/src/change_hub.rs:5300-5309 | crates/mcp-server/src/change_hub.rs:5480-5489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/change_hub.rs:5300\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5300}}}],"partialFingerprints":{"codehealthFindingId/v1":"786cdb6c330943a10f8b2e08c753312ceffa89348310e15b8846acdb0057719c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/bsl-platform/src/overlay_schema.rs:531-540 | crates/bsl-platform/src/overlay_schema.rs:666-675 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/src/overlay_schema.rs:531\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/overlay_schema.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5869da2d8b9d8432d3c6ed80a638cedf90ad8c89d3d39a824688bb0872244b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mcp-server/src/state/embed.rs:398-407 | crates/mcp-server/src/state/embed.rs:504-513 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/state/embed.rs:398\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"03871a99ee52dcc8ac7af3fda77a96b459f6cc82ded1f8108f80d384239de2c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/bsl-check-executor/src/native_check/profile.rs:132-140 | crates/bsl-check-executor/src/native_check/profile.rs:2773-2781 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/profile.rs:132\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b8f72f52c1dfb09f24ff1f260c34ffca30acc8f47cd07540846bb00c3ac55a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mcp-server/src/cache.rs:312-320 | crates/mcp-server/src/cache.rs:329-337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/cache.rs:312\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/cache.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"64db10e28c4ad38f009becdfffc4930c13ad1645f2350b33c48bb9a919d2fbc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/mcp-server/src/tools/metadata.rs:560-568 | crates/mcp-server/src/tools/metadata.rs:571-579 | crates/mcp-server/src/tools/metadata.rs:582-590 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/tools/metadata.rs:560\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edb7d01584639eaa12bf78255eb2d5e942ec0918c666a5fc95bf524706b6ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/bsl-analyzer/src/mcp_install/adapters.rs:250-258 | crates/bsl-analyzer/src/mcp_install/adapters.rs:483-491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/mcp_install/adapters.rs:250\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mcp_install/adapters.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86c85c6767143d47532a30031e311c875cc6c9f200b1492225cfb06d9a5b9b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/bsl-platform/src/overlay_schema.rs:152-160 | crates/bsl-platform/src/overlay_schema.rs:185-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/src/overlay_schema.rs:152\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/overlay_schema.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04578ccd5bc138cc3979260185997cf138f9bc02f6f43b99231c03f8dd6a24a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/bsl-check-executor/src/native_check/profile.rs:708-716 | crates/bsl-check-executor/src/native_check/profile.rs:1128-1136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-check-executor/src/native_check/profile.rs:708\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"3729b22e49e3434bbfee9505e70168efe6858ad82ab81e6df9c682d07991abba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ide-diagnostics/src/handlers/incorrect_line_break.rs:122-130 | crates/ide-diagnostics/src/handlers/incorrect_line_break.rs:143-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/incorrect_line_break.rs:122\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/incorrect_line_break.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d3b298e8ee14c6dd39f141d837bdbfba42bf65e4baca3ce9f2e9ab0dd52503"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/bsl-debug/src/types/xml.rs:385-393 | crates/bsl-debug/src/types/xml.rs:440-448 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-debug/src/types/xml.rs:385\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e87d65eb67e37b2245b7ed804a3f0584738770c5c429bc05378516da243d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/ide/src/partitioned_diagnostics_baseline.rs:644-652 | crates/ide/src/partitioned_diagnostics_baseline.rs:1055-1063 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/partitioned_diagnostics_baseline.rs:644\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"7befbc1ca6039ed59cc66610ae28b87db0bc0a99d49990ddf3f3dcbabe78845d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/mcp-server/src/tools/metadata.rs:477-484 | crates/mcp-server/src/tools/metadata.rs:487-494 | crates/mcp-server/src/tools/metadata.rs:497-504 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/tools/metadata.rs:477\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c31eccea1b95a2ecf6d51c7a57780a1e055442b1267031d62c8843f9828a08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/bsl-debug/src/types/responses.rs:183-190 | crates/bsl-debug/src/types/responses.rs:278-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-debug/src/types/responses.rs:183\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/responses.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"376f3436d52981e79f5d26308739cb7c02207437a710cbf3b3453747adf26a52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/bsl-platform/src/overlay_schema.rs:348-352 | crates/bsl-platform/src/overlay_schema.rs:540-547 | crates/bsl-platform/src/overlay_schema.rs:675-682 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/src/overlay_schema.rs:348\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/overlay_schema.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d728ee50d201f5d87a8a92e655bea798bf0531fcfdc8f44462b580a4ff6cc1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/bsl-metadata/src/metadata_object.rs:1149-1156 | crates/sdbl-hir/src/types.rs:308-315 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/metadata_object.rs:1149\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/metadata_object.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f3181333fbe5e61b78a899b166c259116d60a3839630be66a2dc0df0fdb5a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/ide/src/graph.rs:3129-3135 | crates/ide/src/graph.rs:3142-3149 | crates/ide/src/graph.rs:3156-3162 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/graph.rs:3129\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":3129}}}],"partialFingerprints":{"codehealthFindingId/v1":"271e20a7e458e385773271dd63fa47765065ce1e739b0a64d1d91f1d12b11de0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/bsl-metadata/src/xml_parser/enum_parser.rs:18-24 | crates/bsl-metadata/src/xml_parser/subsystem.rs:29-33 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/xml_parser/enum_parser.rs:18\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/enum_parser.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5dd89c49a99ba415cce7c045099adc5c41da7412ac6ec4febf5a15e6ee7a69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:151-157 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:1499-1505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:151\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c07e723415fa866788c1676ec1d5c6dcf43c259e2e60bbc8ec5463333c113da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:466-472 | crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:479-483 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs:466\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7eebadf1188c87f9d116c7d0bf4a924a38915388e4b42ac9e9538177c30afc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/bsl-launcher/src/provider/server.rs:72-78 | crates/bsl-launcher/src/provider/server.rs:87-93 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-launcher/src/provider/server.rs:72\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-launcher/src/provider/server.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d609247949ab780fe508ea883ed5bb1873812c6bbd2c35bf12b93871e90619"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ide/src/hover.rs:386-392 | crates/ide/src/hover.rs:395-401 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/hover.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ae8c6ae43d0f33450e2920847d37ac7344d2efcdafd4203adf1b1e0f377d9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/bsl-metadata/src/xml_parser/constant.rs:22-28 | crates/bsl-metadata/src/xml_parser/enum_parser.rs:39-45 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/xml_parser/constant.rs:22\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/constant.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3a555343c0e65a3b266936a84bc660752f9333f1fb549ce2563815742bcbdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/bsl-metadata/src/configuration.rs:199-205 | crates/bsl-metadata/src/configuration.rs:206-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/configuration.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a24170fe81a222e7acd26ef4620a8e15f88bf1d783718a5fc012d12146b9ec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-check-executor/src/native_check/profile.rs:124-130 | crates/bsl-check-executor/src/native_check/profile.rs:2766-2771 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"510fe3da778de5b48be20ea8088b5e53617bea663c1dbf7b8be25803a38e2097"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/bsl-metadata/src/xml_parser/form.rs:39-45 | crates/bsl-metadata/src/xml_parser/predefined_parser.rs:31-35 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/xml_parser/form.rs:39\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/form.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"076dbffcb26783424d7475302ee074b8b22c4b209197ce6b596f614d1b683f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/mcp-server/src/lib.rs:1527-1533 | crates/mcp-server/src/lib.rs:2955-2961 | crates/mcp-server/src/lib.rs:3052-3058 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mcp-server/src/lib.rs:1527\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":1527}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a74c82d256b9e398fe0993df600a54a6b94c686df906fc218749c8e0555320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/bsl-analyzer/src/task_pool.rs:117-123 | crates/bsl-analyzer/src/task_pool.rs:135-141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/task_pool.rs:117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/task_pool.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"45318da6c44a7879140627936a5654fc34b4d6a9d74768b508623688597ee0f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/bsl-search/src/external_baseline/postgres.rs:1144-1150 | crates/bsl-search/src/external_baseline/postgres.rs:2453-2459 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/external_baseline/postgres.rs:1144\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ea5c466068c61823146e4a1d6b55773f11cea74d34820d71e312f1d4513271"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/bsl-analyzer/src/mcp_install/adapters.rs:502-508 | crates/bsl-analyzer/src/mcp_install/adapters.rs:540-546 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-analyzer/src/mcp_install/adapters.rs:502\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mcp_install/adapters.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"de383288706a80644d3892cd7d813f201de51013f8df68b6c091c42065e16736"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/bsl-metadata/src/xml_parser/common_module.rs:14-18 | crates/bsl-metadata/src/xml_parser/register.rs:36-41 | crates/bsl-metadata/src/xml_parser/role.rs:12-16 | crates/bsl-metadata/src/xml_parser/scheduled_job.rs:9-13 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/common_module.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c031f01a3a3e4f26847be01f1bc600152c5fd206fc246bcbb287b346fcf10532"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:68-72 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:550-555 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:68\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1366bd07153cdbad01585cc01ad8ca8682e9c462e9032e795be6a8a1c7173c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 4): crates/ide/src/graph.rs:3088-3092 | crates/ide/src/graph.rs:3104-3108 | crates/ide/src/graph.rs:3109-3111 | crates/ide/src/graph.rs:3121-3126 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/ide/src/graph.rs:3108\u0060 calls \u0060next\u0060, \u0060ok_or_else\u0060 and \u0060crates/ide/src/graph.rs:3092\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":3088}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b0a990c38ccb189a842a73370497cad0674b7d678c4884579390cee70413fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:548-553 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:634-639 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:548\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0552b74185039470a8304afd70cc51ddc554c6f43fec7be6077420744b4f4b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/hir-def/src/item_tree/lower.rs:76-92 | crates/hir-def/src/item_tree/lower.rs:110-126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/item_tree/lower.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5a9023477ef71a673ad66eed9f0b298b5535805a115cfb9a115e368897f6cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/bsl-search/src/store.rs:5478-5482 | crates/bsl-search/src/store.rs:5485-5490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/store.rs:5478\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":5478}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc3966b36a2b91537f00cd0e22e9c1298f774da992180df03d8d88a3a67830d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:65-70 | crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:100-105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-platform/tools/html-parser/src/scraper_parser.rs:65\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b3ef197df1d3c39e5f0edbf7fa06b79a4a9b27e15cf8894fd8f1b00d43fa51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ide-db/src/queries.rs:620-625 | crates/ide-db/src/queries.rs:657-662 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-db/src/queries.rs:620\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/queries.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c1fdcb9e70900d6db17152c2d149acf79c7970f6bf2a4185aef4afad65d909"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/bsl-search/src/external_baseline/postgres.rs:1136-1141 | crates/bsl-search/src/external_baseline/postgres.rs:1579-1584 | crates/bsl-search/src/external_baseline/postgres.rs:1624-1629 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/external_baseline/postgres.rs:1136\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"feec8a507bdc2b5933047262bee68772a709324d4d27fb2d1f6e5c1c6b51daef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/ide/src/partitioned_diagnostics_baseline.rs:654-659 | crates/ide/src/partitioned_diagnostics_baseline.rs:1065-1070 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide/src/partitioned_diagnostics_baseline.rs:654\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b986d931b8905548c642f75922b3948c598ef22c05155e22eb8edff4caff1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/bsl-metadata/src/xml_parser/http_service.rs:28-32 | crates/bsl-metadata/src/xml_parser/http_service.rs:43-47 | crates/bsl-metadata/src/xml_parser/web_service.rs:27-31 | crates/bsl-metadata/src/xml_parser/web_service.rs:42-46 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/xml_parser/http_service.rs:28\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/http_service.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"85683eb0c497ef04de74b99294e3b34016d5b6e18d0e425bc8e2370c29c0d284"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/hir-def/src/graph_index.rs:1168-1174 | crates/mcp-server/src/graph/byte_budget.rs:44-50 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/graph_index.rs:1168\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/hir-def/src/graph_index.rs:1167\u0060 calls \u0060collect\u0060 and \u0060crates/mcp-server/src/graph/byte_budget.rs:43\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f890ebf547b854d2e912110a824e41f35afa21351a09f522a27e07d4394052"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ide/src/graph.rs:3136-3140 | crates/ide/src/graph.rs:3150-3154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":3136}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a06069213b26a786430ee63d359b5056225b40b483bf6953e751e3880f546c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/bsl-search/src/engine.rs:577-581 | crates/bsl-search/src/engine.rs:1079-1083 | crates/bsl-search/src/engine.rs:1147-1151 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/bsl-search/src/engine.rs:575\u0060 calls \u0060validate\u0060 and \u0060crates/bsl-search/src/engine.rs:1077\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5c5766763f2b040b379e61085a1fc85de4ea00df510e5a356434122aafbacc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/bsl-metadata/src/xml_parser/form.rs:64-68 | crates/bsl-metadata/src/xml_parser/form.rs:82-86 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-metadata/src/xml_parser/form.rs:64\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/form.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5616e21e920444aa2c80cada6e02c643ccad52d3fa9c4ee6930fd24eb4cf906c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/bsl-search/src/engine.rs:1289-1293 | crates/bsl-search/src/engine.rs:3057-3061 | crates/bsl-search/src/engine.rs:6379-6383 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:1289\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60500e2d2c9e24c8f09e61ff3438e0ab23f32186363ed944db6c867c13bff00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/bsl-search/src/engine.rs:2309-2313 | crates/bsl-search/src/engine.rs:5092-5096 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-search/src/engine.rs:2309\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2309}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0632417a2ff29d492843c5ea5c904382916d8ccc54d2430677ef41142644cda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/bsl-types/src/builders.rs:93-97 | crates/bsl-types/src/builders.rs:107-111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/bsl-types/src/builders.rs:93\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/builders.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"559f3ee654cbcd0eb3d4baf0d2c082ed32efa84a52412047a5d9d5b6a283745c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/hir-def/src/graph_index.rs:2449-2454 | crates/ide/src/graph.rs:1819-1824 \u2014 before extracting anything, compare \u0060crates/hir-def/src/graph_index.rs\u0060 and \u0060crates/ide/src/graph.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-def/src/graph_index.rs:2449\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfa1cc83a5d47798f50c9ca3abaf127b98612d9ad72db72b98a5f84f42e0fd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/hir-ty/src/this_object_attr.rs:27-31 | crates/hir-ty/src/this_object_attr.rs:40-44 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hir-ty/src/this_object_attr.rs:27\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/this_object_attr.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0454f34c6bf2e3c64372beb206017bd3680d239f40400f9793acc1238338af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/ide-db/src/database.rs:2195-2201 | crates/ide-db/src/database.rs:2259-2265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0233adaedc406ef7dd041ecca947ffa17a154f3cbf3fb12e01eeb23dda4701"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ide-db/src/provider.rs:188-192 | crates/ide-db/src/salsa_provider.rs:198-202 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-db/src/provider.rs:188\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/provider.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e351f0696e0e9fe2ae79db25c2bd60ce9747985f15d13a686bc3d7f4413ff776"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/ide-diagnostics/src/handlers/magic_date.rs:97-101 | crates/ide-diagnostics/src/handlers/magic_date.rs:107-111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/ide-diagnostics/src/handlers/magic_date.rs:97\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/magic_date.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6845e318f34dd5c855098ccb9c26169b87e06b8cb7d32984d947b7abe7ab9a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/project-model/src/lib.rs:1362-1366 | crates/project-model/src/lib.rs:1430-1434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/project-model/src/lib.rs:1362\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"e581114edd5e80cf3727ed7c206b101dc277f666f0fb50f3b23415adfee8320d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/sdbl-hir/src/lower/expr/mod.rs:74-78 | crates/sdbl-hir/src/lower/expr/mod.rs:576-580 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sdbl-hir/src/lower/expr/mod.rs:74\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/expr/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3ec621af9260c8c6ae2300149764a58174b3c1597eeaac18123bbe5d5ef097"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/user2/runtime_acceptance.py:413-420 | scripts/user2/runtime_acceptance.py:421-428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user2/runtime_acceptance.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e99ef476e1a0e8cc9540c26d4abe273a02f87f8d225cd3986ecd7980c38adfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/user2/runtime_acceptance.py:127-131 | scripts/user2/runtime_acceptance.py:189-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user2/runtime_acceptance.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41480f3796b5d75f6d72384d8ad04355e4e9e2a27914a5150d3a779c8ab7de8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): scripts/graph_ready_probe.py:28-42 | scripts/perf-nightly/scenarios.py:748-758 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/graph_ready_probe.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a7e4e2e36531bc058d0996c414bd23aa862e61f404839f62a5cc667b489955"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): scripts/lsp-bench/bench_lsp.py:47-51 | scripts/perf-nightly/common.py:32-36 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lsp-bench/bench_lsp.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5eaed10dce820ee382cf5a3299e3cf6df29642269eb667c519e205004c6fc09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): scripts/perf-nightly/gate.py:146-150 | scripts/perf-nightly/perf_nightly.py:154-171 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf-nightly/gate.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f296530cddc7be4f93cc928e73d46e3c022d0d3015b366ac55d3a41c964cc930"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): scripts/lsp-bench/bench_lsp.py:393-401 | scripts/perf-nightly/scenarios.py:371-379 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lsp-bench/bench_lsp.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"823fba5c220ff6b56681c764a63fec2da1a19711966400708d673f513827785f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/bsl-analyzer/src/bench/runner.rs:484-495 | crates/bsl-analyzer/src/bench/runner.rs:525-536 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bench/runner.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"5649904f65b4113eb9b5e87b0e0ecd38233866064aea02f9498ee90651c5736e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/test-fixture/src/cfe.rs:147-151 | crates/test-fixture/src/cfe.rs:177-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/test-fixture/src/cfe.rs:147\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/test-fixture/src/cfe.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"458dcaaa9fb20531e1cffb1547e7d0aa285f1cfdd50b65cdcc42a65846965537"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): scripts/lsp-bench/bench_lsp.py:683-697 | scripts/lsp-bench/bench_lsp.py:729-743 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/lsp-bench/bench_lsp.py:683\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lsp-bench/bench_lsp.py"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"753c316cd6d5248e97b892cfdf83d7e81d5bb2d01cd42d984efcbe373da55996"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/perf-nightly/perf_nightly.py:459-466 | scripts/perf-nightly/perf_nightly.py:489-496 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf-nightly/perf_nightly.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a913650f9cff5b4eb219e250fa48edef6c00d0107c23b5aa59c45388585c97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/perf-nightly/gate.py:476-481 | scripts/perf-nightly/scenarios.py:1134-1139 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf-nightly/gate.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f3d811eda1bc5a687157410a58f73db64e3598ebcdb15bf86e1d716bd6cc45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/perf-nightly/gate.py:1554-1558 | scripts/perf-nightly/gate.py:1616-1620 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf-nightly/gate.py"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b42d7366298e923223e88a92eaf79a4010c362ebc0a41b67f06dc5a68d3771d"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project hir-ty: hir-ty has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"db6d6d9c8e5a7d831e1de63242a499cc71c1e5d9a30d19468d2dc63d144b0618"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project ide: ide has instability 0.85 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f20100be290615894111de6ae29fb9f6097942ce93566bea4eebaa62687796ac"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project ide-assists: ide-assists has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4826e684fb627a631dfc72819b5d30307e2c1d98d24c54d58b0098c0e500371b"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project ide-diagnostics: ide-diagnostics has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"19cec4b69fae8522d6e7d35c8e61fa9ac9bd1238768617f2e5b1213b00c30a99"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project ide-host-core: ide-host-core has instability 0.82 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f5e7fa039593ad200c802524ca967c12d8bf0fd0a2ee69a3f56495b973f9801b"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project mcp-server: mcp-server has instability 0.95 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e293a37efb53008d89f60bd738e7b17b1e49d011b1d8587ab326319375a7a5"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project symbol-info: symbol-info has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4567e385a9b0f1f0df94a619d05a97ae25a4216b678f61c8dfffa1bbe1423a9f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: html-parser: html-parser: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"33fd042d346879c9369241659c95ba8e0ccab891f1cf1dab9a46f74df847ca23"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: lexer: lexer: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5f20052d615de9a0258dad4c534805945f207114219a1be8114156bfa849eae3"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: onec-client: onec-client: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"00fc97db40c915b3670272627794ee14e332679cee4709ccb01bbae588be2ae4"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: paths: paths: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd9e65cfa92adf9a430f37c153a1e24323e61b875b378811b4280cfda9207fd8"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: profile: profile: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8d7185b755b4a6faa9cef4e6a8e759bf93b801d410563808b759e3a73953041d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: bsl-platform: bsl-platform: abstractness 0.00, instability 0.07, distance 0.93 \u2014 zone of pain \u2014 concrete and depended on by 14 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"133480904e6ce528ca48d78748f3c75d5f36e423ac95b454d16512fb76c31f2c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: naparnik: naparnik: abstractness 0.09, instability 0.00, distance 0.91 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"af2424618d55c0d2974ec0e310034ef192f2ec964618dfc055ed007f4a7abbfa"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: stdx: stdx: abstractness 0.12, instability 0.00, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 23 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2a6d25a78eda0cac573cabc65708240efc83ccab8d554c2a5c3a7902480788fd"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: syntax: syntax: abstractness 0.02, instability 0.11, distance 0.87 \u2014 zone of pain \u2014 concrete and depended on by 16 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9a1d8696b4fab1d56db280a7cbaba5745a25152ab117bca8d56bdf95cf511b7b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: bsl-config: bsl-config: abstractness 0.00, instability 0.14, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"caae539f03e090b0cdd599019d5207c2a5d64d683cfa2550b45243cd8f99e54b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: cfg-types: cfg-types: abstractness 0.14, instability 0.00, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0df2a933e2eccf95d62d062008d942d2916c235a3450a2388b4c72cdfc8daa45"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: intern: intern: abstractness 0.00, instability 0.14, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"717664a54ed31aded58f163d82ae0c949d09a931788d8a9e28fbcd368a76c057"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: vfs: vfs: abstractness 0.10, instability 0.13, distance 0.77 \u2014 zone of pain \u2014 concrete and depended on by 13 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"efd3f8997e98b79dc9f67c67f83d969cb7ddf98def8505f0678178c3e98a0377"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: bsl-conventions: bsl-conventions: abstractness 0.25, instability 0.00, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 14 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7775ade8c099d392a0607aaec31ca66bbab35bab83793728404dede7f67f8796"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: line-index: line-index: abstractness 0.25, instability 0.00, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c33d1fb1d8aeecf6f3673fcf8ba941761491c4cfb39ecfafcbbf55e413a95738"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: bsl-metadata: bsl-metadata: abstractness 0.05, instability 0.21, distance 0.74 \u2014 zone of pain \u2014 concrete and depended on by 15 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4d9137c357003af828a3cca955cf7f9bf87ca75593014443de6e101ff9698a39"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RootDatabaseImpl (LCOM4 30): RootDatabaseImpl\u0027s methods fall into 30 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 30 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c9e8640341364a8ecd759cb19d693fe3efeda3f729e987f765b48fb2a84225"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PlatformDataInner (LCOM4 8): PlatformDataInner\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/db.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a340c423bc988e9229dad4ab8d276a5f57f739348d26c35535fa5f0f7eb93c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: McpServer (LCOM4 5): McpServer\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a987454e329cf8d03ebc9dcef95331b7007a286356d6c1b682778dde8e5cb309"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LoweringCtx (LCOM4 4): LoweringCtx\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/mod.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"952e8ec97f8e2d436d6779cd2552c76956c7a82a0f0ed41f73c145ad9599e359"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/hir-ty/src/infer.rs: crates/hir-ty/src/infer.rs changed 89 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in InferenceContext::infer_call at line 4963. 52 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-ty/src/infer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4963}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ce722e69ab0d8a908ceaddb2f89f0aef9d411c83651613a7e8f5703fc055d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-analyzer/src/server.rs: crates/bsl-analyzer/src/server.rs changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in bsl_analyzer::server::handle_task at line 1243. 26 of those changes were fix/bug commits, and the other 28 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-analyzer/src/server.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2cfe6f87a750000fa0b7a05893007f24f57449692362ddd042aae166aa812c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-analyzer/src/bin/cli/analyze.rs: crates/bsl-analyzer/src/bin/cli/analyze.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in bsl_analyzer::bin::cli::analyze::analyze_salsa at line 356. 18 of those changes were fix/bug commits, and the other 20 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-analyzer/src/bin/cli/analyze.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8446aa2f24ec5ce843d11253f0352e95ce2aec6e4acf8dfa34d44d57868b164"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/state/bootstrap.rs: crates/mcp-server/src/state/bootstrap.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in SharedState::init_workspace_search_engine at line 2265. 20 of those changes were fix/bug commits, and the other 27 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/state/bootstrap.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cf6c0d6d0b2e673954fc97864db3c2a3cabb5d1eb4a83a0e2712d904fddd62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/state/embed.rs: crates/mcp-server/src/state/embed.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in SharedState::spawn_embed_pass at line 1284. 18 of those changes were fix/bug commits, and the other 30 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/state/embed.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"634a585a6f2ee58670c1d1381a727d9abdea0c6691ab2c2dc8639093307bd39c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/state/mod.rs: crates/mcp-server/src/state/mod.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in SharedState::workspace_indexing at line 860. 12 of those changes were fix/bug commits, and the other 23 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/state/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/mod.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6c714cec4be8b0a38e61f935088cd20066d97f2ba44404e439f359bbc1879a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/lib.rs: crates/mcp-server/src/lib.rs changed 65 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in McpServer::graph at line 2145. 26 of those changes were fix/bug commits, and the other 39 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f4e233a813631b1f26ab60266c1d2349d7772ee29479de85d056f3106593ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-search/src/engine.rs: crates/bsl-search/src/engine.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in SearchEngine::run_embedding_pass_owned at line 2014. 14 of those changes were fix/bug commits, and the other 24 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-search/src/engine.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"95df04e9b301130c01b481526ccbf35a0dee4deef9b9be92f7e5b7399aab9694"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/state/sync.rs: crates/mcp-server/src/state/sync.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in SharedState::spawn_search_sink at line 318. 10 of those changes were fix/bug commits, and the other 28 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/state/sync.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/sync.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3110e649945ff0cf942e549e5758d3cc1ea8e35483032017c5abfb6554d62e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/graph/state.rs: crates/mcp-server/src/graph/state.rs changed 62 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in GraphState::drive_as at line 1094. 19 of those changes were fix/bug commits, and the other 43 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/graph/state.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"3611597149a47ed8f26103eea3776f4e22396df7312466b1daf00158bf9bfd1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/hir-def/src/body/lower/expr.rs: crates/hir-def/src/body/lower/expr.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in hir_def::body::lower::expr::lower_call_expr at line 385. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-def/src/body/lower/expr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0680e6e7595122e205e6d9bf8d8b245b2a0c6d4541b461e6c81ec61569001f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/tools/search/status.rs: crates/mcp-server/src/tools/search/status.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in mcp_server::tools::search::status::search_status_with_cap at line 226. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/tools/search/status.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/status.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"522be5f2e1a53e8080ecb6532c17f158afe6a9c83d9f54da8fe4ae2d7bc7975b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-analyzer/src/workspace.rs: crates/bsl-analyzer/src/workspace.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in GlobalState::process_changes at line 289. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-analyzer/src/workspace.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/workspace.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77c81dabfda0a3c6dd5bcc76ae013999a82b3c30e13570db97694d36b53abbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/change_hub.rs: crates/mcp-server/src/change_hub.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in mcp_server::change_hub::run_hub_thread at line 4678. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/change_hub.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":4678}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b96b4e119d8cf06d31d01793ccf2cb8c92fa6c420ac4c046083c3711698b8be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/project-model/src/lib.rs: crates/project-model/src/lib.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Project::diagnostics_baseline_partition_plan at line 822. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/project-model/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"91553f32b0f14b3e2c47c4a63ee7fb28d015d5a0266d99413ef0219337468336"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/diagnostics_state/resident.rs: crates/mcp-server/src/diagnostics_state/resident.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in DiagnosticsResident::workspace_aggregates at line 805. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/diagnostics_state/resident.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/resident.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d3adf1136d53050630a39adcc83a9222e95d28585e11f7b02d1132efb3cf84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/graph/snapshot.rs: crates/mcp-server/src/graph/snapshot.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in GraphStore::checkout_with_admission_wait at line 404. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/graph/snapshot.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/snapshot.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"604c793318c3260a5a8fec2a68d1669d5d87dea461d90526e0f66bdf71ed74c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/workspace_lease.rs: crates/mcp-server/src/workspace_lease.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in WorkspaceLease::publish_checkpointed_inner at line 896. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/workspace_lease.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/workspace_lease.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde40a5610229283a7427a29f78d91dffaabf936c2cac0254a2f0a368eedd1b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-search/src/workspace_overlay.rs: crates/bsl-search/src/workspace_overlay.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in WorkspaceOverlayCache::full_refresh_from_manifest_scanned at line 1441. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-search/src/workspace_overlay.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"598e9fc5c3eb3ce1c8d587f26c03399f530a80f179cb01f1d5dcd08c043b0fcb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-search/src/store.rs: crates/bsl-search/src/store.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Store::reindex_file_in_collection_checkpointed_with_reuse at line 2555. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-search/src/store.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a484d6636724102192af57c540e2ba2f653c467f08c41ac68ca09c620413253"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/broker/daemon.rs: crates/mcp-server/src/broker/daemon.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in mcp_server::broker::daemon::serve_shared at line 171. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/broker/daemon.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/broker/daemon.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"098358f38e748da4c4d8b5040c70e14b90c381e50f61b3113b37689942d3bf05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/graph_db.rs: crates/mcp-server/src/graph_db.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in mcp_server::graph_db::compute_body_patch_with_metadata at line 1727. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/graph_db.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0eb08ed2eeda2344666c4efabe1f0168999c1b046ef9fb6096f1e4137f6bef8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/hir-ty/src/subtype.rs: crates/hir-ty/src/subtype.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in hir_ty::subtype::is_assignable at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-ty/src/subtype.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/subtype.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e363b5bd456704b209cc73f9d590523f2eaf4db8e6d75b24c2823cc859319c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/tools/diagnostics.rs: crates/mcp-server/src/tools/diagnostics.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in mcp_server::tools::diagnostics::file_findings at line 409. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/tools/diagnostics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2cc49a524e7cbf2ccc4b63ff1a266c5651e42460709dc410099b4527e0bb1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-analyzer/src/handlers/notification.rs: crates/bsl-analyzer/src/handlers/notification.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in bsl_analyzer::handlers::notification::handle_did_close at line 510. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-analyzer/src/handlers/notification.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/notification.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fdbc4b5e74b1375d62b36dd02392c8b41eee3515f60bcdb1c4cd1cc7129a56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vfs-notify/src/lib.rs: crates/vfs-notify/src/lib.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in NotifyActor::load_entry at line 442. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/vfs-notify/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b19b607c2e1eb434ab4f2d66a7bbbde95306bbee51394f1be9e1309f890544b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-platform/src/db.rs: crates/bsl-platform/src/db.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in PlatformDataInner::from_help at line 145. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-platform/src/db.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/db.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d631b3ef10d1796470c3d0a85dac6267ba09020c65bd56cb3b091380c593d51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/diagnostics_state/drift.rs: crates/mcp-server/src/diagnostics_state/drift.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in DiagnosticsState::retry_holes_in at line 525. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/diagnostics_state/drift.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/drift.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a702640834a6b7ebc40dc12d0e58e46258d20eea904d623b78f21594dede67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide-diagnostics/src/handlers/unused_parameters.rs: crates/ide-diagnostics/src/handlers/unused_parameters.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ide_diagnostics::handlers::unused_parameters::check at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/unused_parameters.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_parameters.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"224ba15416cfda94879ed2d40aee0494a609d113a355fc4a6d746930e0764612"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide-diagnostics/src/handlers/unused_local_method.rs: crates/ide-diagnostics/src/handlers/unused_local_method.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in ide_diagnostics::handlers::unused_local_method::collect_called_methods at line 132. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/unused_local_method.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_method.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d386a838ed2fc8e1da6b9e14eba200e98060a1329230c6f21f50b8d2f1c95a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/sdbl-hir/src/lower/expr/mod.rs: crates/sdbl-hir/src/lower/expr/mod.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in LoweringContext::lower_function_call at line 282. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/sdbl-hir/src/lower/expr/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/expr/mod.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0ffc08ba24c16abf8024bdad457352f881a3c75a5312c9f8cd20fa496f3f7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/sdbl-hir/src/lower/from_clause.rs: crates/sdbl-hir/src/lower/from_clause.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in LoweringContext::lower_table_ref at line 181. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/sdbl-hir/src/lower/from_clause.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff31569a2121273cb49b5dc4433980dfd0a09acce60c4f4b83e28e3cf7c087a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-analyzer/src/bin/cli/lsp.rs: crates/bsl-analyzer/src/bin/cli/lsp.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in bsl_analyzer::bin::cli::lsp::relay_lsp at line 382. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-analyzer/src/bin/cli/lsp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/lsp.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e463f5e4f1f961aa15878815332a02ffee02ce46e75e6e971e8e8668b725ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-analyzer/src/handlers/dispatch.rs: crates/bsl-analyzer/src/handlers/dispatch.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in RequestDispatcher::on_latency_with at line 231. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-analyzer/src/handlers/dispatch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5c5be640950f909342c7495a41a8d48887d21c9ae4ebcd60aceb3070e421b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide-diagnostics/src/config.rs: crates/ide-diagnostics/src/config.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ide_diagnostics::config::parsed_override at line 393. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/config.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb875d26f3c02d2aa615d76369a05cfd6b93d099652299a419655efc026c2a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/state/overlay_retry.rs: crates/mcp-server/src/state/overlay_retry.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in OverlayRetry::run at line 305. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/state/overlay_retry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/overlay_retry.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f70279ae5294fb503489a0796df5db8ecd5442c08d4847988d20ea113719861"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-analyzer/src/handlers/request.rs: crates/bsl-analyzer/src/handlers/request.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in bsl_analyzer::handlers::request::handle_code_action at line 1360. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-analyzer/src/handlers/request.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"388021937ba27c555b78310fa4672a34c07075942226157508a32c3f7a292d35"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-analyzer/src/bin/cli/mcp.rs: crates/bsl-analyzer/src/bin/cli/mcp.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in bsl_analyzer::bin::cli::mcp::validate_serve_args at line 655. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-analyzer/src/bin/cli/mcp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/mcp.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e71d861b21fb3fdfabbd20f54fd5aff80635d151f3ba721d7f26e141c74dadf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide/src/graph.rs: crates/ide/src/graph.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ide::graph::build_workspace_graph_rows at line 1112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide/src/graph.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3e84616f30aa5829f0f15fb6e35165c7fe83c697480c1b6cdae5aea9f44704"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/hir-ty/src/field_lookup.rs: crates/hir-ty/src/field_lookup.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in hir_ty::field_lookup::lookup_field_raw at line 155. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-ty/src/field_lookup.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/field_lookup.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b4c1d083fb77fd551faf02490c1d29a877c3ee34234d7a7d12eea6102e6c28"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide-diagnostics/src/hir_inference_dispatch.rs: crates/ide-diagnostics/src/hir_inference_dispatch.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in ide_diagnostics::hir_inference_dispatch::dispatch_inference_diagnostic at line 139. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/hir_inference_dispatch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/hir_inference_dispatch.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"45847697a107ad2352e0e13d114c6b3bdaa968fe350ec21a0281b6c87af223c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-metadata/src/xml_parser/form.rs: crates/bsl-metadata/src/xml_parser/form.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in bsl_metadata::xml_parser::form::parse_form_xml at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-metadata/src/xml_parser/form.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/form.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd497c41c636415377e26b9c60e2454dce334ce764c5d7ac3c87757590b6203d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/tools/search/semantic.rs: crates/mcp-server/src/tools/search/semantic.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in mcp_server::tools::search::semantic::semantic_code_hits at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/tools/search/semantic.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/semantic.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a05b0173cb340d7cb35c7fda8dbfd8129157bd21f81c92a276b961ce6ac026"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/sdbl-hir/src/hir.rs: crates/sdbl-hir/src/hir.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in sdbl_hir::hir::collect_expr_objects at line 304. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/sdbl-hir/src/hir.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb35013474b4e5125b4dd4a52180f6fad818fa51bb9e73595fb7ec70b38ac7ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-types/src/display.rs: crates/bsl-types/src/display.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in bsl_types::display::render at line 107. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-types/src/display.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/display.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fb8a39767fcb14d12a9f96fca28806508846b520f4385ea1b80c6c355629a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/hir-ty/src/field_enum.rs: crates/hir-ty/src/field_enum.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in hir_ty::field_enum::enumerate_projected_fields at line 82. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-ty/src/field_enum.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/field_enum.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f8f334919db500e450c18769cdcce7bccff8ee9575b82b1baa16324434c853"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/sdbl-hir/src/lower/diagnostics.rs: crates/sdbl-hir/src/lower/diagnostics.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in NullableUses::walk at line 1191. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/sdbl-hir/src/lower/diagnostics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cca0b088b7cd68c29e9bdcea83de63d2fa0275ac85c6ef0e5b9adabe466b38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/perf-nightly/gate.py: scripts/perf-nightly/gate.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in gate.write_report at line 1452. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- scripts/perf-nightly/gate.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf-nightly/gate.py"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"360efc0c26c61f3352934abb5327326893926ddbc325b0e4a80df8e5eba26e09"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/hir-def/src/docs.rs: crates/hir-def/src/docs.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in hir_def::docs::parse_parameters_with_roles at line 713. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-def/src/docs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"151217fe55ac89d8845e5c0dd977af0d7b83b052df75f98aa987559e249fc2c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/tools/metadata.rs: crates/mcp-server/src/tools/metadata.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in mcp_server::tools::metadata::format_filtered_tree at line 412. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/tools/metadata.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"9255b59b3beafdb30773f9e84842b0f58f405b31211f7872c61e795317c55ee4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/tools/references.rs: crates/mcp-server/src/tools/references.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in mcp_server::tools::references::render at line 452. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/tools/references.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/references.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"1891806d7c48def7cbae428b956a214595c944b46266110d08891138f35db18a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/parser/src/grammar/sdbl/expressions.rs: crates/parser/src/grammar/sdbl/expressions.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in parser::grammar::sdbl::expressions::recover_to_delimiter at line 94. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/parser/src/grammar/sdbl/expressions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51c3c59bead620068c0c0cdc4ba3c2b53f3bf2fd6ad2d8e17df920e0bc1ee4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/tools/search/docs.rs: crates/mcp-server/src/tools/search/docs.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in mcp_server::tools::search::docs::search_docs at line 163. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/tools/search/docs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/docs.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"97745519e0fd24fc77da14c9fd347f5451fe60499b68d342295b890e162c5a6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs: crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in bsl_analyzer::bin::cli::diagnostics_baseline::apply_partitioned at line 397. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb6be6077a1e972dc13874f872752aef225e268e446a7088e7c7f4316d6cda9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/hir-ty/src/form_items.rs: crates/hir-ty/src/form_items.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in hir_ty::form_items::body_may_change_items at line 168. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-ty/src/form_items.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/form_items.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"73cf0313ba8634dd9d7fa80f588fcae76a150e9bf83736e66f80707112f7bbe0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide-host-core/src/workspace.rs: crates/ide-host-core/src/workspace.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in EditorView::catch_up_deltas at line 606. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-host-core/src/workspace.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/workspace.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"46411512f95fb367108dbe7b408ce24f4f508864d1ce9b640044095e4570d9fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide-host-core/src/metadata.rs: crates/ide-host-core/src/metadata.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in ide_host_core::metadata::refresh_metadata_substrate at line 422. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-host-core/src/metadata.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/metadata.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"f848b6c1d9ebc547b8247c0a7e42b7d4dc798d892645d68c8c944cd4e0d8ab29"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-debug/src/session.rs: crates/bsl-debug/src/session.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DebugSession::handle_event at line 1147. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-debug/src/session.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/session.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cf28f7f9f4efdc17b64b56375657e0bebadadd37ae8e43a712e5e41b65971d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide/src/references.rs: crates/ide/src/references.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ide::references::resolve_by_text at line 667. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide/src/references.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/references.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da1da3fde17c6e639d8035d26fa2e85459cbd7c4470c69f1fcf91174979f0ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide/src/partitioned_diagnostics_baseline.rs: crates/ide/src/partitioned_diagnostics_baseline.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ide::partitioned_diagnostics_baseline::load_diagnostics_baseline_set_once at line 796. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide/src/partitioned_diagnostics_baseline.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cc313008063922524a9e35e3d0d85bd3b7e6c34353194124f763249b32457f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/perf-nightly/verdict.py: scripts/perf-nightly/verdict.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in verdict.compare_metric at line 354. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- scripts/perf-nightly/verdict.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf-nightly/verdict.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13af79df068b6b97d6456e192e3b341da033894e8953ae6bd1182ba105b5281"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide-diagnostics/src/handlers/transferring_parameters_between_client_and_server.rs: crates/ide-diagnostics/src/handlers/transferring_parameters_between_client_and_server.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in BodyScan::stmt at line 425. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/transferring_parameters_between_client_and_server.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/transferring_parameters_between_client_and_server.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafd5e3eeabba1c5ac3a46f5a53be93e51491ffffcb9d3c907ca254505dc816d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/hir-ty/src/structure_keys.rs: crates/hir-ty/src/structure_keys.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in hir_ty::structure_keys::collect_structure_shapes at line 122. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-ty/src/structure_keys.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/structure_keys.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50fdf431e03c2605be2774a0f3b9bda51a2c38e364bd3153b684ace92f0497e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-metadata/src/configuration.rs: crates/bsl-metadata/src/configuration.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Configuration::merge_extension_overlay at line 396. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-metadata/src/configuration.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/configuration.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d76293a68d2f0440ec9508b955c11009bdb69642d2b63bee1e07cdec852f05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/perf-nightly/night.py: scripts/perf-nightly/night.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in night.write_report at line 436. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- scripts/perf-nightly/night.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf-nightly/night.py"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"307cd7cfc01be31b57c8116c084a680980acb94a4c9fd0543eeade00b7d9d000"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide/src/completion/platform_completion.rs: crates/ide/src/completion/platform_completion.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in ide::completion::platform_completion::platform_completions at line 72. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide/src/completion/platform_completion.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/platform_completion.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2130e61334959004662e0bc6a421f0fa8797c2638185361b1a3672fbcbe50b7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/hir-def/src/body/lower/mod.rs: crates/hir-def/src/body/lower/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in hir_def::body::lower::lower_method_with_externals at line 401. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-def/src/body/lower/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/mod.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a64a1ae583aebbde7c394b845eb5226fa1c2c5394634f22f743a0e1fe7a9eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide-diagnostics/src/handlers/unused_local_variable.rs: crates/ide-diagnostics/src/handlers/unused_local_variable.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ide_diagnostics::handlers::unused_local_variable::check_method at line 262. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/unused_local_variable.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_variable.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd7b15705a1d8dc3b8fb1a639601c46cceb890c3738ab8d242e2a819ed33a9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/dataflow/src/lib.rs: crates/dataflow/src/lib.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DataflowSolver::solve_backward at line 257. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/dataflow/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/lib.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"775bc054f25fa417a39bff72cae195c0cc2194519672a6e9f48b5c9066ad13bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide-host-core/src/diagnostics_baseline.rs: crates/ide-host-core/src/diagnostics_baseline.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DiagnosticsBaselineSnapshot::load_once at line 184. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-host-core/src/diagnostics_baseline.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e53b0595de4d9392ea7e1361fe60b93da3e4b7b9be2afb848f9d10f43ea662d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-debug/src/types/events.rs: crates/bsl-debug/src/types/events.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in bsl_debug::types::events::parse_ping_events at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-debug/src/types/events.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/events.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbeb41b960ec9dbb7d1dc5dcb9dd819a1e38552e310fbd397ea707b4280d142"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-search/src/publish.rs: crates/bsl-search/src/publish.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in SharedEmbeddingPublisher::publish at line 80. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-search/src/publish.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/publish.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"69abf078185a2a728d7e2450896c64b5e2f8c7d0445260025ec1e4e2ab999548"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide-diagnostics/src/handlers/pairing_broken_transaction.rs: crates/ide-diagnostics/src/handlers/pairing_broken_transaction.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in ide_diagnostics::handlers::pairing_broken_transaction::dfs_check_paths at line 324. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/pairing_broken_transaction.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/pairing_broken_transaction.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a977b63c7524ef6968390f8df2a6d3637f1ab186470f89d5d0aba2cdbf233b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/perf-nightly/scenarios.py: scripts/perf-nightly/scenarios.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in scenarios.close_cycle at line 631. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- scripts/perf-nightly/scenarios.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf-nightly/scenarios.py"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fc15696d66006e1956eadb6b0aa3bee19f5c075e4ea76df120773eec18ec9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mcp-server/src/tools/search/lexical.rs: crates/mcp-server/src/tools/search/lexical.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in mcp_server::tools::search::lexical::lexical_code_hits at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/tools/search/lexical.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c772bbee95f68a651d9bb4903483c4b2471114bf992a49c7b4713da47843292e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs: crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in bsl_analyzer::diagnostics_baseline::transaction::publish_set_with_hook at line 150. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/diagnostics_baseline/transaction.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b3518b26be13327335224858a30302054a0062da51e72de5a0b29e5ebefd76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/hir-ty/src/iteration_lookup.rs: crates/hir-ty/src/iteration_lookup.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in hir_ty::iteration_lookup::resolve_iter_element_ty_inner at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-ty/src/iteration_lookup.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/iteration_lookup.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46b15c1d7ba557b8983c8db6bfc8c5da03d02cc7260f3b5087901e5c0c092cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-metadata/src/xml_parser/catalog.rs: crates/bsl-metadata/src/xml_parser/catalog.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in bsl_metadata::xml_parser::catalog::parse_metadata_object_xml at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-metadata/src/xml_parser/catalog.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/catalog.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9221bc5a153542c74d4742f41e60ebdd5380756f7c92b05a09e31daad960359"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/hir-def/src/docs/tokens.rs: crates/hir-def/src/docs/tokens.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in hir_def::docs::tokens::doc_comment_tokens at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-def/src/docs/tokens.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs/tokens.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e378707f49eb870110cf7b22e16d143514709509c1041b8d8c10cbc2b99fe9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/hir-def/src/body/lower/query_fragment.rs: crates/hir-def/src/body/lower/query_fragment.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in hir_def::body::lower::query_fragment::is_substitution_source at line 119. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-def/src/body/lower/query_fragment.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/query_fragment.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6de89b3c347ed89d6b3186348210e7c5ef078c8fa48e14aeeaec40ab8f72a3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/sdbl-hir/src/lower/clauses.rs: crates/sdbl-hir/src/lower/clauses.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in LoweringContext::lower_totals_by_clause at line 263. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/sdbl-hir/src/lower/clauses.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/clauses.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0f1616d4023975247a3e991bc8a2e81ff4368998e8c615d85abed7481b0fc2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/bsl-analyzer/src/bin/cli/search_baseline/publish.rs: crates/bsl-analyzer/src/bin/cli/search_baseline/publish.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in bsl_analyzer::bin::cli::search_baseline::publish::run at line 58. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-analyzer/src/bin/cli/search_baseline/publish.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/search_baseline/publish.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"180b3cba3c7cfd56383210cf463421afae0b5111c18683279fca57390f02ef62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs: crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ide_diagnostics::handlers::multilingual_string_has_all_declared_languages::check_body at line 82. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2174d73c192f010c11c13350fed11d841e5bd92d8afbf0f3c66af17d99f40717"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide/src/completion/type_string_completion.rs: crates/ide/src/completion/type_string_completion.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ide::completion::type_string_completion::type_string_completions at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide/src/completion/type_string_completion.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/type_string_completion.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d019c072e2761e8952ff833705764fe3a61f9ed5be34d036524fc59e14c840b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide-diagnostics/src/handlers/object_modified_in_on_write.rs: crates/ide-diagnostics/src/handlers/object_modified_in_on_write.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ide_diagnostics::handlers::object_modified_in_on_write::check_body at line 47. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/object_modified_in_on_write.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/object_modified_in_on_write.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35276ceea23bfdf77975307a2d0880a06bf9b8e8d48f8373857a6758ad676b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ide-host-core/src/load.rs: crates/ide-host-core/src/load.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ide_host_core::load::apply_source_batch_cancellable at line 107. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-host-core/src/load.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/load.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f9d7ac8e34145d9c468478d76e2ad6676fbc285b6b94d1b78c07774cea064f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/handlers/unresolved_method_call.rs: crates/ide-diagnostics/src/handlers/unresolved_method_call.rs changed 16 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is ide_diagnostics::handlers::unresolved_method_call::from_hir at line 22), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hir-ty): keep a form module\u0027s own method ahead of the form extension on self calls\u201D; \u201Cfix(bsl-metadata): load a common module declared by its XML alone\u201D; \u201Cfix(hir-def): a common module without Module.bsl is a module with an unknown surface\u201D; \u201Cfix(hir-ty): resolve form extension methods on \u042D\u0442\u043E\u0442\u041E\u0431\u044A\u0435\u043A\u0442/\u042D\u0442\u0430\u0424\u043E\u0440\u043C\u0430\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/unresolved_method_call.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unresolved_method_call.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ea61b416a9f39bb6e9982b4537f1fa1e0a61e4aba9675aa536f4030070b0cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/bsl-metadata/src/metadata_object.rs: crates/bsl-metadata/src/metadata_object.rs changed 14 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is MetadataObject::apply_extension_overlay at line 926), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(sdbl-hir): \u043F\u043E\u0441\u043B\u0435 \u0420\u0435\u0433\u0438\u0441\u0442\u0440\u0430\u0442\u043E\u0440 \u0440\u0430\u0437\u0440\u0435\u0448\u0435\u043D\u044B \u0442\u043E\u043B\u044C\u043A\u043E \u0441\u0442\u0430\u043D\u0434\u0430\u0440\u0442\u043D\u044B\u0435 \u043F\u043E\u043B\u044F \u0434\u043E\u043A\u0443\u043C\u0435\u043D\u0442\u0430\u201D; \u201Cfix(sdbl-hir): judge \u0417\u041D\u0410\u0427\u0415\u041D\u0418\u0415 predefined items over the known set\u201D; \u201Cfix(bsl-metadata,hir-ty): judge a readable empty predefined set as known\u201D; \u201Cfix(bsl-metadata): mark predefined items unreadable when Predefined.xml fails to parse\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-metadata/src/metadata_object.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/metadata_object.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"d501f0a6d9c9b79e0f3f7cc6795576ed55643fc7799b0299476bfa3879f3f6c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/mcp-server/src/cache.rs: crates/mcp-server/src/cache.rs changed 16 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is WorkspaceCacheLayout::validate_source_placement at line 309), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(project-model): ignore derived *.Queries.bsl extracts by default\u201D; \u201Cfix(stdx): match exclude globs under a walk\u0027s resolved spelling\u201D; \u201Cfix(metadata)!: preserve partial registers and legacy extension scopes\u201D; \u201Cfix(mcp): address review findings on workspace cache relocation\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/cache.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/cache.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdac4ef16e7c7904942682797f943234c65516ad042ae11bd9df7e1eafd923a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/handlers/invalid_character_in_file.rs: crates/ide-diagnostics/src/handlers/invalid_character_in_file.rs changed 12 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is ide_diagnostics::handlers::invalid_character_in_file::check_body at line 210), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hir-def): make unequal line lists impossible when judging replacements\u201D; \u201Cfix(ide-diagnostics): judge documentation lines without reparsing the block\u201D; \u201Cfix(ide-diagnostics): stop the non-breaking space fix at a line break\u201D; \u201Cfix(ide-diagnostics): judge a parameter doc line by the documentation parser\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/invalid_character_in_file.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/invalid_character_in_file.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"017bbebf816813d58251b7372281840bee307fed225383aed0507dbf71c7e929"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/bsl-analyzer/src/bin/cli/mcp/shared.rs: crates/bsl-analyzer/src/bin/cli/mcp/shared.rs changed 11 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is bsl_analyzer::bin::cli::mcp::shared::serve_lsp at line 612), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mcp): \u0437\u0430\u043D\u044F\u0442\u043E\u0441\u0442\u044C \u0433\u0440\u0430\u0444\u0430 \u043F\u043E\u0441\u043B\u0435 \u043E\u0441\u0442\u0430\u043D\u043E\u0432\u043A\u0438 \u0434\u0435\u043C\u043E\u043D\u0430 \u043D\u0435 \u0432\u044B\u0433\u043B\u044F\u0434\u0438\u0442 \u043A\u043E\u043D\u0435\u0447\u043D\u044B\u043C failed\u201D; \u201Cfix(mcp-server): tighten executor limit sharing, reaping and validate routing\u201D; \u201Cfix(bsl-analyzer): share the check executor worker limit across daemon sessions\u201D; \u201Cfix(bsl-analyzer): carry executor-only connections through the shared session context\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-analyzer/src/bin/cli/mcp/shared.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/mcp/shared.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98dd17979e51e5ec6ca46e204b99d7d01162f719848b286062205f171cfa270"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/parser/src/grammar/items.rs: crates/parser/src/grammar/items.rs changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is parser::grammar::items::procedure_def_content at line 109), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(parser): hand crossed #\u0415\u0441\u043B\u0438 blocks back after a nested method\u201D; \u201Cfix(parser): drop crossed #\u0415\u0441\u043B\u0438 records when a method ends\u201D; \u201Cfix(parser): read keyword-spelled labels and \u042D\u043A\u0441\u043F\u043E\u0440\u0442 after any variable name\u201D; \u201Cfix(parser): keep a nested #\u0415\u0441\u043B\u0438 from closing the enclosing region\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/parser/src/grammar/items.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/items.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84ffdff84d1be7f5f2171a7e923664c1dcad2ff1ec4b35be448c216dfccf941"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/hir-def/src/execution_env.rs: crates/hir-def/src/execution_env.rs changed 12 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is hir_def::execution_env::module_base_env at line 322), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hir-def): constrain uncertain regions by enclosing branches\u201D; \u201Cfix(hir-def): keep excluded method regions dead under unknown conditions\u201D; \u201Cfix(hir-ty): judge arguments in #\u0415\u0441\u043B\u0438 branches that may be compiled\u201D; \u201Cfix(hir-def): ordinary forms run in the managed thick client only when the configuration allows it\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-def/src/execution_env.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/execution_env.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9488935dc552bb3c9797be41dc91c73202cf34d24ce363bfbd6c638dad2203"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/hir-ty/src/method_resolution.rs: crates/hir-ty/src/method_resolution.rs changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is hir_ty::method_resolution::resolve_user_call at line 287), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hir-ty): reconcile a documented metadata reference inside \u0060\u041C\u0430\u0441\u0441\u0438\u0432 \u0438\u0437\u0060\u201D; \u201Cfix(hir-ty): documented metadata return type does not close the result against the body\u201D; \u201Cfix(hir-ty): judge arguments in #\u0415\u0441\u043B\u0438 branches that may be compiled\u201D; \u201Cfix(hir-ty): export variables of a constant\u0027s ValueManagerModule are fields of its value manager\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-ty/src/method_resolution.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"07aaafb90a3ab4744f2262d74843cf7a5643d201adc6a9f7604052ab0b64dd51"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/hir-def/src/lib.rs: crates/hir-def/src/lib.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is ModuleMetadata::estimated_heap_size at line 448), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(metadata): preserve service and command owners for vendor support\u201D; \u201Cfix(parser): read keyword-spelled labels and \u042D\u043A\u0441\u043F\u043E\u0440\u0442 after any variable name\u201D; \u201Cfix(ide-diagnostics): see form handlers bound by string from another module\u201D; \u201Cfix(ide-diagnostics): PlatformMemberNewerThanMinVersion \u2014 \u0410\u0441\u0438\u043D\u0445/\u0416\u0434\u0430\u0442\u044C \u043C\u043E\u043B\u0447\u0430\u0442 \u0442\u0430\u043C \u0436\u0435, \u0433\u0434\u0435 \u0447\u043B\u0435\u043D\u044B\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-def/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/lib.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e932be3f34ff564160a38a42385abe2c4835943005befbdea8f4e0a1c19f88"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/hir-def/src/queries.rs: crates/hir-def/src/queries.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is hir_def::queries::resolved_module_summary_query at line 457), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hir-def): fold case when deduplicating a method\u0027s query reads\u201D; \u201Cfix(graph): treat standard and defined-type hops of a query dereference chain like the first hop\u201D; \u201Cfix(graph): follow query dereference chains past the first hop\u201D; \u201Cfix(graph): link objects named by VALUE and CAST in queries\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-def/src/queries.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/queries.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d08c7d06b72e7c6f8c6495dcd5505ee34498331d63482fc441ac1df2a577bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide/src/folding.rs: crates/ide/src/folding.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is ide::folding::string_literal_range at line 91), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ide): start a method fold at \u041F\u0440\u043E\u0446\u0435\u0434\u0443\u0440\u0430/\u0424\u0443\u043D\u043A\u0446\u0438\u044F, not at its compilation directive\u201D; \u201Cfix(ide): fold adjacent string literals as one closed literal\u201D; \u201Cfix(ide): do not fold an unclosed string literal\u201D; \u201Cfix(ide): keep an unclosed literal\u0027s fold off the code after it\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide/src/folding.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/folding.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8afd789ea05fa3ca9f68426c6589e8917884d35dbe5da585ba20c80923e8af"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/handlers/query_to_missing_metadata.rs: crates/ide-diagnostics/src/handlers/query_to_missing_metadata.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is ide_diagnostics::handlers::query_to_missing_metadata::is_substituted_template at line 63), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ide-diagnostics): every used replacement must replace the placeholder\u201D; \u201Cfix(ide-diagnostics): an identity replacement keeps the template reported\u201D; \u201Cfix(ide-diagnostics): end a template only where its overwrite surely runs\u201D; \u201Cfix(ide-diagnostics): keep a template that also runs as written reported\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/query_to_missing_metadata.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/query_to_missing_metadata.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f73d855fc26b6ff9d2f129fb61657b849a107c10b9cd84729e2ddac87271ca"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/handlers/unavailable_in_environment.rs: crates/ide-diagnostics/src/handlers/unavailable_in_environment.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is ide_diagnostics::handlers::unavailable_in_environment::from_hir at line 23), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(platform): document and pin the mobile client of sync HTTPConnection methods\u201D; \u201Cfix(hir-ty): form data collections keep their client availability\u201D; \u201Cfix(platform): COMSafeArray and JobSchedule members run in the thin client\u201D; \u201Cfix(platform): SetHTML and PDF grayscale/signature methods run in the thin client\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/unavailable_in_environment.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unavailable_in_environment.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c99e992a00c1c57b41d6168f42f47fe022042fa3a553fd34f37c69fb96e12f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/parser/src/grammar/statements.rs: crates/parser/src/grammar/statements.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is parser::grammar::statements::stmt_list_of at line 501), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(parser): read the end of a torn group before the directives of a crossed block\u201D; \u201Cfix(parser): read keyword-spelled labels and \u042D\u043A\u0441\u043F\u043E\u0440\u0442 after any variable name\u201D; \u201Cfix(parser): read a conditional group that tears a construct as one variant\u201D; \u201Cfix(parser): keep a nested #\u0415\u0441\u043B\u0438 from closing the enclosing region\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/parser/src/grammar/statements.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8f937cb7177fa8e943114181e52046d9fc1b01447d4923478748e547f215e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/bsl-metadata/src/register.rs: crates/bsl-metadata/src/register.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is Register::apply_extension_overlay at line 355), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(bsl-metadata): keep extension scalars and trim chart properties\u201D; \u201Cfix(bsl-metadata): take correspondence and chart from an extension overlay\u201D; \u201Cfix(metadata)!: preserve partial registers and legacy extension scopes\u201D; \u201Cfix(hir-ty): expose common attributes as fields of the objects they reach\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-metadata/src/register.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/register.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb6d78b5256f3515c1221c43691f0404b585e3a08304c4e643c39aa1f86cd6e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/stdx/src/path_exclusion.rs: crates/stdx/src/path_exclusion.rs changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is ExcludedPaths::with_patterns at line 116), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(scope): a Windows verbatim path is the same file, not a file out of scope\u201D; \u201Cfix(project-model): ignore derived *.Queries.bsl extracts by default\u201D; \u201Cfix(project-model): resolve an extends parent\u0027s directory through the file system\u201D; \u201Cfix(stdx): match exclude globs under a walk\u0027s resolved spelling\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/stdx/src/path_exclusion.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/path_exclusion.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9434224d7835b2675468602ead23fdafd4f661c09a8187c2eab5955a253ba2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/handlers/mismatched_arg_count.rs: crates/ide-diagnostics/src/handlers/mismatched_arg_count.rs changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is ide_diagnostics::handlers::mismatched_arg_count::from_hir at line 21), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hir-ty): filter possible environments in elsif branches\u201D; \u201Cfix(hir-def): constrain uncertain regions by enclosing branches\u201D; \u201Cfix(hir-def): keep excluded method regions dead under unknown conditions\u201D; \u201Cfix(hir-ty): keep undecided environments when telling dead #\u0415\u0441\u043B\u0438 branches\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/mismatched_arg_count.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/mismatched_arg_count.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e08d0737ab5d89c2c152dba8739a30e8e3e4de10a85605c98d40bc8e4c8a4dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/syntax/src/comment_run.rs: crates/syntax/src/comment_run.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is syntax::comment_run::collect_runs at line 142), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(syntax): find the neighbours of comments in one pass\u201D; \u201Cfix(syntax): a lone CR is a line break for comment runs\u201D; \u201Cfix(lexer): a lone CR ends a line comment, as in the platform\u201D; \u201Cfix(ide-diagnostics): \u043D\u0435 \u043C\u0435\u043D\u044F\u0442\u044C \u043C\u043E\u043B\u0447\u0430 \u0440\u0430\u0437\u0431\u043E\u0440 doc-\u043A\u043E\u043C\u043C\u0435\u043D\u0442\u0430\u0440\u0438\u044F \u0438 \u043D\u0435 \u0441\u043A\u0430\u043D\u0438\u0440\u043E\u0432\u0430\u0442\u044C \u0441\u0435\u0440\u0438\u044E //\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/syntax/src/comment_run.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/syntax/src/comment_run.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8621b27c4b26ba290ad5db2d21626ce7a76c34aa1f57eec8cb9b2285b2209551"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-host-core/src/lib.rs: crates/ide-host-core/src/lib.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is AnalysisHost::request_cancellation at line 112), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mcp-server): apply project config to the diagnostics resident like CLI and LSP\u201D; \u201Cfix(mcp-server): apply \u003CDefaultRunMode\u003E in the diagnostics resident\u201D; \u201Cfix(ide-host-core): count only ManagedApplication and Auto as the managed run mode\u201D; \u201Cfix(bsl-analyzer,mcp-server): take ordinaryAppSupport from what the diagnostics loader yields\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-host-core/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/lib.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"339756ef52bf7833275fe213d10aa338b429f5d77be50839ba45d73ceb983d0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/handlers/assign_alias_fields_in_query.rs: crates/ide-diagnostics/src/handlers/assign_alias_fields_in_query.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is ide_diagnostics::handlers::assign_alias_fields_in_query::dispatch at line 54), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Crefactor(ide-diagnostics): drop the unattested alias-fix branch the dialect gate made dead\u201D; \u201Cfix(ide-diagnostics): skip foreign comments and quoted identifiers when attesting the SDBL dialect\u201D; \u201Cfix(ide-diagnostics): attest a metadata prefix only by an SDBL query-table root\u201D; \u201Cfix(ide-diagnostics): attest the SDBL dialect only by a metadata prefix and outside apostrophe literals\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/assign_alias_fields_in_query.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/assign_alias_fields_in_query.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf34009988c6580de8335c693dd95652ab9daf0cb46e11a7e18c153554b800c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/parser/src/parser.rs: crates/parser/src/parser.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is Parser::match_closers at line 313), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(parser): hand crossed #\u0415\u0441\u043B\u0438 blocks back after a nested method\u201D; \u201Cfix(parser): drop crossed #\u0415\u0441\u043B\u0438 records when a method ends\u201D; \u201Cfix(sdbl): preserve expression boundaries and totals aliases\u201D; \u201Cfix(parser): read a conditional group that tears a construct as one variant\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/parser/src/parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/parser.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5d093132d1557ab1d899f73a56d0a40adf09687b0c5e60d7aa3589ec6f5d59"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/hir-ty/src/manager_lookup.rs: crates/hir-ty/src/manager_lookup.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is hir_ty::manager_lookup::predefined_ref_kind_for at line 157), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(sdbl-hir): judge \u0417\u041D\u0410\u0427\u0415\u041D\u0418\u0415 predefined items over the known set\u201D; \u201Cfix(bsl-metadata,hir-ty): judge a readable empty predefined set as known\u201D; \u201Cfix(hir-ty): judge a string predefined value over the set the manager read closes\u201D; \u201Cfix(hir-ty): keep manager member set open when a predefined layer is unread\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-ty/src/manager_lookup.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/manager_lookup.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"6741dd0a4962a9597e53501dd77bf81452a73d54164d4c02164360d871bf155b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/handlers/usage_write_log_event.rs: crates/ide-diagnostics/src/handlers/usage_write_log_event.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is ide_diagnostics::handlers::usage_write_log_event::from_hir at line 24), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hir-def): UsageWriteLogEvent - \u043E\u0446\u0435\u043D\u0438\u0432\u0430\u0442\u044C \u043A\u0430\u0436\u0434\u044B\u0439 \u0443\u0440\u043E\u0432\u0435\u043D\u044C \u0432 \u0441\u043E\u0441\u0442\u0430\u0432\u043D\u043E\u043C \u0430\u0440\u0433\u0443\u043C\u0435\u043D\u0442\u0435\u201D; \u201Cfix(hir-def): UsageWriteLogEvent - accept Warning level inside Except\u201D; \u201Cfix(hir-def): follow error info kept in a field and drop values outdated by their path\u201D; \u201Cfix(hir-def): keep string keys and removed text apart when tracing the log comment\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/usage_write_log_event.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/usage_write_log_event.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bf96f8aa9065372db768f623146e06647e6fcf4ce25e4249b91113b5e0ae1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/mcp-server/src/tools/debug.rs: crates/mcp-server/src/tools/debug.rs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is mcp_server::tools::debug::debug_attach at line 29), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(debug): report a missing evaluation and keep side refusals visible\u201D; \u201Cfix(debug): share the default target types, classify step ends, report halts once\u201D; \u201Cfix(debug): keep every queued stop, order halted targets, user-private lease\u201D; \u201Cfix(debug): find and resume targets halted before the attach\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/tools/debug.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/debug.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0b3afd6211a427a0164f88ba2464df6e8b784fca41b839295e109f8066292e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide/src/convert_method.rs: crates/ide/src/convert_method.rs changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is ide::convert_method::may_become_procedure at line 142), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ide): offer the method conversion anywhere on the declaration line\u201D; \u201Cfix(ide): count an extension body\u0027s calls before turning a function into a procedure\u201D; \u201Cfix(ide): keep a function in a module that runs dynamic code\u201D; \u201Cfix(ide): see interceptors under #\u0415\u0441\u043B\u0438 and calls assembled in strings\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide/src/convert_method.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/convert_method.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db20a9aeaf4172ead97a8c514e30ab210ea009069ec0eecf6b6876f4549da85"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/handlers/server_side_export_form_method.rs: crates/ide-diagnostics/src/handlers/server_side_export_form_method.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is ide_diagnostics::handlers::server_side_export_form_method::check at line 26), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ide-diagnostics): exempt the English Attachable_ form of the \u0411\u0421\u041F prefix too\u201D; \u201Cfix(ide-diagnostics): report ServerSideExportFormMethod as a warning\u201D; \u201Cfix(ide-diagnostics): the \u0411\u0421\u041F \u041F\u043E\u0434\u043A\u043B\u044E\u0447\u0430\u0435\u043C\u044B\u0439_ form handlers must stay exported\u201D; \u201Cfix(metadata): preserve service and command owners for vendor support\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/server_side_export_form_method.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/server_side_export_form_method.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef7bfda2abc9a8a69e39b776ca3acfbd8bfe4d686fa87b5b36f3a7fc9178cc2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/sdbl_utils.rs: crates/ide-diagnostics/src/sdbl_utils.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is ide_diagnostics::sdbl_utils::extract_string_content at line 501), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ide-diagnostics): skip foreign comments and quoted identifiers when attesting the SDBL dialect\u201D; \u201Cfix(ide-diagnostics): attest a metadata prefix only by an SDBL query-table root\u201D; \u201Cfix(ide-diagnostics): attest the SDBL dialect only by a metadata prefix and outside apostrophe literals\u201D; \u201Cfix(ide-diagnostics): keep the alias quick-fix out of fixAll where the query dialect is unproven\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/sdbl_utils.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/sdbl_utils.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6aa0b5b4e1e2f397d59cf56a0dd974b61eec4ed83de41cb29acce9ce6231ef8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/bsl-analyzer/src/mem_docs.rs: crates/bsl-analyzer/src/mem_docs.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is MemDocs::apply_changes at line 103), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(lsp): preserve semantic availability during live VFS updates\u201D; \u201Cfix(lsp): \u043F\u0430\u043A\u0435\u0442 didChange \u043F\u0440\u0438\u043C\u0435\u043D\u044F\u0435\u0442\u0441\u044F \u0446\u0435\u043B\u0438\u043A\u043E\u043C \u0438\u043B\u0438 \u043D\u0435 \u043F\u0440\u0438\u043C\u0435\u043D\u044F\u0435\u0442\u0441\u044F\u201D; \u201Cfix(lsp): \u043A\u043E\u043D\u0435\u0446 CRLF-\u0441\u0442\u0440\u043E\u043A\u0438 \u2014 \u043F\u043E\u0437\u0438\u0446\u0438\u044F \u043F\u0435\u0440\u0435\u0434 \u0060\\r\u0060\u201D; \u201Cfix(lsp): \u043A\u043E\u043B\u043E\u043D\u043A\u0430 \u0437\u0430 \u043A\u043E\u043D\u0446\u043E\u043C \u0441\u0442\u0440\u043E\u043A\u0438 \u0443\u0441\u0435\u043A\u0430\u0435\u0442\u0441\u044F \u0432 \u0437\u0430\u043F\u0440\u043E\u0441\u0430\u0445 \u0438 \u043E\u0442\u0432\u0435\u0440\u0433\u0430\u0435\u0442\u0441\u044F \u0432 \u043F\u0440\u0430\u0432\u043A\u0430\u0445\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-analyzer/src/mem_docs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mem_docs.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aef12c36cb6e85364059edf09bb1bc15b338166eaf947e99132ff459033a986"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/hir-def/src/docs/type_expr.rs: crates/hir-def/src/docs/type_expr.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is hir_def::docs::type_expr::parse_non_hyperlink_type at line 118), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hir-def): \u043E\u0434\u043D\u043E\u0441\u0435\u0433\u043C\u0435\u043D\u0442\u043D\u0430\u044F \u043F\u0440\u043E\u0437\u0430 \u043F\u043E\u0441\u043B\u0435 \u00AB\u0441\u043C.\u00BB \u043D\u0435 \u043D\u0430\u0437\u044B\u0432\u0430\u0435\u0442 \u0446\u0435\u043B\u044C\u201D; \u201Cfix(hir-def): \u043B\u043E\u043A\u0430\u043B\u044C\u043D\u044B\u0435 \u043F\u043E\u043B\u044F \u0441\u043B\u043E\u0442\u0430 \u0441\u0438\u043B\u044C\u043D\u0435\u0435 \u043C\u0430\u0440\u043A\u0435\u0440\u0430 \u0432 \u043E\u043F\u0438\u0441\u0430\u043D\u0438\u0438\u201D; \u201Cfix(hir-def): \u00AB\u0441\u043C.\u00BB \u0432 \u043E\u043F\u0438\u0441\u0430\u043D\u0438\u0438 \u0441\u043B\u043E\u0442\u0430 \u043D\u0430\u0437\u044B\u0432\u0430\u0435\u0442 \u0446\u0435\u043B\u044C\u201D; \u201Cfix(ide): preserve documentation layout and field continuations\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-def/src/docs/type_expr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs/type_expr.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8976ab82e8a1818e7f0807fa32eff3fa0865414f03c3a6d453bb33fb5e531795"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/project-model/src/file_role.rs: crates/project-model/src/file_role.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is project_model::file_role::file_role at line 39), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(project-model): ignore derived *.Queries.bsl extracts by default\u201D; \u201Cfix(project-model): count only Ext/Form/Form.json as an ordinary form\u0027s sidecar\u201D; \u201Cfix(project-model): use the conventional binary extension constant\u201D; \u201Cfix(metadata): validate sidecar context and watch binary dialogs\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/project-model/src/file_role.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/file_role.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2a0f1c142c6e4f237a315f4480897359fecf4d13f425d517c8f6835081c1a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/handlers/common_module_invalid_type.rs: crates/ide-diagnostics/src/handlers/common_module_invalid_type.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is ide_diagnostics::handlers::common_module_invalid_type::from_metadata at line 21), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ide-diagnostics): report CommonModuleInvalidType as a warning\u201D; \u201Cfix(diagnostics): CommonModuleInvalidType accepts a server module without \u0412\u043D\u0435\u0448\u043D\u0435\u0435\u0421\u043E\u0435\u0434\u0438\u043D\u0435\u043D\u0438\u0435\u201D; \u201Cfix(ide-diagnostics): accept std469 single-client and non-ordinary modules in CommonModuleInvalidType\u201D; \u201Cfix(metadata): preserve service and command owners for vendor support\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/common_module_invalid_type.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/common_module_invalid_type.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66c69c74e2f201fb877c9fca2e9fed9a982209e32ea82d61c43f6b5e6bb9abe"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/syntax/src/ast_utils.rs: crates/syntax/src/ast_utils.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is syntax::ast_utils::leading_comments at line 129), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(syntax): a lone CR ends a line between annotation and variable\u201D; \u201Cfix(syntax): a lone CR ends a line for leading comments\u201D; \u201Cfix(parser): read a conditional group that tears a construct as one variant\u201D; \u201Cfix(ide): preserve documentation layout and field continuations\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/syntax/src/ast_utils.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/syntax/src/ast_utils.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9aeacb8f5abfb336c7e07933a0c5117fd8129ca2b7f4aba9f05207d8d4f460"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide/src/completion/sdbl/use_cases/complete_nested_elements.rs: crates/ide/src/completion/sdbl/use_cases/complete_nested_elements.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is CompleteNestedElementsUseCase::execute at line 9), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(bsl-metadata,hir-ty): judge a readable empty predefined set as known\u201D; \u201Cfix(bsl-metadata): mark predefined items unreadable when Predefined.xml fails to parse\u201D; \u201Cfix(hir-ty): expose common attributes as fields of the objects they reach\u201D; \u201Cfix: complete metadata and external source diagnostics\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide/src/completion/sdbl/use_cases/complete_nested_elements.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/sdbl/use_cases/complete_nested_elements.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be465e39a9eb15b034742bdf5c5af0089946cbdcac173b01cd046f421337126"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/hir-ty/src/metadata_path.rs: crates/hir-ty/src/metadata_path.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is hir_ty::metadata_path::missing_metadata at line 78), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hir-ty): report a repeated type name once and judge \u00AB\u0451\u00BB spellings of a bare kind\u201D; \u201Cfix(hir-ty): judge a string predefined value over the set the manager read closes\u201D; \u201Cfix(hir-ty): read \u00AB\u0451\u00BB as \u00AB\u0435\u00BB in every kind name of a string metadata path\u201D; \u201Cfix(bsl-metadata): mark predefined items unreadable when Predefined.xml fails to parse\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-ty/src/metadata_path.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/metadata_path.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ce4916a20d26c223f763ea1fa2db6a54106f017284aaf9d1e1a6365362e110"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/hir-def/src/preproc_condition.rs: crates/hir-def/src/preproc_condition.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is hir_def::preproc_condition::tokenize at line 311), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hir-ty): filter possible environments in elsif branches\u201D; \u201Cfix(hir-def): constrain uncertain regions by enclosing branches\u201D; \u201Cfix(hir-ty): keep undecided environments when telling dead #\u0415\u0441\u043B\u0438 branches\u201D; \u201Cfix(hir-ty): judge arguments in #\u0415\u0441\u043B\u0438 branches that may be compiled\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-def/src/preproc_condition.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/preproc_condition.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b1ff8a95c9d77ce4bbde039114c1a41ee94ee34c8fc2925c5038f6f7328340"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/sdbl-hir/src/lower/expr/predicates.rs: crates/sdbl-hir/src/lower/expr/predicates.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is LoweringContext::lower_in_expr at line 97), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(sdbl): lower a nested query in a value list and stop a member path at \u041A\u0410\u041A\u201D; \u201Cfix(sdbl): accept a list in IN HIERARCHY, \u00600.\u0060 and a dereference of parentheses\u201D; \u201Cfix(sdbl-hir): read predicate negation from the predicate\u0027s own tokens\u201D; \u201Cfix(sdbl): preserve literal text and operator ownership\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/sdbl-hir/src/lower/expr/predicates.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/expr/predicates.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84281257234375e4ef7f896376553c1d376623bfd7a9ef7f0f749a70ef0da51"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/bsl-metadata/src/xml_parser/helpers.rs: crates/bsl-metadata/src/xml_parser/helpers.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is bsl_metadata::xml_parser::helpers::parse_extension_ownership at line 54), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(metadata): preserve service and command owners for vendor support\u201D; \u201Cfix(bsl-metadata): keep extension scalars and trim chart properties\u201D; \u201Cfix(sdbl-hir): \u0441\u0442\u0430\u043D\u0434\u0430\u0440\u0442\u043D\u044B\u0435 \u043F\u043E\u043B\u044F \u0440\u0435\u0433\u0438\u0441\u0442\u0440\u0430 \u043F\u0440\u0435\u0434\u043B\u0430\u0433\u0430\u044E\u0442\u0441\u044F \u043E\u0434\u0438\u043D \u0440\u0430\u0437\u201D; \u201Cfix(bsl-metadata): read extension ownership for enums and constants\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-metadata/src/xml_parser/helpers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/helpers.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bfbc01865d3beab495b13a5f0fe9748a89e480ead4c2ad0b5d69ecc1e30055"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/bsl-debug/src/lease.rs: crates/bsl-debug/src/lease.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is Lease::reclaim at line 81), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(debug): cut lease names on a char boundary and drop late eval results\u201D; \u201Cfix(debug): report a missing evaluation and keep side refusals visible\u201D; \u201Cfix(debug): share the default target types, classify step ends, report halts once\u201D; \u201Cfix(debug): keep every queued stop, order halted targets, user-private lease\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-debug/src/lease.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/lease.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"065526402bc3eec943d59e79a7a69c9fb24844cd6a650704b5e6f5d9d83a1912"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/bsl-debug/src/client.rs: crates/bsl-debug/src/client.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is DebugClient::post_bounded at line 265), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(debug): report a missing evaluation and keep side refusals visible\u201D; \u201Cfix(debug): honour a zero wait_stop budget, tell stepped-over breakpoints, name the timeout\u201D; \u201Cfix(debug): find and resume targets halted before the attach\u201D; \u201Cfix(debug): report what the debug server actually answered\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-debug/src/client.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/client.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8b58f1cb9de4ac4526bb2edd46f2e18969b61b1cc1aead8fd1649468f24c43"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/handlers/deprecated_platform_facts.rs: crates/ide-diagnostics/src/handlers/deprecated_platform_facts.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is ide_diagnostics::handlers::deprecated_platform_facts::is_8312_kind at line 211), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ide-diagnostics): \u043D\u0435 \u0441\u0447\u0438\u0442\u0430\u0442\u044C \u0431\u0435\u0437\u043E\u043F\u0430\u0441\u043D\u043E\u0439 \u043F\u0440\u0430\u0432\u043A\u0443 \u0442\u0435\u043A\u0441\u0442\u0430 \u043B\u0438\u0442\u0435\u0440\u0430\u043B\u0430 \u0438 \u043D\u0435 \u0442\u0435\u0440\u044F\u0442\u044C \u0441\u0440\u0435\u0434\u0443 \u0434\u0438\u0440\u0435\u043A\u0442\u0438\u0432\u044B\u201D; \u201Cfix(ide-diagnostics): \u043D\u0435 \u043F\u0435\u0440\u0435\u0438\u043C\u0435\u043D\u043E\u0432\u044B\u0432\u0430\u0442\u044C \u0432\u044B\u0437\u043E\u0432 \u0432 \u043C\u0435\u0442\u043E\u0434 \u043C\u043E\u0434\u0443\u043B\u044F \u0438 \u043D\u0435 \u0442\u0435\u0440\u044F\u0442\u044C \u0441\u0440\u0435\u0434\u0443 \u043F\u0435\u0440\u0435\u0445\u0432\u0430\u0442\u0447\u0438\u043A\u0430\u201D; \u201Cfix(ide-diagnostics): \u043D\u0435 \u043F\u0440\u0435\u0434\u043B\u0430\u0433\u0430\u0442\u044C \u043F\u0440\u0430\u0432\u043A\u0443, \u043A\u043E\u0442\u043E\u0440\u0430\u044F \u043D\u0435 \u0441\u043A\u043E\u043C\u043F\u0438\u043B\u0438\u0440\u0443\u0435\u0442\u0441\u044F\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/deprecated_platform_facts.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deprecated_platform_facts.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ba8aabf45a14807a8e92521139343032eed10a44e97afa21b900861e9fc6bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/bsl-platform/src/overlay_schema.rs: crates/bsl-platform/src/overlay_schema.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is bsl_platform::overlay_schema::parse_property_correction at line 309), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(platform): reject case-insensitive return type duplicates\u201D; \u201Cfix(platform): \u0424\u0430\u0431\u0440\u0438\u043A\u0430XDTO.\u0421\u043E\u0437\u0434\u0430\u0442\u044C returns \u041E\u0431\u044A\u0435\u043A\u0442XDTO or \u0417\u043D\u0430\u0447\u0435\u043D\u0438\u0435XDTO\u201D; \u201Cfix(bsl-platform): \u043F\u0430\u0440\u0430\u043C\u0435\u0442\u0440 \u00AB\u043B\u044E\u0431\u043E\u0439 \u043E\u0431\u044A\u0435\u043A\u0442 \u043C\u0435\u0442\u0430\u0434\u0430\u043D\u043D\u044B\u0445\u00BB \u043F\u0440\u0438\u043D\u0438\u043C\u0430\u0435\u0442 \u043E\u0431\u044A\u0435\u043A\u0442 \u043B\u044E\u0431\u043E\u0433\u043E \u0432\u0438\u0434\u0430\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-platform/src/overlay_schema.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/overlay_schema.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"17af305e5e63b6c61854d8303baeff154ab09dee7c69f6383df0b518d1f7bb70"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/bsl-search/src/embedder.rs: crates/bsl-search/src/embedder.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is Embedder::send_request at line 365), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mcp): bound graph reloads and reuse compatible embeddings\u201D; \u201Cfix(search-baseline): share the strict EMBEDDING_DIM contract with the CLI publisher\u201D; \u201Cfix(search): bound embedding requests by serialized payload\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-search/src/embedder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/embedder.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e06df510e13c3fc54f818670b09985a92713dcb2c6ed8d072fdec0235a1f714"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/handlers/style_element_constructors.rs: crates/ide-diagnostics/src/handlers/style_element_constructors.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is ide_diagnostics::handlers::style_element_constructors::from_hir at line 21), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ide-diagnostics): report six standards rules as warnings, not errors\u201D; \u201Cfix(hir-def): StyleElementConstructors \u2014 \u0432\u0435\u0442\u0432\u044C ?() \u0432 \u0441\u0440\u0430\u0432\u043D\u0435\u043D\u0438\u0438 \u0438 \u0440\u0430\u0437\u0440\u0435\u0437\u0430\u043D\u043D\u0430\u044F #\u0415\u0441\u043B\u0438 \u0432 \u0430\u0440\u0433\u0443\u043C\u0435\u043D\u0442\u0430\u0445\u201D; \u201Cfix(hir-def): StyleElementConstructors skips auto color/font and comparison operands\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/style_element_constructors.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/style_element_constructors.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"601462a3e30f12df6ad694742cf3974705540a976a6daa68dc0226539a1a6499"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/bsl-search/src/document.rs: crates/bsl-search/src/document.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is bsl_search::document::prepare_file_documents_with_context at line 182), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mcp): bound graph reloads and reuse compatible embeddings\u201D; \u201Cfix(search): restore the merge resolution of document.rs and the changelog\u201D; \u201Cfix(search): owe graph contexts a provider failed to render\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-search/src/document.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/document.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"800c81eefd0f4b37c268e24074075414dfbcd7244bcc8fc5823ab0c6fe0d37b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/base-db/src/lib.rs: crates/base-db/src/lib.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is Files::count_parse at line 212), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(bsl-analyzer): park only cuts a drifted disk read explains\u201D; \u201Cfix(mcp-server): retry on file_text revision mismatch instead of terminal panic\u201D; \u201Cfix(graph): resolve metadata paths across batch boundaries\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/base-db/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/base-db/src/lib.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8155e37f455de852241aba32ea9a30167c9d298d52b6196495e08baa43735d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/hir-def/src/item_tree/lower.rs: crates/hir-def/src/item_tree/lower.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is Ctx::lower_annotations at line 203), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(bsl-analyzer): park only cuts a drifted disk read explains\u201D; \u201Cfix(syntax): bind variable export to the following token\u201D; \u201Cfix(parser): read keyword-spelled labels and \u042D\u043A\u0441\u043F\u043E\u0440\u0442 after any variable name\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-def/src/item_tree/lower.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/item_tree/lower.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2ecc4941db916ef77a2fa1dc535fe8590ed62b9e1e20f498c97a515d451556"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/handlers/begin_transaction_before_try_catch.rs: crates/ide-diagnostics/src/handlers/begin_transaction_before_try_catch.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is ide_diagnostics::handlers::begin_transaction_before_try_catch::from_hir at line 22), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hir-def): BeginTransactionBeforeTryCatch judges a begin nested in an outer Try by the statement after it\u201D; \u201Cfix(hir-def): accept conditional begin before exhaustive preprocessor try\u201D; \u201Cfix(hir-def): BeginTransactionBeforeTryCatch accepts a conditional begin closing an If before Try\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/begin_transaction_before_try_catch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/begin_transaction_before_try_catch.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5077d6ad0c91041fa2c55f8ff08448aa638bfc2d01cee50c74eef7be0a041a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/bsl-analyzer/src/lsp/from_proto.rs: crates/bsl-analyzer/src/lsp/from_proto.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is bsl_analyzer::lsp::from_proto::offset_with_overlong_column at line 79), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(baseline): keep snippet fingerprints on the LF line below a lone CR\u201D; \u201Cfix(lsp): \u043A\u043E\u043D\u0435\u0446 CRLF-\u0441\u0442\u0440\u043E\u043A\u0438 \u2014 \u043F\u043E\u0437\u0438\u0446\u0438\u044F \u043F\u0435\u0440\u0435\u0434 \u0060\\r\u0060\u201D; \u201Cfix(lsp): \u043A\u043E\u043B\u043E\u043D\u043A\u0430 \u0437\u0430 \u043A\u043E\u043D\u0446\u043E\u043C \u0441\u0442\u0440\u043E\u043A\u0438 \u0443\u0441\u0435\u043A\u0430\u0435\u0442\u0441\u044F \u0432 \u0437\u0430\u043F\u0440\u043E\u0441\u0430\u0445 \u0438 \u043E\u0442\u0432\u0435\u0440\u0433\u0430\u0435\u0442\u0441\u044F \u0432 \u043F\u0440\u0430\u0432\u043A\u0430\u0445\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-analyzer/src/lsp/from_proto.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/lsp/from_proto.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b7d8132db4cdca695b429ac701b724c2e364989c202f4b7aa667e9b7fc7bf8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/bsl-platform/src/overlays.rs: crates/bsl-platform/src/overlays.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is bsl_platform::overlays::extracted_type_keys at line 373), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(platform): \u0424\u0430\u0431\u0440\u0438\u043A\u0430XDTO.\u0421\u043E\u0437\u0434\u0430\u0442\u044C returns \u041E\u0431\u044A\u0435\u043A\u0442XDTO or \u0417\u043D\u0430\u0447\u0435\u043D\u0438\u0435XDTO\u201D; \u201Cfix(bsl-platform): \u043A\u043E\u0440\u043F\u0443\u0441 \u0441\u043F\u0440\u0430\u0432\u043A\u0438 8.5 \u043D\u0435 \u043E\u0442\u0432\u0435\u0440\u0433\u0430\u0435\u0442\u0441\u044F \u0438\u0437-\u0437\u0430 \u0420\u0435\u0436\u0438\u043C\u041E\u0442\u043A\u0440\u044B\u0442\u0438\u044F\u041E\u043A\u043D\u0430\u201D; \u201Cfix(bsl-platform): \u043F\u0430\u0440\u0430\u043C\u0435\u0442\u0440 \u00AB\u043B\u044E\u0431\u043E\u0439 \u043E\u0431\u044A\u0435\u043A\u0442 \u043C\u0435\u0442\u0430\u0434\u0430\u043D\u043D\u044B\u0445\u00BB \u043F\u0440\u0438\u043D\u0438\u043C\u0430\u0435\u0442 \u043E\u0431\u044A\u0435\u043A\u0442 \u043B\u044E\u0431\u043E\u0433\u043E \u0432\u0438\u0434\u0430\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-platform/src/overlays.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/overlays.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdeb0ff18cc4749b02c70bde5b29aa986ed30a52a2bae180e373b665b639cd9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/hir-ty/src/form_attr.rs: crates/hir-ty/src/form_attr.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is hir_ty::form_attr::lower_form_attribute_to_typeid at line 13), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hir-ty): form additional columns on main-attribute table rows\u201D; \u201Cfix(hir-ty): form data collections keep their client availability\u201D; \u201Cfix(hir-ty): type the record-manager attribute of information register record forms\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-ty/src/form_attr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/form_attr.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"864c39421a6cd63f456b6869aa5d5cf84b1b87a545a0eb3d8ed9b9c42c6d3c04"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide/src/formatting/engine.rs: crates/ide/src/formatting/engine.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is ide::formatting::engine::compute_line_ranges at line 90), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ide): \u0410\u0441\u0438\u043D\u0445 \u043F\u043E\u0441\u043B\u0435 \u0434\u0438\u0440\u0435\u043A\u0442\u0438\u0432\u044B \u043E\u0441\u0442\u0430\u0451\u0442\u0441\u044F \u043D\u0430 \u0443\u0440\u043E\u0432\u043D\u0435 \u0437\u0430\u0433\u043E\u043B\u043E\u0432\u043A\u0430 \u043C\u0435\u0442\u043E\u0434\u0430\u201D; \u201Cfix(ide): \u0441\u043D\u0438\u043C\u0430\u0442\u044C \u0443\u0440\u043E\u0432\u0435\u043D\u044C \u0442\u043E\u043B\u044C\u043A\u043E \u0441 \u0430\u043D\u043D\u043E\u0442\u0430\u0446\u0438\u0439 \u0437\u0430\u0433\u043E\u043B\u043E\u0432\u043A\u0430 \u043C\u0435\u0442\u043E\u0434\u0430\u201D; \u201Cfix(ide): keep compilation directives at the declaration indent\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide/src/formatting/engine.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/formatting/engine.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b111fb442b1a6655756f4d57f6835e81890a08480ddba96dfe23e6606037053"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/bsl-platform/src/global_catalog.rs: crates/bsl-platform/src/global_catalog.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is PlatformGlobalCatalog::status_for_target at line 202), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(bsl-platform): compatibility_mode \u043F\u0440\u0438\u043D\u0438\u043C\u0430\u0435\u0442 \u0442\u043E\u043B\u044C\u043A\u043E \u043B\u0438\u043D\u0438\u044E 8.x \u0431\u0435\u0437 \u0441\u0431\u043E\u0440\u043A\u0438\u201D; \u201Cfix(bsl-platform): compatibility_mode \u0440\u0430\u0437\u0431\u0438\u0440\u0430\u0435\u0442\u0441\u044F \u0441\u0442\u0440\u043E\u0433\u043E, \u043A\u0430\u043A min_platform_version\u201D; \u201Cfix(ide-diagnostics): PlatformMemberNewerThanMinVersion \u2014 \u0410\u0441\u0438\u043D\u0445/\u0416\u0434\u0430\u0442\u044C \u043C\u043E\u043B\u0447\u0430\u0442 \u0442\u0430\u043C \u0436\u0435, \u0433\u0434\u0435 \u0447\u043B\u0435\u043D\u044B\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-platform/src/global_catalog.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/global_catalog.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b82170a4a6e9761748fc665701a8b29782403513635c7079aa93823a423802"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/scope_gate.rs: crates/ide-diagnostics/src/scope_gate.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is ide_diagnostics::scope_gate::diagnostic_in_scope at line 55), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(line-index): number vendor-filter lines by LF alone, as git does\u201D; \u201Cfix(ide-diagnostics): \u0444\u0438\u043D\u0430\u043B\u0438\u0437\u0430\u0446\u0438\u044F \u0441\u0430\u043C\u0430 \u0434\u0435\u0440\u0436\u0438\u0442 \u0444\u0430\u0439\u043B\u043E\u0432\u044B\u0439 \u0433\u0435\u0439\u0442 \u043E\u0431\u043B\u0430\u0441\u0442\u0438\u201D; \u201Cfix(ide-diagnostics): \u043C\u0435\u0442\u0430-\u0434\u0438\u0430\u0433\u043D\u043E\u0441\u0442\u0438\u043A\u0438 \u043F\u043E\u0434\u0430\u0432\u043B\u0435\u043D\u0438\u044F \u043F\u0435\u0440\u0435\u0436\u0438\u0432\u0430\u044E\u0442 \u0433\u0435\u0439\u0442 \u043E\u0431\u043B\u0430\u0441\u0442\u0438\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/scope_gate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/scope_gate.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86731c60308b23db50bd82430950ecff26dc870878617ff8f66d4bbaea18434"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/handlers/type_mismatch_by_doc_comment.rs: crates/ide-diagnostics/src/handlers/type_mismatch_by_doc_comment.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is ide_diagnostics::handlers::type_mismatch_by_doc_comment::from_hir at line 22), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ide-diagnostics): keep TypeMismatch sides distinct after shortening\u201D; \u201Cfix(ide-diagnostics): shorten TypeMismatch unions by their members\u201D; \u201Cfix(ide-diagnostics): shorten union types in TypeMismatch messages\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/type_mismatch_by_doc_comment.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/type_mismatch_by_doc_comment.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"372a36fbd0c985886c895bf86f67f8d875a40f663ab8e82bcd76223bfd5fbd5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/hir-def/src/docs/reshape.rs: crates/hir-def/src/docs/reshape.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is Block::judging_ways at line 215), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(hir-def): keep the line judging function apart from a test\u0027s counter\u201D; \u201Cfix(hir-def): make unequal line lists impossible when judging replacements\u201D; \u201Cfix(ide-diagnostics): find the end of a section\u0027s parameters once per block\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/hir-def/src/docs/reshape.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs/reshape.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cdbfe5fe790df1f2eac17ed5fa1ed54018f02df7a82020fcdc12fac33e8690"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/mcp-server/src/tools/diagnostics/snippet.rs: crates/mcp-server/src/tools/diagnostics/snippet.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is mcp_server::tools::diagnostics::snippet::plan at line 191), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mcp-server): attribute snippet parse errors past a broken host tail and detect variable sections\u201D; \u201Cfix(mcp-server): report an unclosed block of module snippet code as its parse error\u201D; \u201Cfix(mcp-server): take snippet module path names from the conventions dictionary\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/mcp-server/src/tools/diagnostics/snippet.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics/snippet.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc0799b2a53bf43cda21a8f6822459ba9c4abc77319533767e561312af902b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/handlers/code_block_before_sub.rs: crates/ide-diagnostics/src/handlers/code_block_before_sub.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is ide_diagnostics::handlers::code_block_before_sub::scan at line 44), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ide-diagnostics): CodeBlockBeforeSub treats #\u0415\u0441\u043B\u0438 branches as alternatives\u201D; \u201Cfix(ide-diagnostics): CodeBlockBeforeSub sees methods and statements inside #\u0415\u0441\u043B\u0438\u201D; \u201Cfix(ide-diagnostics): report CodeBlockBeforeSub for code between methods\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/code_block_before_sub.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/code_block_before_sub.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3e537a6cf5c785dfd9908185ae3320d9a9614b3a4c9efb96a9d51ae068d1b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/bsl-analyzer/src/bin/cli/search_baseline/postgres.rs: crates/bsl-analyzer/src/bin/cli/search_baseline/postgres.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is bsl_analyzer::bin::cli::search_baseline::postgres::embedder_config at line 44), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mcp): bound graph reloads and reuse compatible embeddings\u201D; \u201Cfix(search-baseline): share the strict EMBEDDING_DIM contract with the CLI publisher\u201D; \u201Cfix(search): bound embedding requests by serialized payload\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-analyzer/src/bin/cli/search_baseline/postgres.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/search_baseline/postgres.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6586a2656201c5a57d913ee546d8c8c4d6f007c17484619deee6fd23fbb0dfc9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/bsl-search/src/ports.rs: crates/bsl-search/src/ports.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is ModuleSnapshotSource::catch_up at line 50), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mcp): bound graph reloads and reuse compatible embeddings\u201D; \u201Cfix(search): owe graph contexts a provider failed to render\u201D; \u201Cfix(search): bound embedding requests by serialized payload\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/bsl-search/src/ports.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/ports.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b9472bc193b7a1c70e113c05b1143be07e66b8f679b1d7201fb2882cac314e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/ide-diagnostics/src/handlers/structure_key_is_not_identifier.rs: crates/ide-diagnostics/src/handlers/structure_key_is_not_identifier.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is ide_diagnostics::handlers::structure_key_is_not_identifier::check_body at line 45), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ide-diagnostics): StructureKeyIsNotIdentifier \u043F\u0440\u043E\u0432\u0435\u0440\u044F\u0435\u0442 \u043C\u043D\u043E\u0433\u043E\u0441\u0442\u0440\u043E\u0447\u043D\u044B\u0439 \u043B\u0438\u0442\u0435\u0440\u0430\u043B-\u043A\u043B\u044E\u0447\u201D; \u201Cfix(ide-diagnostics): StructureKeyIsNotIdentifier \u043F\u0440\u043E\u0432\u0435\u0440\u044F\u0435\u0442 \u0421\u0432\u043E\u0439\u0441\u0442\u0432\u043E \u0443 \u0424\u0438\u043A\u0441\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u0430\u044F\u0421\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430\u201D; \u201Cfix(ide-diagnostics): StructureKeyIsNotIdentifier \u043D\u0435 \u043F\u0440\u0438\u043D\u0438\u043C\u0430\u0435\u0442 \u043D\u0435-ASCII \u0446\u0438\u0444\u0440\u044B \u0432 \u043A\u043B\u044E\u0447\u0435\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/ide-diagnostics/src/handlers/structure_key_is_not_identifier.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/structure_key_is_not_identifier.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9186b786d8cd666a1ef4a160ef08a53a3cfd9e85400e11b0c5c439ac870c4406"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/line-index/src/lib.rs: crates/line-index/src/lib.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is LineIndex::new at line 41), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(ide-diagnostics): skip the CRLF half of \u0060\\r\\r\\n\u0060 when IncorrectLineBreak looks ahead\u201D; \u201Cfix(line-index): number vendor-filter lines by LF alone, as git does\u201D; \u201Cfix(line-index): count a lone CR as a line break, as LSP does\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 21:20:02 \u002B03:00\u0027 --until=\u00272026-11-16 21:20:02 \u002B03:00\u0027 --full-history --no-merges -- crates/line-index/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/line-index/src/lib.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0ead110f013f8735e451a07e90d2bdac739373a2a58d386c637ca403a2b860"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 39 significant file(s) lose their only recent owner: crates/bsl-platform/tools/html-parser/src/scraper_parser.rs, crates/bsl-analyzer/src/smoke.rs, crates/hir-def/src/ty/doc_types.rs, crates/ide/src/signature_help.rs, crates/hir-def/src/region_tree.rs, crates/ide-diagnostics/src/handlers/magic_number.rs, scripts/test-tier-registry.py, crates/platform-help/src/lib.rs (\u002B31 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"47b810d2afc1998ddb0666d013998b5d6040207d207cb553ce1a5563e7f79f34"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 5 significant file(s) lose their only recent owner: crates/bsl-debug/src/types/xml.rs, crates/ide-diagnostics/src/metadata.rs, crates/ide-diagnostics/src/handlers/postfix_access_on_expression.rs, crates/hir-ty/src/call_resolution/candidate_builders.rs, crates/hir-ty/src/call_resolution/tests.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a088a5f1a69fabd63a7524473be64bc2c6abefcb8f995480057a69037a1a2cd7"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 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 (47 single-owned of 862 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 862 of the 985 production source files in this repository met that bar). They are anonymized user #3 (2 file(s)), anonymized user #4 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: crates/ide/src/syntax_highlighting/docs.rs, crates/bsl-platform/src/parameter_series.rs, crates/mcp-server/src/cache_windows.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO inline \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/bad_words.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc69ef7a26c1ffe6601a9b6d0ff3e5380ac0bf6f20e0aa61d690f1f40a076409"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0414\u043E\u0434\u0435\u043B\u0430\u0442\u044C \u0444\u0443\u043D\u043A\u0446\u0438\u044E \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/bad_words.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"f502ae4673e41c29c29d82ecbab4335a9029579d7242130dec9d17f2649df212"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO right before it, matching its indentation. It leaves a placeholder for the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/if_else_if_ends_with_else.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"823ef0afe1a4957d4721ff8b324049b3e6c6e72f542124df6a7adff4fc00d7db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u043E\u0431\u0440\u0430\u0431\u043E\u0442\u0430\u0442\u044C \u043E\u0441\u0442\u0430\u043B\u044C\u043D\u044B\u0435 \u0441\u043B\u0443\u0447\u0430\u0438 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/if_else_if_ends_with_else.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e393c1b26ff7e223a6d784d3a9063d614edcdd9775aee6980fc9586bfa75b6ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0443\u0434\u0430\u043B\u0438\u0442\u044C \u043F\u043E\u0441\u043B\u0435 \u0432\u043D\u0435\u0434\u0440\u0435\u043D\u0438\u044F \u0411\u0421\u041F \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_service_tag.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a15c03002d89c050b7694c9c8dbf4d0fab9005e422ae769081d5aef0672629"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0443\u0434\u0430\u043B\u0438\u0442\u044C \u043F\u043E\u0441\u043B\u0435 \u0432\u043D\u0435\u0434\u0440\u0435\u043D\u0438\u044F \u0411\u0421\u041F \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_service_tag.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"219b8862f96386f3fe929ce170ad5b84f417a5eec57448585645de0f0c2fddc7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0414\u043E\u0431\u0430\u0432\u0438\u0438\u0442\u044C \u043D\u043E\u0432\u043E\u0435 \u0437\u043D\u0430\u0447\u0435\u043D\u0438\u0435 \u0432 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0443 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_service_tag.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26fc7c4cf12f08124bad0bb2d7048a2d6ff7bbe3dc53f29920a1c5b88217ac1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0414\u043E\u0431\u0430\u0432\u0438\u0438\u0442\u044C \u043D\u043E\u0432\u043E\u0435 \u0437\u043D\u0430\u0447\u0435\u043D\u0438\u0435 \u0432 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0443 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_service_tag.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"f910544499d9c4821cc36f388f2de205e4c758b14139367d6af7741f07c11f53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u043F\u0440\u043E\u0441\u0442\u043E \u043F\u0440\u043E\u0432\u0435\u0440\u043A\u0430? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_service_tag.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff48a7d4b7f08bb0c2d1fc9a8f77025101f6cfeb7af15ee321d62508ed1bad0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u043F\u0440\u043E\u0441\u0442\u043E \u043F\u0440\u043E\u0432\u0435\u0440\u043A\u0430? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_service_tag.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"543dfd002bbfa86efa91f37fc15ce310ed9a1c4d5a4561fe9c027ff5f947eeb9"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/mcp-server\u0060 (134917 LoC, 136 module-visible types across 8 directories) overshoots its size bounds. 8 of 49 build unit(s) (Cargo, Python) overshoot their size bounds, lowering Project Cohesion to 6.7/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a68641736fb12ff893e7f02725c1ea036c4f8f8e4c440cc0dd2204ea9e43234"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/ide-diagnostics\u0060 (89918 LoC, 278 module-visible types across 4 directories) overshoots its size bounds. 8 of 49 build unit(s) (Cargo, Python) overshoot their size bounds, lowering Project Cohesion to 6.7/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66866020f3455096c5f2f62428f8286db785862115c3f62248069fd84b7d510"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/bsl-analyzer\u0060 (56905 LoC, 220 module-visible types across 15 directories) overshoots its size bounds. 8 of 49 build unit(s) (Cargo, Python) overshoot their size bounds, lowering Project Cohesion to 6.7/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50325c011d69ac27b6144b2e83fc9d7a7d86153626b8042e105d72eb23670fe2"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/bsl-search\u0060 (51947 LoC, 161 module-visible types across 3 directories) overshoots its size bounds. 8 of 49 build unit(s) (Cargo, Python) overshoot their size bounds, lowering Project Cohesion to 6.7/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b79495d29300dac6e235acdf41d611ca45ae784e52af5a6a10434fba03a508"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/ide\u0060 (34706 LoC, 212 module-visible types across 12 directories) overshoots its size bounds. 8 of 49 build unit(s) (Cargo, Python) overshoot their size bounds, lowering Project Cohesion to 6.7/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"724b9ddbe2b121876054029f3e7409f397f17dad90a9c6e3493d037cb3f7e61c"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/hir-def\u0060 (34467 LoC, 230 module-visible types across 7 directories) overshoots its size bounds. 8 of 49 build unit(s) (Cargo, Python) overshoot their size bounds, lowering Project Cohesion to 6.7/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"911abfa5b43ac9429e3f8ebb1f5695a6c67fda08885dcf77ddf755c5c5bce3f3"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/hir-ty\u0060 (32707 LoC, 145 module-visible types across 7 directories) overshoots its size bounds. 8 of 49 build unit(s) (Cargo, Python) overshoot their size bounds, lowering Project Cohesion to 6.7/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3bbb9caed2744d8dc24348ec00d8aad6c8f14b914338ed5bd079c16aa59b62"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/bsl-metadata\u0060 (19217 LoC, 122 module-visible types across 2 directories) overshoots its size bounds. 8 of 49 build unit(s) (Cargo, Python) overshoot their size bounds, lowering Project Cohesion to 6.7/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa9882551f4b6d57b1849d2f54fd7a5cc82dd6c984ae375cca7f99c1c664299"}},{"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":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"866f5db9e17cba13054be81498300d5689d6380b38ab693dd948f99e20adbff5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54015389eb5f9a0beb6433e209224f32665bbffd45f48b4ac71eacdc7584cddd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"05dd1cc6a6536213feac72458953b3ecc92da85b7219289a9d2c68054660f8e9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58416306c1a27a37c4768b939e55dd2865e8672774adab59964be2ffeffdd74f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1873f73df2980e05749fb989e4983bd7e44b6790994284629fa7f4a2ef29ad4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99c8716916ca0dd9ddee8302208a5745bab6513f34ca12c2672d93f07c07be5f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82a1893f62fe8dee3fcdaad2e3da3e94b86729172346ee8d336b86cb9d8780c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45e43b2cf0f13df69fd5c5d1f3263d8d91ae8a1d217ff414c529a77aebd1ca8d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b81debfdf26ad72c8d0b6ae327091ed6b094389fdb86a94cad6363ea8f38e48"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b562a86ba4fad32d6ccdcd6ca2d4c34c2236a59e5d8276adbfb83a1790cdee0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"57d823555c0f50a3493fd14230fc2974c80d783a2164e0399518f807a574cc38"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"233c283afabc3cbe9e1fb2c663cda67ee401e34fde1c1baa92c564e85ddd0b79"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab979ab2dc46515c14a5a4f004fc991e04e40404eedb88f91aeaa5242f0df4a2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74e9a15e0aaad67b56b01fc904a989f50780d47c2a8d26f4479f4d170548bf18"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f052e3b915703ce74dbe254ce3507080529b36b18c985045e6219d12e5a0d05"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4014e7719155abad9ee780737c6a29d8c31bcf1e70b94286734d74edc799576"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"93c67239263ced008f6948a23fc91225b82d9ea981b2c200b7bb9b3e6d6a2731"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8358801f39b00898552496f70ea14d5cd30197b985656c6109c836b3d66a18b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ba1bd8cd7cc00ffea37dae7b5e07643f624b23874e3cb0759fc3e4878f73406"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d92d492f279497a97159e521f6a848a5f0fc66e0e4668028d0cca48bba8e0cd2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df38043f089cc380f0507d28c25a6e9fb75594e3ba57309dfa9892cd52cb6a01"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dcfa4da9215284db6a6355a359d46e54ece6d33a8e6548e02570fa88e565fa20"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fe915542e9ef9e0e2030d13e5e967c9edc93ad44e0043112709e63c307bce8b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f782c0d7a9f0d5d38c75648713b76f1fde3fc1f981d05642591632401bdb112c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35556a5475cb1c5234059a0b3c30dda978f5fd4eceae301f3db788741b04bfcc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb0c607bd165f0cf3b34a2f73b61c1ed49abc3b4ce9af13dabc25e65096c4298"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"693249723480b7d3690fbc9002e4acaa2fd5c4f5277d52948268b51530c89d1e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"925a1751e8d41c7a13a4890cf62f333e20e1b9979e60753140251f2431b1053b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8018fa76f9798f58c2d54888e01f82e01d93750f0c34580eea02821510c2b5a4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"194a1865ac28c4ae38c004b2601f2b28923cef7e57a09e701d1f0c62e1a4f16b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d46bdcf42c1c606bdd786623bb0af01ceec881af0d3bbc48f063beab9197add"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9317c6bff8cff2e4a88424157c1618dbad988ca014793c84ac07ed03b4dc6dca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8259b8be486050d832e8cd0d3615cb14b1c44312ffed9c1274cb8979ba9ade8a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"42e9d6301c053362bf0ce37242fc71d90cc3de86ff5d08eaaf6a8b1b31766102"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"437e31ed7e1f0c36c778d0593905664f31212f69983cbd327ce719f592ceeb16"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07bf96121e49e35629cf8401a8d0796240f8aeed41aa27ee01bf292a421b2e08"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e08ddf0b34466d16c249b81109cb6e3b6a3a56098545eae46865168cc6d82e78"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d97387fb76fa3c76a40f2841c0b62489e16c81051f0d5bdbabb02dd26d947fc"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bdeaf8aa5f2cb0d550c98cdc911647e8966320cd3dfc37514e8f6b447962a4d5"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45a626c37aa7aaf6ad28262aaf4789af9cfc66c50be888e34865387fd36de616"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b25a611569a0196ccecfe9ed7cef8009e7c1208be8aae70b03cd51b42bccf8f6"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9a542c246d3a4e5076658e607344f16dcfd875007babed0f0e37c709d3e61ff"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f429eeac556ca7578faa2cb697580d5ee79271a09fb0a27524134afea049bcd2"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d7518afb0053e5e6b418234d9f654c57682b984f8d6ba7850b43044b7442e23"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e3eda7e0ad59d199345e467c284981620462786a69a40f2ad3a58f8592089098"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1edbe79cd7b61ec9e15657f82085ee303ea388c7ea7ddce634c6643994428aae"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6b5c1c2d60b15f756050f849eb44f30d6170bbbd1d26a952181331e22ef139e"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a7165b43e8aa24da12fcd1cca47ac7556b410287ffb04cb8c0ad24a71edc9b39"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0db09bf9328a3438faa69f77b47269a25318ff247a9551068814cd7fe0568fd5"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46cec58be2c9a785b46ae9cf9dd669d5d41262793e2dd2bcd04a119bf6971ae6"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63778fa624412affc09bbae17ed4e235deee47c1e8fbbd49594e08c2f223c987"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"058fb25accd6485c226bf82b7899932e6a2c24b8e24955b0ec1cc977920f64d6"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5700cf8ee182fc440abb16030061d2e9976929eb60c880096208a514bc453b10"},"properties":{"dependency":{"package":"zip","version":"8.5.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429"],"severity":"critical","fixedVersion":"9.0.5","relation":"direct","declaredRange":"8","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ec6eb82b5c491529ec32e9c3bdabd5655bf79fa3c694a8b51178853861951e50"},"properties":{"dependency":{"package":"postgres-protocol","version":"0.6.11","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]","RUSTSEC-2026-0179","RUSTSEC-2026-0180"],"severity":"high","fixedVersion":"0.6.12","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5308f9ed219ff7d361ed2b01ab7b5fa7a33b0013fcd35575e7068ccda1d2997"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.14","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0185","RUSTSEC-2026-0338","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"severity":"high","fixedVersion":"0.11.15","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"759d36a63e8483c4a467399ff199fa57fa2e02d89ef311720974588edb9516d4"},"properties":{"dependency":{"package":"anyhow","version":"1.0.102","advisory":"RUSTSEC-2026-0190","severity":"medium","fixedVersion":"1.0.103","relation":"direct","declaredRange":"1.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ca383df8f93c1fcb449201c7c47b9fc487e55acf31a9bb60212d29fe36dde189"},"properties":{"dependency":{"package":"block-buffer","version":"0.12.0","advisory":"[GHSA redacted]","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c7b9a8ac482fc86f4a71123ceed4c93ea0c3271a81af8110055d770516a43327"},"properties":{"dependency":{"package":"cap-primitives","version":"4.0.2","advisory":"RUSTSEC-2026-0482","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"4.0.3","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b995e75272b61cf5f3649600c4af60acb108488f8113b0f25a04ec6792e70778"},"properties":{"dependency":{"package":"cmov","version":"0.5.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"0.5.4","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4a0c58aca13bc848c37d4c3d5bcb90f8e046f8df5b386f5a3743d0625ad8dae"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","severity":"medium","fixedVersion":"0.9.20","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"109eb8c2be00952287a6643744da7dcc2c9a7a6618d7cac60ea6539c1687dfd6"},"properties":{"dependency":{"package":"ctutils","version":"0.4.2","advisory":"RUSTSEC-2026-0385","severity":"medium","fixedVersion":"0.4.4","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47c5576439236b8a201d46e552e9541555e69819faee22cce09defc812266cff"},"properties":{"dependency":{"package":"cxx","version":"1.0.194","advisory":"RUSTSEC-2026-0202","severity":"medium","fixedVersion":"1.0.195","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9985e934bf5258966ba30771d636042c3373acbe5f9699173950198ff207d4c4"},"properties":{"dependency":{"package":"git2","version":"0.20.4","advisory":"RUSTSEC-2026-0183","severity":"medium","fixedVersion":"0.21.0","relation":"direct","declaredRange":"0.20","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1eae401a2a8770be38f5a54c3afe36fa4464ebe4004c5fb285ffaa2f1ae4d5b7"},"properties":{"dependency":{"package":"git2","version":"0.20.4","advisory":"RUSTSEC-2026-0184","severity":"medium","fixedVersion":"0.21.0","relation":"direct","declaredRange":"0.20","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b3f5e73f54279d8a385f3ccb6ce6659725cab3121019062bfd36c6500f66d85"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.38.0","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"severity":"medium","fixedVersion":"0.39.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"728758c9d3428053e1082b5fb9832c05e2e04dab40233f2ffbfd7792b93201ec"},"properties":{"dependency":{"package":"libz-sys","version":"1.1.29","advisory":"RUSTSEC-2026-0418","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.31","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.39.2","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"severity":"medium","fixedVersion":"0.41.0","relation":"direct","declaredRange":"0.39","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.14","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.5.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0a650926c1446a30b78b4d0bd1ac0b14a584b7ecfe488180d3a51ffb3e8d361"},"properties":{"dependency":{"package":"rmcp","version":"3.6.0","advisory":"RUSTSEC-2026-0457","aliases":["[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0462"],"severity":"medium","fixedVersion":"3.7.0","relation":"direct","declaredRange":"3.1","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7481fb93c86b503a82a3e06a3172c7e27c5da26b8a178702a1e8028944c7596"},"properties":{"dependency":{"package":"rustls","version":"0.23.38","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"severity":"medium","fixedVersion":"0.23.45","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.13","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"0.103.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5142003981c324666bb583598b357b42178f3deb91658fc9a55bd03a382aebe1"},"properties":{"dependency":{"package":"salsa","version":"0.28.2","advisory":"RUSTSEC-2026-0308","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.28.5","relation":"direct","declaredRange":"0.28","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.52.1","advisory":"RUSTSEC-2026-0386","severity":"medium","fixedVersion":"1.53.3","relation":"direct","declaredRange":"1.35","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8977321aecc28dedc7f149b649deae898a3d3083d35bad2f5230fa177c5ae0c3"},"properties":{"dependency":{"package":"tokio-postgres","version":"0.7.17","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2026-0178"],"severity":"medium","fixedVersion":"0.7.18","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c78c7c829ffb431fb928ff724c9cf0276a780b7b7d9be87f32343d1209a988f8"},"properties":{"dependency":{"package":"webpki-root-certs","version":"1.0.7","advisory":"RUSTSEC-2026-0383","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0382"],"severity":"medium","fixedVersion":"1.0.10","relation":"direct","declaredRange":"1","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"232458f1e861a473d11b103db83010acd3c76ee2f5eb5b53069ae6f2eda9586f"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.7","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"1.0.10","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"705e8761c5e609601c0419d94a8bad1aeb6aee434f48ec4660c92e8bf534c9de"},"properties":{"dependency":{"package":"number_prefix","version":"0.4.0","advisory":"RUSTSEC-2025-0119","severity":"info","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","severity":"info","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: standards.rs \u2192 handlers.rs, runner.rs, diagnostics.rs: \u0060crates/ide-diagnostics/src/standards.rs\u0060 changes together with 3 other files \u2014 \u0060crates/ide-diagnostics/src/handlers.rs\u0060, \u0060crates/ide-diagnostics/src/runner.rs\u0060, \u0060crates/sdbl-hir/src/diagnostics.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/standards.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4613db8e50d1ee38eccf93317c5ed338687d659227eb0d99cb84fb053d1e9e29"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: salsa_provider.rs \u2194 context.rs: \u0060crates/ide-db/src/salsa_provider.rs\u0060 and \u0060crates/ide-diagnostics/src/context.rs\u0060 change together 83% of the time (10 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u00604672789a\u0060 \u0434\u0438\u0430\u0433\u043D\u043E\u0441\u0442\u0438\u043A\u0438: \u0417\u043D\u0430\u0447\u0435\u043D\u0438\u0435\u0417\u0430\u043F\u043E\u043B\u043D\u0435\u043D\u043E \u043E\u0442 \u0411\u0443\u043B\u0435\u0432\u043E (ValueIsFilledOfBoolean); \u0060047d85a5\u0060 \u0434\u0438\u0430\u0433\u043D\u043E\u0441\u0442\u0438\u043A\u0438: \u0432\u044B\u0437\u043E\u0432 \u041C\u0435\u0442\u0430\u0434\u0430\u043D\u043D\u044B\u0435() \u0443 \u0434\u0430\u043D\u043D\u044B\u0445 \u0444\u043E\u0440\u043C\u044B (FormDataHasNoMetadata\u2026; \u0060d034dadb\u0060 fix(ide-diagnostics): StructureKeyIsNotIdentifier \u043F\u0440\u043E\u0432\u0435\u0440\u044F\u0435\u0442 \u0421\u0432\u043E\u0439\u0441\u0442\u0432\u043E \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/salsa_provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2945fd926d2f5a01f5b4306ca0c66068a52628c2b288abf41872be44f0b2ed"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: analyze.rs \u2194 features_state.rs: \u0060crates/bsl-analyzer/src/bin/cli/analyze.rs\u0060 and \u0060crates/bsl-analyzer/src/features_state.rs\u0060 change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060cdbfc29a\u0060 fix(mcp-server): apply project config to the diagnostics resident lik\u2026; \u006072edbebc\u0060 fix(mcp-server): apply \u003CDefaultRunMode\u003E in the diagnostics resident; \u0060db13b06e\u0060 fix(bsl-analyzer,mcp-server): apply the ordinary-form setting in the \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ca59d6079a1e55d06db658e7d11900a327721042a504544cf3dfa48aa1e8a3"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: handlers.rs \u2194 diagnostics.rs: \u0060crates/ide-diagnostics/src/handlers.rs\u0060 and \u0060crates/sdbl-hir/src/diagnostics.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060020952f5\u0060 \u0414\u0438\u0430\u0433\u043D\u043E\u0441\u0442\u0438\u043A\u0430 \u0443\u0441\u043B\u043E\u0432\u0438\u044F \u0432\u0438\u0440\u0442\u0443\u0430\u043B\u044C\u043D\u043E\u0439 \u0442\u0430\u0431\u043B\u0438\u0446\u044B \u0431\u0435\u0437 \u0438\u043D\u0434\u0435\u043A\u0441\u0430 (#389); \u0060f8b0f618\u0060 feat(sdbl-hir): diagnose ordering by a document reference\u0027s date (#404); \u0060adf72eb8\u0060 \u0414\u0438\u0430\u0433\u043D\u043E\u0441\u0442\u0438\u043A\u0430 \u0447\u0442\u0435\u043D\u0438\u044F \u0440\u0435\u043A\u0432\u0438\u0437\u0438\u0442\u043E\u0432 \u0440\u0435\u0433\u0438\u0441\u0442\u0440\u0430\u0442\u043E\u0440\u0430 \u0432 \u0437\u0430\u043F\u0440\u043E\u0441\u0435 \u043A \u0440\u0435\u0433\u0438\u0441\u0442\u0440\u0443 (#399) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"973d6a624d073dc179cfdef958fca7eb6330f1bd0b2af308f009a7ad0aef75a4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: code.rs \u2194 diagnostics.rs: \u0060crates/ide-diagnostics/src/code.rs\u0060 and \u0060crates/sdbl-hir/src/diagnostics.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060020952f5\u0060 \u0414\u0438\u0430\u0433\u043D\u043E\u0441\u0442\u0438\u043A\u0430 \u0443\u0441\u043B\u043E\u0432\u0438\u044F \u0432\u0438\u0440\u0442\u0443\u0430\u043B\u044C\u043D\u043E\u0439 \u0442\u0430\u0431\u043B\u0438\u0446\u044B \u0431\u0435\u0437 \u0438\u043D\u0434\u0435\u043A\u0441\u0430 (#389); \u0060f8b0f618\u0060 feat(sdbl-hir): diagnose ordering by a document reference\u0027s date (#404); \u0060adf72eb8\u0060 \u0414\u0438\u0430\u0433\u043D\u043E\u0441\u0442\u0438\u043A\u0430 \u0447\u0442\u0435\u043D\u0438\u044F \u0440\u0435\u043A\u0432\u0438\u0437\u0438\u0442\u043E\u0432 \u0440\u0435\u0433\u0438\u0441\u0442\u0440\u0430\u0442\u043E\u0440\u0430 \u0432 \u0437\u0430\u043F\u0440\u043E\u0441\u0435 \u043A \u0440\u0435\u0433\u0438\u0441\u0442\u0440\u0443 (#399) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/code.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6999355d406ddcfa19d13dbe3c56d0ac061867fcb0a8fd4ef1e01ce3776cea0"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19d4cbb252a3e4997007fe629a8fde65a6a24e745494155b47ed43cbf523f1eb"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6eb5a94052c328a9f9d4f3228923a5f2d4d56700f96d3ddbb1b358415402983"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060append_baseline_summary\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/check_config.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a81fa659d5628309e457ca64d75ab46d71252ca06a0c6c8afdbfcfec4c99cd"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060semantic_tokens_stage\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a344c42efb65ef4cc122421fefc0579b443213bd604bbde838393fcb8874862"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060document_symbols_stage\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"923d89351246489db6d9122b34b1eded896da3e4ad6b9e35bf6dad4f55560e51"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060folding_ranges_stage\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1654166fa5e6c971e316c072a8dea1a6f1d21ead8c7644cd450a86a35de448"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060diagnostics_stage\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c0480c33637f5f20acd041f08ab3f9b47cc852448e4bb35902141808f0b8c1"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060lifetime_pair\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/security/mod.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e4de97da76675e19ffac01eb7f807e7c147edfb020d15854f883f9667aff7a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060log_snapshot_publish_phase_timings\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":4276}}}],"partialFingerprints":{"codehealthFindingId/v1":"45aa3b36352d8688be164e6e43e577e78997753b0a7a95c41b79a08474300316"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_process_id\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/lifecycle.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75cc9ab97208831569f2af086ea55425e0e225f4a173fcb0b2690fb959f7a13"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060body_arc_heap\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"65137ed8767365c8411db28d8196ff735af6769ce070b03a83ce536d10481a6b"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060shared_effect_summary_heap\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/effects.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cab65f235f66132ba2d96574caf938030cb3c9b873eaf0d06d773746848dfd"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060shared_mdo_heap\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5e49f33eff29c1d94725813ec43f4a6c122194fcba40d07aa3762ea9d91661"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060shared_register_heap\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9ccf41c04d0188ef4fdea7455168596d85ca1cb758a7a875440f5337a47b18"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060shared_common_module_heap\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ae27bbea75b52e3c89a4a3c90d17f42ab06bbe4f53e7d93e8e6b4478c14969"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060shared_http_service_heap\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66e6d31fd0928fda9f509212f284f70cd4e5335a0aa3507a26325be76b1c081"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060shared_web_service_heap\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d20bb63b4658bd6de1e0f10d9583a079e90dff40e10f53759fb520ae2f1ad70"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060shared_integration_service_heap\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e81d64c2503376c75afefcbbfd28b5c5f090bcb9de724aa8f22dbe8a42dce4"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060shared_event_subscription_heap\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0a59db00790afda88be124845049b75139b84f1aa3c704066af3543296343c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060shared_scheduled_job_heap\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb19f9fc255a91b4a3aa5e05974693f6d57f569d3c9c89bdeb779973f2c07db"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060shared_role_heap\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b260ac2e4eb7a5fbffdbfd3e145a0097d5db2b4b6fcd757c331f576e5fb4fd8b"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060shared_subsystem_heap\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/metadata.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6af75535c8a9ff669721375a43c5ae855d5dcfee2b76609f7102f8ec3b718c7"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060from_hir\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_common_module_method.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"84491b823511845f261341a2ad05ac3326106ae3e1b12b9414625d1fa404a154"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060register_cli_surface\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/contract.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa81663df56d565a83beb5523cdcc353b826b74c8173db7fbf310b3786b3300"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060zero\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/heap.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"496f7defd87e067d968bb3475eba30813627dc045f663881d0357fdf4da6a84c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_current_thread_qos_class\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/thread/intent.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5256b5737d3428bc50f6a40e59a87a5afc3386ba927b2f9d396a288a684d4c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060file_content\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs/src/lib.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d90b2317c20e9d43d7e2ca5614447e2ac4886cd85443fb5543832a34ca7c7b7"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060ide_db.database\u0060 is marked as implementation by its own namespace, folder or name: \u0060RootDatabaseImpl\u0060 (crates/ide-db/src/database.rs:95, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04653733c391be7ada287e4f3d3c9e8fb74de47dea657c0ae0ea9f0dcbfd724"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 24/28 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060crates/bsl-check-executor\u0060, \u0060crates/bsl-launcher\u0060, \u0060xtask\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060Cargo.toml\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Cargo.toml"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58f1258ac0739cd1e0a2e83a9aae67bcefcf633d7f90f15ee6eb51c19cdb530"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/release.yml"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::builder()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-launcher/src/http.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ed5932aaa0b9ae27384d867a33c497f38f3608c7435f4d63c5b84547f6dcbe"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::builder()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-launcher/src/http.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d035f6b0f2668e59f12be631b8e1c5db8f1fa618b97b6e69bf6ed009c305f5d"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060urllib.request.urlopen(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/user2/prepare-qwen-vulkan.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"672b45b8b24520beca3d56768386abd12c54f0bbac25a7b42a7833b96a24c159"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060run_daemon\u0060 is async and calls block_on \u2014 a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/mcp/shared.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0696da2934a7d67ba750dc353c424c058fc6afbbd32d9d8adc0e6eb8ff6f8a5"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: This repository starts an HTTP server and nothing in its Rust source or committed \u0060Rocket.toml\u0060 secures the transport: no TLS served (actix-web \u0060bind_rustls\u0060/\u0060bind_openssl\u0060, axum-server \u0060bind_rustls\u0060 with a \u0060RustlsConfig\u0060, tonic \u0060ServerTlsConfig\u0060, a \u0060TlsAcceptor\u0060, Rocket\u0027s \u0060[default.tls]\u0060), no \u0060Strict-Transport-Security\u0060 header, no \u0060X-Forwarded-Proto\u0060 read from a TLS-terminating proxy \u2014 so its traffic may cross the network in clear text. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (crates/mcp-server/src/http.rs:291)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8697c7a8b4c37084f15e81b8ec84d4cf62954730be74a0816d39b2127a21fd9b"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is set on a response this repository\u0027s Rust server sends \u2014 defense in depth, even when a proxy could set them. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (crates/mcp-server/src/http.rs:291)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd19c680309417e132c0be93c2002123f0664b42afe6172b1319da65a6a57ba7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.corpora or data.path(\u0022corpora.toml\u0022)\u0060 appears character-identically in 2 files \u2014 scripts/perf-nightly/night.py, scripts/perf-nightly/perf_nightly.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf-nightly/night.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"366323df0e0c7fd1a379f8279a996df90ee1e548767ce801f270ea0e177a0ca4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, (int, float)) and not isinstance(value, bool)\u0060 appears character-identically in 2 files \u2014 scripts/perf-nightly/perf_nightly.py, scripts/perf-nightly/verdict.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf-nightly/perf_nightly.py"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef91912f840bfe578b7f9041dc6e69200cbcf096579ee4546710b03b970cfd7f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!before.is_some_and(is_ident) \u0026\u0026 !after.is_some_and(is_ident)\u0060 appears character-identically in 2 files \u2014 crates/ide-diagnostics/src/handlers/unused_local_method.rs, crates/mcp-server/src/graph_query.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/unused_local_method.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"700bd6535d40f02df5b2fb5bfd64e39aecbb5a14ae4a524df2d38060c76b2082"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!entry.en.is_empty() \u0026\u0026 lower == entry.en.fold_lower()\u0060 appears character-identically in 2 files \u2014 crates/ide-diagnostics/src/handlers/deprecated_platform_api.rs, crates/ide-diagnostics/src/handlers/deprecated_platform_facts.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deprecated_platform_api.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f2cc6a5300d204676c460b96352d44e4919a95038a35cab4b444022ddf00a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!form.is_managed() || form.has_base_form()\u0060 appears character-identically in 2 files \u2014 crates/ide-diagnostics/src/handlers/missing_form_event_handler.rs, crates/ide-diagnostics/src/handlers/unbound_form_event_handler.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_form_event_handler.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"205a20419c7168c3822f2ffae3ef8e16599eee24c1d609d326267439b977fa1b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!metadata.is_file() || metadata.file_type().is_symlink() || metadata.len() \u003E 2 * 1024 * 1024\u0060 appears character-identically in 2 files \u2014 crates/bsl-check-executor/src/native_check/profile.rs, crates/bsl-check-executor/src/native_check/source.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":2267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea738e7e66dee5c04a0c05f3fc20c2ce6d21277cafb67cd0f775aaaf4df91f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!rendered.is_empty() \u0026\u0026 seen.insert(rendered.clone())\u0060 appears character-identically in 2 files \u2014 crates/bsl-search/src/engine.rs, crates/bsl-search/src/workspace_overlay.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1129a4904cb6b3ba9ce8b3e80f39d2ca97de320ed90d726d8e9f6713d64825"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.start() \u003C b.end() \u0026\u0026 b.start() \u003C a.end()\u0060 appears character-identically in 2 files \u2014 crates/ide-diagnostics/src/lib.rs, crates/ide/src/batch_fixes.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5acede60f16032d1f3a8ca320b362fbf19b9415179e63e694923afa5acd21c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060actual.eq_ignore_ascii_case(en) || actual.fold_lower() == ru.fold_lower()\u0060 appears character-identically in 2 files \u2014 crates/hir-ty/src/platform_type_name.rs, crates/hir-ty/src/subtype.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/platform_type_name.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c54073ee0d6299d403755841a8aceb947d3692fcaa961c7db1733f50b43aab8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060baseline_count \u003C fetch_limit || baseline_count \u003C= previous_baseline_count\u0060 appears character-identically in 2 files \u2014 crates/mcp-server/src/tools/search/lexical.rs, crates/mcp-server/src/tools/search/semantic.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36c8ff69dd8e93b98da089c70cc091b91881d6799ef31259f6b2ff7e5812c9a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060building.generation == generation \u0026\u0026 !building.structural_superseded\u0060 appears character-identically in 2 files \u2014 crates/bsl-analyzer/src/call_hierarchy_index_state/journal.rs, crates/bsl-analyzer/src/call_hierarchy_index_state/status.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/call_hierarchy_index_state/journal.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a03eb6f67f9f26974216b5330e722814bd66a6592d6611b7189a707d92ceaab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.is_disabled_with_metadata(code) || ctx.is_module_code()\u0060 appears character-identically in 3 files \u2014 crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs, crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs, crates/ide-diagnostics/src/handlers/pairing_broken_transaction.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicated_insertion_into_collection.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc0e1e31e190ba80ada67602f691b9b2ba2d643dc1346bf102aa95425a1c2b9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.is_disabled_with_metadata(code) || ctx.module_metadata().module_type != bsl_metadata::ModuleType::FormModule\u0060 appears character-identically in 2 files \u2014 crates/ide-diagnostics/src/handlers/form_data_has_no_metadata_method.rs, crates/ide-diagnostics/src/handlers/global_context_method_conflict.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/form_data_has_no_metadata_method.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a15738b4fcd532abcd37fe159b5f2ad5a489b46f130b8ee80408d87e14797fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.element_kind == ElementKind::Method \u0026\u0026 entry.display == DisplayKind::Method\u0060 appears character-identically in 2 files \u2014 crates/ide-diagnostics/src/handlers/deprecated_platform_api.rs, crates/ide-diagnostics/src/handlers/deprecated_platform_facts.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deprecated_platform_api.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"94598b1499e889f8cdf66eecbcace17f466ffa7ff7b0aac2c4285516da5319de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.file_type().is_dir() || entry.depth() == 0 || entry.path_is_symlink()\u0060 appears character-identically in 3 files \u2014 crates/mcp-server/src/change_hub.rs, crates/project-model/src/source_set.rs, crates/project-model/src/workspace_walk.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c714f8f555669c628f6aed42d5f1eedd691ad1b53b0ee0c292dda381a090216"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060facts.terminal || facts.stopping || facts.in_flight || !facts.owns\u0060 appears character-identically in 2 files \u2014 crates/mcp-server/src/graph/debt.rs, crates/mcp-server/src/graph/state.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/debt.rs"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea58254eb04d8e2c5aad68d3af1a794b1e604a5749d5583ab2c497f76ef8c2e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060graph.owes_forced().is_some() || graph.drift_pending()\u0060 appears character-identically in 2 files \u2014 crates/mcp-server/src/graph/state.rs, crates/mcp-server/src/graph/watcher.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":6576}}}],"partialFingerprints":{"codehealthFindingId/v1":"58645754fb9290e7a64fdcaa92270663b61c03c64601c8dc9e3dd7484df304da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hub.is_polling() || hub.is_partially_blind()\u0060 appears character-identically in 2 files \u2014 crates/mcp-server/src/graph/state.rs, crates/mcp-server/src/state/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":2525}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e00d35f304d72db19eb41f5bf1142a34de2fba4837ce6917e552e1abf0fc3d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u002B 1 \u003C bytes.len() \u0026\u0026 bytes[i \u002B 1] == b\u0027%\u0027\u0060 appears character-identically in 2 files \u2014 crates/hir-def/src/body/lower/expr.rs, crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba80aa8509df6502ca016b70224a3b91f55fe7b0e81595d9e420e323cc6173e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u002B 1 \u003C bytes.len() \u0026\u0026 bytes[i] == b\u0027%\u0027 \u0026\u0026 bytes[i \u002B 1] == b\u0027%\u0027\u0060 appears character-identically in 2 files \u2014 crates/hir-def/src/body/lower/expr.rs, crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"d217ff70687702e92eb3647aa98c8883aa9999f6e16abf53ab34d077d56767cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inner.reload == ReloadState::Running || inner.invalid_configuration.is_some()\u0060 appears character-identically in 2 files \u2014 crates/mcp-server/src/diagnostics_state/drift.rs, crates/mcp-server/src/diagnostics_state/lifecycle.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/drift.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1d3a5a47f0ae33907d8a5019a3560f8ae9c5489d619eba448055fd33e2586e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060marker != Some(false) \u0026\u0026 !(scope.is_some() \u0026\u0026 marker == Some(true))\u0060 appears character-identically in 2 files \u2014 crates/ide/src/diagnostics_baseline.rs, crates/project-model/src/lib.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/diagnostics_baseline.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c5cc12dc9e6cb3ea7cd6bcdc54ce27d4bd667925d78046657b2f5b5b80a28f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060module_owns_bare_call(name, ctx) || module_owns_bare_call(replacement, ctx)\u0060 appears character-identically in 2 files \u2014 crates/ide-diagnostics/src/handlers/deprecated_current_date.rs, crates/ide-diagnostics/src/handlers/deprecated_find.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/deprecated_current_date.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e79bdfe8256681682ed07a52a62f6bef2d7c6d0f669a24549581292e30d9c08"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name \u003E end || !text.is_char_boundary(name) || !text.is_char_boundary(end)\u0060 appears character-identically in 2 files \u2014 crates/ide/src/graph.rs, crates/mcp-server/src/graph_query.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":3232}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf5446185240f9600f260b7bbbae26fd35143df87bb83418c209882f0817296"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name_lower == \u0022\u044D\u0442\u043E\u0442\u043E\u0431\u044A\u0435\u043A\u0442\u0022 || name_lower == \u0022thisobject\u0022\u0060 appears character-identically in 2 files \u2014 crates/hir-def/src/body/lower/stmt.rs, crates/hir-def/src/call_graph.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/stmt.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dc7f7db7e2f3ac28a3f4666c127e2d134fa85a38a32207431985b6f13f4c03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060num_end \u003C bytes.len() \u0026\u0026 bytes[num_end].is_ascii_digit()\u0060 appears character-identically in 2 files \u2014 crates/hir-def/src/body/lower/expr.rs, crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"a027dd923e922b9cb3153a15483281e861f2450cadb174e23a94d3bb5a3efd15"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060num_end \u003E num_start \u0026\u0026 num_end \u003C bytes.len() \u0026\u0026 bytes[num_end] == b\u0027)\u0027\u0060 appears character-identically in 2 files \u2014 crates/hir-def/src/body/lower/expr.rs, crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1755}}}],"partialFingerprints":{"codehealthFindingId/v1":"33cef39c2036570b6722e2a7f3b3299fe80d07b80428a03288070b2d4f32f417"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.at_keyword(\u0022CASE\u0022) || p.at_keyword(\u0022\u0412\u042B\u0411\u041E\u0420\u0022)\u0060 appears character-identically in 2 files \u2014 crates/parser/src/grammar/sdbl/expressions.rs, crates/parser/src/grammar/sdbl/select.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed272e8923c3e28157550d2cb08ce52b31baa8bc17b100c4196b0ae141a33e7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parts.len() \u003C 2 || parts[0] != \u0022CommonModule\u0022\u0060 appears character-identically in 2 files \u2014 crates/bsl-metadata/src/event_subscription.rs, crates/bsl-metadata/src/scheduled_job.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/event_subscription.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9cb940ebd8fe5fc73025615fddbd024d9198817de05ede9a3a631f43f72dbe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pos \u002B 1 \u003C bytes.len() \u0026\u0026 bytes[pos \u002B 1] == b\u0027\u0022\u0027\u0060 appears character-identically in 2 files \u2014 crates/ide-diagnostics/src/handlers/multiline_string_in_query.rs, crates/lexer/src/sdbl/strings_mode.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/multiline_string_in_query.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"265a073033316b606df4fcabd725182e57881a18b8478e7b94a027a20cb619a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pos \u003E= bytes.len() || bytes[pos] != b\u0027%\u0027\u0060 appears character-identically in 2 files \u2014 crates/hir-def/src/body/lower/expr.rs, crates/ide-diagnostics/src/handlers/incorrect_use_of_str_template.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1fd9f82fc86a52a56bbacb2348f5db48d7d4a68c90cf376c02d9649d052c89"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.body_env.is_empty() || member_env.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/hir-ty/src/infer.rs, crates/ide/src/completion/env_filter.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe648a6768d8fd884ceec36937b4e515430829bc32fb4480ecbb16a101c7d421"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.lease.is_superseded() || self.lease.is_released()\u0060 appears character-identically in 2 files \u2014 crates/mcp-server/src/graph/state.rs, crates/mcp-server/src/state/overlay_backlog.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae380e4e1379ca5dbbcdd5625fd920d8d03d7e431dc3011c846d1ce214884b9b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.unreadable == 0 \u0026\u0026 self.canonical_fallbacks == 0\u0060 appears character-identically in 2 files \u2014 crates/bsl-search/src/workspace_overlay.rs, crates/project-model/src/source_set.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61d119f3141c3274ec1bd2fe4a8356c5b260d20d43d7b4341797afcc26a9c96"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060signature.platform_id == Some(method_id) \u0026\u0026 signature.candidate_ordinal == Some(candidate_ordinal)\u0060 appears character-identically in 2 files \u2014 crates/ide/src/hover.rs, crates/symbol-info/src/adapters/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/hover.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c292db7f2d9becb71b704fa2a73f2d9c4a7cfb745fb5c34bd8af3c90de2a517"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060signature.platform_id == Some(method_id) \u0026\u0026 signature.candidate_ordinal.is_none()\u0060 appears character-identically in 2 files \u2014 crates/ide/src/hover.rs, crates/symbol-info/src/adapters/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/hover.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8dd2c7e9ad19518d82db345ce369685667e773976c9e438d22393581015731"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stdx::case::eq_ignore_case(name, ru) || stdx::case::eq_ignore_case(name, en)\u0060 appears character-identically in 2 files \u2014 crates/hir-ty/src/method_lookup.rs, crates/sdbl-hir/src/lower/missing_row.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/method_lookup.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fa7297b415ed89b8f5267a8637efdc7da553511839c4e7db76ee03f7087c0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tok.kind() != SyntaxKind::IDENT || !is_nstr_call(tok.text())\u0060 appears character-identically in 2 files \u2014 crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs, crates/ide-diagnostics/src/handlers/multilingual_string_using_with_template.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/multilingual_string_has_all_declared_languages.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"652ee3d9cd4d6842213dd18f6d738ef5f3e1c6167d166f93001f70ffd3d9a802"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060if has_raise || has_log { CatchBodyClass::Mixed } else if has_rollback { Catc\u2026\u0060 follows \u0060{ return pure; }\u0060 (line 32) in the same block, and control never passes that statement \u2014 it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns \u0060unreachable_code\u0060 on it. Delete it, or move it before the statement that leaves if it was meant to run."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/catch_class.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d311bdc47a75fbe8177d53e5847bcc8494b9ccb2f870cf6867848b4ffad987"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060let cwd = fs::canonicalize(entry.path().join(\u0022cwd\u0022)).map_err(| _ | NativeProf\u2026\u0060 follows \u0060{ return Err(NativeProfileError::CleanupFailed); }\u0060 (line 3566) in the same block, and control never passes that statement \u2014 it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns \u0060unreachable_code\u0060 on it. Delete it, or move it before the statement that leaves if it was meant to run."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":3569}}}],"partialFingerprints":{"codehealthFindingId/v1":"37836ef9a80bdd19c62ee92db89fde98e5e788054f1e581445118351541cd83b"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060let cwd = match fs::canonicalize(format !(\u0022/proc/{pid}/cwd\u0022)) { Ok(cwd) =\u003E cw\u2026\u0060 follows \u0060{ return Err(NativeProfileError::CleanupFailed); }\u0060 (line 3601) in the same block, and control never passes that statement \u2014 it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns \u0060unreachable_code\u0060 on it. Delete it, or move it before the statement that leaves if it was meant to run."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":3604}}}],"partialFingerprints":{"codehealthFindingId/v1":"027aa8303df76dd19ed88069fd8888a0d9b6da9ec89fe53c58197f1c2ecd01cc"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060stack_size\u0060 is public and takes a \u0060Builder\u0060 as its receiver from its caller, and it calls itself at line 31 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060stack_size\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/thread.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c400b20ea4a5c359f55354d7302c43855fb1684eca0f39271da77eb07e3fa1"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060spawn\u0060 is public and takes a \u0060Builder\u0060 as its receiver from its caller, and it calls itself at line 44 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060spawn\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/thread.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ed027b41438c431b8788af65488a0c76291428bc17232d1c8fe746a03d1afa"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060join\u0060 is public and takes a \u0060JoinHandle\u0060 as its receiver from its caller, and it calls itself at line 61 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060join\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/thread.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e4402c4453111300ca6760f9bf923a86fc3315933caeafa45c57fd4fd8208e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060collect_resolved_tables\u0060 is public and takes a \u0060SdblHir\u0060 as its receiver from its caller, and it recurses at line 71 through \u0060collect_expr_tables\u0060 and back with a piece of the document (and at line 74, line 78, line 82, line 86, line 90, line 94, line 98, line 102, line 511, line 513, line 517, line 520, line 524, line 525, line 527, line 530, line 535, line 538, line 539, line 542, line 546, line 547, line 548, line 551, line 552, line 554, line 557, line 560) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060collect_resolved_tables\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"def4b862bc4a4787d1d6b68f74191af5c6570bb088e9e6b2a4f8021597ed9743"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060collect_resolved_attributes\u0060 is public, takes a document from its caller (line 114) and hands it to \u0060walk_level_expr\u0060, which calls itself at line 453 with a piece of the document (and at line 457, line 464, line 465, line 467, line 470, line 475, line 478, line 479, line 482, line 486, line 487, line 488, line 491, line 492, line 494, line 497, line 500) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060walk_level_expr\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86971c2f7bc1d341712011ab4df84be654d24275ea5b277201be44dd773fa29"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060collect_resolved_attributes\u0060 is public and takes a \u0060SdblHir\u0060 as its receiver from its caller, and it calls itself at line 165 with a piece of the document (and at line 172) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060collect_resolved_attributes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fe013f049aa5d51bee3d1e7f63484e98ae4dbff3cf696c9dc95361d178162a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060collect_dereference_chains\u0060 is public, takes a document from its caller (line 185) and hands it to \u0060referred_object\u0060, which calls itself at line 251 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060referred_object\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f73d6aadcebd69ecab507a960841ddeef7cda0d59aaaee48771397956f5ba4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060collect_dereference_chains\u0060 is public and takes a \u0060SdblHir\u0060 as its receiver from its caller, and it calls itself at line 216 with a piece of the document (and at line 223) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060collect_dereference_chains\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1675fe4978903221b944540aa322a8241523469c15df051322e4a26dacc2f50"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060collect_referenced_objects\u0060 is public and takes a \u0060SdblHir\u0060 as its receiver from its caller, and it recurses at line 267 through \u0060collect_expr_objects\u0060 and back with a piece of the document (and at line 270, line 274, line 278, line 282, line 286, line 290, line 294, line 298, line 320, line 323, line 325, line 329, line 332, line 336, line 337, line 340, line 344, line 347, line 348, line 351, line 355, line 356, line 357, line 360, line 361, line 363, line 368) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060collect_referenced_objects\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/hir.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffe0a09a3d145407f53df754497557b3cb067a8a0738e800daebae1103f5c84"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060is_numeric\u0060 is public and takes a \u0060SdblType\u0060 as its receiver from its caller, and it calls itself at line 129 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060is_numeric\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/types.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"728ea32bceb13bc3159da22ccdd7b9f0ace8747c2c92beeeaa17b96d6bb5e97d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060unwrap_aggregate\u0060 is public and takes a \u0060SdblType\u0060 as its receiver from its caller, and it calls itself at line 151 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060unwrap_aggregate\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/types.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"1926df5954fa645be30a4189de29aba17f4c84c4b45c860215eba1737dfb49a1"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060is_unlimited_string\u0060 is public and takes a \u0060SdblType\u0060 as its receiver from its caller, and it calls itself at line 144 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060is_unlimited_string\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/types.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"104e2b39c1159712f5fc6214f54f312913fa87bf3e941948e388c80008823562"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060is_compatible_with\u0060 is public and takes a \u0060SdblType\u0060 as its receiver from its caller, and it calls itself at line 186 with a piece of the document (and at line 187) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060is_compatible_with\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/types.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbd6d2c644b8b289f09e4ea0d70f9b321da6d119185a7c8c69aa8c76371f89f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060display_name\u0060 is public and takes a \u0060SdblType\u0060 as its receiver from its caller, and it calls itself at line 268 with a piece of the document (and at line 277) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060display_name\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/types.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73502e6d7c14be4f8b06846b8145895b58f4555166446a0b6c5bd1411a7c74f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060check_nested_fields_by_dot\u0060 is public, takes a document from its caller (line 123) and hands it to \u0060report_dotted_paths\u0060, which calls itself at line 304 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060report_dotted_paths\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72ba205bbb816cc8e0285026bcd67b8d6174cc932a683008500174ff945eee5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060expanded\u0060 is public and takes \u0060ty: \u0026SdblType\u0060 from its caller, and it calls itself at line 896 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060expanded\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"020d15ef7f652e5551ef4eed6f4b634219bb360d693668e814a570a87850677d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060check_ref_overuse\u0060 is public and takes \u0060hir: \u0026SdblHir\u0060 from its caller, and it recurses at line 545 through \u0060check_ref_overuse_in_joins\u0060, \u0060check_ref_overuse_in_order_by\u0060, \u0060check_ref_overuse_in_having\u0060, \u0060check_ref_overuse_in_group_by\u0060, \u0060check_ref_overuse_in_where\u0060, \u0060check_expr_for_ref_overuse\u0060, \u0060check_ref_overuse_in_select\u0060 and back with a piece of the document (and at line 537, line 538, line 539, line 540, line 541, line 542, line 551, line 557, line 564, line 571, line 578, line 586, line 598, line 599, line 603, line 608, line 614, line 617, line 618, line 621, line 626, line 630, line 634, line 638, line 644, line 645, line 646, line 650, line 651, line 653, line 658, line 663) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060check_ref_overuse\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"b141f79c482c7c10d6c712959e2ff2d1f14a7582dca34a59efab5d1bc7fe941c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060check_unlimited_string_usage\u0060 is public, takes a document from its caller (line 719) and hands it to \u0060check_expr_for_unlimited_string\u0060, which calls itself at line 771 with a piece of the document (and at line 772, line 776, line 781, line 787, line 790, line 791, line 794, line 811, line 815, line 824, line 825, line 826, line 831, line 832, line 834, line 839, line 844) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060check_expr_for_unlimited_string\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e723fde15acc95fc739a5fbe416a4928ec2f1b2dc5bc448a12e55ec60345c58"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060check_unlimited_string_usage\u0060 is public and takes \u0060hir: \u0026SdblHir\u0060 from its caller, and it calls itself at line 758 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060check_unlimited_string_usage\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/diagnostics.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded34febca70a3bbd046cf7a88e75fecde6d74ebe0da8d2bce4e1351228f9e3e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060of_when\u0060 is public, takes a document from its caller (line 175) and hands it to \u0060value\u0060, which recurses at line 270 through \u0060propagates_null\u0060, \u0060isnull\u0060 and back with a piece of the document (and at line 280, line 287, line 300) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/missing_row.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3094087bd0df84b6e4de868a50f35756f7310da2ddd9d2429e0976f17dfd29"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060of\u0060 is public and takes \u0060condition: \u0026ExprHir\u0060 from its caller, and it calls itself at line 184 with a piece of the document (and at line 185, line 186) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060of\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/missing_row.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c276eef2ebd6314f69d1bb53793a5a1fa7078426d1ac1ea9027bd8d0105dc9"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060a_line_break_precedes\u0060 is public and takes a \u0060Parser\u0060 as its receiver from its caller, and it calls itself at line 636 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060a_line_break_precedes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/parser.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5fdc4e1d1df57cb400d95e6f907889fd8fc4711f65919ad711e24f8049e575"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060a_gap_precedes\u0060 is public and takes a \u0060Parser\u0060 as its receiver from its caller, and it calls itself at line 645 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060a_gap_precedes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/parser.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8863bdb4abdbd70dce542c77d81527315943e4edc605a969fb36d71164c1eb5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060expression\u0060 is public and takes \u0060p: \u0026mut Parser\u0060 from its caller, and it recurses at line 276 through \u0060paren_or_subquery_expr\u0060, \u0060when_clause\u0060, \u0060case_expr\u0060, \u0060column_or_function\u0060, \u0060primary_expr\u0060, \u0060unary_expr\u0060, \u0060multiplicative_expr\u0060, \u0060additive_expr\u0060, \u0060predicate_expr\u0060, \u0060comparison_expr\u0060, \u0060not_expr\u0060, \u0060logical_and_expr\u0060, \u0060logical_or_expr\u0060 and back with a piece of the document (and at line 282, line 288, line 300, line 306, line 319, line 322, line 329, line 337, line 346, line 354, line 366, line 369, line 379, line 384, line 396, line 423, line 547, line 562, line 629, line 635, line 666, line 692, line 718, line 726, line 732, line 736, line 775, line 914, line 950, line 991, line 997, line 1006, line 1023, line 1031) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060expression\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e44d976f0e1f02218f583a8176748133dbc7a4e0e0a4be8c9c1421ddaa9bc8b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060subquery\u0060 is public and takes \u0060p: \u0026mut Parser\u0060 from its caller, and it recurses at line 171 through \u0060union_clause\u0060, \u0060join_clause\u0060, \u0060data_source\u0060, \u0060from_clause\u0060, \u0060query_body_clauses\u0060, \u0060query_content\u0060, \u0060query\u0060 and back with a piece of the document (and at line 182, line 195, line 212, line 253, line 566, line 579, line 593, line 700, line 748) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060subquery\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/select.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a8e8c471b94cf7cb849810869a28599674b671a77a7ef4689ccb3a8c90252e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060execute_query\u0060 is public, takes a document from its caller (line 82) and hands it to \u0060post\u0060, which calls itself at line 132 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060post\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/onec-client/src/lib.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b78b73d38104c4bc4bd93c09c68e38ada4139ba7a41efee13a32bcff88e357"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060kind\u0060 is public and takes a \u0060DocumentSymbol\u0060 as its receiver from its caller, and it calls itself at line 581 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060kind\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/lib.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6078ae389b5bdc9b79dbe9d70d640ab00b61495a324ef2625613b851bda772"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060eval\u0060 is public and takes a \u0060PreprocCondition\u0060 as its receiver from its caller, and it recurses at line 155 through \u0060eval_with\u0060 and back with a piece of the document (and at line 157, line 166, line 167, line 169, line 176) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060eval\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/preproc_condition.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5a4bd8015e5c00b76f7494ece09090e43b1cb6caf98f36fe5cbb1e4341fd0c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060get\u0060 is public and takes a \u0060ValueOverlay\u0060 as its receiver from its caller, and it calls itself at line 43 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060get\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/value_state.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91306f45603a9911cf26c0e3bc84761d1756b6ad07f7e7777cac99636630ef5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060is_empty\u0060 is public and takes a \u0060ValueOverlay\u0060 as its receiver from its caller, and it calls itself at line 50 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060is_empty\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/value_state.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f0011569b640cc22dca3d83f385088ab394c3c9d1f58afe49483f38bb0f67f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060apply_extension_overlay\u0060 is public and takes a \u0060MetadataObject\u0060 as its receiver from its caller, and it calls itself at line 944 with a piece of the document (and at line 955) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060apply_extension_overlay\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/metadata_object.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"265408bdaeb6c408856723e61837c4687c0852a4b0c302d2edeee56a148ce7b2"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060writer\u0060 (line 1185) is a \u0060GraphDbWriter\u0060 this function owns and never releases: no \u0060finalize()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060GraphDbWriter\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"44769c408af81d3293b65996b9d20dad32c693efdfec093270f6ec4bbe173354"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060config\u0060 (line 49) is a \u0060Config\u0060 this function owns and never releases: no \u0060init()\u0060 or \u0060init_with_layer()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Config\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/bad_words.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"783d63a1c56e31c62560f69b3becaf29db769a988f8c1da2eddfc60e0a9387a7"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060config\u0060 (line 128) is a \u0060Config\u0060 this function owns and never releases: no \u0060init()\u0060 or \u0060init_with_layer()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Config\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/commented_code.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7da5fa3a98c2d6d38bc9f8196ca6b3e68d3c6041a8470a399a017296476f89"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060config\u0060 (line 46) is a \u0060Config\u0060 this function owns and never releases: no \u0060init()\u0060 or \u0060init_with_layer()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Config\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicate_string_literal.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d24baef909f9c38a331443b23d76349ee186ea074d9bf88585500949b03ede"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060config\u0060 (line 72) is a \u0060Config\u0060 this function owns and never releases: no \u0060init()\u0060 or \u0060init_with_layer()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Config\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicate_string_literal.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18af5e2656fec650f7b25564c94d3a1b267a26a08cf51ea85c3ce0df0d6a54b"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060config\u0060 (line 467) is a \u0060Config\u0060 this function owns and never releases: no \u0060init()\u0060 or \u0060init_with_layer()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Config\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/latin_and_cyrillic_symbol_in_word.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66e06ef9dabbb979f8b94be684869cffa5ab24ad48a6c2340a07c3f4fd5a65b"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060config\u0060 (line 81) is a \u0060Config\u0060 this function owns and never releases: no \u0060init()\u0060 or \u0060init_with_layer()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Config\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/line_length.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"248ab00049fdfe779cffe560297136f28426fd88215f5c4c433633a1eb0541c7"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060config\u0060 (line 273) is a \u0060Config\u0060 this function owns and never releases: no \u0060init()\u0060 or \u0060init_with_layer()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Config\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/magic_date.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"99941b7c0b3e742e7f0f9d7391676fe390e2520277d4b4a8978481543ae2a646"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060config\u0060 (line 36) is a \u0060Config\u0060 this function owns and never releases: no \u0060init()\u0060 or \u0060init_with_layer()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Config\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/magic_number.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d933003e2d65f3a06ba61f04120e2a98771a1aff36578f1050a9cb04407ee6"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060config\u0060 (line 350) is a \u0060Config\u0060 this function owns and never releases: no \u0060init()\u0060 or \u0060init_with_layer()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Config\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_space.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a218645d420c6743aa9e90342ea20d5190947b6acde32ea6202a675dc2f8a0"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060config\u0060 (line 71) is a \u0060Config\u0060 this function owns and never releases: no \u0060init()\u0060 or \u0060init_with_layer()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Config\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_temporary_file_deletion.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"975e9a70139d63d6c60ac91f18110006de70d257f1590fb3f00c46cd78d67f90"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060config\u0060 (line 73) is a \u0060Config\u0060 this function owns and never releases: no \u0060init()\u0060 or \u0060init_with_layer()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Config\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/nested_function_in_parameters.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4823f42ebf297f1fae17cf48dfa58bcb3e635591ad926984bcd9ea7beade442"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060config\u0060 (line 92) is a \u0060Config\u0060 this function owns and never releases: no \u0060init()\u0060 or \u0060init_with_layer()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Config\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/timeouts_in_external_resources.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3925a8552b8ca7402226d846ff1107d536e38cb03a596ad6c6f95f415e7954d8"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060config\u0060 (line 330) is a \u0060Config\u0060 this function owns and never releases: no \u0060init()\u0060 or \u0060init_with_layer()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Config\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/typo.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb4f3c4629ed577e9f82c3750870014fdd3cee4b13edf31915a2c7c85ba7521"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060config\u0060 (line 393) is a \u0060Config\u0060 this function owns and never releases: no \u0060init()\u0060 or \u0060init_with_layer()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Config\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/typo.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"179c2157dadb1aa985bddce5c25124f1d959f6eb5d4e68b357a1aa4e0ab89ea3"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060config\u0060 (line 200) is a \u0060Config\u0060 this function owns and never releases: no \u0060init()\u0060 or \u0060init_with_layer()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Config\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_hardcode_network_address.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"3497b1d97937d8c313a0e1f8b23cb76a7d82656c741e2dd818e298e97f2561d2"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060config\u0060 (line 126) is a \u0060Config\u0060 this function owns and never releases: no \u0060init()\u0060 or \u0060init_with_layer()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Config\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_hardcode_path.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67801ddc9bdac012dbbf24c26f946018397431450426a84294b419a51153b67"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060tx\u0060 (line 3159) is a transaction this function owns and never releases: no \u0060commit()\u0060 (or a deliberate \u0060rollback()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a transaction that is dropped rolls back, so every write made through it is silently undone. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":3159}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbdfe54e0970cb8b1ac18fc3756c1b57deec0782bb1cb0f1e959ba8c60e0cde"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060tx\u0060 (line 3773) is a transaction this function owns and never releases: no \u0060commit()\u0060 (or a deliberate \u0060rollback()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a transaction that is dropped rolls back, so every write made through it is silently undone. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":3773}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d0558e791de5795614630459b6bc465e21a05065fa2fc44afd8bbb984d8964"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060tx\u0060 (line 4426) is a transaction released by \u0060commit()\u0060 (or a deliberate \u0060rollback()\u0060) only on the path that reaches line 4446; the \u0060return\u0060 on line 4437 leaves before that with a success value, and on that path a transaction that is dropped rolls back, so every write made through it is silently undone. Release it before that \u0060return\u0060 too (or return an error there, if the early exit is a failure)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":4426}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a41414ac2ffb27dfe4cf0e7f872f00df2b972e2ce57b8503139a13d41cca6fe"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060tx\u0060 (line 4557) is a transaction released by \u0060commit()\u0060 (or a deliberate \u0060rollback()\u0060) only on the path that reaches line 4610; the \u0060return\u0060 on line 4581 leaves before that with a success value, and on that path a transaction that is dropped rolls back, so every write made through it is silently undone. Release it before that \u0060return\u0060 too (or return an error there, if the early exit is a failure)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":4557}}}],"partialFingerprints":{"codehealthFindingId/v1":"a006ba3b65220cf93d77b6fa65c072ae084cd8c58040b5d9a574056cd354777a"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060tx\u0060 (line 4683) is a transaction released by \u0060commit()\u0060 (or a deliberate \u0060rollback()\u0060) only on the path that reaches line 4702; the \u0060return\u0060 on line 4692 leaves before that with a success value, and on that path a transaction that is dropped rolls back, so every write made through it is silently undone. Release it before that \u0060return\u0060 too (or return an error there, if the early exit is a failure)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":4683}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc269ad7128b7f47f9350f3a1d522e3f86d4562a85fa5a045e75ec07fb8c870"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060tx\u0060 (line 5326) is a transaction released by \u0060commit()\u0060 (or a deliberate \u0060rollback()\u0060) only on the path that reaches line 5344; the \u0060return\u0060 on line 5335 leaves before that with a success value, and on that path a transaction that is dropped rolls back, so every write made through it is silently undone. Release it before that \u0060return\u0060 too (or return an error there, if the early exit is a failure)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":5326}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e7121c537c5a89aa433d284c25b765cbc9e5af76e25406385d085623d61c9b"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060tx\u0060 (line 1363) is a transaction released by \u0060commit()\u0060 (or a deliberate \u0060rollback()\u0060) only on the path that reaches line 1391; the \u0060return\u0060 on line 1369 leaves before that with a success value, and on that path a transaction that is dropped rolls back, so every write made through it is silently undone. Release it before that \u0060return\u0060 too (or return an error there, if the early exit is a failure)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"830119ba30ca60456b1dd42ee29a0a5a3d4efc042dfffd0c893bc035d32b113e"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060tracing::debug!\u0060 at line 1210 is called with an argument built by \u0060parent_obj.tabular_sections.iter().map(|ts|ts.name()).collect::\u003CVec\u003C_\u003E\u003E()\u0060 (line 1216), whose cost grows with the collection it walks. Rust evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because tracing::debug! is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060log_enabled!\u0060/\u0060tracing::enabled!\u0060 test, no debug flag, no \u0060cfg(debug_assertions)\u0060, and the work is in the argument itself, not deferred into a field the subscriber formats or a closure the formatter calls."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"222b4ac6c96f0e62fc6ee7844c13bb1981c0ede6376f88cb2b4336b8471546ef"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Analyze.workspace_dir\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/main.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd986658cfe060fea7aab587d5ebe753f8fee9d67a3b85ab54aee3782f69041"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Analyze.output_dir\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/main.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2972e675ec8b8a00744d721c337ca93bdf4b2f529faf22c6702f502fbfa1bfa9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Analyze.quiet\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/main.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abcf57410e1ec3191244bdbd443032be46da4b799ff7163c8ea8d6d2a387628"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Analyze.only_diagnostic\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/main.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d92b316be40cf989f22e97acd6dcdf77a54ae2a70c9a52db901b5ecd5d30cf"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Format.spaces\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/main.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"76923700046ca2f3d9fa2cf7059304f7649eede46f9bf0d79ca7b6178185cd9a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Deps.sample\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/main.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bb5ace5b80e4af440aea000c70cd6bd115ed289fd0987014b108d4415d1811"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Deps.quiet\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/main.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"01853163b37c655f56f888517719bb6edad2667b31b89ec2d01f1106a86451a9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Deps.report_mem\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/main.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29eddc51b866a60910692b41ed810d1a121c24ec5f515f76aaec61e86ec1300"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Deps.bench\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/main.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"75464ac74a9ff3ffdd5e8b09ccdda51b2f11e2bf168012097639cb3786bfe616"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Deps.multi_open\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/main.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e51e5fde81586bf115a633bb59bc0e8ae463c38c499c078ca7dd7fccafacd9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Deps.bench_index\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/main.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf042c4b248f7cef2b9ef2238f29f2f2334c8bab5768e5d65b74e2e7d9e54dcf"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Commands::Deps.index_workers\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/main.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd713c91807640dce3e0988900f8ec722dc138a7a5ac9e71c6d42fade13c074"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is only ever logged: \u0060DepsResult.roots_sampled\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but the only production code that touches it writes it to a log or the terminal. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"328df814ace34fbe39b1a6fd15c647b40bb9175c4b72bb1c018cb1c947feaa91"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is only ever logged: \u0060DepsResult.cold_ms_p50\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but the only production code that touches it writes it to a log or the terminal. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5df2c9574cb33dc4f61ce88c38e969a34480f9e63b371c9d1653073b5bce04"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is only ever logged: \u0060SessionResult.rss_boot_bytes\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but the only production code that touches it writes it to a log or the terminal. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef467117082b95c963cf18c8331b84875f00995b2556b846fd0e3bee54808c26"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is only ever logged: \u0060SessionResult.rss_warm_bytes\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but the only production code that touches it writes it to a log or the terminal. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77f41aadac0c0909508367ccd85b3a58e7bf0b53b36880c654e1f498a72a350"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is only ever logged: \u0060SessionResult.rss_post_edits_bytes\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but the only production code that touches it writes it to a log or the terminal. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c401e29cc4e2f4479733eb79b67b8356f68e09b7cc02fc85199d309c94777721"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is only ever logged: \u0060SessionResult.rss_post_trim_bytes\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but the only production code that touches it writes it to a log or the terminal. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc21090bbab58731da222d7aec5d69258e834e9a0a1715866bf3ae4c3777bd60"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is only ever logged: \u0060SessionResult.edit_rounds\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but the only production code that touches it writes it to a log or the terminal. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97d1acc5db71b5be7a1005c0ede51ebdd53de9a9cd61b4b6ac329ea66227785"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SessionResult.interned_trend\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbad2beba79d2f5283e84a596597d9680755b154db2eaf0fda0efa70fd0c733"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is only ever logged: \u0060InternedTrendRow.count_max\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but the only production code that touches it writes it to a log or the terminal. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/smoke.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1dbb5ef90922ca1a66cc0154bb903be553689bc441aee788638b315dc8fe067"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060GraphState.probe_window_hook\u0060 is offered as a builder setter option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"02eace586d08319121edb100d8d9f7b79de1ccc64197f77235d2e92dc9605006"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060GraphState.scan_receipt_hook\u0060 is offered as a builder setter option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/state.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5420d9fa4f3abd9c4e09b933a04e33e441676386faadf4e3e11aba8661e8a29"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060EventLogParams.date_from\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe1afd7434164deb861118545c5f522982e308f8a2711bdad3d9f04027756dd"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060EventLogParams.date_to\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f61543ee7d707805aad3ba586ce9fe789c1875a1573b5bc935ba05e737484ab"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CredentialHelperResponse.lease_id\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":4292}}}],"partialFingerprints":{"codehealthFindingId/v1":"154db83b4ba68a5c66e963a357ba1ebaea129b272909ef1232d66032156474db"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CredentialHelperResponse.expires_at\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":4294}}}],"partialFingerprints":{"codehealthFindingId/v1":"21dcf9731ebfe0c9671557884c3201974390c46ada643e93fd2c62b237b84678"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CredentialHelperResponse.renewable\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":4296}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2023f760ab83bebcd272adcff16397716514ff52af4bb563a94e36a03f440b6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1214 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d696b6241bd86660e9d2142355b881ac1b1987e846e1346c0e0abc956899828c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 163 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcs/src/author_filter.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2a00e6482d63d74dd4541d14236cc4ed6ae311090b32be57875e4033a6b65e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 67 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcs/src/lib.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bcc25a60d1d31f439abddcebfefdf7856066081755efc54bff38bb68587088"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 96 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcs/src/lib.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"edba340391955407b4a9fb26879d6062198ef276098c70acfeaa2b70f25b2c42"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 153 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcs/src/lib.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c5b32363831338c539686b64ad64955a02029f9d3f87a319781d32d43f3068"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 248 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcs/src/lib.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"746759c61b9af72dfb5cbfbdb96a40d13c0349ab9e68a27cec8c865bba1e166e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 47 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/literal.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"474438d90c8179d00b97f24d919c43697786d3226f765d6eafb7e16042f51d7c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 60 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/literal.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d40a5d58c5b907c59a83917a8e2af9ff06743d32c6f45a10667f4fb48aac5e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 71 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/literal.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9422bb3e471ef85f13c0f45fff0841d3a48d9179bd9e81ebd94692948ff78181"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 79 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/literal.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0754be54cf6c42580a4ae2701aa8a8d4f406036d68f691f04f5f7fa4981d7f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 93 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/literal.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb63ef2b0ac74ef00c8604e386008836ad8ac9a541c16cf11c4e3d495527b920"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 102 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/literal.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"372fe7de982540038dda3ad1ce641a3f558fed0c28107a44880f3416623e6824"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 131 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/literal.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc19b884b9cc2e8ed8efe929824fb7b24df3a429f9cbb613e51d43dfc3cbcc1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 160 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/literal.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45ab05aa6ef4bff16d0031875c83f13b21b79ff6bf6809889b34c4efbc97a55"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 169 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/literal.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c87aeb032161f0cd7a2abae0c8d729ba79f2a18e13feec7bf3ea29713fd27a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 190 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/literal.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e542c7227489475f10a88bd312825013346c2a6e8172ca3a1ddf42edf1ff44"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 199 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/literal.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9772581c66d642a2ea4dc745b2c308cc033e46a9577b5b56f1416f562d6066"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 45 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/position_detector.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a001d283c0e02291147a37447457101c21a10896514f69eada4ca185c60c57"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 510 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"4145af820b5b5b1526ca800ea8dc191e5bb4a25bb0e562f9b22b8df3b02ef4a7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 355 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform-help/src/lib.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c13f3e93ecd4540084986da2890fa39d63a5926639a9519f0da88407f76f866"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 373 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform-help/src/lib.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38fafe91d8e807d9a296e5ecb4dcbd7ec6ffc9b25cfc9b9d831db0ccc58d16b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 211 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/baseline.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0bd8917631057db70891ffbb4fe6c2ab229d1d7dffdff120fa929666f7bc55"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 243 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/baseline.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"20534c6f57b4c1498960cffe40cbcade4adcefa91b4c6039006351b07ed9ecfe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 431 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/baseline.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dd83ca0597f82d394548b8dca2bbd1a77f89e597b6debeef7e284560071a2d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1478 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/baseline.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f49d3cdbd07dbda70066ba334c6f6a8aeb58e428ea7d3edbc8b917f3034bed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1506 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/baseline.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"864d49e9a8375c4f8cd944303414bb209d5ac845f814f503a3046c8a12006785"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1522 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/baseline.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"c913542fcbb77bf98c84116feeceaf04e6903de49ffba15509b17ee7c685e642"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 259 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae81237eb366e2a89210ad3c81cee56724373e942fda96035ce73842e2c885f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 5206 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5206}}}],"partialFingerprints":{"codehealthFindingId/v1":"647554dac58e5fc1a069225a6d5cd51087424aa3d0206d419c8993d96fbf296e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5217 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5217}}}],"partialFingerprints":{"codehealthFindingId/v1":"489e01e7af7108cf94de1acbf05c0059bd1c887534d8a2f8028c6bdd5f430a24"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 5307 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece61bf8fdd2c880d55d62940a971e90ab6fb24038d161cc79a6bc19c0ce6b87"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 5333 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bca6a9ac9e255f7227415045ef03d29a3e8ed0dcce452948114c225f19a2ba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 5368 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5368}}}],"partialFingerprints":{"codehealthFindingId/v1":"61976196ff94bf0bdf22f0e4bf900f2a4db17344b407eca04133e3e377839f2b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5402 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5402}}}],"partialFingerprints":{"codehealthFindingId/v1":"158d492ec83f227d36cd02d861cd4a1a0780e291b459b3928d1ac266063bfb64"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 5487 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5487}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aee194ab3b0773ca7255c95abbdc26e39809bd77c247434125f54e4058bb1ab"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 5707 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5707}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2faec0729006f421c480297c2ab3985c8e4f9319b0d09b2c8c05dd4b0794fd1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 5792 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5792}}}],"partialFingerprints":{"codehealthFindingId/v1":"07502b4011e0a5ef1074f761d1f7b3bac3e97fae9fc91d02639cd68148c089cf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 5807 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5807}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe8784a5f22dc9a95d673ed36077f5bae4e3533170a2f4b91d2eca2186fa6aa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5817 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5817}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcdf7a927c047ea099afe3d06f2a7551a57e838391c621a18655a9fe31a8424"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 5835 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5835}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b70a8a7fc75fe8e81fcab60c2a10c14542720660e62593cddafc91a90359e0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 5870 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5870}}}],"partialFingerprints":{"codehealthFindingId/v1":"b325ba78d64fdc4f717bc1c4716d36151c8508c1be216892b909efbaedb46676"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5894 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5894}}}],"partialFingerprints":{"codehealthFindingId/v1":"3524d6c297c02f0b126374bcddd06bfb104fb031f21767f2a0cd2b97db1a68a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5922 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":5922}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc29399db457692153be404aa2f2a0bacb38986ee301b956582397c2c1ecf541"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1017 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1b26e96fdf8cd6b71391b1e23f70612a56750a1d6dea7e72b14cdb8d142906"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1107 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"984ec4b0d80c5d8e2976ea6e0b154bff2f2537abc220d03c2915deb704272926"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 26 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/gating.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1989630967245a50ba6157fe2d53b758fe0ab76f07b81dfdffb3f28115e968"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 183 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f616dd96571db7af3fb157113ba72147db964a34974a23f46a3940701618c8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 186 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"202fca5d068730fc7c6536554fc96bede4d9efd708c7b3b729cd273a36621058"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 208 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"02722501162e102155045b9271efce39ca8ae303e5d0e92446f607e6c4f0b018"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 211 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc968e776f4201323332c44140506bb337ce2ba3fe80d4e77866fd683b4fd0db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 232 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"3691e0279c4302073afe7e58ba60111665100a8cff5846a585058ca8e17490a0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 275 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b4ea16826bdf9ae5fa4183af522975afaac1072e54b2413d44ddfd6aa1f9b8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 278 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/lexical.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9052add84c503d2acd068b24238aa967d1a991ac1143d255b8546d06ac73e830"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 139 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/semantic.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf649501245df076db8882c99642b62b10e576f26d90d942286595cf5632821"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 306 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/semantic.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61ca4a88e28d999a16d6ded93a67a3ba1bf635c6d11e760efdbc60026bb80c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 309 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/semantic.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b2168c8b5b5771e26785e7964bfded30668195f913a3591e3ebc7ede913c05"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 346 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/semantic.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a214f0789c27dfde1270d8bf66c551349d603ace6b29d95e9c87da40a955ca0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 398 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/semantic.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be645c00092c84996248c192b496318494ba7970dcfa7b62d708032f2bd301f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 401 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/semantic.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6037d769557a0d152a803769549bbd4c7f3aeeea8d04d4958880026306f2be2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1409 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72de02b6e2da41dd8288ac29496892633aa56aad8353cddf86e4b9bab8c8928"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1815 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a67c809ec7d579bc17426acefda7d03ce58400824de4b901cf0f20f8ad382d6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1841 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1d8c5103bcdf057e62b269e0f88f8c44bae06950cfd8a8d520bb0923227d05"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1858 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9a214093c9ffb500de3e3834b3201a64431f832a5ccf12fb6bfb9e239dc818"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2252 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"443ea4ba1e7ef3a30b7e6cf26d63e275efc6c403267aa97d13acf3bce4268b67"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2412 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2412}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c78a3515100fc4caa68330cd171c8fa4b4ac1c22c2e74b2f4997cf42016c22"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2456 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"e567efa150e08c1f13c8f73ad522d53f5ea257e72e92f94574abb84d2eb8ad41"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2473 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2473}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6615fad12cea82fd95bdb63af23bc9809b8ef1a43a66ec7f6d96dc2247d85cf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2492 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf87d964da5ba50dbfb299fe7cffdea3471887921f130951237dc8894d0efd5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 433 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85edec8687968b8b06a5ced49b25ba62b20edcce611d0a6bf4e078e2aea3a18"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 445 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4e60726ca02de5ad489c0d71c302d84c0a40ea02fa545fdd655592e2761509"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 462 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"1316e78b612183481193b27515ea99302c5c5f3a70842f35b64113e939340846"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 495 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5dd7be483083bc261f476c8801db5fafeebaa1b37c644bc2bd676a31feb3675"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 523 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ded99b00423aa66c1ec8422693f4e0a632a3d8652f4e17d1120c5f1bba0a5c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 564 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"e510b91c01646df86c7559841e2166478e79bd3b5edbcbc997fdac38966d592d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 576 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad4449ecc7487291b2b415a3c22db457372af8647e7301f185e83478ae3ab67"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 643 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"be94e070240917283e21c0ed59af6af476e4aadf6bcab3e75a2d6ca7ccb858d4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 738 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fdc2fba91b0a95feaedc1639dd4d53bf594c7cf2e08548a70926e17fc670fa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 755 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea4c5b705a7ccfc452711e35eb1f9ede11c42b148ac28f91948e173f385c514"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 785 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7c49c2700ca5d4ab89b54dd7fa5940c042263961f231b5ad8e22b27db1f12d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 854 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"df73e2b596b17c2ff02ed97e969540ecf76b5376ab2e81679b1949ef2024a01f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1115 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cd601774b91cbee74d319144ab6d145282ea88838c07005ff9f910942db9be"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1174 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1ec86dd3614e5f2cc425cf6da5716954c97c08d5a336599f53a99eabac2a29"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1525 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fba5b2834993a68952a29d2f15a135145fe75638c8d215f02306f1250288614"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1663 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6618bee3c92e883885564e83ed0b4025e0966391d01e0f773d509d877417ff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1739 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"b791bd704c07520045c9c8c649c729a37a5dd61f88cb46c6f4ebde77c93a8c48"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 500 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/overlay_backlog.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9ae34ef02379d44a708efd5c34ca76d6fb4e83e18f07fbcb227e153b24606f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 512 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/overlay_backlog.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"3745ba290fa47eafe54427ffcad27c1605e427a3a3490a6f69964b2e0af20b05"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 520 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/overlay_backlog.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66aac1866fdc76cb5daa21e17ec933cd67ce7becca4e5f69c080883ae7ca405"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 563 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/overlay_backlog.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa36028d2eb5be5f6dfabba17435a34d1ccb7c3cea4b110ecee5c72e31438112"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 406 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/sync.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be3db825a731aaf31085a54804b01de9862e6b8cfbebd7f78eeeb5290f109e2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 600 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/sync.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"602e46e4b9a8585c4af2b266429609397a53f31fd1120287f10c543eff05b50d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1329 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/sync.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f6d9e680ba790cbb98c1fff22084998e4469fe87faaa92372d157866bd309c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 605 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4873ae3e7b76bef8b4bc94cd24b86e246e5d723384107ce9f0326d561268631"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 867 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b56af9e3879b7cdaec56ef8812a89697b0171a3437e6fbd5d2e3f4c5be98868"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 925 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"0415911868a3aa34c98d53d5c713635d677a1d6582df4407d0e9a28b10e1aaf5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1768 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"4177336fcc09d09396d05485e3134cacb25d7765f0f8f2888053c1a52a0e8d3b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3565 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":3565}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cdd8de260a1b4c5d181c42d49c4bb7b58b2c7ce6a064cc1e5b3d1ca00f508e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3731 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":3731}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdcef34e4deb6cb9e2ff2a8b85d9384c0e0aefefff41318df61edd6caa339ab"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3987 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":3987}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd5f396991e9a23929145cf471c176b6978d625bbb046aef5e242885cee71f7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 276 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/input.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a5b67d6d5de63fde86dbb67e494305b6cac2cc1838c3f7955eb11fbf2c3f6c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 122 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/watcher.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e589ae154dd7628bcfd3b7b905263d4dedd69fa3a06a073d3111063f04dd6fa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 306 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/load.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba820af5eedd0723a46ef88d4a681a86e6ae2dac7c9b6c6fb7f9f36c29c7c929"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 150 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/config.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c81e06682450b0c0230f020efa6fe18870eee57a781705304c04401f2dd39a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 161 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/config.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c5d80c97afde81253048bd51575dfc00814c8522798351d5e7a6903cf2b184"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 174 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/config.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3357afa61f3a69c79603f54fc5b9924c5609f30395abd76cbd9fde72c6b3b735"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 185 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/config.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7020c9252172491d5d2ad2c0a1ff3f738d87a14a7fef46da9230436a8591d39"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 547 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/config.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec12ce0af837db6b783be3d7762c3cf03df03ac672eceb7f17507cdb4421a7e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 572 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/config.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce69fc16d02b137ba3ff4f7e5dada032f58a74a86c1a62050714573694955630"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 578 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/config.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40f23ff5f3d0cebfaad4df56764d61c850f3e16e9bb30d69aa062f0c183274d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 585 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/config.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"455199421e6fafed8fd1e87f6995cfe6ab5e59f499126e9f1e3a5c6c71d8de72"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 591 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/config.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"201b521b79243b41df6e82a5b7f91232b681178133fd8c4febaca8411ebbdc04"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 599 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/config.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"1307fadefc12142ebdda9c762768315aa660f7a62986e1be37cf1b43d0d370a4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 74 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/lib.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1bb25e867dd2923d6cb984f0eee36401ba530b50e7c4506218bbbdc15cfcc1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 249 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/slab.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"d089b18f5cc2e720162db75b9d908b9211d64c32a03a2dc4473dc2e0c73e52eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 95 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/duplicate_string_literal.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a941c37f69114d9d41685595efaf4b3ec170fb773c1230cd10e802846e87ff7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 516 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/queries.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfe88eb2dc85173bfdea3351ba293ae295e2727ed06be704a137a9be51b2fe8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 522 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/queries.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef09185c3fb91f55ce1d34ee5d1175c5445d77a6b511109cf6a590dfea078ac6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1051 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1accb3ed36aa4da3657106e6088bde505c5701d3ce98924c708348ce963e77c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 223 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"875e65aef07ca7515bdbe6982bdd9705263abd61ce6debc8a233641e8b374176"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 227 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/syntax_highlighting.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb1ba638f0dd0b00071e08f9085405d0bbaeff82365d6380698fd550a6ad9dc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 23 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/sdbl/mod.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"588df79c9e872be92a23674d34ff0cd8e76e3d949e593c6abc887a852396bd92"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3605 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":3605}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ed41ce6427a4b8f35b033a126ed00539bfed1d01b2212ee9f9f946cf829335"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 3977 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":3977}}}],"partialFingerprints":{"codehealthFindingId/v1":"a300488b3980dd25cdc4fb0a435651cfd2ca084f34f4219ffab19c175bf179a5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4429 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b025795b4fecd9c321abba241b74484f5ac32074e5eca085688004a1ad9b338b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4441 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4441}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8860f8f0f98be3fb919143245cf03d2ff4f640c32b1ef3ab7e943a91945d75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4455 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4455}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdbe04686775639a6084c8cf562e7d91b7515aa71123ddb8ff65e8caca9c017"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4475 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4475}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f0a2c19c0224e29031c3477501dd33e8435bc26346ed134b9af7bd0966d76b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4487 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4487}}}],"partialFingerprints":{"codehealthFindingId/v1":"60494e331e17b52eaf89fae6fa9b2c715c2c883670c69c14225b8526e7807e88"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4491 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4491}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e01b31c41a67181163085ce649dd525c1e1af68a941ee7b154a22b1672a794f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4514 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4514}}}],"partialFingerprints":{"codehealthFindingId/v1":"12708816861aa765507e7b5789f068d28ac8050c7a96c80eb19f0847c2380fbf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4542 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4542}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e99565a5952ff656df3ff55dcfb1cd8d21f76f42325ae4ae29f84b6d2431fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4549 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4549}}}],"partialFingerprints":{"codehealthFindingId/v1":"164d41c7d1bf08af0be3e1fc408db771f3ed3ca56043874278e67bf7370e1e1d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4555 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4555}}}],"partialFingerprints":{"codehealthFindingId/v1":"89517cdc91550f0f23c83a826eca8b3baf21f69722a80d5db69ca921a470c9b4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4571 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4571}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c5b990be084e9ffa2923faefc0be11dc99170b1a98ee9b51b3596ad97eb040"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4580 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4580}}}],"partialFingerprints":{"codehealthFindingId/v1":"52186c613f141ded34f2247aec6a6bc86f470e49c2316cafe319c6bda76366a7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4603 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4603}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a2cac839bfaf56a7c6e69190afc77f657b1735c4ce99f2cb49be0d5a9378a1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4667 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4667}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c39c55a6010ebfa8a7eaf4689ef10af79ae410b4fdfa43bec12b9cf02ab890"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4684 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4684}}}],"partialFingerprints":{"codehealthFindingId/v1":"7241eb824650ce9555626ff878be63ec57d5980db0b17b4c7691493de076abf9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 4731 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":4731}}}],"partialFingerprints":{"codehealthFindingId/v1":"04209de5c5c5ad6f8f6df70e081acf61b692b548aba8361c665177045837d4a4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 6740 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/infer.rs"},"region":{"startLine":6740}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43cb186e7b7b7d38dd330547a32835e10f44c04ae97fdf574702130d65f48fd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 133 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/builtin/candidates.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6492004cf324f75828ccc8c8a636293cd2faec0fb638c8f00f28b238361b61d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 690 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/resolver.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ec892915476f193f5c77b3bb84df8869a1fce6777d500175966901eb1cbfdf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 695 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/resolver.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"247ad0f11b637bb9f68c7b6b89c68433d3d429a3265a802526bb9e667a6655eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 850 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/resolver.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ed724d6cf54bec109f99e9a4e8523b9c6e5475d74e53bb7fdb6247bc9e33fa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 120 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/ty/doc_types.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e0a3405482ba1f1e548394b6296db3fa6702c95f11ea7ae617b8133aa37789"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 455 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir/src/semantic_symbol.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"5454ae5df4f6a15188802cc3aaace676abfdefc96763cafc8fa63a0a468f3823"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 190 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/lib.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"badb8b9b33dc7834a3757425ee44f9696259007b64204036a7805d50919ac99a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 247 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/lib.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d9fca97412f92b5cf95de4c3a39c1890626991eb59e86b1f1aec3725e1eb05"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 290 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/lib.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ac026a0b43728b0ff611d548972f861278db9e9eaaadd3fced852e1e5fc75e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 304 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/lib.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d0de9ba5a1fcf3d820f9a865651f1e4150f80ca3df225c75dccfad20deca33"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 368 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/lib.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bedb14c10410f95f84750076dfc9b5c0702167c540af134a01cbefe02ef36ba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 376 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/lib.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b2911a765576c4129b7dc06de259b958d63c4f31cafe2bf442fdf05f256183"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 93 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/document.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa2188f71cdaa6a3460f7e604d19243d274efd0cdb3c304199680a1e4653c35"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 161 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/document.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6100f322e2c15d91cb07393368578717165945ffd4de92faa87a311ddeb27a36"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 286 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/embedder.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"420ca947f440a6edf0be9fa049ed03c388e757361efccea4d40e0b16e7b4293d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 294 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/embedder.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"08314f06cb752d007cfe319ed82774e4b9f4960c3784bd2f6b6eacc3cb4e2a1a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 381 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/embedder.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7e51beb479e6d7e08e21f2b150c173c55c5e07a2060188e480aea1cb9fdf42"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 395 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/embedder.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba07adaa5cd7ee141e4f192dfadddab09415d3ef33a7f5cd6890567b607efac1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 409 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/embedder.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e28dfb900407d6d5a73a7381a8a60ccf4354ad7b9c4f415b4121a62271353cb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 965 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1c7e3ac935e22cb9f33d79a2489ba1153781f1568b56ff92751fbc662c274a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 994 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f35c0e60386cb867bd15cb84aaa65a0a9761d72c3b28b780bb255f1bad1c1d0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1038 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"197f0bdd08fd230c6841b3ce2dae39935d0094d2aa04b979147d8fef4f6cfec9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1314 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b6c05bb698e92c831ff97cc49a32f31ed4ea4dbc166630dbd72d451121a2bc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1587 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e51522059a4e1eba06e0499593bfe1fc3f8eedc5f5a83b406549731fa8711d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2220 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efaa5b36cb33b438dddeec9c94be1448eb0582fe4369f8d09c36774de32b42e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2403 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ba6b22299dbae1f76769344a77e72c9447f4d912fa9ba581ad8af505a8bd6d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2528 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2528}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f41f55cef122cbe5151675912a262052db7fc9631f4d1dc771605cd0098019"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2705 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2705}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec3b940840b7d574d32e6ea42ce62a2a6404e42e870c60e3ef173f4e5a4d638"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2955 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":2955}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d082616726fe7c77aa90b9e2097fd73b3291b2caeb3ef1d2916671b4f2ce94c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3470 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":3470}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5584204cf6ffd9e5d591dabcf9ae1effcfd3059be49abbdefe9fe0204f568db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3480 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":3480}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb36b0aa331d3d6e4237d1edb520d35d99b0b2d0e37816c3a95926ecad09eeb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3491 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":3491}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2830b7ab65510a1cb9d45fd2436acc116e45ddb2f40dafcd0493eca1934cd2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3515 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":3515}}}],"partialFingerprints":{"codehealthFindingId/v1":"95097894b6cb8d05a770ce33f05dddc7a4ed9407953eee73ff904002ec023a28"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3809 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":3809}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba50f2a9cc03d623fab20fee97513641bc481e647e7ca702f874f128ecd956e8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3890 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":3890}}}],"partialFingerprints":{"codehealthFindingId/v1":"0591d363c87f321304a60a3ce057c360814634a29842c27e286867a8e412084d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3976 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":3976}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d98f03001924d31b56d823ffd2c11680015fd64d208c232b880ab339966231"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 4419 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":4419}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca371604bf8c1df27a7f64470fe986d6f5321678016a1264bb627c2c88ba73d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 4518 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":4518}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5704dce2f7dcef1b453b08e4c40547c9e7412530bcf30c3c064e62f2563839"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 4620 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":4620}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a3a04fd1eccc665c00b0436aa6d19b5faababc319e6393183a2702e53c5961"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 4647 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":4647}}}],"partialFingerprints":{"codehealthFindingId/v1":"2449d2b88819070d53121a6ec15d09a109c06061900284b25354e90786d0d6f7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 4704 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":4704}}}],"partialFingerprints":{"codehealthFindingId/v1":"44351a5cc4e2d911082cf0149a9abfa5664a369e60c804fcfad13e2d4e1b3bdf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 4848 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":4848}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc568a98fb548389cd2331e99bf3870d429363f090ac4ccb04220805eb8ac04f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 4897 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":4897}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb32d9ef8b0f2a80b9ce66d2d1efe24805c3a9cf8f34aaca3c17d1daf7d6959"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 4956 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":4956}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf291bf7708a5b08146f7f00519533b50e0f418e9f9c22146f63ea69295c070"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1023 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b269e449005d5521d4d936503aeda9830b37b359f6fc470b82cbb0f090b3da"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1076 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb687d203e90922c19df763cc7cb0c81db3cbe97b6ca6199ce8f4cd6544b0371"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1328 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c808b67b4b363681b96c673e12843e97feb26b11bf5fc27329d16d886e5192e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1353 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7e35f28a27c60c0692957b78650d512a989caaac97d24754fdc5462d5b9d8c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1361 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcdfa443a4f58bdde286f5489f8acdbe71ca94058c746f151af334b7ec6182a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1366 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"e870bd9730e241fe10e3d6902c0f6d476dca07e08c3153803cd2cc8e0750d42f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1373 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"512d14c5380b22206950d586ccaeb2240154f8b46751cea7b57335e0e3170a80"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1546 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede0bda92c7d060c52d4e2d23a2bc6ca6fe648990aa2af3a69250043154d9289"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1627 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4afa340395f8bab2e22c93ce6a55a57386759f26964de97b0a472db7c317ddc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1688 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70f59e841940eee5fea5b9aef33b84c9f531c0f9a69763e5b1fda2fe9ed786d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2626 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":2626}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9617185a0280543e36ade9ba646529f1823576a412903aef51c9433664c41e3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2789 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":2789}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefa249046ed9b94e54e87badeab860e9d2371462c9af1a55f43a51a125a93d5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2656 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":2656}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b0f3d2c15338b03a138b59bf27346262ab10d7d66362fa2a0a8f8746d3a367"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 264 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/analysis_scope.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"da39c38d24c5adeba108e8e20240687996ca00306dc5919323fa7a6ea7f35c4b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 283 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/analysis_scope.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"744c763b85e4c250f7b7a34d542309ed790caf162a36f5d5af1415215c5d088e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 25 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/features_state.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b340175a833b798990df0288f99f2f7ca6afadbb27f5eeed7ad8269b08d2c0db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1132 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/global_state.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0039720b44a24a958e16f8363a9470d5d929d8d684576854d116a845dec0c3bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1151 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/global_state.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fd02d765e933cb2356f41f99764e3e260f559b5f7e74cd5083d8eed0e2f769"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1171 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/global_state.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75e7f6bce6dbff2d0859bd747cb3959c4af984edafcaf8378f3b4c51b57359d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 137 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mem_docs.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2da2d3568583bd093820b9dbd2cc6933a7864dddd086e1cdc1be66e70749726"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 44 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1a178ac4dd96ec578fea8a5cf029d7016d6480cd2d3948a674e6ce5b42c7a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 390 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f40981c386b0b7358152e7c31b5987f62ab61060ff2586dc9a39db686fdb84d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 857 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af5cfcd054f0d5ec2c86da64eff61e437cf124f6b7ec03003a2a1bec9d85632"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 979 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"d501179cf28e4a065a9897f7787c474d3cbc9c8e03af3fb5dfffeb800703b8f1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2392 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3710ded0bcbaff7ca599dc85a6dd1748a33926ced8c82e15e68e1bcd79cf19"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 147 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/tracing/hprof.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"779079e43b42ae3374eca184cddcf23e85de5590e57311e1f089c34d26028d56"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 32 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/reporters/codequality.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"278aebe996ad9953ddd9017944f978a0959fed31d4b59e798610e033bf4d1d9b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 33 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/reporters/json.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c277bad295fa47aac44a2183efda0cf6388db68969b8c52e2d4374fc7a5ca609"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 54 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/reporters/junit.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a38c80bb8c7005f78faf99ea9754a89f88e818489c1552ec6bbc48d8d311ee9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 26 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/reporters/sarif.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d5a49e6518577cd2cfd7773827dc8c5a6c5d0a6657c96a63b978b5a30483c6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 144 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"928bac82469f2928f6b517a34fac38005dd038fd1c31e09edf178f7cc6ba9f3d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 167 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbb67246181e73a7ad0642504c653fb9ec13d219fa4ff584e3b7691ebe49c9f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 252 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee27844b908e0f8958f0f683aba701b7da79b1ee2534bb45af5cf36c8fabaf8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 513 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac7a67ce0d6d16f7b13fe50a98aebabd107d0ae6d84b6711097661e621336e7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 539 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35d5575aeb646f19559b7eec936c0d4daf75d6b486d8b0f8137670b937e6bb5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 605 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"e451929f4f952a973f03642f7c1bc54669c2602a3431fde39ebe469d36a51757"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 618 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78920e1a2ed1bb77a66ce0eb4ba2bd9a1c2913cd00ad360507d0c75ad1a4090"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 632 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"8831c70d7ef1f11189910772bfbb0509c3eb7c5e474bb24aa069c32ea8a6a504"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 638 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a68df83b1a321c65b9cb6838ca41ae9ece2b13ddfd40fd0afc12a6bb68d5565"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 277 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/notification.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba516746d559536f66003961c32093718357e10f117520bdd2571b1cac037da"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 450 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/notification.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8eedc1b157e3d418912af28ab12ee0d7b895fec5962a5467665918899bfb0f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 503 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/notification.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"c687c04bd10a128d5b4a40fe135a6c193d9d3f33d3172d9e970b2e947014a87e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 515 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/notification.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e520d1b4f8ff32661d337dbf9121c84e28abc695bf063906fe06e56b7f3a974"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 676 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/notification.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"58678d029a8f8ad0cc55dc931ab6746ba2df21e35e14d3537ed62723b80da853"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 710 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/notification.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba1ef628ee16ca770a34f8ac3b37cee0d6ba4dc8993006c925fe7557b15168f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1003 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c237c2d4928a6098419123d42136d57c4907ed508d1da5b3c471e73faaf1a89"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1037 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d1b40775f7fe378f991486b97dae471f36a7bc85df83f99b56cf4d44e655aa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1045 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d43dd2bf546ace58f45196b52401f99bbfdb73ed81d0578941187884dea4c4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1058 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f17087a4c0156a6bf12b895ed4264a26e2f591865ce692dff3c3f4d1345fd72"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2269 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f2762904667e8532dc2603b9ebbe9338d94fd24bb9bbbe879d98dcb9aaaac9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 2285 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":2285}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad52d03d00ae39aec8f49bcaec663607ca505f0c5ce983cf6e2dc254aa14a8a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2331 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"0993d2e50f3f232ad4004a4de88a4252abf9f1b6ca4e6b446b30088919c8008a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2338 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ded9ab2b4501f8e80454717ea66e69f95a73639368af84f51edbd4b6d310e5c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2342 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":2342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bacfd884e247b0cf8cd47a208190edb4de0da40694d220c43eabf40fc03af6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2351 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad18efe49f1617c99df3c20ed41ca6f2ee9043e4838b19a77c15a13024b547f5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2357 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":2357}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6bb6dc7bc2dac3a735e74eac659c8f6a202095b97faa8200d0072e28964c6e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2360 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":2360}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e09b9d0f59c186ad5b20b9beac4f0fb95c11bae32297fecdbd4d64d59794ae"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 2375 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":2375}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cff4e4630d72a8e1f06c80d04fc5401e4b1969e0850d1b94b35ef05cf23fbd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2379 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":2379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afe27c5f59e8027d6be3c923f2dc981342d29668d02292f225ab0a26e65c89e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2381 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d84a68caf49cb6f09b9d011e8620a745141309524d1aa8ddd5982e8576ea764"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 342 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/main.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"4303f8eb3b39ba8b7dda4c2c1269d46a1741211b1fc8b6e202a58447a5f2838f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 343 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/main.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"390b58daba582bb15e4c1347ed8634176cca85f1cb5d21a3699031ce2aa33d2b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 344 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/main.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"434d82af54c1c518cb14cab90d2553a901fc5de7d2fc77ccd915d249b07a8fad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 402 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97dec73e5f51282b3579292f4c5b3bb94bec4b9ab33fae59b2d10ed0068e7a5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 405 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41cd6f3bef4617b0b48a51ffc65ae5422be9c9b66499878eff6cd9aeac59c18"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 406 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c601ee0dc6398e9ffead9628705b62415176bc7c5a04d6182da9eb0138cfae"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 407 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"831dd787241c2a65d2c61316e87c2ba09063509dc8b182a8c0dfb25fdab6cea4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 409 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c5cd6eb78144d4b4920977c8cf862e5c41a2b1192ba1b382733c3522386551"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 555 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9071d746ef5d46d455d835ad279718e0eef7a7aa343de6b73389999c3f8c96"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 558 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"1840cc68b233688689aab55a6a28218eeab04ada13b8fdc3aeb62a10525ca7db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 575 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b3e708e4b6cb8e786a1d81c880a944202ced534b61d5435eab66195ecc39e8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 613 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd38cf3d5c875725904d4f4353c1a24c630b8309a5db6e881af0d4dbb29ef03"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 809 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"be748c534d94818f6f5bd42e25f993f9c4dc1193d2a66ba46010b141d7d2c15f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 859 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"333b3b3f7c17de2f6abfe8fa4a3680d9dc55254ef2a3a81f4351f16330042ca0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1269 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"138e3cc3d08554b0f8a0ded38b95ecb09bdd9ca84ec879ce9d135f21662bad47"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 12 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/check_config.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af404dee53d3d428386b54191e5e57093862e0272e7348284bfc74acd241425"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdx::thread::Builder::new(stdx::thread::ThreadIntent::Worker,\u0022VfsLoader\u0022).spawn(move||actor.run(receiver))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"6198d14a9e28dfe538d7c8dcef2d7147a26097790927cafd01540912e26b8447"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.sender.send(Message::Config(config))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_config\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86bd1a6a8f269ae32ed20861430589ecfc1cdfa4a7e9ae15dc0d5ada82c1219"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.sender.send(Message::WatchOnlyFiles(files))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_watch_only_files\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1265e2d84627cbb47b216761574b6de9fe1563f57d3d96e2837cc092c5170446"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.sender.send(Message::Invalidate(path))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060invalidate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b15963352c6e09365823732b1ee3107919c83e947a0d5e7b6c2b8d2c60d22c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060it\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060next_event\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9186a88c5093d8e3fa9147f07abffdb24ecc2778b4af3b5072fa9275a7aab02c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stdx::thread::Builder::new(stdx::thread::ThreadIntent::Worker,format!(\u0022VfsReader{i}\u0022),).spawn(move||{while let Ok(path)=paths_rx.recv(){let contents=read(path.as_path());if results_tx.send((path,contents)).is_err(){break;}}})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060load_entry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfs-notify/src/lib.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"046a86da7971159bce857efa33363a7ab84f0640e6aea442c2c18e0326ce90c7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slot.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060lines_kept_cached\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vcs/src/author_filter.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a62708d6274e75c1a6e2b940bf9704a9cb15810ee6eb4a431c107d8f841556"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060text[pos..end].chars().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060skip_leading_whitespace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/syntax/src/sdbl_query.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc6551d8ce36a98c2a678acb576880c142391d546cfbfb1e9f93bb779324971"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060literal_text[pos..end].chars().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060process_content\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/syntax/src/sdbl_query.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab219546b611c61de66ac2b503fb3029d50324b7059b9645dd597be1a206c856"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060items.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parallel_walk_paths\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/fs.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3890e730bf5f01156c64d5e7ecfef9367a0b69587ac66edc8b5d827d66cd3a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060items.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parallel_read_files\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/fs.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfb3b82341f62f7cb90f92ba48009795e87b553826c24074dc7a669e858f154"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060items.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parallel_read_transform\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/fs.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4574625aaa843b7db194fc7429c6b49896d12de39a38c91c5498e514e2e92e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060items.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parallel_read_transform_with_progress\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/fs.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b2d21d15d34a4b7d6a5dfc452953459c615fdaab3d76cc5cc652d6ac9c9eca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Builder::new(intent,name).spawn(f)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/thread.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e92200b0dad754672f3ba1d6a25daa149870611e57cd80f2ec8d09002266eec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.inner.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060join\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/thread.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21f91cadd77b3e54f81c30742d0ea4765bb14626a7ca9518ceae2568b17465f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Builder::new(INITIAL_INTENT,format!(\u0022Worker{idx}\u0022,)).stack_size(STACK_SIZE).allow_leak(true).spawn({let extant_tasks=Arc::clone(\u0026extant_tasks);let job_receiver:Receiver\u003CJob\u003E=job_receiver.clone();move||{let mut current_intent=INITIAL_INTENT;for job in job_receiver{if job.requested_intent!=current_intent{job.requested_intent.apply_to_current_thread();current_intent=job.requested_intent;}drop(panic::catch_unwind(job.f));extant_tasks.fetch_sub(1,Ordering::SeqCst);}}})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/thread/pool.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0000bc07f93d412d06789ae3beeb7be90a7b8d22d72bd7796bd0d052a26c1c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.job_sender.send(job)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/thread/pool.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5744d9133cf04e93b53311a4e5fb9f00630c4ab9b81cfa115626ba1c59f83d82"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pool.job_sender.send(job)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stdx/src/thread/pool.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ead3841afe8e40de79dbaaa68876ae2d55f0a4151d71dc3bc64f69a0d43e98"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parts.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_nested_field_chain\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/context_detector.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"629c8f869fdfb5f9e3e14cc72bfd32cd917990adcf8e1744577eeaa622204c25"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sdbl_types.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_attribute_type\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/types.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"301edb7a90133effc17eba89081596cc32452fc93e9d221ec448e839c4516b8d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arms.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060resolve_attribute_type_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sdbl-hir/src/lower/from_clause.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea2bcfc90fa5877081b619799f3b137df8479bc8923171dfc4f7e2799a8a073"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060relative.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060open_parent\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/diagnostics_baseline_fs.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"693b2c4c4038dc1a1c9c21ffeee30f2312fef807fb02b13d35aae42027cdb5ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060edges[current].iter().map(|id|id.index()).find(|idx|remaining_deps[*idx]\u003E0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060topological_order\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/extension_topology.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce4ffb51744fd782bc726eaf05e0d8a6802d52960d79f29b00f8db82fb7814e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060config.resolve_configuration_path(root)?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060discover_source_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/lib.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01287cf089cd1544dad8b88241a0065ccc570ff38ca47e58a2f6422413c1e14"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060unit_outcomes.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060scan_in_scope\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/source_set.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61e90a772bcdaa5258a0aa9f736d5fbdea5c05867394dcce33c141039d69a3a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060outcome.files.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060partition_root\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/project-model/src/source_set.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b130ed96174262dd440e48b710b6c9a0c281b43f8fdfd9b014eeeeb29b033a98"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tikv_jemalloc_ctl::epoch::advance()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060now\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/profile/src/memory_usage.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2f0e15400077ef977638e3b82cea7ec8aa9d337f936da1dcd3d1e6c5acd53f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tikv_jemalloc_ctl::stats::allocated::read()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060now\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/profile/src/memory_usage.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"699932494e95e8ec3ad36c3f8221b20ace618b255beb1f1175ded1b64fb2340a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(self)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060cache_key\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform-help/src/installed.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"55353cf9ac0a38a2a6bb85bbd5a20aca2c6809d2e74879687396500409a95e1e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec_pretty(identity)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060save\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform-help/src/installed.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca59566b1c0d12ed905c4b6b54d8994deebb15991d59695bc20a499ff9d995f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec_pretty(manifest)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060stage\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform-help/src/package.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b61aca27e3d895d81cd7d6c74d5a040746a13148bbf1427375fa29a0d4d07bc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(manifest)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060publication_name\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform-help/src/package.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe84280eb03ebb1377bc3f3ba9d882d9b79a25f26e76a2acbcae7629c29723be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Utf8Path::join(self.as_ref(),path).try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060join\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/paths/src/lib.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa052db952810807a53b50408a36f767f491f2c12b1d8091035e5f432de50a3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060AbsPathBuf::try_from(self.0.to_path_buf())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_path_buf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/paths/src/lib.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64e87979952bfda7f1c7d95a7a3b4cf7357330fdc4d32a9bc4372d8a2f956e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RelPathBuf::try_from(self.0.to_path_buf())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060to_path_buf\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/paths/src/lib.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2a919886febd45b080cc5ebad9595d94806317da28c286fa2162e932890329"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060preprocessor_if\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"388b308e4ff6f0e99e2943cb488a48cdb06caae0792c56c17116b3cdadd69bf7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060preprocessor_if\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6d0e0770beeaba6b83e34d09da903ac035ad50bef3265e80f8c49bbc996041"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060preprocessor_if\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2714047216124e9d0a0421b1caade908e9e1fe7df9be4917a1e80bb6d9db120c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060torn_preprocessor_if\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"91363d0f65d494b7e55a1b6c1119f0ea7c31490151475e5105e6cb6b9a2143f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060preproc_logical_operand\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"97029dd8e0daf57f348bdfac0f44948d75e25f120a6e2628ddfa532d1391eb78"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(n)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060size\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/reparse.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b435568dfe47bf6e77b06684ed6a6eb8f3ca2aff397ba9451ca2dac567328d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060postfix_expr_with_call_info\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/expressions.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ac4a3a1337ba2cbe507361d247ec25b954ad3973b25e69fa7c9f5ec3a95842"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060primary_expr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/expressions.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"45130061f4a6d5e38ead0ffa769c1585e3f9f056cabeed88a8ea790ec4c4b5f8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ternary_expr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/expressions.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ce279bb10e38c11d4968bdc023bb2622c6a0625e1bc897928f18bced8b7436"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ternary_expr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/expressions.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab19cb3eace3ccc820105ce557f9f622efb316f46863b1112d4e06e9ce9cacc2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ternary_expr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/expressions.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f746ec047775c9b66956cebdbfdeaa679f71857594ab16c26b533ac143d282e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ternary_expr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/expressions.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff96477ca5c045b18fa2caff5b06729d843116ae3dc6142ac096637ca9941f7a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060arg_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/expressions.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1c1cbbb7ec2dec788e3161683e76e350300998686672a2823db3c5897f2e8a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060annotation_params\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/items.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5508bf27679bc607cc2b6c53b650f1b85897b41daae1192bc04599107c4297da"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060procedure_def_content\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/items.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8f392d0a57a29f55c4c4cef42e2e36148ef43daac68b66cbbb6f9828cbdfd2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060function_def_content\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/items.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"486225cd69f46baba07bf618e61bab5a8c86e33583838f4826eac47da2de03f9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060param_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/items.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6528ad67d89ba4f26058b157094becb1fb5fc25605032cd8bf0b1fe8026e1c3c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060statement\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce96418f7460a4400839ac2e181d57e2ddb7a2b1ece6e9f55c4355b9b18540f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060expect_stmt_list_terminator\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5546af03155ed8c9226e462a46ecd14d869b4625e3eecb26006c0081ce6c432"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060if_stmt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c411b28b264dfc9217c1c8a0813b858b7cd3dc4e5dcf98a40dba1ef7c10023"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060if_stmt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54523e92b021ba1f444d99a7f1d83c60e3b00e9e337284199f9cd5d9d459a17"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060while_stmt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"309dfcc5c27b9161197394b72b452d1c6e0e6986f8f79bdbff0f472a3e7e877f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060for_stmt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fefd9215b337ec0454cf97f000ec19fd7c24aaae7dd1607f3d8117aec971a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060for_stmt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a736e66a9dee119f12405565058e24a6f94af2e5269388fc3d90485289ba03"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060for_stmt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8aced27c85a939893f81f52b51ab8701b562ebf7c57363215d233ae859b013"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060for_stmt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e490069ade0d216b5bf8a916f1184da566345c684f4cb50e0b3738db6c3b57"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060for_stmt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"5299127a8cddaeb01bbce249f9c5af5b1d851b213a2c9909450e803522400609"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060parse_raise_call_args\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dd39e077c5f0fadaa14ad713f69250c170ee982612ccd3491e6b0350742683"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060label_stmt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3830f560f975fc717abe284b7e0cc94a1f45fa8a3b32ce1e0f4b10b30e1d0c1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060label_stmt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c34830ce7095968877efc1c250c5a186c0852ff14a1131fc44822ed0846b6d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060add_handler_stmt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a832d4c7ae10bd2d2df399753c3be7054f514a008f78d266ebdd691879874f1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060remove_handler_stmt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/statements.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4d06da41026f158544fd22c88f6dec72ed06c3f2bd37e660257260a0f513d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finish_parenthesized\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d75daf2da6b355580d033a45dfa7de036477c4c4ff1535d03b8107db3fda859"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060predicate_expr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c95b2ae4d383e49261e5b2bf9c155c2fe004245b6228bb2b052447233ea029a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060predicate_expr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/expressions.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f928f553ab88d8842fdf3e056655ac9a79ed651342489c1cb1ca855f61cd746"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060asterisk_field\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/select.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e97437a09a753a54f4504b281e51dad7f4fa609e0cbc5096c0d912ae76e7cb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060table_ref\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/select.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"03620951e39e14cc00da69daa39f6a6c63f0c911328e0e285b7ececd59edb3d1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060top_clause\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/select.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d5829be1943544b6c9b5d15198e44e3de9d22978d86e04a4ea7dbb77690aaa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060virtual_table_args_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/select.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"78021aaa3098f7d38a4b92d5570babeb6e79ce7493eb4200743a9b7893a1cedc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060virtual_table_args_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/parser/src/grammar/sdbl/select.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f27193f735a6c150f7d2aa5ebe62bcd6bf42184c6374802b8e7b3f5f0b08df"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060shared_or_build(\u0026SHARED_HTTP,build_http)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/onec-client/src/lib.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4f14ffa2a7caff243a333c470d6f436f5b809a8855a2a1f9f4a41bc4cfe8e8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(format!(\u0022baseline-service-{}\u0022,corpus.as_str())).spawn(move||Self::worker_loop(worker_source,receiver))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/baseline.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"f499415b972a6a16a44864f6d26dd8c5820be5f32f7d40ff4597cb1c14a2b655"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060acc.cursors.get(\u0026id).map(|cursor|cursor.pos)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resubscribe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/change_hub.rs"},"region":{"startLine":2878}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbb98b7b7fda9dfb8296c5f1eea894a081e6172c5a349e739977d1be4b6825a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060listed_tool.and_then(|tool|tool.output_schema.as_deref())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060profile_surface\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/contract.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"225b05f2044243bc77ecc866263cff11c5a14998ad4f0c17d41b4c8b245e70c3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(output)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060profile_surface\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/contract.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d178d7e8bc9e102d9bf31a9ead984c7ce18666475bd9238c11538702404dbe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.portions.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060send\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"e766710e64c46325825bdafae5e74547fa4ddc33bc091fdf16637eb62a871865"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.thread.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finish\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c003c1139553fb95fda92bd3e24755e2143df90dc9a75e95e4b390e45db9538"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060project.search_roots.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_graph_database_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a334ea6027cb0f319ce70e4422d60b614f57075cc3188f1389ac3fd63868929e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.conn.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060commit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":2082}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace9098a410f2210df3912f8f1c33dcdf0cb714cdf540f7c2d8720901666fc6f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.summary.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060commit\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73d139925c1c7f29269848a66e24c204ce45cdee4f26f676be47e138bca7b8d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060transaction.conn.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060begin_body_patch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":2158}}}],"partialFingerprints":{"codehealthFindingId/v1":"e085d4d416cb5370617c7cfcc5ae0ae57ac155bc957e00c7bff4c8e0832453fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060h[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060write_body_patch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":2490}}}],"partialFingerprints":{"codehealthFindingId/v1":"def012d33c9a1f498ba4e57fd811a5bc25e8ae3f735d9cf3a5e3593073a3212b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060attr_hi.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060referencing_files\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_query.rs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"caac777843dae26574e48d7812a9d0e801ba23180c0bc71b38b2b458730ffadf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(body)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060attach\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/indexing.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bceecd9c7943507bdfc7031c7768aec02176b8ca20f7cdcab23ed0e35a987f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(self)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060attach\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/indexing.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea619f216e541c2d2b410d294881cf2656c719f8641113492b629b24a064abf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(body)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060attach\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/indexing.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da23840cc0a107c57d3add17750fe3f2a229943dd433e3a3f62101c01a4b469"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(target.kind)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060text\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/indexing.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"0271eae74d1eb3a9d9bf6e71ebdc1e007a642b64df4f43e9cecca3d4c6f44495"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(target.state)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060text\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/indexing.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59dbfaa807e9b364a2c7ccf3b5e6e6a03304fee4eac3582398fda2a53661590"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060kind.as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060text\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/indexing.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e62f216d3738b39c335efb7c2378424c08143214f6b6e5470ba4b5eabcb33f5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060text\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/indexing.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9132b6d7cc18d14d37d6409d8ac4a5152d5dc9860fd9c5b5fa8d45c1eb951d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(phase)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060text\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/indexing.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"39356b7391fd8d3fba4d44974df4093a514692259813ec08bcf0d8fb73f07577"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060phase.as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060text\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/indexing.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f96e8a8e290752a6f78689da7dbc0ab75c81656f7677684eea2207c5ec1e21"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(progress.unit)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060text\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/indexing.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8933869d339a3f7485994d42139ff374f9f5e40426acc69f5205a62e1bf7be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060unit.as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060text\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/indexing.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"3039096b98a0384f3681f916f1a446d9c765981bab3dbe8fe6e3b6882bf60164"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_dir(dir)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060rust_sources\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/inventory.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"045834cdf1e48e68b7dd25da56ae76acb16e22f46b9e4685e4e9b413e01d38fe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060rust_sources\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/inventory.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ae6db9b17e316c4168a7e1ebc6171194dd7c922a62e71837ca12caa8cce9ec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.parent()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060is_test_only_module\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/inventory.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"762a0a0541464b4ad81a44dc09b54996b6bf56b575ebbf5e5c06da25811dd410"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dir.parent()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060is_test_only_module\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/inventory.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"97050d2737b713067d510cd060b6741e3e8317937612c30b399e5a3f55791a11"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.parent()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060is_test_only_module\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/inventory.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"d072ef0ac1e61cf9f06f0b9d50f74f9bae8d1935973aaa01c8d71bc7fd8ad053"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_to_string(\u0026path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060production_waits\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/inventory.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bc2cc5726545e6690a275301ec4df8377e3ea49fcdac2faba017f2484bc9bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.strip_prefix(\u0026root)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060production_waits\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/inventory.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f3d6bc07ca762ea5b8e1c7b2013c368a3891be4a2e847b8e257d7629b1fc2d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(body)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060mark_graph_stale\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3fb7eaca5f27bc878a893e0914d2dae9c965ad2415dd08099c54f05e447cc1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(body)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060mark_graph_stale\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/lib.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c39d267fc18dbb7f88eeb2fad743d7dc63c17224d9dffd91724c7ae356215ad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060hasher.finalize().as_bytes()[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new_token\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/workspace_lease.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"3000db827e8e7c6a62c5bd2b5eb5d9695608505d6060d169cc2a687cd4ee4aec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Arc::get_mut(\u0026mut lease.inner)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060claim_cache\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/workspace_lease.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ef32db9dcc4f5102f498caba080c6387207d1db468943155dc29231c2d5f29"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stopped\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060map_checkpointed_result\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/workspace_lease.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b9e1ebd05c0862e77caf9f82678bc6ff608f0869abe1fe89e3422f54b02861"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026request)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060execute\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/check_executor.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce7f46eb82256255849df55a3dc786ac9161d97e7eab390126c2dfdb53b5b7e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060permit.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060execute\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/check_executor.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b887f36bd9d0e12e8bb6fb8b9fadfb1c9198e97b82ed2aa9d2ebade937c296e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stdin.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060execute\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/check_executor.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7265cfe48d5b88bef97448fdd83d0a266a380e86f12b084555b19792b0a0b59c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stdout.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060execute\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/check_executor.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1837152dbd68b0e791babe19ea8f0db4a25203fcfc254b151be7e8fd2b9854c1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stderr.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060execute\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/check_executor.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"85298e4134fc4ce6fb524fc8a1c20efcebc8cef1215924976495711a8d05bce5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.raw_handle()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_executor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/check_executor.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"6807cec442306d0d9feafe743ee8cd4fb4f7ea69a23316b5b877f333f70d5f9e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060permit.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_executor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/check_executor.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3c865641b39de7672deaf79263db9f027414e85ae278ad1f9266a407a2ce41"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.id()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_executor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/check_executor.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccd53b1af8c8fc9c8c824ad4d465c1d62f63fca436f66134012c35572ca71d3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060permit.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_executor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/check_executor.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5d43d6f0ac07d42d26a3a9aa5fbc995252fffd75f9b0fb10f307d3b9da35a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060permit.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_executor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/check_executor.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c4b4d371422eda66c9ef1b4e27a4f0097dff65130888b9346d4764514dfd8f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(response)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060structured_response\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/check_executor.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb1587a4306fd482626e60bcb45a73bbbb00e4b5bc894938d0ef52a967d6e9e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060snapshot.error_summary()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060unclassified_baseline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9291e044fcf8262fc957ca321b5c0c171a125a8bb529733fe4d87162b26dd7e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060plan.policy_for_partition(\u0026expected.id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060unclassified_baseline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbb2d2774b85b05b7e51f1de1a613a1504dc31e65b645379d2193945c174f6c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(partitions)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060bounded_baseline_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5b1a14dfc30316f6b421b98c9a798aaaa2bd303e8dc03c12bf9e884d0b182f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(summary)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060bounded_baseline_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e08e9ddd955bbbc898729c47ec51268eee9a3348d947859594c011fcad1c93"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060snapshot.error_summary()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060classify_file_baseline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63912fa842edd7288a23bf0fefbacf06666d3f4c0b31eebc00f79f376da5367"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060body.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060workspace_findings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"05243fcb8698ec48327507cd25e75760fbd68967f9b2b45abfe1662d00ebd256"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060body[\u0022baseline\u0022][\u0022partitions\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fit_diagnostics_response_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe17b2aea9e015d4461e8f2ae99694fbbe1d83a920c56ad9c4c9d2258fe51ba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060body[\u0022baseline\u0022][\u0022errors\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fit_diagnostics_response_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a0ccabbd7a59e938066b522d3bd479d02c5a668f69b61f5941ae86a9e894bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060body[items_key].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fit_diagnostics_response_budget\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"069515ae83dec19147acbcb76237c116a84db54967fc6d1dd94e8b23ef2fab88"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema.as_object()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060graph_output_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/graph.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"8023fb3cdf8af8271b71f7470972d29955a5d31db5ba4f04a9fb76ed2acd8d9d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060guard.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060its_help\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/its_help.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"63321a774d4a5656b13d7814fe784868cc1667b996889a5ebba1ce1b06fa3df1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060body.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060to_value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/location.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b97f727f91015983f6d792b4c40b5b5cf034dae13b73fdc9a3ba94d5e3fa790"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.content[0].as_text()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_metadata_tree\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a533e4e8d8f4eba3cea8d29695d19a2b9ee7630400ec636f2d6ff06a6b90b4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060body.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060into_result\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/outline.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68e2416c0254f11e17f2f12dc2e75e5d53a48046a955356f5f771459a8210aa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060body.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060answer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/outline.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"611e55940d1e425d4d2d94eb2238fcb2ea78832b2d3682ddc5827e29527e3ebe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(left)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060reference_documents_fingerprint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/platform.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca9183fd64239d5e7fbfc61b4be6171ca805b8eeef3ec97498aefffbbe7d6fe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(right)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060reference_documents_fingerprint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/platform.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa6be62fa028ecc73d41c195d1462c1cbbca87ab9f2d9ef567b9f4c10b45682"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026(REFERENCE_DOCUMENT_SCHEMA_VERSION,canonical))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060reference_documents_fingerprint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/platform.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2c8ea8ca938f0edb8e14e58fafa0c3712fcd01329bf47b539e79a63d1ea4de"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026identity)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060reference\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/platform.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e17ec79a6bb34b4b6c33a90bba5478d9bb15f1244265981951b783286dd3376"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.structured_content.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060loading\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/symbol_info.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4ce0086c3f44015e96dff5b6c4df1c0288d899f04cb0ea4fb488acc67c3ef6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(body)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/budget.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"588e54822dba0a446758a55cd6fbd80876a7256b2f9e60f9a217434b65c9b45d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(body)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060mirror\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/budget.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"448b9debe4f168bb7f4f3e3ae61c1c95f7a9cc500092c6c3dd30900a70003783"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060body[\u0022hits\u0022].as_array_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060trim\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/budget.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5488ad691a46bfd53488dd9aae153eb674298774fe786b487bc9fe59b4632b8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060floor.structured_content.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finalize_indexed_response\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/budget.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e18eec051af19c9506774b9025525b3665721ee41d7f26e300e9131dc4736f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060response.structured_content.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finalize_indexed_response\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/budget.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"82933f6a8149e16cd6738e559cb3384f25a25def08123e3812cb529db834bf39"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.embedding_failure()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060search_docs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/docs.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2456635d08a14923c02659ce7e3fcca7b586da1da246de61cb14198e5d5e9fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.structured_content.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060not_ready_with_failure\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/render.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1ab572d1b908e734b522507ad0b93ce56a0a9c5376a546cce22c92015f9fc2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(body)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060not_ready_with_failure\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/render.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f6229c63c8bdf8242ecdb189839ce86cf750d1bf7786a9bbbd91d1f467819e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(body)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060not_ready_with_failure\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/render.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4894d171984c8dc2078663b4ebc950c8c8a7e07d07b0f606d78f09638783acd2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.structured_content.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060failure_hits_response\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/render.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e0a16c6d777a12bd74d644d6a199fea2f9ebd47293065c02332cb70be54f1e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.content[0].as_text()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060failure_hits_response\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/render.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d0b4c5b63b03b043d0ce8b28687e10d6248e66a31c0c57e9d541af0b05b607"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.structured_content.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060failure_hits_response\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/render.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fed1fbf749972606fdac823de20e37cdee9e09a8ec41ee5a488b6e684ad3dd1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(result.structured_content.as_ref().unwrap())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060failure_hits_response\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/render.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cb16f8c2e82b9cd78f6604120d37a25945a814f90ee66d35889152ef8fdfaf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026block.json)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060failure_hits_response\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/render.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"123e43deb7fa34d25dc10c74a386336b69ad7650fe009998bb3c237ed263c808"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.content[0].as_text()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060failure_hits_response\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/render.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bc891697075e1b6f678cb90ed9646f6dce2e42d78ecc126de57439fb307393"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.content[0].as_text().unwrap().text.strip_prefix(prefix)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060failure_hits_response\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/render.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"800ee950673b4905c0ac3eeb6c51941875e18bbc24d62d8c0a7d34dd988f8678"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.structured_content.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060failure_hits_response\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/render.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdb100b8a9f2943fcbfe872dda1cb350fb5ee8f912eab0c977d70e99c6f5db0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060guard.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060semantic_code_hits\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/semantic.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d159a2df59f51b02ce32178be2dfa42eac8966695d816afebf07e289487c00f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060error.embedding_failure()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060semantic_code_hits\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/semantic.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a953ed49d1e240a46fe9da9db02ed36b4e432bbe0ff1fb43579cf43cca89b4b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060external_baseline.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060semantic_code_hits\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/search/semantic.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9c1d5ad2ad0b89dc5a505acf92850ea81fad1a09c1196ac9aa35483a08a2a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(byte)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060offset\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/diagnostics/snippet.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e2a9fbb1260ef32edba05eccd2ad64bedf79aee5ea331c1384d72486127675"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060operation.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060startup_apply_once\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/bootstrap.rs"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13003a096331678164584071dc2e8e89984ffc4ed2d23729ca1b312fb61ec99"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060prepared.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_embed_pass\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/embed.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c67ce31ba2aefff2c531ab4b50fdfe5561dad6269b4cf96d26b00e49fe4579"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.onec_connections.iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060onec_connection_named\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/mod.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4f1375b5fac81c1d558564ab98cbd7285ead9a7c29cc4d6ff2f99a63f8aa44"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pending.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060spawn_search_sink\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/sync.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"849ed1fc45aa10cb570828f6b47c9464d9e903f21b65f63d19b0295ce0e31c62"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060drift_retry.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_search_sink\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/sync.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"345ec8a72e673cad8de1c10f5c0881f16c87bc6b50fa1b846185a30e0cd06147"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.graph_db_path()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_load\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec3e177782464f4c9bad2f066cc6f532b7553772e843d11b87b0fad373bc209"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.graph_db_path()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060try_incremental_reload\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeadf43d693c6f6132b3177035e9cf720809245e6fb31c179d9cae9fa1db50e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060h[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060try_incremental_reload\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa06ebd1fcd1cf4a831a405efcc876b0d12b7c71ebf1161241bdf2f527f641e3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060h[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060try_incremental_reload\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe1848fd1f3327fe12ecea256a55ddd0e3dd7c38cda9c762223915ccfb5844c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060incremental_coherence.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060try_incremental_reload\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f1eb64f1e1802257d0f9002415019e2f3b0a7da5d51055a2345f61f2229bf5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060graph.graph_db_path()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_and_publish_scanned_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e3b7a7a52a1102be1063f545e4c114755b8dfccd64b52ef51ba0783aeeebfc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060graph.cache()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_and_publish_scanned_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb9a03e158e7a999f710d1e35654bfab80e5792cd3da122c8973878a896da91"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060delays.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_and_publish_scanned_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"360abfaa09576fc7e1bb1c2cfe687345312f55b0aed5d3bee1b990a65ac0f660"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060graph.cache()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resume_pending_full_candidate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":2355}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4566d80cdf15a808350c76ea7dee0f581df4820113e66a4bbbf22602b0fa53"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060hash[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060catch_up_straddled_candidate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":2769}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c06aa160892c443ad26f0706594b9f5f8f9960f6d618ea3f888e913b21259f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060graph.cache()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_patch_candidate_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":3000}}}],"partialFingerprints":{"codehealthFindingId/v1":"4deffc1651e19fdb167d9696ab3bf0ade00c4322f1e4e84416fe365c378ba280"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060graph.workspace_root.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_patch_candidate_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb07b6718efadbee32cbf6a20d2638a0a981c40c423340a405893f522f9966f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060graph.workspace_root.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_patch_candidate_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":3217}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9e2d30721b3ad750250dbf8aef00f40c28397cde0c3166b8334952bde52f5d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060graph.workspace_root.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_patch_candidate_inner\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":3321}}}],"partialFingerprints":{"codehealthFindingId/v1":"38969f98ae47f0af47d8c23a90ad6d70764245fde47d9c1d75a2274c834a20c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060held.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060write_patch_in_place\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":3543}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e43335eb09409413fa8011bf93e9cc0bdf3e0c9b1d8eb80c37190c7704ff357"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.observation.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060emit_chunks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":3937}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c4ee286e3725b7a93b43e4f04368a1d703ebaadd6bbfc57a0356d5728040c6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060groups.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060emit_chunks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/build.rs"},"region":{"startLine":3946}}}],"partialFingerprints":{"codehealthFindingId/v1":"84eda1f29949b36190ab230b23974c4c6c0d047134f4c6b69e3cfc2f60c98176"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060map_largest_first\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/byte_budget.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ee0d07dc33ed97a7c90ebae1ff57071a5279beecaf60163f225b75a78bd24e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060digest.as_bytes()[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060portable_topology\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/input.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d98efbcc8e1657223dec32cd9b24ff50fc6a5227aa2f3efa34e67940f72d2e9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060hash[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060digest_fingerprint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/scan.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e8f15d031c92c064626ac8fab3cbe1be2a98c0daf898927487160bf9dbb9a3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060digest.as_bytes()[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060portable_fingerprint_of\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/scan.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84982ea7b2f7e3942e655a9a7e560b186759b5f025aa5cdadef3f9eb2121983"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes.as_bytes()[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060topology_hex_u64\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/scan.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"37920618a57755866c2012dc3ad4e77d268bdbaebf0ef388e73a500de14a9597"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060h[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060xml_sig_hashes_within\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/scan.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"5395974738569f55301b22407a474c3b7368fcf3741c17345b55b61d2636cf67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.entry.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060deref\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/snapshot.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"379fa4b28e6f5b6d8fe39d1009be247c63dee67e439f6ca1ad40668611082581"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060prepared.entry.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060install_prepared_snapshot\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/snapshot.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef81fff55fc4527f897ea7c1578e65961e796fef69310d40b0a7edb34029905f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060project.search_roots.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060current_disk_fp_with_watermark\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/snapshot.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"3983ba074ab35404365d7cb648cc9c660a0176f152d6faa76a605466b4dff92b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060digest.as_bytes()[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fold_portable_fingerprint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/snapshot.rs"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"daeaf71c4b9ffa11d6624a57a15bc9c308d493fb2057a30f8da66e49d1506ad8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060hash.as_bytes()[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060refresh_saved_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/drift.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32563c6c27751686e2c50546aed8245c1c8f12214602f9f92b2ead990167d1a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060hash.as_bytes()[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fingerprint_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/drift.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"834412e6794f462d89b8ceb8349453a3890053e2638f39ff005e7929415cd76f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir_all(\u0026gate)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060hold_shared_test_gate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/lifecycle.rs"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f8b722803f44d65d7fc7469a4f001aa9d3b8c81c58db72cc1e5c53080c6639"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path_of.get(\u0026file_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060workspace_aggregates\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/resident.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb4ff80bbe3edc2c1ed80feed0fa7000b2b9c5990d8cddb18dfac9649875578"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rayon::ThreadPoolBuilder::new().num_threads(threads).thread_name(|i|format!(\u0022{SWEEP_THREAD_PREFIX}{i}\u0022)).build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_sweep_pool\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/diagnostics_state/resident.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeae0959fb4046e44e068878b6cf2e24d3ad54589ff93b3eac45abfe56f7ef2d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes.as_bytes()[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060embedding_config_fingerprint_with_prefixes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/broker/name.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0d25de8ee20a58013062e8bada87a8e097f65041db0d5ff1882404648545d6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060worker.join()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060file_fingerprint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/broker/name.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"748cc1997f244605dc21cf4ede94bd17f54d865c85b18637d50b1aec53440145"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060prefix.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_resume\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/broker/transport.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0c120766683ca728f592ce5e6b8665f6c5f321eaa9cacd90c75d4c68a99530"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.try_line_start(line)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060line_start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/line-index/src/lib.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"880424d4b82bebac1cfc9aa55bf48018b5c7290178ac3ba457b18d868b1a6257"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060global().norm_strs.get(self.0 as usize)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060as_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/intern/src/lib.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a391a7b2e2ec8cf72f41798589744141e360cb573955d25c1bb272374163bd90"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060intern\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/intern/src/lib.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ccf490c827936012cf73ccf5829979322edc7a3f75a48ed3fd030255eb8c8a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(root.join(\u0022bsl-analyzer.toml\u0022),r#\u0022\n[source]\nroot = \u0022src/cf\u0022\nextensions = [{ name = \u0022Ext\u0022, path = \u0022src/cfe/Ext\u0022, scope = \u0022InfoBase\u0022 }]\n\n[diagnostics.baseline]\ndirectory = \u0022baselines\u0022\ninclude = [\u0022main\u0022]\n\u0022#,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060selective_project\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd32d60fb82e5015656d6472bbe234505176c5a221970b141b04700edb175e65"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060project_model::ProjectConfig::load(root)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060selective_project\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a837715f53fa5bee3eaf2fa3c312e5ed7d5b57b83f85ae63ad29eeb3d502633"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060project_model::ProjectConfig::load(root).unwrap()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060selective_project\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72ca1e64ac07bb77ed751ecc4e153f79ad5c24b6b3f77be561a2ad4718a2b99"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060project_model::Project::with_config(root,config)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060selective_project\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f992105f296d858638e110eed1cd8ee77a4d9eab0a134d95c18da54b5ebd423"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060project_model::ManagedBaselineDirectory::open(root,\u0022baselines\u0022,true)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_selective_set\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5155d8296b54bd8700b226bc625f94a13cca1e383e7b2d58a06dbf523dd58a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060diagnostics_partition_json(partition.identity.clone(),vec![])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_selective_set\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"525a929757e3b99b27f7e1ab1a2607ae9470f06bbaaefe4c5e04af14a4915309"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060partition_object_path(\u0026partition.id,\u0026partition.key,\u0026hash)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_selective_set\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabee022d9d97ee7331e9fb49e0e2d46ade4c51ec695b249c80136a891d970b8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060directory.create_file_new(\u0026file)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_selective_set\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01dd9b6529998cdcc6ee1d8f005a758069ab52bfd47d55db50039a3b1ef7239"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060directory.create_file_new(\u0026file).unwrap().write_all(\u0026bytes)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_selective_set\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80721391afce0b79dcc74395fe786c6528edf53f9183eb403995d3ee69c2db6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060directory.create_file_new(\u0022manifest.json\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_selective_set\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c10df55e7d25ee9c83cc1af56d0c11f1ceed76cc0ecfd75d72bab2c91588c85"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060diagnostics_manifest_json(\u0026manifest)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_selective_set\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"a751ec264b47807743f488e390d02da9b6fae556081a9478442ebcc140420671"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060directory.create_file_new(\u0022manifest.json\u0022).unwrap().write_all(\u0026diagnostics_manifest_json(\u0026manifest).unwrap())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_selective_set\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"6616a041068a7d40d4d64394926fd4b3b32576255297c0796a424fa3b89fa4e8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tempfile::tempdir()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060selective_stand\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c22f44787ed6049f5bdfd8f7a3956e89707c668ac291010909065a4f602788"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir_all(dir.path().join(\u0022src/cf\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060selective_stand\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f517a001cd031d06d639ded85a0ef00b6dd44b7d81fc4b871d39add545b2be2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir_all(dir.path().join(\u0022src/cfe/Ext\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060selective_stand\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4687ca46a10e7c4d42e5ba683c5287369960ad3f3eb211fe1ec857fed9c05c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(dir.path().join(\u0022src/cf/Configuration.xml\u0022),\u0022\u003Cxml/\u003E\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060selective_stand\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ed95e750365d0e1bb307a6e9c394c5e778fdae362abf6fe51a357a8645aefb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(dir.path().join(\u0022src/cfe/Ext/Configuration.xml\u0022),\u0022\u003Cxml/\u003E\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060selective_stand\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c495cd674f03bd6e50305e16b728282416cb96f1309d6f676e68d1b72ee59f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_dir(from)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060copy_tree\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e716a082f929a283d649ca3b05e0203a012ef2a4d7735ef9bc1743f6c856f6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060copy_tree\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"d315495b988f6da4533d3cb0c3142324eaa4dd48756bc8e4c7f67304fb20637e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry.file_type()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060copy_tree\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f01ec6b308babe53e2107d1b04f36d47e3f82b591aa254d29387690410ddbb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir_all(\u0026target)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060copy_tree\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c84a9d642495ecb04296f111dcac25b4b6bdd8a929435fd7ef43206342cad1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::copy(entry.path(),\u0026target)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060copy_tree\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/diagnostics_baseline.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9248eef1e54d4950ce5dc9d054c9fd2d38de5dab090696e38e8936e956cf397"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060apply_source_batch_cancellable(db,source_root_id,changes,||false)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_source_batch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/load.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c00076c33e09ce72f4e0a73f1cd0d13f3dac1d6366281882862652a23c6e17"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060disk_revision\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060source_matches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/load.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf9a8e8e5f2256e95161f13a9502d0feb0f18938d2f08b4b98ae279e497d7b2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060disk_revision\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_owned_source\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/load.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5d4595c5ec07e1dd06c70be98f63b59112a18c8ac80dd41ce9938487255fee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::prepare(snapshot,||false)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/workspace.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4dedf058c385eaed066b4e5aac0eaa3e1eed2dcf3f248742bcd9b8edee752e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir_all(\u0026gate)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060hold_shared_test_gate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-host-core/src/workspace.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cb6e9ef5edfbb2cdf222a1726a015de00ae55321710bffae28cb125394c6dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env::var(\u0022OUT_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/build.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4420be0bbf1d4a35710dcae8e71c384f9e301135d92c924795acf287f251ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env::var(\u0022CARGO_MANIFEST_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/build.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2210800e2cf571d9449b729aaca4c708cc39c36d1c1b86f49041bc463e86b2ad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_dir(\u0026ru_dir)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/build.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4ea26fe5b215e2e7c620ae431e788aaaa92220e924185ea58dc0dea05abf8f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/build.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07a8bae4bcd7e64855a46d814b9aeaeff157aa32861f33cdb4296c691c9cc84"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(\u0026dest_path,generated)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/build.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0cb2cc88843276529debfbb01160df06a1d6091dc00e0b8921577ab91eed2a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(o)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060to_input\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/config.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"088dd5c76f31959c0edce3f68bfc3b1a85de8971903cfd7ae935bd4ec9f1e71c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cached_regex(\u0026format!(\u0022(?i)^({})$\u0022,DEFAULT_SEARCH_DELETE_FILE_METHOD))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/missing_temporary_file_deletion.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c020fcb7e794aa5991d6c9a9e96ac5f2ccefab013bdc051a6036335f2d8805"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spellbook::Dictionary::new(RU_AFF,RU_DIC)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_dictionaries\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/typo.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"334cceadaaccfd5eacb6c24ffce2ab5b0450361fb4fe8789ec33dd2659fc4cd3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spellbook::Dictionary::new(EN_AFF,EN_DIC)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_dictionaries\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/typo.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f0b979c81770309978b8a6001c8c637232f3e1817e1e3a6f35761573056526"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cached_regex(\u0026format!(\u0022(?i){}\u0022,DEFAULT_SEARCH_WORDS_EXCLUSION))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_hardcode_network_address.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29efd803af8b1bd9f463bb269e51fa482f4ab09e167cd2a5cbf493ba366dcc3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cached_regex(\u0026format!(\u0022(?i){}\u0022,DEFAULT_POPULAR_VERSION_EXCLUSION))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_hardcode_network_address.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"da47f1b1f00ec3f33953576031495e3fbff9cf912aaec7753bf6561042c449c7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Regex::new(\u0026format!(\u0022(?i)^/({})(/|$)\u0022,DEFAULT_SEARCH_WORDS_STD_PATHS_UNIX))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_hardcode_path.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1271019f28c00895df50ff338bed054e31a00857615177c5a102c9496ada18b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cached_regex(\u0026format!(\u0022(?i)^({})$\u0022,DEFAULT_SEARCH_WORDS))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_hardcode_secret_information.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50b63c2da02470a01fb216ff7975a1fd05ecd89f2cd99c504457a69099f6514"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cached_regex(r\u0022(?i)//\\s*(todo)\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_custom_pattern\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-diagnostics/src/handlers/using_service_tag.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbc33dbb6e85c4066270602a08216eb86178c8ae67487bb630aedea5df1adc8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060metadata::WorkspaceConfigsInput::try_get(self)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060workspace_configs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde7735aaa61d31032e817ccb1a97ecc11ee468af75702e14276498dad7ccca6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060metadata::WorkspaceLoadStateInput::try_get(self)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060workspace_load_state\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c78155ae5f417fa76f6b9661b30bb8dcf42f280ad22168b57502c1d10fb374b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060GlobalConfigRevisionInput::try_get(self)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060global_config_revision_input\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f81919623f4c95d8ff92d0aa86766abb4ed4138b875de60f694ecad13ee6e3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060FeaturesInput::try_get(self)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060features\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":2764}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b050808fb862b90dc3cdd0769ee6c3ae307148dcb90af8658c4b25bf616ce6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060FileRootLookupEpoch::try_get(self)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060file_root_lookup_epoch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":2878}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74caaff5557cef007e9c0aa84f0312806fd86a753b63de0022aed08c59d4418"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060FileRootLookupEpoch::try_get(self)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060bump_file_root_lookup_epoch_if_observed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/database.rs"},"region":{"startLine":2888}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3bb0825723619c07426fcc035763b67fc39170afc78194f63b5c5f2f5ad323"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.table.get(id.raw()as usize)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060lookup_type\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide-db/src/type_kernel.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b8c3c3c1147baa44dd93bd3b62eceb1b4c0a1170f8e353ef396220fea43ea3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.values.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060send\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d6776808a7a97d70d7f0e27c4dd69a5e027f61a1150dfb76bdcb7f552c83f3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.thread.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finish\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa3fc1177599f7666c40e6b18954d524e9ec53e80d1b5c9618281bed0d6072f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rayon::ThreadPoolBuilder::new().build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060reproject_metadata_owners\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/graph.rs"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd49f0d3c9fa386c8bc061c2c355767479f21dd9de71573f446e8cb966f8f59b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.get_mut(owner)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060partitioned_coverage\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"734e1739591bc8ce06da0ac0f413ea7c2304fcefcf0c677c5eff7e1ed6ab45b5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060owner_files.get_mut(owner)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060partitioned_coverage\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"895c60a69bf668eb7665e7909f5edd291b4e08d0860caecd534320783acd82a4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parse_hash(\u0026fingerprint)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060classify_partitioned_diagnostics_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd393da863fe0a56931411b5b263e9d56ea4aa785fba8516633be68d3f7b3784"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060plan.policy_for_partition(\u0026expected_partition.id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060classify_partitioned_diagnostics_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd744ba8a23d95b10f8aaa0a35fb42eeb8af12bbf91a17eb390dc03ac35f59b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result.get_mut(owner)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060migrate_v1_to_partitioned\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3744f492d7ada17f10b56f9ca2c387b35dce66f96811d6bb35ea53e5e103ae7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060previous\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_diagnostics_baseline_set_once\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/partitioned_diagnostics_baseline.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d88eb60ec78e346620ea3da307cab06a8870c62b2e5488a0f32da2f0a38c86f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060anchored[0].place\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_by_dictionary\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/references.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad955fa6918405320bd1f6c76da6fd5474abc73b40440c39bb320f134d4e067"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060place.range\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_by_dictionary\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/references.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a5012d493eebc6aed575d18442bda7fdc289ef12b6a41c775b79696646f4d8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tokens.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060highlight_leading_comments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/syntax_highlighting/docs.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6756d8de2bacee852b94dd183d698041e3697538afa4d2385746af25b13e5497"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060token.parent()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/formatting/ir.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df12251ebbeea6aad487365e7a63d27e6339f17ea555587cbf1e7057a8329ef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::iter::successors(Some(b.clone()),|n|n.parent()).find(|n|a_chain.contains(n))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060lowest_common_ancestor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/formatting/ir.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec15d65e98ce9d88a977d1f2ec6ef4944bab0c898a3cdbd67090f0fffe18e14a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060segments.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060trim_preserve_gap\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/formatting/ir.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3873f0e40b1b3ff7424d7d3a1c100782b7ab209d29e864601cfc96ed3e8a888"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sigs.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060render_global_function\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/bsl_completion.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"440cf685c211fd4642b96d5a9a5aa2a8068151df858574fe61bc923cd79d54aa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sigs.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060render_manager_method\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/platform_completion.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8be2a22fbc17ce1c783af17a77ed7c9e8c6099517cdfa143aa3119864950731"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sigs.first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060render_platform_method\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ide/src/completion/platform_completion.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"8124db14f9d9c24fd4e26199f9809b9015289173e3ccee45aa4f12f9d855cbc6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060kept.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060drop_union_arm_id\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/method_lookup.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b597f633c24ca28e8503781615bc68daea8ec3557b59301b4769465081a9c7a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060db.interface_method(resolution.method_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_qualified_call\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7023415a8ae0c24d3ed3c1f482dcf33636d4d2d8f958699223cc3fcba5a26e0d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060db.interface_method(resolution.method_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_record_set_module_call\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"394b92f3027d4d74b9c222f224f5dee8041574a680b69f984dfc199d6ffb67e7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060db.interface_method(resolution.method_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_object_module_call\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3090695f5f2ddb5ad5d53d1f74ba6134fc4e654101ac19548c004df251d7a0a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060db.interface_method(resolution.method_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_aliased_manager_call\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/method_resolution.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d9061cbb1bfeb0970edc561516df58dd28c495b68a022fb31ad7704913c822"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060shapes.get_mut(\u0026root)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fold_call\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/structure_param_keys.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"72888bb1db31b8c397494284347a3db54fb4fd535be7b64f5522626ddda942ba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::user_call_candidates::for_resolved_method(db,method_id,return_ty)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060for_workspace_method\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-ty/src/proc_signature_lookup/candidates.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd604a16a3e9f50a92c97170250979190aec16c15c32403cab832f5dfb65c2ef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.chars().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060is_likely_type_name\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf45bdee4c9616a32b5419acaa4242ab7917e4cdaf4e404dcd12248295427b3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lines.iter().rposition(|line|!line.trim().is_empty())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_code_section\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/docs.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b83968f718b0e1da53393a77344eaf84f1b073c572c96756eb13fa1c2da12e6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060map_in_order_largest_first\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/graph_index.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"709895454e9c0cadff6525ae78fae3af5207a16229ee125149fd476a38a53d7a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.else_branch.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060branches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/hir.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2552bf2e7725846585c2de2e3e8502dde96a3e03836b5c6cc6f29c8093f40b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060item_tree.method_item(item)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from_item_tree\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/module_interface.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb771f0a40c3a9f1dc9ba48ebae0e6e5b2e239faee791b2c71580863ebaf11a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.segments.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060last\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/path.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e17fbba432a96250f3fcad9a99d2be465528e0e92077320e26a1c0cb2434610"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060item_tree.method_item(item)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060assemble\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/symbol_tree.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e960cdca0ace6461e7ecb5441beb5e8a280799750d35c0c871d01306934ad70"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060item_tree.method_item(item)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060index_file\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/workspace_index.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4f7f8381a379919cd3c6707227edc24d310a02cda56e80ca7faed2425eacf6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060members.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_type_name\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/ty/doc_types.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbef2ee8d06eae4c203acc3c3e43bca8a48e018ea996f1a86870620f884a362"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ordered_float::NotNan::new(0.0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060lower_literal\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hir-def/src/body/lower/expr.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fd711acc479879faecc2b820b9f8971b514b242844de74fbd2da295c64ff4e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.block_in.get(\u0026block_idx).cloned()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060solve_forward\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/lib.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"db392f17359afdaa35a3334a493eaae02cfe9e1630c4b0206c9e97db8006e117"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.block_in.get(\u0026block_idx).cloned()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060solve_forward\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/lib.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a98580b98657c02c6163ff164ef092b78ab124e9c3cf2736c6a4748eb6da39"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.block_out.get(\u0026block_idx).cloned()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060solve_backward\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/lib.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"652ce5c291ad47534e058bb23cd576ad5bc7ce480b887a78229ea96838c43cf6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.block_out.get(\u0026block_idx).cloned()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060solve_backward\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dataflow/src/lib.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cf022f85c3ed2d4c5a392d745607e67385949a7e4b45e1edaee82855b471ec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(schema)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060strict_object_schema\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/check-contract/src/lib.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd8a445d8dd1ea8e8f6f6d40e5bbb68adb43c3256ff7f5ce95b2d7fe8224eb5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060branch.condition_range\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060walk_preproc_if_statement_hir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cfg/src/builder.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3d0d2b0505faabf907587239764087a05fceebecadf446667456da9f19fa56"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060branch.directive_range\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060walk_preproc_if_statement_hir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cfg/src/builder.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b5bad33f23420377d0381a933e4d8f6cc03fe95b7e4433314b3541a632184d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.graph.node_weight(idx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060vertices\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cfg/src/graph.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53dfe7b2aae2f052027d8c80fdd961cbb3af74f57d4d68f117e6f953e06a4a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{}.{}\u0022,kind_label,facet.name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/display.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d7497caad884226ea400af377e9dabb670c21f474b68dc2b5c26ec4dfa898f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{}.{}\u0022,parent.name,name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/display.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9336ad08961184b274976d72557139956672b6984cb1589a8c6a6a0e495564"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{}.{}\u0022,parent.name,name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/display.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"38593a410efb6053625142e8eecfb44aae7f969dccce1054cc183f74dfbfd842"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{}\u003C{}.{}\u003E\u0022,label,parent.name,name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/display.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"4266d0ac44a55e7bb105befaa9f097a772e1a500de75ddf578514fe823e4ff8e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{}\u003C{}.{}\u003E\u0022,label,parent.name,name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/display.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6d60ce65c9f2cc78cf8599875e55a79c488adaec32e34cdbf6c1ae4674a9cc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{}\u003C{}.{}\u003E\u0022,label,parent.name,name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/display.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa18ede43930e26186a041656f80652a5e5819804236ec8a1f92a332e851ca3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{}.{}\u0022,parent.name,name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/display.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d83675ee577ffad96754d2530af8b25da81aabd16c3652f8e607d44b9a6f82"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022({}, {})\u0022,p,s)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render_number\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/display.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c62ac460e1b2e0ba5920b550bcfac0e5f3b7ec01ac274aaa23853015a90ab8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022({})\u0022,p)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render_number\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/display.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc5057132adb8bb2a46d4bd44ab0688dbd68922b6b1dc4abb06be91b88bb813"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022({})\u0022,len)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060render_string\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/display.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d384bee19028ce5a00f80e66178e61a288a2932e43841c31198863c346941a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.kinds.get(id.raw()as usize)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060lookup_type\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-types/src/testing.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"83579d4ef948f7d65159335fc6c7a37bde9e6c556d3e43a8da27b79c511f8606"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060next\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060batch_ranges\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/embedder.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f57ee40f722d4e453e4ce0964db8a20ec4beec43f20463b73a7f53184ba8e22"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060open_store_fenced\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32ee217cc2a1978ccceeb850f4ba37a609ac2e44247f244e98d30e971ebb2fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060embedding\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060index_directory\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e573a5af1bed9719cf032e9dce9d9d4905f13c9173f922e329a7cb40536c0d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060validated.staging.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_staged_workspace_roots_transition\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":3804}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0b21ec3bfab56fe5091d74b820deedc0df539a16c5a10e2b347e969fe4307c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.workspace_roots.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060remove_workspace_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":4275}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff1055d36df7f0cbe9f0c407eee76d610739de9a296c2db05751d6d7d609c78"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060removal\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060reconcile_workspace_files_fenced\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":4644}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63efa8d31b2cab029cc0281e0602c26e7cb4cf62e7520acf965e0185b5ad8ca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.embedder.as_ref().map(|embedder|(embedder.model_id().to_owned(),embedder.dim()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060refresh_dirty_contexts_fenced\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":5025}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7778c1177f9e96f1dd04c6d5b4cbd3d1142a5deff5f86930b56649a4143433"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060publication.staging.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_staged_workspace_overlay_publication\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/engine.rs"},"region":{"startLine":5846}}}],"partialFingerprints":{"codehealthFindingId/v1":"511be44a96913a40d607894d5bf294cb7891693e7ea4dfe0ce5210327b24298d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060c.total_chunks\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060percent\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/progress.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49a5dcc35d1c75e951bab99755d885e27a4fc89db93e0b89e65ef6eeacb887a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060source[start..].chars().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060next_char_end\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/token_policy.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8defb82f4d8ba5d727da75cff132cc55c1870a717c3bab00497f3b38678902d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060temporary.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060install\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/vector_persist.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6af948483a6aeed6cf90fb6c5e6b7fc42d168f3c8aeaffedc5a69adf9840f2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.entries.get(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060snapshot\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/workspace_overlay.rs"},"region":{"startLine":2428}}}],"partialFingerprints":{"codehealthFindingId/v1":"4950dc2386a3be8af57a7cd1756a419950cd71095f5b165eea1f6ca5a863e714"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060visible_files\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060populate_serving_semantic_with_progress\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/external_baseline/postgres.rs"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"5794d142bb0d4acfa878684675341af983bc135c5493a0e985ef79728ed714f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env::var(\u0022OUT_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/build.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c76ce0a2fa051ca937d9073c33268dc3f2f98154523cd3d9bbd1d5f869aa5c3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env::var(\u0022CARGO_MANIFEST_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/build.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf955d90915b1e817704f0ebb1968c5879eb3dc971e69de7a832ccd7bb044cbe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(out_dir.join(\u0022generated.rs\u0022),code)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/build.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0e8af266ef4a50156446b55b0c5af36e7b3de9a1fc32333978c447396e22db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_to_string(manifest_path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060append_global_catalog\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/build.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5a22a227d3462f9544780800272daae5c24839983c5e25786e7d37860eb2db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::from_str(\u0026source)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060append_global_catalog\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/build.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"519082e018a4b33c4a3ed899901ad50c9dd9bb1aa39e0e3efeba316d52e81994"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060manifest.get(\u0022source\u0022).and_then(|value|value.as_object())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060append_global_catalog\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/build.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c615543b85f99c46236a60130975f153b0f7c11446bae2f8142e81588c9a639d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060source.get(\u0022environment_mask_bits\u0022).and_then(|value|value.as_object())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060append_global_catalog\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/build.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"902cfb8fd050d6822dd01fe6c019a80a105c67645d247cc44b7986faddf1fad3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060source.get(\u0022resources\u0022).and_then(|value|value.as_object())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060append_global_catalog\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/build.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"518399fb672fdfd66a1042606900beb7cfc6c15e6805faa30a449b7fecbfee96"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060manifest.get(\u0022completeness\u0022).and_then(|value|value.as_object())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060append_global_catalog\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/build.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec9cc6162f6c4073df307000a91d426ac0174b1aa4200117c81fe24e7052ad4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060manifest.get(\u0022symbols\u0022).and_then(|value|value.as_array())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060append_global_catalog\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/build.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3227cfe1ce6eec736bd2f408fe4066b712a978bdeed44444bc1922e6dbda591a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060manifest.get(\u0022attestation\u0022).and_then(|value|value.get(\u0022expected_symbol_counts\u0022)).and_then(|value|value.as_object())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060append_global_catalog\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/build.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"038cc09593f1cb519abe689316603d03f317cbb4950beb017c9a0acd8f0a507a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060symbol.get(\u0022environment_mask\u0022).and_then(|value|value.as_u64()).filter(|value|*value\u003C=u8::MAX as u64)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060append_global_catalog\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/build.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"676d9884b26087023bc927658d7580d18100d2cc1b86c532f3011b2227f205f6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060zip.start_file(*name,options)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_zip\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/hbk_writer.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"174e0a579ed04f8982d53aa507bdbb8652a5d768c12dfbb00e8b0cd74932942e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060zip.write_all(content.as_bytes())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_zip\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/hbk_writer.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2c8d5a61e0c9b01c900b5f154ba823a1d231c6fd742e84b00f2a1b2c7f4945"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060zip.finish()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_zip\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/hbk_writer.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a2e3fbe657f27457eed328115f3057a8dc628d8008c44286ecf881e1e7faeb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060catalog_path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_shcntx_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6126fe0b601827142434aecc7bd0340c9a3b5b71b6ab310dd87353deea61dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry_path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_catalog_directory\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f67a162a1f7066c5037ea6baf68948d5421dc764cc8f0f230ba12c2486a7c2f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060catalog_path.file_name()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_global_functions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/lib.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a151db7bd483f44e83d7774a2eb6a5eee4df921ef49e385a07c7e70f92fd219"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Selector::parse(CHAPTER_SELECTOR)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extract_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1baaeba0964861733f46b318016b93650044461dad8d515c007d746919d8d9c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ElementRef::wrap(n)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extract_context\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e5602841085b1026c618a6590fea8a87083b25631fd48a96b1d5a879d2c972"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Selector::parse(CHAPTER_SELECTOR)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extract_return_type\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e5b4fb4659f526e64c5eaa439a722d6c698c6453cdc2d354c2e59258d8a9a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Selector::parse(CHAPTER_SELECTOR)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extract_iter_element_types\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfef717f85898f45bb4fa0db59a6a5d7b2692b37704f8817ca715c720a3bf11"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Selector::parse(\u0022a[href]\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extract_type_from_html_section\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b5f247f2bc1d70ea13074360cf8de3aacae04f9a6f5b7d66e4591d28722a8c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Selector::parse(RUBRIC_SELECTOR)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extract_parameters\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b39b69f6483b1716489984e7a07cad0ddbe8aeb639e68876556d3c2e95eaf2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Selector::parse(\u0022p.V8SH_chapter, div.V8SH_rubric\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extract_parameter_variants\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"3431511950f1216bc7a664e9d6cdc06a62a6f26770663ac3437831606a232646"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Selector::parse(CHAPTER_SELECTOR)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extract_chapter_content\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d06b979bd4f36d51ab1aa1d98e912115567c0cb849ff390124787bd2cbd5a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Selector::parse(CHAPTER_SELECTOR)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extract_parameter_descriptions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5eb141e3e3097c77903f65952994c1800d0543c54d5e0c82567cbb6aeca455d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Selector::parse(CHAPTER_SELECTOR)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extract_examples\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc8898d8d196d6d9fb8051c1cc5f3f4bbf1e03c9856da328381e49e1d76f14c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Selector::parse(\u0022pre\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extract_examples\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c3a364a969bae0eab1545ff65534618e12213cc63f1042d5fedbc32272073c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Selector::parse(CHAPTER_SELECTOR)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060extract_see_also\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5f06ccc5820dbf6be42230ad07fecf29e0eae07201884ff92a0cf4c828f00e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PLATFORM_DATA_SINGLETON.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060install\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/db.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db8106fcd43f858113000a95faebac2fcb1668927b9b1422eb803c8f531bf27"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.as_object_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from_corpus_json_with_overlays\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/src/snapshot.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bed776fead673b1d8a2154880ebbe322fc780499327c4cf8d4519a916c5738"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.uuid\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/defined_type.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"60012cbdf791d73c01ef79629ba998c368349b7aec7c02651c0759af6a925987"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.name\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/defined_type.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8e1e902c820bae982d82c815b8bc272beedf070cb22f5e15a54f174fe6a5ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.underlying_type\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/defined_type.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a30659f18c979f38e16aa5c64a57c8701943fc422d838593edee46602d4de35"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060common_modules.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23009d87e5eb8ac0f751965d6ebea7aee55cc9cce50c79b09bd22892009cd57"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060catalogs.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f0dd9b38e324f161c925ee1243fbffe5fd4ab412a52a46546d95f11b9b4ab9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060documents.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1dd94a75a28d708de51767275378c96eab24859882d6708bfd78dde0293a661"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060info_registers.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cbde3b704fb3454456904e17a600ec4a62b4f868c75f6359bc12d1bef92651"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060accum_registers.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"550258e83408a6b68885dad61e1aff41857d12cbb102b319d9ff16846e8b5229"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060account_registers.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"795edb0ea32c79d230a608ebed39e9d583caee893ea2ae53b2816eb1dd5f46d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060calc_registers.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdfbf5e99c018a2738552e7729d0bb20f0c39263dd8d0b74b25425d3d51735a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060event_subscriptions.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f761fb9a9a5ba8897d698caf40f9447602c58ff4b5db0a494073eddfc73c9b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060scheduled_jobs.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ca3d843d763a38a35304b4b2f7872baf4c2f0966c726c591dd695f8bb2b761"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060roles.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d44b2c8ca26cfadc9fc4f15a3645f4606cf7b7f9b0377ed58833579384c65e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060defined_types.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dd91bbfb1640caf50f10900df4f6b1e99b40518463f5f349315ec1bf01a994"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060charts_char_types.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06bfbee11c482d842e18f551396476ae2b7051471365daa7a69582417547a05"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060constants.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e438f0b3138898e7530874a7afc29d55e8c8f77e691d82b38282af880ba227"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060exchange_plans.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"5720b979305a3214f0b7b2807d8f38bed2e33d615f73e762d002f6e1a784fbfd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060business_processes.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d5f534882a79e1fefd4c7441efba9cb01b201f3f5c5681af5ece518e5f5e6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060enums.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fc4d0fd1ec38f8fb6e1dbd25de9ccecf7d7c4a5899ddfef0f159c68dec39c3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tasks.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"205da66e8d44603a6bea5c0b44e7386830bc6a005cad55b9ee79773ed8c505f6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060charts_accounts.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"78388e4896e00b34b0f0184072629344c95ec7cacfa5fe0bf95e59b5a3830113"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060charts_calc_types.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1759c9448c93c5926d43e8d340be9ef44f16618234f2a10d31ebd38332474eb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060external_data_sources.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a133d135e1c690840a6cb1ac428c5cdbb438ab3d667c60dda2a9df1a33388372"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060http_services.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c26b0bf88b25b94404c70d77be9c346c1557cd1c8e44a89235e54968a4be7de"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060web_services.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f75dbb4eda3c905001d7aa479b40eec53d2039b586920c45a54f5ee0a012556"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060integration_services.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c0e274aa55a79713fd728957af81feaebb093080f72303299796439240f36c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data_processors.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"122d30d0bd0d59c5754ec24eaedc4bc2d55d2cddb36dd3cfcae3daf32f4b1551"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060reports.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"0261d47f396179e0bf63c5686abb41c22e6d36fdf31c2c4f06356a42ced7a591"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060subsystems.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"594ba16d06706be9f579d2641d6dd26c8dad0e3297ef55fa87cd841278e4142b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060common_attributes.into_inner()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060load_all_metadata_parallel\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"4085c71a762151f68512e9a349d4c4bdd68390ed3a9e7bfb20af24ec24489df5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060types.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060owner_attr_type\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/standard_attributes.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"6361df1c2702730953ec8ee78710c8e59c8048aae87c29d97970139ce8b41571"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060all_types.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_type_xml\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/xml_parser/type_parser.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f50db521926ceec543a376cbd507c7ae02026fc31180459cfe1d6d71dabbb8e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060res.compile()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-launcher/build.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e720f93ac05854d0afb7467b5a129f017eab74c462e4440d231913dc1033fd8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060config.repo.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060create_provider\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-launcher/src/provider.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de895bca54159f4ac246f43eef925aadac8af4b009c41afea2fb57c5ef91a1e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060config.url.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060create_provider\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-launcher/src/provider.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c07cc7662dfbcab45af3607ee3ed5110e7f87ebd4bb7287249b7c695a8b30d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060config.product.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060create_provider\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-launcher/src/provider.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"039714e43f68ba1abfb012dd8d52541c6c19b70bbca4b719d89ceec484196afe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060config.public_key.as_deref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060create_provider\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-launcher/src/provider.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ec3b3b8f1253c3c0d700482793c18c821288d0bf6dc2de26bf1a48131cd50f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Client::builder().user_agent(\u00221CV8\u0022).timeout(REQUEST_TIMEOUT).build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/client.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"560be04cda842b6bea2c28b9a81df5ca2333f3cff1936ba84cacdc8682c3f505"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writer.write_event(Event::Start(root))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdb4dbb0a8759a87e97237c60fe20550855e0431837a64bf04a05a947300252"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.writer.write_event(Event::Start(BytesStart::new(name)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"13aaf389fa6c6de62aa0f49b2c4b9a6b0a8f06045f3917d53a6fac32fe012f0d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.writer.write_event(Event::Start(el))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060start_ns\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b0bef833874719b98bfa6ea2781983d46fc6321d0bff7166e69a8832c4486c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.writer.write_event(Event::Start(el))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060start_with_child_ns\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7b0b116f7e662407cfff58eff4bc4df04ddd905f08aa3033658bf0a78112d1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.writer.write_event(Event::Start(BytesStart::new(\u0026qname)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060start_prefixed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6024493f9e4f1711240c1955f8083e4c3caf4e83e805dc03628ca5f448b2af0e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.writer.write_event(Event::End(BytesEnd::new(\u0026qname)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060end_prefixed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb66641d6f5befec865614327eec44683436956327d2242121af682f9da0e48"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.writer.write_event(Event::End(BytesEnd::new(name)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060end\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc8d4a08ddb356ab82cfb6732481356999ebbd353626f7b4d51c8f4d6301f3a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.writer.write_event(Event::Start(el))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_target_id_light\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"446c087acf8bcddeeb262241062a5ebb2d1bc28a6f98c427392923664c55c925"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.writer.write_event(Event::End(BytesEnd::new(\u0022request\u0022)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf496a8afea0084857dd6d19d6b9b12a6d70dce80bfe66ef700ae3467bd9679c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writer.write_event(Event::Start(BytesStart::new(name)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_text_element\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a89891e148c136d88cc8ade0620d69c3414f7919555f402202dfd1aaa6fac23"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writer.write_event(Event::Text(BytesText::new(value)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_text_element\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad191cdb39be27a8bd30b8f0bad0661cbac78732ee7d290531f3f3f804706f4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writer.write_event(Event::End(BytesEnd::new(name)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_text_element\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a009b58df6e72e29f4e5b1fdcf341758c99634db5ede1ca6fd8b3c68cce830"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writer.write_event(Event::Start(el))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_text_element_ns\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e4d1f0b6ae8a70fa7f75d3b975568c0576c86245857c37fe5fd4b52328985e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writer.write_event(Event::Text(BytesText::new(value)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_text_element_ns\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"57834dfed93c24561ab17dcd57b8021aff25acce8a9c2802d120d7887e19a59e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writer.write_event(Event::End(BytesEnd::new(name)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_text_element_ns\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac054088c7c9c5396f2066d6290ae955f507e4c5304a69b2b210dca17663845c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.writer.write_event(Event::Start(el))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_set_breakpoints_request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-debug/src/types/xml.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9adf3e44e02ef73a16e82f4988e5ab98b04245ac53fce84dc15fd1108342ef9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(\u0026path,format!(\u0022#!/bin/sh\\n{body}\\n\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060script\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/compiler.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1de8f335a735ff41db58023eae275b69af3324336d2a8614aa24cb3a31a857"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::set_permissions(\u0026path,std::fs::Permissions::from_mode(0o700))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060script\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/compiler.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"be15e90e81178ef29791c21dbe37ab0c6497147e9d38ed957a839e7d2fbef8bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(\u0026path,format!(\u0022#!/usr/bin/python3\\n{body}\\n\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060python_script\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/compiler.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fcb72b8c2f17ddff84a3437e19d7ac0b4b79d94968ace8d24b0fe3e142548e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::set_permissions(\u0026path,std::fs::Permissions::from_mode(0o700))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060python_script\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/compiler.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b8170a264fe4bf16d6215fcd7f0a5780d671b6c8453c8cd7738af5dee91cc7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tempfile::Builder::new().prefix(\u0022x\u0022).tempdir()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060short_test_root\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/compiler.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf943a6088ef2bfb3fe3e42973eca615b0e25fc2cc2916a4695db928d47cf7e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060directory.canonicalize()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060process_listed_in\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/compiler.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c79ca4f6a334ca159baec4ff5c2acb441d811a95891487d876ac04c4f3133e3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_dir(\u0022/proc\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060process_listed_in\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/compiler.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9c3fd1f905dbcea9e63b8e970d434877726f9642e414f56a130be850ce7ba3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var_os(\u0022SystemRoot\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060echoed_arguments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/compiler.rs"},"region":{"startLine":1937}}}],"partialFingerprints":{"codehealthFindingId/v1":"5388b40c8cce3bea62c5d1ec8a2dc06dec07abc67cd665ed0dd9d39ee46ae6fe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060append_designer_args(\u0026mut command,args)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060echoed_arguments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/compiler.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f43acd7dd78be8e1cf2fa6850296809933d76795c3496239fe4d196cbf7a7b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060echoed_arguments\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/compiler.rs"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"439a8ac85f6ff1d0dbf5f7fd519b3f893dfe7009754837667e8c453faae52641"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060local_action_args(\u0026ib,LocalAction::LoadConfig(\u0026applied_cf))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_native_check\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"d028de143d9241ccf7c991c3ee3d3f7d58791534b0a4662517a4246f97b2d017"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060local_action_args(\u0026ib,LocalAction::UpdateDatabase)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_native_check\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"325abdc9e118342c98c1017de48a08cf4154070504eb07a9176ac5c7cd7934cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060local_action_args(\u0026ib,LocalAction::CheckExtensionApplicability)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_native_check\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca128f42929bc772b885eb8554aede220ac4f11e3d633e37af76326da65b9b15"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060local_action_args(\u0026ib,LocalAction::DumpConfigToFiles(\u0026xml))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_native_check\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f342e902532f8fe2066cc214e56cd957a35b353d4a6de929fb05d19ea6c2dd5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060local_action_args(\u0026ib,LocalAction::LoadConfigFromFiles(\u0026xml))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_native_check\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"556efca72cbe0fe87703472b51219510e60bed41f2209b2716c09550540f7144"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060local_action_args(\u0026ib,LocalAction::DumpModuleFiles(\u0026modules))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_native_check\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e102cd50b3d22e547c86772c794f6e90ff2b96b7cc34cfd6e6f14dcc028e60"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060local_action_args(\u0026ib,baseline_action)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_native_check\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"077d51fc7a40dc6fcaf0bd01a9fe194b4d7d12a7612f10b4423c91c6b75d099d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060local_action_args(\u0026ib,load_action)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_native_check\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f588a27224b49d8911d68eec0b0ef5d1c3a64177f66e3f403e97f964848635"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060local_action_args(\u0026ib,check_action)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_native_check\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f04277216775e355e8e4ffa5621d98e4375201d7eed17e0bcb44c26476c9dd4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060local_action_args(\u0026ib,load_action)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_native_check\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"4024f56eff2fda5837e80cacbd9e8db7134140dbb0e8d9068acbd469b58a3edd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060local_action_args(\u0026ib,check_action)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_native_check\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40766b6b523a7bf92c26b131a921d7662d83e1598a2cc0f4326de09df0796cc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060record.get(key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060parse_ibcmd_extension_record\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/profile.rs"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"359136327b0ece74eb075aa10fa8b9aaa97e7ec0ef30066717f37b53afd4a8f6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060matches.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve_flat_module_export\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56bb7753d93b614d6d9c874810b9746f50efcfd975ad6405fb45474b1d3321e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060versions.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060linux_elf_build_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-check-executor/src/native_check/source.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9b5bfc5a0c08714bae83d6af8b5edaab56b56579b2b11d0fd394b466ad41f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060res.compile()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/build.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"37eca01efb11f4e9bc00ca590b297bd697a0c15f2892dfeac83edb75868395f6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\u0022OUT_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/build.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbcf84252b3e9c5dc73e8c9ee8ae3d158738ef765c9f2d0bd84f8971d04ff2d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::File::create(\u0026zip_path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/build.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d127aae5d76dcca3073f96aa99dee1eab4cc48def3f076fa1999ffd505de8cb0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.strip_prefix(extension_dir)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/build.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a541ab7197a0a5f8ffe008db87e88c00acce5daafc645f0fbb5291eeaee56899"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060zip.start_file(\u0026rel_str,options)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/build.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48557929cbc82d0bc733b2ee98a6fbaf9fdd7338ed7690237c8eac2da215f86"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read(path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/build.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"49432b0120acdc804a7d451c9e96aecc96ed842403dc2f08fe4492eb41648eaf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060zip.write_all(\u0026content)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/build.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a9b7cf1eb81610f5af28c1a457fb09753095f3f4f7db24d6668d9dab2e7e7c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060zip.finish()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/build.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"474c38f1501549f51579942771cab8e9acf4603a1c61d8e8cbe8bdd433f1d378"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022bsl-shared-workspace-events\u0022.to_owned()).spawn(move||{while!bridge_stop.load(Ordering::Acquire){match updates.recv_timeout(std::time::Duration::from_millis(100)){Ok(generation)=\u003E{if generation_pending.swap(true,Ordering::AcqRel){continue;}if task_sender.send(Task::SharedWorkspaceChanged{generation}).is_err(){break;}}Err(std::sync::mpsc::RecvTimeoutError::Timeout)=\u003E{}Err(std::sync::mpsc::RecvTimeoutError::Disconnected)=\u003Ebreak,}}})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new_shared\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/global_state.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d96ce2fd76f2cc7eda996cf6d145dba773429dc01f1fc07ffa9af91d8fafea4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.request_lifecycles.get_mut(\u0026key.id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060queue_latency_retry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9a35a040f29c8a592628b0abeeedbeebead9b3f8c89fde6cafb50b60280fe2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060request\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060admit_pending_latency_retries\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"043b5ba6b660fbe51112d2fd8fed0f73f5e3c78d6f914318a32cabf14588c0ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.workspace_batch_plan.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060advance_workspace_batch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"2614691eb819e81ff06baf94f18969c2935e635445c5d5aa9344addb32ff6045"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.workspace_batch_plan.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060advance_workspace_batch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06d093b452096164d24316bb26a0ddc73579c321f92b32f1ee4dda76d6ecb43"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.workspace_batch_plan.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060advance_workspace_batch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb37bc800acd9291eee7e20ed47ed18dd79243ab9e46bd73a4c3ef147f536b74"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.workspace_batch_plan.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060skip_workspace_batch_chunk\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/server.rs"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f778493808d78d18284f406c19b11bc7b6522ec61ddb6dd1d85b40feb3002ce5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(format!(\u0022bsl-task-pool-{worker_idx}\u0022)).spawn(move||worker_loop(job_rx))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new_with_workers\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/task_pool.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb02864bc9fd745c5484983a2d68e5c91876117cb2e4f77a45f79370a60841ef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(self.string,\u0022{} = {:?} \u0022,field.name(),value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060record_debug\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/tracing/hprof.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5e736fe1e967fc111233e9322e0da24a6dd6098664a0a0ba85189d798df108"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.span(id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060on_new_span\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/tracing/hprof.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"414d4ab9f32f27685eed3bf7d007e0549f80527a6f7ceceaaedaa52eecb450f7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.span(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060on_close\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/tracing/hprof.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d38d6c0f3ff74a9912c022c2b23ff0d7742ac5ae70f9f0743e23f077672badd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060span.extensions_mut().remove::\u003CData\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060on_close\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/tracing/hprof.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1d152dfa0a189b8b0f5c0301df06595f7888ba25f1774ab116dc5985de2f34"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parent_span.extensions_mut().get_mut::\u003CData\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060on_close\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/tracing/hprof.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8e8f461dfc9835617b58a66eacf3d34694e176d9dfd9904dc78811f2031ab7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spec[idx\u002B1..].parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from_spec\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/tracing/hprof.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7eab266179c0be2ed7acd4e0ece75782960aa36932f92ed96525ab42c1237e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spec[idx\u002B1..].parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from_spec\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/tracing/hprof.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dabf4ccb97018777f0e736c6a1b709a54deadbe8372895dc0f7629507b233a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.span(id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060on_new_span\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/tracing/json.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6eef1b80c88f95889621229a7f7c530abd9ad149974268e92bccbf1aa02892c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.span(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060on_close\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/tracing/json.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"77724c158741887ca1cb79c6384244fe5f83df3001b54e74ce858878fab3f1e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026data)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060on_close\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/tracing/json.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c40e771ede3f27dc2ec62b961e8e3c9c2854b46488263588098f3bedc06bb7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.writer.make_writer().write_all(out.as_bytes())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060on_close\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/tracing/json.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0341c32cfb787092ce31d10cae3f621cf7a7e837d15c21b6618b0d2dd9c3001"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060root[\u0022mcp_servers\u0022].as_table_like_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060upsert_codex_project_server\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/mcp_install/adapters.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"817b346cf4beae47f7ef55dd88ebbd1f72f429588b6d76811ce500e38e5aed58"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.global_state.request_lifecycles.get_mut(\u0026key.id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060on_latency_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b41869021a33a6ec217696893563c8a0f578e281213a98b96c78d9989fa801"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.req.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_request\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b046f579a0561b140c485610b344620ae2ca140f91e37248b75e4669c4bf8c4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.not.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060on_sync_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/dispatch.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"28cccd9b32055d1005e2b0787f2ac1c24d6a98c86615e9e84ad39a7ef92a6587"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.target_files.get(\u0026file_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060target_file\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/request.rs"},"region":{"startLine":2178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ddcaa6c07a0488bfddcf64eaec2cbd2122ccf33597f8ae822751ac6509f78c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.workspace_batch_plan.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_next_chunk\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/workspace_batch.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d5416a58b9bee42861201c25b0c508adacacac13ae2eee84683f9eb0d7dd2b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.workspace_batch_plan.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dispatch_next_chunk\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/handlers/workspace_batch.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba4bd5edb308141657b4132bf30c0731040c7242aa3410091f0a9c32439a4ac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ProgressStyle::default_bar().template(\u0022[{elapsed_precise}] [{bar:40.cyan/blue}] {pos}/{len} ({percent}%) {msg}\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060analyze_salsa\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"f765364e8681abf73ab3b1fb344e38f2c36f4bb80c30d83fa08fdb521104e47d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060loaded_baseline.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060analyze_salsa\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/analyze.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecaf1408a7df257740206c271eb7e1cb83d1c1fc52c341bb2e69cbeecd97d92"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ProgressStyle::default_bar().template(\u0022[{elapsed_precise}] [{bar:40.cyan/blue}] {pos}/{len} ({percent}%) {msg}\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run_deps\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/deps.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec49f091906b39c83e01f7f4aa3d75531968eec07ef6dbaff9348b587f28c651"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060plan.partitions.iter().find(|partition|partition.id==selected)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply_partitioned\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"91517226a0d1dca03aa6f925bf5c25484d7e586b34c4f16fed9ac4b5e2ea058e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buckets.remove(\u0026selected)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_partitioned\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d99a14efba4920a3bd2a05e173940a6541bf5748905ad2d36f3e4a09fa529c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writers.get_mut(owner)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_partitioned\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f19f1331dd7d389a256d2863ff2fe23a5731eea95e68cdd414f0fddd553234"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buckets.get_mut(owner)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_partitioned\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7aa7ae594b40a56b61ffc9de602cf0b97c3816f38ecf6859ab0e932ac107e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buckets.remove(\u0026partition.id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_partitioned\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f04ebf242a947b7d8e4f065c64d20400d1cfdbe892ebc53a6096e65d4a9cef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060snapshot.manifest.partitions.iter().find(|entry|entry.partition_id==partition.id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060apply_partitioned\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc24a5198b64670e03d60297884e690cce7bea5f8d0f7bb32d54ec56a7f016e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060manifest.partitions.iter().find(|entry|entry.partition_id==partition.id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060validate_set_for_repair\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02eabc22cc8c74b48fc4eba93ea4b237cdf1f7e55d80eb05b99ddb59bfdb773"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buckets.get_mut(\u0026item.diagnostic)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060current_entries_by_partition\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"047086ca9b4724aa38cbfac3b4ccd86663711cd43cd71fca264710879bd46ddd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060summaries.iter().find(|summary|summary.id==selected)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060selected_counts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/diagnostics_baseline.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"42dbccef557e28dbcff066c42887fcf2a4538bf2ae0cde7ae27727cbc070646b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060http_options\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_mcp_serve\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/mcp.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1a7c0033a28114716b72437fc154e8d7d810369be54c54ea8d38e1b195bfc5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060embedder.token_policy()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_workspace_code\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/search_baseline/documents.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"552b8477be4309eb3ac37e77948b1e58691d5103fc4be15108cef71856adfb18"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026safe)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060safe_config_fingerprint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/mcp/shared.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1b8db5596caf51866cb2531361efbc7e410cc353872e376abcc6362c9cb92c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060format!(\u0022{TARGET}=info\u0022).parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060filter\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/logging/journal.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"03097a721065968461c844e1f17483952b084d409e58ab050c968168e0f16007"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pending.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060worker_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-analyzer/src/bin/cli/logging/journal.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c1b2194923a262081e53e94ae97cd1255d583a15a71d60b005edeca297cec3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060child_names\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-conventions/src/tree.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6047d64194b65ed0aefd8c86bf8b92db6f02b406dee3c1af1eafc9b35248a479"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060entries\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-conventions/src/tree.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a354e35bf6b59ed42e8e497dcc0d1dbd2bcda1aa890e466ee45a396cc586ec6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_enums_parallel\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb38a5551264205450b360c5400eccbab933b782ceedf1ba73293a9caa5a465"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_constants_parallel\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d023f42e884450985df0c56cb975f1aea9571ba468a2aa724b38de7e6eac4c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_registers_parallel\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"0896cee1e77e12dd65b144e12d79d12654c839461ad7c152ffd8d11299a753ce"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_event_subscriptions_parallel\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05fa50d8e2933e75b064915ab3b7707d66351c6a2981bb1a240e317ae4323e0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_scheduled_jobs_parallel\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"68596570f93f51ba8e0814f30d02d1133cfd2df85c0f1d670d2ad86f8838483e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_roles_parallel\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0382ce9b1cdec742e421762375e434ff93d26d4669df96d3713f0594242ea8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_defined_types_parallel\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5688245e2a78aceb7605278740fc855b34ec41427095dba1031e893db0438bf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_http_services_parallel\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"df90063038ef335241c99ff53873217181944e362791500f7df868c2432915e9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_web_services_parallel\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53111e1263bec892256e72d9d60cdd0e44f8af1cf20a9b8cac79ffbc4082406"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_integration_services_parallel\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"0565f7bade2c462cad14d1c104fc41f195d7d129e7729665f161796cb85e04a2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_simple_metadata_objects_parallel\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-metadata/src/loader.rs"},"region":{"startLine":1658}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46ef7a9a78be8e8e54e94782b72c5d0559464d04a05162ad62e2bba959a90f1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060column_names\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-search/src/store.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a65aeab250ff9076dc5d5b39e3f32360e3d971f47f2713b84908df4959f7a1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060backlog\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/state/overlay_backlog.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bde1c4077415e9186627170e123de0906ec2871ba40cd934fdf1779bfb0697"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060on_disk_identity\u0060 turns every \u0060Err\u0060 into \u0060Ok(Some(OnDiskIdentity::default()))\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph/snapshot.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"1849d3e89598e568e812b9f8667f52e410f8c2ab950907dd07b73e4b10c7f68d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060stored_fingerprints_in\u0060 turns every \u0060Err\u0060 into \u0060std::collections::HashMap::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"640265393dd161642c4fc875f9cc29432c12dd374008d556d01974f68798394c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_stored_observations_in\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef9c321e6e7ff2259051af5fbf56c7ad1c9f61839f6adc2e7576befdd7ad2a2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060thread_state_summary\u0060 turns every \u0060Err\u0060 into \u0060\u0022unavailable\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/graph_db.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"794d4ab556b8b8c97d2caed291c521e61eaa58aaaa3f1c0baf4df0d2e2e7a193"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060generation\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform-help/src/package.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce2bedba6a59332a1e2abc60d96bd2b8e7ae1ea5ecd17923be4de65c93411d6"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022HTTPService.HTTP\u0421\u0435\u0440\u0432\u0438\u04411\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022HTTPService.HTTP\u0421\u0435\u0440\u0432\u0438\u04411\u0022)\u0060 also satisfies \u0060text.contains(\u0022HTTP\u0421\u0435\u0440\u0432\u0438\u04411\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":2339}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b07e4c462d72374a7737efa7cf44ad6437eefb85752d28ebfae46d238ef1a6"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022WebService.Web\u0421\u0435\u0440\u0432\u0438\u04411\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022WebService.Web\u0421\u0435\u0440\u0432\u0438\u04411\u0022)\u0060 also satisfies \u0060text.contains(\u0022Web\u0421\u0435\u0440\u0432\u0438\u04411\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mcp-server/src/tools/metadata.rs"},"region":{"startLine":2355}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9289fd1a7bb3992aa01386b30b4ed8caecca449350e3d88c62e0a17c9ea029c"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060trimmed.starts_with(\u0022\u041F\u0440\u0438\u043C\u0435\u0440\u044B\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060trimmed.starts_with(\u0022\u041F\u0440\u0438\u043C\u0435\u0440\u044B\u0022)\u0060 also satisfies \u0060trimmed.starts_with(\u0022\u041F\u0440\u0438\u043C\u0435\u0440\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bsl-platform/tools/html-parser/src/scraper_parser.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5694abafe4f1888b3daeef3805e53a2075f8f120221d436a70d3a5f27851a8"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":87,"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."]}]}