{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXA1","name":"Runtime unauthenticated reachability","shortDescription":{"text":"Runtime unauthenticated reachability"},"helpUri":"https://codehealth.canine.dev/dimensions/AXA1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"AXH1","name":"Runtime security headers","shortDescription":{"text":"Runtime security headers"},"helpUri":"https://codehealth.canine.dev/dimensions/AXH1"},{"id":"AXI1","name":"Runtime container hardening","shortDescription":{"text":"Runtime container hardening"},"helpUri":"https://codehealth.canine.dev/dimensions/AXI1"},{"id":"AXR1","name":"Runtime accessibility (rendered)","shortDescription":{"text":"Runtime accessibility (rendered)"},"helpUri":"https://codehealth.canine.dev/dimensions/AXR1"},{"id":"AXS1","name":"Runtime exposed surface","shortDescription":{"text":"Runtime exposed surface"},"helpUri":"https://codehealth.canine.dev/dimensions/AXS1"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"DM1","name":"Aggregate boundaries","shortDescription":{"text":"Aggregate boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/DM1"},{"id":"DM2","name":"Strongly-typed ids","shortDescription":{"text":"Strongly-typed ids"},"helpUri":"https://codehealth.canine.dev/dimensions/DM2"},{"id":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"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":"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":"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":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"rig_tui::input::act (cyclomatic 50): rig_tui::input::act has cyclomatic complexity 50 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/input.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e32645c725a66e18926a495fa2317a33b0a8a6743614fd0e95ce6e82125788"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamingTurnSource::run_model_turn (cyclomatic 48): StreamingTurnSource::run_model_turn 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/rig-agent/src/agent/engine.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"3146dd3c4eac496843d9890824f79b5bb21fb3e7fe2605acadbba26b41d582f8"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_claude_cloak::transport::body (cyclomatic 44): rig_claude_cloak::transport::body 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":"plugins/rig-claude-cloak/src/transport.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b964954fdb1c199578f3c8c77ae26cf6b9ab1b5643983c283bfdf925a7081d"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_cli::run::run_agent (cyclomatic 41): rig_cli::run::run_agent 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/rig-cli/src/run.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f9490a4e9c737d4db787f49facbd35089d464df52c0f7b46f25d6077a93ad2"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::providers::openai::responses_api::input (cyclomatic 41): rig_core::providers::openai::responses_api::input 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/rig-core/src/providers/openai/responses_api/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9902f7afcbe5efb4c86d2fe51d914c68b75ac802eb6334bd942ad9da59b37d9"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::verify::execute::internal (cyclomatic 40): xtask::verify::execute::internal has cyclomatic complexity 40 (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":"xtask/src/verify/execute.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0aad30237eba626a92ab9aff250b180d5b06f10f32b481adc38735de81f48ef"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_agent::agent::engine::drive_agent (cyclomatic 39): rig_agent::agent::engine::drive_agent 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/rig-agent/src/agent/engine.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bd417caa57bf4cec84caae54f93cdd31163a0c18ee22ce9d737dcee186379a"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_claude_cloak::schema::upgrade (cyclomatic 39): rig_claude_cloak::schema::upgrade 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":"plugins/rig-claude-cloak/src/schema.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"48645eb8c7fd72f0ab6dcb97fbfe7d55864a50c82b60028f66084b42bbb0b292"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_claude_cloak::transport::prompt_caching (cyclomatic 39): rig_claude_cloak::transport::prompt_caching 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":"plugins/rig-claude-cloak/src/transport.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7709d522e06f7eeba27adfbd080a860856c77f1fd9255c74ab13682781e312"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::driver_adoption::mask_literals_and_comments (cyclomatic 37): xtask::driver_adoption::mask_literals_and_comments has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/driver_adoption.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"518f52f6f1a655754983103bd351fb815e7842ca06e4b3753b0b91927a542aa6"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_cassette::scrub::capture_format (cyclomatic 36): rig_cassette::scrub::capture_format has cyclomatic complexity 36 (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/rig-cassette/src/scrub.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fecaa3bdf0639e839d5f66b53f9818d5bc51ada73c8dc5c27a2a12fddef7806"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_fh::editor_front::receive (cyclomatic 32): corpus_fh::editor_front::receive 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":"corpus/fh/src/editor_front.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8633f29cb0ac05d873d8efe9a4b930017a3d3fa34fe0b9ac46eff2b0d198ab2"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::completion::history::user (cyclomatic 32): rig_core::completion::history::user 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/rig-core/src/completion/history.rs"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"add7e3af6f171900d6cbbc6f4e0360940326eb7878094f019c6068c12b17c043"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::providers::anthropic::completion::strict_schema (cyclomatic 32): rig_core::providers::anthropic::completion::strict_schema 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/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d4dc3288aea2298abf2c58e5f27676be3e9249ca9b4ea4ba3e75619b2cb510"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::driver_adoption::macro_body (cyclomatic 31): xtask::driver_adoption::macro_body 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":"xtask/src/driver_adoption.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed57d3e576ceef35301dead7f9b2d27256d0e27e3cf30651b88ed80f8b2e1159"}},{"ruleId":"D1","level":"warning","message":{"text":"Markdown::start (cyclomatic 30): Markdown::start has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/web_fetch/markdown.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"51821504c1fbc53f06040c8290d564a0baebd70d252c935d9a58f9c48237d1b6"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_agent::agent::engine::drive_tool_calls (cyclomatic 30): rig_agent::agent::engine::drive_tool_calls 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/rig-agent/src/agent/engine.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d52a83b8b595835e9e9f9c88983f685d872937042109b487b3dfb59cd8fc63"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_sn::vim_input::editor::parse (cyclomatic 29): corpus_sn::vim_input::editor::parse has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/vim_input/editor.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"5243a32092c063c59564b6b6fd6d43c8730af8653a13639cc2fa9238694819a8"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentRun::next_step (cyclomatic 29): AgentRun::next_step 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/rig-agent/src/run/mod.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"79232272ecf4b61b534755c6b0a1c38046e28e07461cb7a5ca75ef56aa56584b"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_candle::protocol::render_qwen_message (cyclomatic 29): rig_candle::protocol::render_qwen_message 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/rig-candle/src/protocol.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc00d82b859c21c00a39ac36b43657a11c0c659a8986635f58c3b8c307bdfce"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::completion::history::assistant (cyclomatic 29): rig_core::completion::history::assistant 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/rig-core/src/completion/history.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a6ab6d5ee6a0c85930bc0684c2d9e12d160798b6220ca5f8a4453aca1a44a9"}},{"ruleId":"D1","level":"warning","message":{"text":"QdrantFilter::interpret (cyclomatic 29): QdrantFilter::interpret has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 3 of the 29 points are its own statements and the rest belongs to 3 function items inside it that branch (to_condition, to_filter, to_match). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-qdrant/src/filter.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f02cf61fe74e4577a81e25dfcd8c72beec0ca92aa914fb62eb6600bc44fa23"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_tui::render::lay_out_transcript (cyclomatic 29): rig_tui::render::lay_out_transcript 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":"plugins/rig-tui/src/render.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e67d7abccc7be1cc9dbde238c59ada93ed66ded16727137b21bf5add458ad06"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_ct::git_guardrails::shell::lex (cyclomatic 28): corpus_ct::git_guardrails::shell::lex 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":"corpus/ct/src/git_guardrails/shell.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ce015c9488f95919cfcb15ca8a1da627bfdadbebd5c4ce8dbe4f294082ba40"}},{"ruleId":"D1","level":"warning","message":{"text":"Screen::csi (cyclomatic 28): Screen::csi 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":"corpus/sn/src/terminal_sessions/screen.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad84f5a46a815ce43ca47a2b8ed86b66d5aab6dc782f74afb089bfaf07d048f"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_cassette::traffic::line::line (cyclomatic 28): rig_cassette::traffic::line::line has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/traffic/line.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"65dd829d5bd71591949fb3668409281d0b74ab72d4e25cf995d8168a97aac4c1"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::providers::internal::schema::sanitize_schema (cyclomatic 28): rig_core::providers::internal::schema::sanitize_schema 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/rig-core/src/providers/internal/schema.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"095a27499a099ea7f0e886d2d4fde2fbe2eba28dd8fc38133fa0fe76907a9c6e"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_basics::compaction::compact_near_the_window (cyclomatic 28): rig_basics::compaction::compact_near_the_window 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":"plugins/rig-basics/src/compaction.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00c7461afe339c482bd3fbb4d2b2e90bae7962d1c93295a8f0ebd1ca286bc33"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_basics::print::drive (cyclomatic 28): rig_basics::print::drive 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":"plugins/rig-basics/src/print.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"650b67b0e6503c890385a62190fac8e7794495456df80c4d95913149cad5e50a"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_claude_cloak::schema::normalize (cyclomatic 28): rig_claude_cloak::schema::normalize 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":"plugins/rig-claude-cloak/src/schema.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45364fcce3b9a80ca03e7ad6c809c11b43001c2d1702bd3c07295177b86f73a"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_acp::translate::replay (cyclomatic 27): rig_acp::translate::replay has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-acp/src/translate.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f82cefceaebfb7798657c0fb1bf883fcee858851fd1abb4453090bb3d7034b1"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_tui::transcript::message_lines (cyclomatic 27): rig_tui::transcript::message_lines 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":"plugins/rig-tui/src/transcript.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c2b2216c600b80539dcf89c8f4066bbb2a7e7f553e062cd4065f7a6fde4a2c"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::cassette::scan::scan (cyclomatic 27): xtask::cassette::scan::scan 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":"xtask/src/cassette/scan.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"453f38b3dce43cfe3f620dc6ce6750d7dccf6a887b355b5f7636517fde7ee33d"}},{"ruleId":"D1","level":"warning","message":{"text":"Scrubber::scrub_json_in (cyclomatic 26): Scrubber::scrub_json_in 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/rig-cassette/src/scrub.rs"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"483c3ba58eadc8c3ff1b414140d808d07ac41f33d480ec98ece778129413da86"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::providers::deepseek::strict_node (cyclomatic 26): rig_core::providers::deepseek::strict_node 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/rig-core/src/providers/deepseek.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4db9ef81b9f831b2bd70e150926377791906ea5aabcb18c9e2fc5ca09ea9faa"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::providers::gemini::options::generate_content_options (cyclomatic 26): rig_core::providers::gemini::options::generate_content_options 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/rig-core/src/providers/gemini/options.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c17430741a07c2774920b51b954f74ea34bb27ffaff5e8311af386ea33c9d1b"}},{"ruleId":"D1","level":"warning","message":{"text":"Stopper::stop (cyclomatic 26): Stopper::stop has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/turn.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"624ad85d6d92b2a1a25846185d572de228021fe3a87ef3ff5af3ff3d955a21f5"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_claude_cloak::schema::postprocess (cyclomatic 26): rig_claude_cloak::schema::postprocess 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":"plugins/rig-claude-cloak/src/schema.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b291079b34da5909a36da8bc81922f88a056d57484694bdd078a1c8c052750e"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_tui::input::read_input (cyclomatic 26): rig_tui::input::read_input has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/input.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"409bfd9c3d25a0a38276ae04d090b2e0c6b14930f060897a61b0595a01995b30"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_oc::steer_and_queue::strip_keys (cyclomatic 25): corpus_oc::steer_and_queue::strip_keys 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":"corpus/oc/src/steer_and_queue.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e5774f7450bc59d9290b0cdc336d1ee01ed1fa056cd0f06a33065a013a3ce5"}},{"ruleId":"D1","level":"warning","message":{"text":"Chat::assistant (cyclomatic 25): Chat::assistant 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/rig-core/src/providers/openai/wire/chat.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19e89f217a1d70e43e5df24955b2473878c47cac17d6d8a98bcfccf3a7c9f13"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_cassette::scrub::multipart_slices (cyclomatic 24): rig_cassette::scrub::multipart_slices 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/rig-cassette/src/scrub.rs"},"region":{"startLine":2922}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8c769995c7f167741812473f15f6e9ab56e4c6e4f4780430ff733eb9089ae1"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::conversation::pairing::walk (cyclomatic 24): rig_core::conversation::pairing::walk 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/rig-core/src/conversation/pairing.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dca5a9733c497148ce63535a8b7bfec81d55899fb64fce45dfb5f5fbd04514"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::providers::anthropic::completion::apply_cache_control (cyclomatic 24): rig_core::providers::anthropic::completion::apply_cache_control 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/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba11ee9d27bc49bd64d325a905bba3c7a8aea8f606ad9daf75ddf06e2bc3d888"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_ecs::stage::start (cyclomatic 24): rig_ecs::stage::start 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/rig-ecs/src/stage.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c693927a00230f8a5e5e0d489150d34afa7ea946d58e80b7693f563f31859fd3"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_basics::telemetry::usage::usage (cyclomatic 24): rig_basics::telemetry::usage::usage has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/telemetry/usage.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"c093b191b73d4b50550df52cde79f93236c2c483d7627dcf487149df93431391"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_claude_cloak::schema::strict_schema (cyclomatic 24): rig_claude_cloak::schema::strict_schema 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":"plugins/rig-claude-cloak/src/schema.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c13f225446f27e3c2b6a1047e83da5f309ba51a844e79c80db3d406850807c7"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_library::transcript_import_library::import (cyclomatic 23): corpus_library::transcript_import_library::import has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/library/src/transcript_import_library.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"696496d5c9c6bb00ecdc995a470fb7a3aa4fc9d1d354ae44c7d7189b799bbf3d"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatResponse::absorb (cyclomatic 23): ChatResponse::absorb 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/rig-core/src/providers/cohere/streaming/document.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05f94a7a3937c3e80e48846b82538397491cb9015b961c24c48a06f87451d7d"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::completion::options::merge::apply (cyclomatic 23): rig_core::completion::options::merge::apply has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/completion/options/merge.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dcb4b767a4e230a1ffd926c53e7aa346ea50f9fdb779073e20b32f81ebbea7"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_tools::watch::send_batches (cyclomatic 23): rig_tools::watch::send_batches has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-tools/src/watch.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"b624b3e3b074560b0049a723e3d0bd76d7123ca501f871ad783ce9ee4b7c69b1"}},{"ruleId":"D1","level":"warning","message":{"text":"Markdown::end (cyclomatic 22): Markdown::end 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":"corpus/sn/src/web_fetch/markdown.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6346a30d57cf0fc397c68bbcc191ce94a9c45421af8c8da960b679cf446a59"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_agent::run::prepare::prepare_request (cyclomatic 22): rig_agent::run::prepare::prepare_request 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/rig-agent/src/run/prepare.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef5f4a3642eaaee0d004145fffd50ca88ac24ac737e35bb166fa2dc6f061468"}},{"ruleId":"D1","level":"warning","message":{"text":"Reply::observed (cyclomatic 22): Reply::observed 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/rig-core/src/serve/handler.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1751bb403a2db43dfedecf895046bb26f63d1509481583f17159e6d5e0f8dce"}},{"ruleId":"D1","level":"warning","message":{"text":"Validator::check (cyclomatic 22): Validator::check 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/rig-core/src/tool/validate.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60b11bf4b06f21eebe68d133f39f69490d8ad608cf6685f8281b0d156d3463e"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::providers::openai::options::chat_options (cyclomatic 22): rig_core::providers::openai::options::chat_options has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/options.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"202ebaf237a9c3a2f881639c39c424925229b425aa5bdb7a46bf8459b347e714"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::start (cyclomatic 22): Writer::start 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/rig-markdown/src/markdown.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f26ec4302b8938b6dc2ef2efe1ec5f0e2ed7d0f614271e977bb30d1d0e6b93"}},{"ruleId":"D1","level":"warning","message":{"text":"Repo::push (cyclomatic 21): Repo::push 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":"corpus/ct/src/git_guardrails/rules.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"66be4e3afb051512e8007f204e101b47584c63f79d85b8efd066d04a4cbf1256"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_oc::transcript_in_editor::rebuild (cyclomatic 21): corpus_oc::transcript_in_editor::rebuild 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":"corpus/oc/src/transcript_in_editor.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1830e2e0f4ec5009d80282a93134cc01b34996073b9a2446ab2c03817bc857"}},{"ruleId":"D1","level":"warning","message":{"text":"Message::absorb (cyclomatic 21): Message::absorb 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/rig-core/src/providers/anthropic/streaming/document.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"7358ea6faa1cd13d4ebccadecd2235f86062cb9f89fdbc6863aa85b09e7edc20"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerateContentDecoder::decode (cyclomatic 21): GenerateContentDecoder::decode 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/rig-core/src/providers/gemini/streaming.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59595b817ff48a1ed8622eab98b71ed270b3050d37c5a30d0a7c6cac7d7ca5a"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_derive::tool::expand::expand_rig_tool (cyclomatic 21): rig_derive::tool::expand::expand_rig_tool 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/rig-derive/src/tool/expand.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"54feee0b857f4d3697a2df9925ffae355f1c18278c57a556c815fb82052d8af0"}},{"ruleId":"D1","level":"warning","message":{"text":"Kept::line (cyclomatic 21): Kept::line 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/rig-tools/src/shell.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a76532f799aa03d31b1babad90c804c9fe89d8553a04bb67ef2611fa6c41440"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::cassette::scan::key_shape (cyclomatic 21): xtask::cassette::scan::key_shape has cyclomatic complexity 21 (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":"xtask/src/cassette/scan.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbc355738e7d69720631cadf71c688a22fd9f82d57f5154bcfcc5d441ed0df5"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::catalog::pin (cyclomatic 21): xtask::catalog::pin has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/catalog.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"f533140ba17553e8173ec53c181543280c42d1f63cdf900c39c4e1b6e56a9fea"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::catalog::guard::changes (cyclomatic 21): xtask::catalog::guard::changes 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":"xtask/src/catalog/guard.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"114a638fea0631431fb70e756547236250566e5eb6a21ab23da85ebfa50ee713"}},{"ruleId":"D1","level":"warning","message":{"text":"Job::diagnostics (cyclomatic 20): Job::diagnostics 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":"corpus/fh/src/lsp_tools.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"8416066b4aee4f887f6efa50d05c75d13189d03d78ea30853b4f654b3082b16c"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_fh::import_sessions::parse::claude_code (cyclomatic 20): corpus_fh::import_sessions::parse::claude_code 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":"corpus/fh/src/import_sessions/parse.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfd368bfa37ff8633a926abe13575d853e51a6d2cf5c234e80df72f17efd2c2"}},{"ruleId":"D1","level":"warning","message":{"text":"Manifest::entries (cyclomatic 20): Manifest::entries 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":"corpus/oc/src/dependency_guard.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec20e5b42717ad582e4553a419c0e29aa4958a6deeee9a72f6ad1dd95d43c38"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_oc::dataset_cli::dataset::chat_messages (cyclomatic 20): corpus_oc::dataset_cli::dataset::chat_messages 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":"corpus/oc/src/dataset_cli/dataset.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b15e2d23d4589061640efa179e5c9a28c47135d706fc03e9027737265ccd81"}},{"ruleId":"D1","level":"warning","message":{"text":"Editor::run (cyclomatic 20): Editor::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":"corpus/sn/src/vim_input/editor.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"886c5949917c56e7b0c9333485de060737f3f3b29a4972808ffb15585aefe252"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_sn::crash_resume::recover (cyclomatic 20): corpus_sn::crash_resume::recover 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":"corpus/sn/src/crash_resume.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"3339cf7c3e27766453a05c15b31ecd6942dc7ea7b2133d7352c85a2fb1eb4b15"}},{"ruleId":"D1","level":"warning","message":{"text":"Scrubber::learn_json_in (cyclomatic 20): Scrubber::learn_json_in 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/rig-cassette/src/scrub.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"52019cffe37ed0704e0afd0bee4662c530eee670fcf3fbbc89bbf52bf5ef12a1"}},{"ruleId":"D1","level":"warning","message":{"text":"CacheBook::plan (cyclomatic 20): CacheBook::plan 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/rig-core/src/providers/gemini/caching.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc0fdada101bb59fdd44096eaa8d24167e354e9d006ef6e3b122ab039ad3164"}},{"ruleId":"D1","level":"warning","message":{"text":"InteractionsDecoder::delta (cyclomatic 20): InteractionsDecoder::delta 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/rig-core/src/providers/gemini/interactions_api/streaming.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"991645250c39d866ab4afee0f416f7199f434de4b0fc8abbeaf6194d168640f4"}},{"ruleId":"D1","level":"warning","message":{"text":"InteractionsDecoder::decode (cyclomatic 20): InteractionsDecoder::decode 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/rig-core/src/providers/gemini/interactions_api/streaming.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f5896df6faa81812663de07d40ce5f7c6dca168c0f1e1486fc6f330059f904"}},{"ruleId":"D1","level":"warning","message":{"text":"Responses::base (cyclomatic 20): Responses::base 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/rig-core/src/providers/openai/responses_api/mod.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f3ff3500781e60312ee0d8e6c697b5127e97a5afbef370aee4ee8c8ece64f8"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_basics::reload::rebuild::drain_reload (cyclomatic 20): rig_basics::reload::rebuild::drain_reload 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":"plugins/rig-basics/src/reload/rebuild.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc58058c10cc2bc34718f544326e32ee7377613a40bbd24a46c1a5fe632903b"}},{"ruleId":"D1","level":"warning","message":{"text":"OAuthTransport::prepare (cyclomatic 20): OAuthTransport::prepare 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":"plugins/rig-claude-cloak/src/transport.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bd81d53824fb515d24f250194dbc9148217d569108b4570c95a0a899b887ca"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_tui::pane::lay_out_panes (cyclomatic 20): rig_tui::pane::lay_out_panes 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":"plugins/rig-tui/src/pane.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2312434494973e43052bfe8ad9fdce363d51e0e2884b1216096dab27a4b649f"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::verify::plan::plan (cyclomatic 20): xtask::verify::plan::plan 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":"xtask/src/verify/plan.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d1279e7b4c2b238501eb09787d6105cd07271bb9d216776a1c8813f8e5699e"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_fh::apply_patch_tool::patch::parse (cyclomatic 19): corpus_fh::apply_patch_tool::patch::parse 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":"corpus/fh/src/apply_patch_tool/patch.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"52107ef0e171a781c3331df925620b6dbc4722f435b858d31cc72fbd3113e4b0"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_fh::prompt_cache_shaping::shape (cyclomatic 19): corpus_fh::prompt_cache_shaping::shape 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":"corpus/fh/src/prompt_cache_shaping.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dac55ad879df0b25395429c2cbe3338c216ef47e3b6cc7fae8437c4080fe226"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_bedrock::request::base (cyclomatic 19): rig_bedrock::request::base 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/rig-bedrock/src/request.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66fb0af9fea3428feb8df1309b8695f140e8c551d5d83be6f4487b0b55794e4"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_candle::protocol::parse_qwen3_assistant (cyclomatic 19): rig_candle::protocol::parse_qwen3_assistant 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/rig-candle/src/protocol.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"539334f33eb1c68f80c28d0f8513c677d39d96ff748ab0b0ab3f3a652e5f40b8"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::end (cyclomatic 19): Writer::end 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/rig-markdown/src/markdown.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"18685642f415a80ed9e3d1cc097e8e0b5abaeb3c3c3d11eee73111a9aa3f3bcc"}},{"ruleId":"D1","level":"warning","message":{"text":"PrintPlugin::finish (cyclomatic 19): PrintPlugin::finish 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":"plugins/rig-basics/src/print.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee01c5c5ffc20b4db9567ded9d2215072bab5dc1c555d13fea73f5127e10eaa"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::verify::preflight::run (cyclomatic 19): xtask::verify::preflight::run 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":"xtask/src/verify/preflight.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2306774caeaad01114784362d10f943ebb0e0915c6be9980795ab6f020062ec9"}},{"ruleId":"D1","level":"warning","message":{"text":"Rewinder::rewind (cyclomatic 18): Rewinder::rewind 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":"corpus/base/src/checkpoint_rewind.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb77ea5b04fabd89b4f832b43b38d8b04002721050e15604a3b17cacb4b1200f"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_base::debate::step (cyclomatic 18): corpus_base::debate::step 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":"corpus/base/src/debate.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7992ab0743c62a171ae6798971e7b0c26bc5e7d997cc36e341616d7853594c"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_fh::apply_patch_tool::patch::check (cyclomatic 18): corpus_fh::apply_patch_tool::patch::check has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/apply_patch_tool/patch.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3dd0ea3ec0c9ac1e42328b65df1b3682f5d29d3b640e95c5e5f28ed52b2efe"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_ho::hunk_review::revert (cyclomatic 18): corpus_ho::hunk_review::revert 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":"corpus/ho/src/hunk_review.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee748013a71dae434c99340e0ae220ec31b050cc6820ca171e9f120d21795f16"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_ho::hunk_review::review (cyclomatic 18): corpus_ho::hunk_review::review 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":"corpus/ho/src/hunk_review.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"813f0ebad91ab09a7d0657497d5dbc26f178980d62a2d06c3851bcf4beba878b"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_sn::model_params::check (cyclomatic 18): corpus_sn::model_params::check has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/model_params.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c6474fdcbb71d9ae6d9525b143d66db71dd8ca1f52d41dafcd52c791bd450e"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_sn::vim_input::edit (cyclomatic 18): corpus_sn::vim_input::edit 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":"corpus/sn/src/vim_input.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17f4cad9d4d058900cfcd66d2b1e7906a421ad041b65a08d2b3d21cc7ede620"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamState::delta (cyclomatic 18): StreamState::delta 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/rig-bedrock/src/streaming.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d682c4eef45a2925daeed33cc167f239ad3e1e4c5024580db51abb062cbb81"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonObjectContext::field (cyclomatic 18): JsonObjectContext::field 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/rig-cassette/src/scrub.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f7f5beaed1d8ef4a9fd134842029c9a5e955588a3f90b39045fefc360796ed"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_cassette::http::replay_request (cyclomatic 18): rig_cassette::http::replay_request 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/rig-cassette/src/http/mod.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"021e8ad235c522fd72cc0e912a03e80857a3aaec685b691f93874e36a524f985"}},{"ruleId":"D1","level":"warning","message":{"text":"Caching::send (cyclomatic 18): Caching::send 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/rig-core/src/client/gemini_caching.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff63e55997397592b04b8bab55bf1e3cccea2207458a32cceea4e78672d8828"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::json_utils::parse_partial_object (cyclomatic 18): rig_core::json_utils::parse_partial_object 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/rig-core/src/json_utils.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"535281fef2593c01015f9743bd88deff8565314ac48dc62d49afb22454f7998d"}},{"ruleId":"D1","level":"warning","message":{"text":"Summarizer::serialize (cyclomatic 18): Summarizer::serialize 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/rig-memory/src/compaction.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f45bf3966cf71a49ac07aceec102936c8ef921fb27ecd5aadd26235cfc97517"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_memory::rewrite::rewrite (cyclomatic 18): rig_memory::rewrite::rewrite 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/rig-memory/src/rewrite.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"f178445e21d26580d794f16cb323e3ef905360b20c76a8209b438224e6136d3e"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_tools::process::forward_both (cyclomatic 18): rig_tools::process::forward_both 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/rig-tools/src/process.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2102bcb0cc9deb814ee204da2842dd05623dba0ec7e4d7f16df5e7a9d588a8"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_basics::subagents::spawn::spawn_requested (cyclomatic 18): rig_basics::subagents::spawn::spawn_requested 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":"plugins/rig-basics/src/subagents/spawn.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b731b16804eb6d5b3928e5d4dfe0cdfe9417e529a3a82a1a8c5c696c9b2214d"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_tui::render::draw_choice (cyclomatic 18): rig_tui::render::draw_choice 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":"plugins/rig-tui/src/render.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"466c80cce1bea4c93b5f01f121bbb22b7c376990a785a3777c95cddcf4cb247a"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_base::export::render::walk (cyclomatic 17): corpus_base::export::render::walk 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":"corpus/base/src/export/render.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb483fbae5b17d6de0bca0075cd7b77dcc7a227b528f8672a00fe395345bd34b"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_fh::apply_patch_tool::gate_together (cyclomatic 17): corpus_fh::apply_patch_tool::gate_together 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":"corpus/fh/src/apply_patch_tool.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"2772df14d7b5e3aa69b89350f603cfb6553fe31bd0737d3bf966d35af17e3245"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_ho::session_recall::docs (cyclomatic 17): corpus_ho::session_recall::docs 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":"corpus/ho/src/session_recall.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"562cc815fe9e374de446176d3b4324705c673f8caa59fb9a2f62d4ff5e802c23"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_sn::crash_resume::resolve (cyclomatic 17): corpus_sn::crash_resume::resolve 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":"corpus/sn/src/crash_resume.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"247e9112afa8d59a5d42e1576635bef3bd79cf1a564cd3162120d34f03499a32"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_sn::vim_input::editor::target (cyclomatic 17): corpus_sn::vim_input::editor::target 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":"corpus/sn/src/vim_input/editor.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d318a320f27b3b743752aa2380c5edf3e0621a3d9ef8c2b4a55df0b00909fc"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_bedrock::options::claude_reasoning (cyclomatic 17): rig_bedrock::options::claude_reasoning 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/rig-bedrock/src/options.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c368226f2647833e93c49467ac0df5c1ce03972465f561af8eb52e76c705c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Scrubber::learn_body_parts (cyclomatic 17): Scrubber::learn_body_parts 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/rig-cassette/src/scrub.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefb35940716ac8076acdddb542d276b674039149fbf275442a9d822832cc53d"}},{"ruleId":"D1","level":"warning","message":{"text":"Catalog::from_overrides (cyclomatic 17): Catalog::from_overrides 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/rig-core/src/catalog/read.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa77ddd19294f6c56c0164cb4f5ab345285aad9bc28e3ecefa55440641f4256"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerateContentDecoder::part (cyclomatic 17): GenerateContentDecoder::part 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/rig-core/src/providers/gemini/streaming.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff756a00518d809d719a636b509fd4e5549bdae340472725d83999983d5cfa77"}},{"ruleId":"D1","level":"warning","message":{"text":"Chat::encodes (cyclomatic 17): Chat::encodes 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/rig-core/src/providers/openai/wire/chat.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b2fbd527d885bd0969a0c7cb62bbd14d94cb0fc72410385997b4b35b04a48e"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::providers::openai::wire::chat::document::merge_call (cyclomatic 17): rig_core::providers::openai::wire::chat::document::merge_call 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/rig-core/src/providers/openai/wire/chat/document.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"474a70d0173edaf6cc52fd12b15b498d7d01eb01145304a5ed60ea443c393eef"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_ecs::turn::commit_turn_calls (cyclomatic 17): rig_ecs::turn::commit_turn_calls 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/rig-ecs/src/turn.rs"},"region":{"startLine":1658}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb26fda16e3d4c47f3195734eb8b9c2e38c80607060544fc6acc4ddeb099918"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_tools::search::find (cyclomatic 17): rig_tools::search::find 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/rig-tools/src/search.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dadb3c0f0fad408b7a50b8dc55b93f159be98a0848b7c5207698c7600b808cc"}},{"ruleId":"D1","level":"warning","message":{"text":"Transcript::update (cyclomatic 17): Transcript::update 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":"plugins/rig-tui/src/transcript.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"894aad5ed5f3fdea0f54dfaacca0706f58208de69678d126afd660648c53fd2a"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_tui::pick::queue_choices (cyclomatic 17): rig_tui::pick::queue_choices 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: rig_tui::pick::choice_key (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":"plugins/rig-tui/src/pick.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ee5d346ea6e17937dc08bda1b6546460c262dbfc3eaedba591362eab60b340"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::record_one (cyclomatic 17): Session::record_one 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":"xtask/src/cassette/record.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e3b1e32a40a72b80b8cd9a5926041cc04907d7b9c0bdc7aaff73079b0f99dc"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_oc::dataset_cli::dataset::session_lines (cyclomatic 16): corpus_oc::dataset_cli::dataset::session_lines 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":"corpus/oc/src/dataset_cli/dataset.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b865bfd6186dc012d36b52044a0d39851f30eda0cdaf332e1ddc0b518740d9"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_sn::sessions_prune_cli::plan (cyclomatic 16): corpus_sn::sessions_prune_cli::plan 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":"corpus/sn/src/sessions_prune_cli.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f981c11f8e511d1758a82605cbe618e2f5bb144dc23396b678a2bae9509139d1"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_sp::dead_ends_ledger::review_shell (cyclomatic 16): corpus_sp::dead_ends_ledger::review_shell 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":"corpus/sp/src/dead_ends_ledger.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"26089638daf19eeadedb34c82218c1c76d6bf895ec747be485eda069129ab4b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::encode (cyclomatic 16): Writer::encode 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/rig-cassette/src/effect_log/jsonl.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe2500b87fd0795aeac5ea5fd21d6ad925f8494a4f403c81e8147ac64c2cd07"}},{"ruleId":"D1","level":"warning","message":{"text":"ReplyFold::settle (cyclomatic 16): ReplyFold::settle 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/rig-core/src/operation/completion.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10d7467d1c1d65ac7c7a6100bac5e43ee1785f54a59f07a56142c53a0d114bf"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeChat::assistant (cyclomatic 16): NativeChat::assistant 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/rig-core/src/providers/cohere/chat.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ed8ca3da36fcaaae9be7eceaadf2dd18007a61654176fb0acfcb6d529bd3ef"}},{"ruleId":"D1","level":"warning","message":{"text":"Serving::serve (cyclomatic 16): Serving::serve 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/rig-core/src/providers/internal/auth/loopback.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"163bb92555d4fb63a852ef1fd3c326c28828b5de248df64883cb19e1184955ce"}},{"ruleId":"D1","level":"warning","message":{"text":"ResponsesDecoder::done (cyclomatic 16): ResponsesDecoder::done 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/rig-core/src/providers/openai/responses_api/streaming.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"6758314338037bbe601f97de092eb3e360609cd2d6f615b7a4123d9413b69b3e"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamRecord::push (cyclomatic 16): StreamRecord::push 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/rig-core/src/streaming/event.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf6712fe8719a93085e2c08844bdd6511e3246c587545adf4e62e90a8608441"}},{"ruleId":"D1","level":"warning","message":{"text":"Out::fragment (cyclomatic 16): Out::fragment 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/rig-core/src/operation/completion.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48ad258bf22d67cdee20b7994c45c979c3a513ee3badfff5674cde97ccc8906"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::completion::history::adapt_for (cyclomatic 16): rig_core::completion::history::adapt_for 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/rig-core/src/completion/history.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db422dafc2ad9bc6cc303f19708c60980b6739b5e5e418ab68c230163005f5f"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::providers::anthropic::completion::base (cyclomatic 16): rig_core::providers::anthropic::completion::base 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/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1ea4f3fa9dd33e3f39cae1f5f0e05430cf303d1925018fb6f3e6eb6cef22f0"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_ecs::restore::restore_session (cyclomatic 16): rig_ecs::restore::restore_session 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/rig-ecs/src/restore.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f1d6c58eeec0ebfa9dbca62c522c05931b9897d59be4c950b182269daf781c"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_ecs::turn::take_unanswered (cyclomatic 16): rig_ecs::turn::take_unanswered 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/rig-ecs/src/turn.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed03b3de89cc25ecf8bde27e506b15b94f29a73d51ef70df0ff286fc45cbc390"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_markdown::wrap::wrap_hanging (cyclomatic 16): rig_markdown::wrap::wrap_hanging 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/rig-markdown/src/wrap.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9acdb0f334e666752ad7771ab90cc540ebec4e8465540668c52624b7c195806"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_memory::rewrite::map_file (cyclomatic 16): rig_memory::rewrite::map_file 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/rig-memory/src/rewrite.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"832f6aa347a6e161f6d56b8da8774793dd795910b811a355ef8aa58a6fa1e3a8"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_acp::session::open (cyclomatic 16): rig_acp::session::open 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":"plugins/rig-acp/src/session.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7433c958e58a482f51380da16d89871ae97eb36395fb611f4ae527d9fee3ba2"}},{"ruleId":"D1","level":"warning","message":{"text":"Options::parse (cyclomatic 16): Options::parse 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":"xtask/src/verify.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce13345a4e6eaa9b5ddc0df8958c1eeec12075694982256812912f01aa7e016b"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::driver_adoption::streaming_modules_never_debug_print_wire_payloads_in_warn_logs (cyclomatic 16): xtask::driver_adoption::streaming_modules_never_debug_print_wire_payloads_in_warn_logs 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":"xtask/src/driver_adoption.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a5007f98ea8b4808f322595995198f990e29e8b5be273af3d58eaa164d8164"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamingTurnSource::run_model_turn (cognitive 132): StreamingTurnSource::run_model_turn has cognitive complexity 132 (threshold 15). Drivers by points: if/else 18 (67 pts), match/switch 15 (49 pts), loops 4 (11 pts), boolean chains 5 (nesting depth added 90). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/agent/engine.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f326868871af950486bc7efb3385b861417f75dcc50fd83e3c2283bbe547536"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_claude_cloak::schema::upgrade (cognitive 102): rig_claude_cloak::schema::upgrade has cognitive complexity 102 (threshold 15). Drivers by points: if/else 29 (78 pts), loops 5 (17 pts), match/switch 3 (6 pts), boolean chains 1 (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":"plugins/rig-claude-cloak/src/schema.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb807f1d0642566bc0ea2ae6cbdda90654cf8997c8b752e1055c0a1a4350820"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cli::run::run_agent (cognitive 93): rig_cli::run::run_agent has cognitive complexity 93 (threshold 15). Drivers by points: if/else 26 (68 pts), match/switch 6 (15 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cli/src/run.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"893143315f22230a6152351dd51d9d8d007e76bfe1900a7b9f71e36d26c17eaa"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::openai::responses_api::input (cognitive 92): rig_core::providers::openai::responses_api::input has cognitive complexity 92 (threshold 15). Drivers by points: if/else 15 (56 pts), match/switch 6 (23 pts), loops 3 (7 pts), boolean chains 6 (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/responses_api/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5432e7f29b421610f4f645dff8163e963f6967b60c74cf629fb18017bc1c3872"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::driver_adoption::mask_literals_and_comments (cognitive 86): xtask::driver_adoption::mask_literals_and_comments has cognitive complexity 86 (threshold 15). Drivers by points: if/else 20 (56 pts), loops 5 (19 pts), boolean chains 6, match/switch 2 (5 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/driver_adoption.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ff012afef0559e5f42bb76690b92c5d913a187640f04b241dad0cb123bdb70"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_agent::agent::engine::drive_agent (cognitive 80): rig_agent::agent::engine::drive_agent has cognitive complexity 80 (threshold 15). Drivers by points: if/else 15 (37 pts), match/switch 13 (34 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/agent/engine.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7649cd63e66cce85263f7e92528871a15a7f6a27c7b9de0276661831de29e4e5"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_fh::editor_front::receive (cognitive 72): corpus_fh::editor_front::receive has cognitive complexity 72 (threshold 15). Drivers by points: if/else 17 (50 pts), loops 5 (15 pts), match/switch 3 (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":"corpus/fh/src/editor_front.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be2a60bb4e34cb59cfecbbd4c83dd4cf0dfe720cf244c709f9e6fd1cd5589e9"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentRun::next_step (cognitive 70): AgentRun::next_step has cognitive complexity 70 (threshold 15). Drivers by points: if/else 21 (63 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 44). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/run/mod.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"deab037e097d4fc92de03dff48090aaf30468948993b6a6340b04c4384c17cf6"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_candle::protocol::render_qwen_message (cognitive 69): rig_candle::protocol::render_qwen_message has cognitive complexity 69 (threshold 15). Drivers by points: if/else 10 (38 pts), match/switch 6 (20 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 47). 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/rig-candle/src/protocol.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"62511a782be19529eb42438084e2c5294658d98b98eef6e0bb863b6d9b775cbc"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_acp::translate::replay (cognitive 58): rig_acp::translate::replay has cognitive complexity 58 (threshold 15). Drivers by points: if/else 7 (25 pts), match/switch 5 (16 pts), loops 7 (15 pts), boolean chains 2 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-acp/src/translate.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b51504ddb5b74759a886d3b2e9325466b31f48399233c6a6d1ef23a4ee249da"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_claude_cloak::schema::postprocess (cognitive 58): rig_claude_cloak::schema::postprocess has cognitive complexity 58 (threshold 15). Drivers by points: if/else 13 (43 pts), boolean chains 8, loops 2 (6 pts), match/switch 1 (nesting depth added 34). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-claude-cloak/src/schema.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae41d3e3e6d442aa8add1c19bc8c75e64514428175833908ee25578d14b4989"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::driver_adoption::macro_body (cognitive 58): xtask::driver_adoption::macro_body has cognitive complexity 58 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 7 (18 pts), match/switch 2 (6 pts), boolean chains 4 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/driver_adoption.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1614fb752062536ec75d440ee1c9260cc0ae82edf80e69e4cddfccd642d137"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::internal::schema::sanitize_schema (cognitive 56): rig_core::providers::internal::schema::sanitize_schema has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 5 (16 pts), boolean chains 8, match/switch 1 (3 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/internal/schema.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bd3ff74aff8cd99a8e11e575231bab6c943fa728c5f7ac03a24df0c83e3441"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_basics::compaction::compact_near_the_window (cognitive 56): rig_basics::compaction::compact_near_the_window has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (37 pts), match/switch 3 (11 pts), boolean chains 7, loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/compaction.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"937945791b7559ede092ac36ec4e2f121cd1107b8d271e32dd5a4704e9ea846f"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::conversation::pairing::walk (cognitive 54): rig_core::conversation::pairing::walk has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (36 pts), match/switch 3 (9 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/conversation/pairing.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b28de5ff8ca5751722c59a62cdc49d78220e2f945f69b84d7c0e9e2d2ed0b50"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_claude_cloak::transport::prompt_caching (cognitive 53): rig_claude_cloak::transport::prompt_caching has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (33 pts), boolean chains 15, loops 3 (4 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-claude-cloak/src/transport.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44c7145c6dd3e8213bb72d583ef2f8b543b1b5673d89071183f6d6beeb24153"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_claude_cloak::transport::body (cognitive 53): rig_claude_cloak::transport::body has cognitive complexity 53 (threshold 15). Drivers by points: if/else 24 (36 pts), boolean chains 10, match/switch 4, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-claude-cloak/src/transport.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8252973d317a14a71b4e5c3308ad237b3dc99598cdc50dea83a9f56a7950040"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tui::transcript::message_lines (cognitive 52): rig_tui::transcript::message_lines has cognitive complexity 52 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 6 (15 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/transcript.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"817dd24fbbbb769c9e630730edbd191a0346df3e50390b18d95d16e2a3ce9104"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_agent::agent::engine::drive_tool_calls (cognitive 50): rig_agent::agent::engine::drive_tool_calls has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 5 (8 pts), match/switch 6 (8 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/rig-agent/src/agent/engine.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9970bc834d4d146b8188fe70b97510ff4bdbc72d191421d8703f3735e71759"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tui::render::lay_out_transcript (cognitive 50): rig_tui::render::lay_out_transcript has cognitive complexity 50 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 8 (16 pts), match/switch 4 (8 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":"plugins/rig-tui/src/render.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de525ddf3daaf33abeb537852b07fae12876c4febb180cbdad86adfb56d4933"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::verify::execute::internal (cognitive 50): xtask::verify::execute::internal has cognitive complexity 50 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 5 (12 pts), boolean chains 11, match/switch 2 (3 pts) (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/verify/execute.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccf614c32932c7c94303c02cd69a1dcba3a570db192155bc140db0041efeb8f"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_fh::prompt_cache_shaping::shape (cognitive 49): corpus_fh::prompt_cache_shaping::shape has cognitive complexity 49 (threshold 15). Drivers by points: if/else 9 (28 pts), match/switch 5 (15 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/prompt_cache_shaping.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b27de3bbe240473a3c67ef612a539c058b1747bcb7845d692d52fa14e288fe"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ho::session_recall::docs (cognitive 49): corpus_ho::session_recall::docs has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 5 (25 pts), if/else 2 (12 pts), loops 4 (11 pts), boolean chains 1 (nesting depth added 37). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ho/src/session_recall.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e186112d288fd091a89dc0d29c7a21a26645462d157b6b34cf2489428037515"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tools::watch::send_batches (cognitive 49): rig_tools::watch::send_batches has cognitive complexity 49 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 7 (17 pts), match/switch 4 (10 pts), boolean chains 4 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-tools/src/watch.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e37a007e15babc61b7c16c59bdf060a93fd1b730c42450644307d44ac7c3bb0"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::transcript_in_editor::rebuild (cognitive 48): corpus_oc::transcript_in_editor::rebuild has cognitive complexity 48 (threshold 15). Drivers by points: if/else 8 (25 pts), match/switch 5 (12 pts), loops 4 (11 pts) (nesting depth added 31). 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":"corpus/oc/src/transcript_in_editor.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ceb0f39c2775fa0dc008e31ec64a9c630e41feed4bbac02410be9344279fe9"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::completion::history::user (cognitive 47): rig_core::completion::history::user has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 8, match/switch 2 (5 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/completion/history.rs"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf56a2868e09c8549f058a7b997303c27150a666d5dd922baa66d3acd4e8431"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::completion::history::assistant (cognitive 46): rig_core::completion::history::assistant has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 8, match/switch 4 (6 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/rig-core/src/completion/history.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8256d7af42c7c26ccf01a4d358084db3bb0c4afa09c9dce6d0f0069f4ee425a4"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::deepseek::strict_node (cognitive 46): rig_core::providers::deepseek::strict_node has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 5 (10 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/deepseek.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"51114d971c124dfc1b363e411fbaf591065f470ac3649f586f65db9352cce67c"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cassette::scrub::capture_format (cognitive 45): rig_cassette::scrub::capture_format has cognitive complexity 45 (threshold 15). Drivers by points: if/else 25 (29 pts), boolean chains 16 (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/rig-cassette/src/scrub.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e4e5ab87254a0c31ddd2169df7626a580f7aaa158f355573caead9fd0643af"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cassette::traffic::line::line (cognitive 44): rig_cassette::traffic::line::line has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (33 pts), match/switch 5 (8 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/rig-cassette/src/traffic/line.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db3ea75093df9390c8f8167417c63a3d0ad56a8e7275ec7e0c2fdbed3ffdf4b"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::cassette::scan::scan (cognitive 43): xtask::cassette::scan::scan has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 10 (13 pts), boolean chains 6 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/cassette/scan.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"de869eb52132b67774e2b778b223927b15d8c4f29cca48d0dc436f63db66e13c"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_library::transcript_import_library::import (cognitive 42): corpus_library::transcript_import_library::import has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 5 (12 pts), loops 4 (6 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":"corpus/library/src/transcript_import_library.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e63a76de2775cc631fa19e0c0b3d6e95da2e08762648cbf2bfe0347743fe73f"}},{"ruleId":"D2","level":"warning","message":{"text":"Scrubber::scrub_sse_body (cognitive 41): Scrubber::scrub_sse_body has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (8 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/scrub.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"5040d499b4fcbdfc70f50f6a91e2d1d7bf343928abb85f53d6518813bf488b83"}},{"ruleId":"D2","level":"warning","message":{"text":"Summarizer::serialize (cognitive 41): Summarizer::serialize has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 7 (27 pts), loops 3 (7 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 28). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-memory/src/compaction.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e19acf2cec5d79b7205adb6fc03511e82485dbe63ef4e261856ddc48f52866b"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_basics::print::drive (cognitive 41): rig_basics::print::drive has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 4 (10 pts), boolean chains 5, loops 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/print.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fe84a4b865b12491acee7e60c48cb9a38c3cad1f6272473389b6e1ec0d45e1"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_fh::apply_patch_tool::patch::parse (cognitive 40): corpus_fh::apply_patch_tool::patch::parse has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 2 (8 pts), loops 3 (7 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":"corpus/fh/src/apply_patch_tool/patch.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5493d71de5c8d8d6c0dd83ebe7c56c352f64cfeb977c8f6e2ee326f2ea7de0b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Scrubber::scrub_json_in (cognitive 40): Scrubber::scrub_json_in has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 4 (10 pts), boolean chains 7, 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/rig-cassette/src/scrub.rs"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"726dd57073d66b5a1f09f5fac5499655c8896a42f6e316ffba56ffbe50d3ffca"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::anthropic::completion::strict_schema (cognitive 40): rig_core::providers::anthropic::completion::strict_schema has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (24 pts), match/switch 7 (11 pts), boolean chains 3, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"c113c2ff0413f69969be009713367a24c39b2d399f03bab66f2b3e24793721da"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::stage::start (cognitive 40): rig_ecs::stage::start has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 3 (7 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/stage.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab5f62516242972cab76b34590e015ee70fbd49443b042e3f69758284ee459d"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ct::git_guardrails::shell::lex (cognitive 39): corpus_ct::git_guardrails::shell::lex has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 4 (14 pts), loops 5 (13 pts), if/else 4 (11 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ct/src/git_guardrails/shell.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fccc79cfec1a9bd7211b204563a6c0e205832475933f30323dc74988925ead7"}},{"ruleId":"D2","level":"warning","message":{"text":"Catalog::from_overrides (cognitive 39): Catalog::from_overrides has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 3 (7 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/catalog/read.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3e28e3e2c6f7da31d22f93a8d52b197c5e4e41f5b3fce854fd616b191597bd"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_fh::checklist_runner::schedule (cognitive 38): corpus_fh::checklist_runner::schedule has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/checklist_runner.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f54f95f4717f9f476cd87660990f1a2faa4e0f630712bba0874c7b06392ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_fh::import_sessions::parse::claude_code (cognitive 38): corpus_fh::import_sessions::parse::claude_code has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 3 (10 pts), loops 3 (7 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":"corpus/fh/src/import_sessions/parse.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"500716a650ecbed1c9bbfa7ce8cee6b3fab967d3fdb3e0ebf3c3be2e34d2560d"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tools::process::forward_both (cognitive 38): rig_tools::process::forward_both has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 5 (11 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-tools/src/process.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe1dd53a8290a8d237fb8d1463b0c9c739947e05b8396bcf600e6bd8302daa6"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::catalog::pin (cognitive 38): xtask::catalog::pin has cognitive complexity 38 (threshold 15). Drivers by points: loops 10 (18 pts), if/else 4 (12 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 20). 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":"xtask/src/catalog.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4e5eb78a7fd6448d9e1db5b35f8e979537cf0c1504dc0b305272996417fce7"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::transcript_in_editor::render (cognitive 37): corpus_oc::transcript_in_editor::render has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 4 (16 pts), loops 5 (13 pts), if/else 2 (8 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/oc/src/transcript_in_editor.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef63531b12a975ef68842c45add4f52569fb7a4cb4671121724402359d14bdd5"}},{"ruleId":"D2","level":"warning","message":{"text":"EffectLogReplayer::serve (cognitive 37): EffectLogReplayer::serve has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 3 (7 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/effect_log/replay.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee62beb2a44c3183845ec2b8de65e2c3e20dc99e9eb8b6466ca924c1b636bfe"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cassette::scrub::multipart_slices (cognitive 37): rig_cassette::scrub::multipart_slices has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 9, 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/rig-cassette/src/scrub.rs"},"region":{"startLine":2922}}}],"partialFingerprints":{"codehealthFindingId/v1":"88476c2f4ae15a51010d56dc7d2a678beedda72d04ea21ad57f7c6f3e3271731"}},{"ruleId":"D2","level":"warning","message":{"text":"Chat::assistant (cognitive 37): Chat::assistant has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 4 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/wire/chat.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac921507e0c3f660e4f92e9e9946547c4b154fa8ee35cd3612ae76e8d8a9781"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroArgs::parse (cognitive 37): MacroArgs::parse has cognitive complexity 37 (threshold 15). Drivers by points: if/else 4 (20 pts), loops 3 (9 pts), match/switch 3 (8 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/rig-derive/src/tool/args.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"495a4c66335ead28fea3ddc0200cb5d867d50008ba6e820e9c3a055a453ca638"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::verify::preflight::run (cognitive 37): xtask::verify::preflight::run has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 3 (7 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/verify/preflight.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba47393843a7cfa29db77b52ad30cef1ff08ee83c25d1c566568330535c25fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Job::diagnostics (cognitive 36): Job::diagnostics has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (8 pts), match/switch 4 (6 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/lsp_tools.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83376825455dfc49e60ff1d07c5688c6c36c32fdb1c23c12178c1d067843100"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_fh::apply_patch_tool::gate_together (cognitive 36): corpus_fh::apply_patch_tool::gate_together has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 6 (16 pts), boolean chains 4 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/apply_patch_tool.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"623a60c6ac849f06b19bbd95747fa87e3524b9befc533af537ba0fe8be3a149a"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_fh::apply_patch_tool::patch::check (cognitive 36): corpus_fh::apply_patch_tool::patch::check has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 5 (10 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":"corpus/fh/src/apply_patch_tool/patch.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c184a8dc17a6d475754099d3249d09d08917a95f7b478e140cd515361127dc8"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::verify::plan::plan (cognitive 36): xtask::verify::plan::plan has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (29 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/verify/plan.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"454fb039186aa117e07df2f2f7f95618caf60bde6271a70415cd069109ac8d6e"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::crash_resume::recover (cognitive 35): corpus_sn::crash_resume::recover has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 6 (8 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/crash_resume.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a7c1a56a04c31a7ad2b291f9a514fab76712cdbbfd6982f07fe482e095c2d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Manifest::entries (cognitive 34): Manifest::entries has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 7 (15 pts), boolean chains 2, match/switch 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/oc/src/dependency_guard.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"a026f9b35e80d8b9bef69c36d4b645d4d3be8841890d895063959f2ee94be313"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_claude_cloak::schema::normalize (cognitive 34): rig_claude_cloak::schema::normalize has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 8, loops 4 (6 pts), match/switch 3 (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":"plugins/rig-claude-cloak/src/schema.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e922f9e79dc61d347f2ce6dca2714320e2ddded017f02a773c97f18e676d0a"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ct::status_command::clean (cognitive 33): corpus_ct::status_command::clean has cognitive complexity 33 (threshold 15). Drivers by points: if/else 3 (16 pts), loops 3 (9 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ct/src/status_command.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"e859b235bf2b056642c25489cd6fe3730cd30fa9f2cc7147e0c557c410a21317"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tui::input::read_input (cognitive 33): rig_tui::input::read_input has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 4 (11 pts), boolean chains 6, loops 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/input.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d766ab41d926a704ba2beee326f3de5a31765fc11f6fbe07642f234a7ef3a75"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sp::dead_ends_ledger::review_shell (cognitive 32): corpus_sp::dead_ends_ledger::review_shell has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 3, loops 2 (3 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":"corpus/sp/src/dead_ends_ledger.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"50339906fb25098167abaee75b7990a0babff4c98eba67d2474619246bddad10"}},{"ruleId":"D2","level":"warning","message":{"text":"Reply::observed (cognitive 32): Reply::observed has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/serve/handler.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"14be4e7471dd3b002d7e856b882c453f30844ed7a1f597e25cc2dc5a8493d2ea"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::anthropic::completion::apply_cache_control (cognitive 32): rig_core::providers::anthropic::completion::apply_cache_control has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 7, 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/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8caede47859edba55a2804015c165f723359572281877b387e581a21221541"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_derive::tool::expand::expand_rig_tool (cognitive 32): rig_derive::tool::expand::expand_rig_tool has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 4 (5 pts), boolean chains 2, match/switch 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-derive/src/tool/expand.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"83803d5f33ee17ae8bd21b74e4713f4fe8228a59668dd4c448214828a65c1114"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tui::pane::lay_out_panes (cognitive 32): rig_tui::pane::lay_out_panes has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 2 (4 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":"plugins/rig-tui/src/pane.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf5d56ed47a08f2b6e40af871d786f02d0e0a851f719cf34fe10114739cbda5"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::cassette::owner::module_map (cognitive 32): xtask::cassette::owner::module_map has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 2 (3 pts), match/switch 1 (3 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":"xtask/src/cassette/owner.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bfa1ad9b3fb03400600046717618401a8d64fa5b8bceaa4128d7b70a792865"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::catalog::serve (cognitive 32): xtask::catalog::serve has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 3 (6 pts), match/switch 1 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/catalog.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3bd9858cc56460fc073d215de4e2a08d7f627ff634e73e47c0c236a62951ab"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::inline_images::sixel (cognitive 31): corpus_oc::inline_images::sixel has cognitive complexity 31 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 6 (12 pts), match/switch 1 (4 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":"corpus/oc/src/inline_images.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc85689ac2630550f6320b6dd6cc279b3ba85b6a3d734499d39e17c5ad563711"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::untrusted_quarantine::fence (cognitive 31): corpus_sn::untrusted_quarantine::fence has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (11 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/untrusted_quarantine.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef503a587c0e08194113db95b9b45e81a6d8f57d66e00d055b5cce42d06c3b3"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_markdown::wrap::wrap_hanging (cognitive 31): rig_markdown::wrap::wrap_hanging has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-markdown/src/wrap.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcf8d05ebe24f248c5b1d5011b88936f054d75fa2bbd832d8eb87d7f8cad967"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tui::input::act (cognitive 31): rig_tui::input::act has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 6 (10 pts), boolean chains 2 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/input.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd01dfa78c051f5ea18b5b71790db2a91347bc40ccf2c5a947fcf08d02977d2"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph::reads (cognitive 31): Graph::reads has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 3 (6 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":"xtask/src/verify/graph.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"1891873fc8ee5baac91132a02f0a7c8b827da1500a05edcea3f47de839f1f045"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::driver_adoption::streaming_modules_never_debug_print_wire_payloads_in_warn_logs (cognitive 31): xtask::driver_adoption::streaming_modules_never_debug_print_wire_payloads_in_warn_logs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4 (8 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/driver_adoption.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a953b23093a55601f2a309778b7feb2bc3cf57aa6e92089533e2b378df20636"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_library::session_edit_library::conversation_markdown (cognitive 30): corpus_library::session_edit_library::conversation_markdown has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 4 (15 pts), if/else 3 (8 pts), loops 3 (7 pts) (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/library/src/session_edit_library.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b73ca842dbf8ad8cdf89d8e85df206f3d6935dd7d4fd8058ca79286207b61e1"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_shared::protected_paths::filter_searches (cognitive 30): corpus_shared::protected_paths::filter_searches has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (8 pts), match/switch 3 (8 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":"corpus/shared/src/protected_paths.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3c7917909a493677f732d891fe0ce4e2371a75e2e66138545342799de307d3"}},{"ruleId":"D2","level":"warning","message":{"text":"SummaryState::track (cognitive 30): SummaryState::track has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 4 (9 pts), match/switch 2 (6 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/rig-memory/src/compaction.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc2f4629a5748b3c0c204e20415c146b8c65ceb41032152e57555b1be319cc4"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_claude_cloak::schema::strict_schema (cognitive 30): rig_claude_cloak::schema::strict_schema has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 10, loops 4 (7 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-claude-cloak/src/schema.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"465ac00074a423444708d5767c1399524faa3c49584c8ea96838feb451b7ef4b"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_candle::protocol::validate_protocol_inputs (cognitive 29): rig_candle::protocol::validate_protocol_inputs has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 4 (16 pts), loops 5 (13 pts) (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/protocol.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da1dd21af7b2ea68718a7c69cf71e0464c8d99d6350c6363493e5510f88a42d"}},{"ruleId":"D2","level":"warning","message":{"text":"Scrubber::learn_json_in (cognitive 29): Scrubber::learn_json_in has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (7 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/scrub.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c24b9fe285ab585fbb15b63a18f66c376b9131f811a05f90a40bcbb472dd5a2"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cli::locks::sweep (cognitive 29): rig_cli::locks::sweep has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (22 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/rig-cli/src/locks.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1572c6c2875df04caed03b197ff548e9e94ecd3fbe9b7e96ffda07dbad4e4924"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tools::edit::apply_to (cognitive 29): rig_tools::edit::apply_to has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-tools/src/edit.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03369990ab77ed85c809959c0e236be527869afa7c3b80f2da14ea0e9181177"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_bedrock::request::base (cognitive 28): rig_bedrock::request::base has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (8 pts), match/switch 4 (5 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/rig-bedrock/src/request.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"238b65fac35e6b763a06b6eebb11f9a0536b59ae901d2c4526cc92085fa70a05"}},{"ruleId":"D2","level":"warning","message":{"text":"Message::absorb (cognitive 28): Message::absorb has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, loops 1 (3 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/rig-core/src/providers/anthropic/streaming/document.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"092e46cb26e8c75cbe017556a7fb89442d80d988b5ac0d7cb9f77dd8a80119e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Chat::base (cognitive 28): Chat::base has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/wire/chat.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a367f780399e44415ff838b851b8ad9e33901df3b0ce416d73daca810311140f"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::gemini::interactions_api::steps (cognitive 28): rig_core::providers::gemini::interactions_api::steps has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 3 (7 pts), match/switch 2 (6 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/interactions_api/mod.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"d225cd373eb7090d98b3100fe9d650b9a0696e383d79a6ac4b25e08db4680bca"}},{"ruleId":"D2","level":"warning","message":{"text":"Kept::line (cognitive 28): Kept::line has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 3 (5 pts), boolean chains 4, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-tools/src/shell.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"292d9526d2533561ea4c2662eba288c9a78559fba34c2bebb8fc3b9932c91cb6"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::transcript_in_editor::parse_body (cognitive 27): corpus_oc::transcript_in_editor::parse_body has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (4 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":"corpus/oc/src/transcript_in_editor.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"5317f3a158b81b1b8536ba5361c9cf6e5ffb83399e216ccb4bd170f38317c402"}},{"ruleId":"D2","level":"warning","message":{"text":"Stopper::stop (cognitive 27): Stopper::stop has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 5 (6 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/turn.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfc4897898313ffeecbf34789701a3b1a899f8ccaa9ebc6cff0f7e687886a23"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tools::search::find (cognitive 27): rig_tools::search::find has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (5 pts), boolean chains 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/rig-tools/src/search.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0550c3a47f955a0e1a39ada0d9215738b553c9027ad1b8799398673b645d136"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_claude_cloak::schema::empty_schemas (cognitive 27): rig_claude_cloak::schema::empty_schemas has cognitive complexity 27 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 4 (10 pts), match/switch 1 (nesting depth added 16). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"plugins/rig-claude-cloak/src/schema.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8283f7ff348cb0ed989654fb784900325e17dea94921005b65c5fc695025c33"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::catalog::guard::reviewed_facts (cognitive 27): xtask::catalog::guard::reviewed_facts has cognitive complexity 27 (threshold 15). Drivers by points: loops 4 (10 pts), match/switch 2 (9 pts), if/else 2 (7 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/catalog/guard.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e544bd0b054a6bb7d84c0985fe9f51d0be51e3d9804236b03c4ab812f70d894"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_base::export::render::walk (cognitive 26): corpus_base::export::render::walk has cognitive complexity 26 (threshold 15). Drivers by points: loops 5 (13 pts), match/switch 3 (7 pts), if/else 3 (6 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/export/render.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cad2bc22bab6f1f560fa20e60d7ca36f6d972b674de7682a0d01b888e67cf4"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ct::git_history_tools::blamed (cognitive 26): corpus_ct::git_history_tools::blamed has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (3 pts), loops 2, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ct/src/git_history_tools.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"385a8af91c54e1a5e8d5f45c4ad79b9ee80021298c853415e7e713ab47e5d109"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::crash_resume::resolve (cognitive 26): corpus_sn::crash_resume::resolve has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, loops 3 (4 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/crash_resume.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"47efc5250ac51059771ceeb206d511611c8e923542ea4bb040be30ad454e2aa6"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::race_models::claim (cognitive 26): corpus_sn::race_models::claim has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/race_models.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd38c92f73a93a48125a45b294b10fd8d27c4d4b682ad8ad79231264544bd7bb"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::sessions_prune_cli::plan (cognitive 26): corpus_sn::sessions_prune_cli::plan has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (4 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":"corpus/sn/src/sessions_prune_cli.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"4533dd06031d41a2ed3f6c9e5c0b3b03cdff1f19e3ebd901c518c214620fbb2c"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::vim_input::edit (cognitive 26): corpus_sn::vim_input::edit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (7 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/vim_input.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3396216e6f7813838cdc7e6dc41d2f194205aff8c48c12f4434c06f005760c2"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cassette::http::replay_request (cognitive 26): rig_cassette::http::replay_request has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 3 (5 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/rig-cassette/src/http/mod.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66973f594e2125b6bf98bf437124b2694dedfe2fdf24cc5622df49d29b5ac70"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::inbox::push_messages (cognitive 26): rig_ecs::inbox::push_messages has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 3 (8 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/inbox.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dfd25c3f067502e4ec47b4e2c0ab1715829a7a420eea51790a04da0a59d3dc"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_markdown::markdown::table::grid (cognitive 26): rig_markdown::markdown::table::grid has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 4 (10 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/rig-markdown/src/markdown/table.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f68dcf9c9ec0241d8389b95bfe3fa6a50e833812e0c740b773ecb7a01fc71ab"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_memory::rewrite::map_file (cognitive 26): rig_memory::rewrite::map_file has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (11 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-memory/src/rewrite.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d4cb24f9b3f50994a020e4957f438427c6be9a504d5d84bdb8f19dd85efa8a"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::catalog::translate_reasoning (cognitive 26): xtask::catalog::translate_reasoning has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 4 (10 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":"xtask/src/catalog.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"c313e3c96b304e7bf6cd78f1f9d8999847cb81fd889fb174752bbba84160ea1d"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_base::window_gui::blocks_of (cognitive 25): corpus_base::window_gui::blocks_of has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (16 pts), loops 3 (7 pts), if/else 1 (2 pts) (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/window_gui.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a43132d62d4e9a739848a2f6bcec995a2ec6d604f4bbbc14233338f930e39bb"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sp::structured_config_edit::key::parse (cognitive 25): corpus_sp::structured_config_edit::key::parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sp/src/structured_config_edit/key.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94d41b6334ff482f9f17979892d4fad2c6fac9d634f2676ecd9f935bd581e92"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerateContentDecoder::part (cognitive 25): GenerateContentDecoder::part has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/streaming.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67e1c0461cdbda2d456ed80fbe8e7293423b533ab72a96ec3e996131fb1587c"}},{"ruleId":"D2","level":"warning","message":{"text":"WireIds::for_target (cognitive 25): WireIds::for_target has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 4 (11 pts), loops 4 (8 pts), if/else 2 (6 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/rig-core/src/providers/internal/wire_ids.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a876304f4f5fe64468df150335b8506d0c0d5ee154f3e53d793dfec69bed1c6b"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_memory::conformance::races (cognitive 25): rig_memory::conformance::races has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (4 pts), match/switch 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/rig-memory/src/conformance.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"c724e7fa85d41abece0336ed5f218c046f79790195f52392015ba44b13997741"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_memory::rewrite::rewrite (cognitive 25): rig_memory::rewrite::rewrite has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 8, 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/rig-memory/src/rewrite.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a77cc46f86d11440adf8296c93a64ef2e6db73a3167a0d60c27b48d96dc155"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintPlugin::finish (cognitive 25): PrintPlugin::finish has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 4, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/print.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fece6499724a3e069111f74a8af396322960b68fb16decb8abd9e33628d1302"}},{"ruleId":"D2","level":"warning","message":{"text":"OAuthTransport::prepare (cognitive 25): OAuthTransport::prepare has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, loops 4 (5 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-claude-cloak/src/transport.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"0073b9a3c3c56d4b8b24bcda36f8e34dfd41f924fe69982d2974516066b95110"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_mcp_client::register (cognitive 25): rig_mcp_client::register has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (24 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":"plugins/rig-mcp-client/src/lib.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c4c2455fa3f996754f01c5dc119d6c09e60930a2b055a32eb6b2dde69f9698"}},{"ruleId":"D2","level":"warning","message":{"text":"Rewinder::rewind (cognitive 24): Rewinder::rewind has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 2 (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":"corpus/base/src/checkpoint_rewind.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9901af045cdba8b32b66531f60dcfd643385206caeb245473d0ec00bac7a09"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_base::tool_rate_limit::limit (cognitive 24): corpus_base::tool_rate_limit::limit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/tool_rate_limit.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfaa6b69671282ba7c9e14eac8b834570e4c3180d09d970c1f4a2eb7d1b997f"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ct::schema_adapter::schema::flatten (cognitive 24): corpus_ct::schema_adapter::schema::flatten has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (9 pts), loops 3 (7 pts), if/else 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":"corpus/ct/src/schema_adapter/schema.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa6f8bda0f1f7b8cd393e330cea7170b01c4ce913c298b7098a4d8492430573"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ho::stale_read_elision::elide (cognitive 24): corpus_ho::stale_read_elision::elide has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (6 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":"corpus/ho/src/stale_read_elision.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48eb978e8dba72025cdb0b608ef95d0c6ca88ae28160eb26e9efd6eb40d0c81"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::git_delta_context::annotate (cognitive 24): corpus_oc::git_delta_context::annotate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/oc/src/git_delta_context.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"68442449921f0da152871980d21b93ca5f804fa2c9c9c1c1a9e6043db9a8f7bc"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_rf_07::checkpoints (cognitive 24): corpus_rf_07::checkpoints has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (18 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":"corpus/rf-07/src/lib.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"8961df6d9645ab1d5107f19051597b7f7043a88cdce2fd49242d50c4e0c60621"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sp::inbox_folder::take_changes (cognitive 24): corpus_sp::inbox_folder::take_changes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sp/src/inbox_folder.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bcff64c69ffc36a22eae52f390b996f77dd207bcda11a00aebcb6988920d53"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_candle::protocol::render_qwen3 (cognitive 24): rig_candle::protocol::render_qwen3 has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (11 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/protocol.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed5aadf79cdb4fcf3bc548f91a4c28e1dea384e1e956df16afc0ee53c3f7e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatResponse::absorb (cognitive 24): ChatResponse::absorb has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 2, boolean chains 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/rig-core/src/providers/cohere/streaming/document.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f47d362ed027fb7e5beded5667b64d63c7a1adef94a37b4760023b82da4f0e"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::anthropic::completion::base (cognitive 24): rig_core::providers::anthropic::completion::base has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"488e1d13139ec4e899326a423596c85ca8bcef2803e2167911ab56bd074878cb"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::restore::restore_session (cognitive 24): rig_ecs::restore::restore_session has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 6 (8 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/restore.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00a816f705c7b8cb6369d2775df98624aab83a8a9f36d5f96cd68940610ba01"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::tools::keep_within_parents (cognitive 24): rig_ecs::tools::keep_within_parents has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/tools.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7270bc1fae90ee2b88114bd6396bc8c74b442bd5878cd020bc3d4a661bcc644"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::turn::take_unanswered (cognitive 24): rig_ecs::turn::take_unanswered has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (6 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/turn.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"1040a6fbd166462be7a0dbe284d81fde5bf274b4ca1a1300be5e966ba661467b"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tui::editor::draw_editors (cognitive 24): rig_tui::editor::draw_editors has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (9 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/editor.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"e593da4ac003f7539c4798db761b335352297e764ea2ed9ccbcdba83a4e75901"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ho::hunk_review::revert (cognitive 23): corpus_ho::hunk_review::revert has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 4, 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":"corpus/ho/src/hunk_review.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"468a5171e43f35cb9a3197eef0cb58ea3eac1efb54cbb3e03e9fbcb7482c9892"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ho::working_set_carryover::track (cognitive 23): corpus_ho::working_set_carryover::track has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (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":"corpus/ho/src/working_set_carryover.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc661c396e5e6b9197e1370d145292bcc9e517379201526a02726e112fa42453"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::dependency_guard::gate (cognitive 23): corpus_oc::dependency_guard::gate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/oc/src/dependency_guard.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"98def20fac5ea73638b89cc5e8a7a4608e549ca5ca5626b86d0a29d73d956e98"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::steer_and_queue::strip_keys (cognitive 23): corpus_oc::steer_and_queue::strip_keys has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 3 (6 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":"corpus/oc/src/steer_and_queue.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32b0a239944f581c626526b718903fb1d3e30b2e0fa8fde115e68d28689bea2"}},{"ruleId":"D2","level":"warning","message":{"text":"Screen::csi (cognitive 23): Screen::csi has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (10 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/terminal_sessions/screen.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafad7092f9b5671855ad56ef6223b2d19958309680832d7d8fdbe2b8e825390"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::untrusted_quarantine::scan (cognitive 23): corpus_sn::untrusted_quarantine::scan has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/untrusted_quarantine.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3feffef75b13a62584e97b23e832fe3c6a699b12befb4cb9f2a9fc7861c315eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Responses::base (cognitive 23): Responses::base has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, match/switch 3, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/responses_api/mod.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"a748bbdb7d2ffd9c768295d58c2661cafad737d04a5f8ff807cba3a4f304a316"}},{"ruleId":"D2","level":"warning","message":{"text":"Out::fragment (cognitive 23): Out::fragment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 4 (7 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/rig-core/src/operation/completion.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b170a3e102b31c95288213eebaa83b5a02b0d271190319778382763efe2fcb"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::completion::history::hosted_pairs (cognitive 23): rig_core::completion::history::hosted_pairs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/completion/history.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a44ee2f2836075f6fa645bd8dc53c811273c774ad4266e7cb1efbb626fdc6c"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_claude_cloak::transport::prefix_tools (cognitive 23): rig_claude_cloak::transport::prefix_tools has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (6 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":"plugins/rig-claude-cloak/src/transport.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6031300fc2059f72081bf17c0f6d0dbef74bae62ec749a5335d59e886cdc1b"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_claude_cloak::transport::normalize_messages (cognitive 23): rig_claude_cloak::transport::normalize_messages has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-claude-cloak/src/transport.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42427c43c52339c256309a3e473f65edba008381e3b82cefc0e48636edd6762"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_base::loop_breaker::judge (cognitive 22): corpus_base::loop_breaker::judge has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/loop_breaker.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f76445729e7a7049e2acb54c4084e71cffeaeb332d695a432f51944b34da137"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_base::session_replay::answer_from_record (cognitive 22): corpus_base::session_replay::answer_from_record has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/session_replay.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b01fc26fde16d76b62f5ab8453b382ef0b9cb32ebc980f57d86187704bfc19e"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ct::paste_chips::send_contents (cognitive 22): corpus_ct::paste_chips::send_contents has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts), match/switch 2 (5 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":"corpus/ct/src/paste_chips.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee7cf32a8bf16ea9fa79e1d7144327669bd17439e49e5a726c84e868c055912"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_fh::batch_provider::take_over (cognitive 22): corpus_fh::batch_provider::take_over has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/batch_provider.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8435cbaecd3f19a59367d633277cc348f1d114f819796534e0acd47c76cca7"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::dataset_cli::dataset::chat_messages (cognitive 22): corpus_oc::dataset_cli::dataset::chat_messages has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 3 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/oc/src/dataset_cli/dataset.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70310d58ba2002c976d5f58f84dea50ce973d804fa89ac86eb8ba43e4049522"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor::run (cognitive 22): Editor::run has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 5 (9 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/vim_input/editor.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b159fc82782c66f22d0d3adff1d8f0766e0471057500a1b57ef374a36906e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::glob_rules::deliver (cognitive 22): corpus_sn::glob_rules::deliver has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 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":"corpus/sn/src/glob_rules.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"517a5370f76a39a2d3ed8103bb26803b3a86481bcc29824cd3d42e4bda4ba715"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sp::inbox_folder::start_items (cognitive 22): corpus_sp::inbox_folder::start_items has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sp/src/inbox_folder.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbac4f5b721c505b220a15c731846e884077b8d9313825d557a5c91921784a8"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_candle::protocol::parse_qwen3_assistant (cognitive 22): rig_candle::protocol::parse_qwen3_assistant has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/protocol.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b250c3f188cb2d15bc6f83097b82c4f27e028740ec675c3ec59ef8b3d5a4b19"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeChat::assistant (cognitive 22): NativeChat::assistant has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 4 (9 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/cohere/chat.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"459c9a3c5ceee2080659e5e9df709f315c7e5f92d808632407e5af75531d148b"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractionsDecoder::delta (cognitive 22): InteractionsDecoder::delta has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 4 (7 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/interactions_api/streaming.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7d15009a30c4dac6af76a4ed7f95a97ca89987ff6e6f1fd49abecf77aa7470"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerateContentResponse::candidate (cognitive 22): GenerateContentResponse::candidate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (8 pts), loops 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/streaming/document.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ced431d7f253548da84516fa255c95767ad8b4961107daca0bf11c6a5f5d4a"}},{"ruleId":"D2","level":"warning","message":{"text":"Serving::serve (cognitive 22): Serving::serve has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (8 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/internal/auth/loopback.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd2679e99c23457ca7e1aebeddb35b4eed75c0934808cbe02a2011756de7073"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::openai::options::chat_options (cognitive 22): rig_core::providers::openai::options::chat_options has cognitive complexity 22 (threshold 15). Drivers by points: if/else 21, boolean chains 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/rig-core/src/providers/openai/options.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fd75a6e296ebd7b0ea7f373a599f2c4395eac7228f2876a909426edff60344"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::restore::carry_on_restored (cognitive 22): rig_ecs::restore::carry_on_restored has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts), match/switch 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/rig-ecs/src/restore.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad781580747bc482373d2da00b3af40263b8bf2feb8e05ee99b9f5d8f0133d4"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::turn::stream_partials (cognitive 22): rig_ecs::turn::stream_partials has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/turn.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"63831d0a33b70efc9adfdb844a102715840f43d3b94345832f1dd83237a76001"}},{"ruleId":"D2","level":"warning","message":{"text":"SseFramer::push_inner (cognitive 22): SseFramer::push_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-http/src/http_client/framing.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8278a16a133a7d1f32f68ed1c43f5089f1347f1f0d5f46fb9f908d9d72ff35"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tools::edit::around (cognitive 22): rig_tools::edit::around has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 3 (7 pts), loops 3 (4 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/rig-tools/src/edit.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"914ea90caf6ba012787a8d9c699705e36a637eca58dca8800cc1ba150b5b96ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner::run (cognitive 22): Runner::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (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":"plugins/rig-basics/src/helpers.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde369b611669093064518e07eee99d4ea7a9c6863093697aef75342177c2895"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor::layout (cognitive 22): Editor::layout has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (6 pts), boolean chains 3, 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":"plugins/rig-tui/src/editor.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"908699a84d7239349645d83fb2dacd09cae8a6f3806a59cb018eaf6c9e7f36cc"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::bevy::check (cognitive 22): xtask::bevy::check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/bevy.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f21d5f9ee87ae665649a295f82680013a975cf10cba49442987c5d8c1b20ec"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::catalog::validate_review (cognitive 22): xtask::catalog::validate_review has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/catalog.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d4f926bf528cf6f3e9e84ff4d72d72e06ac4b2ddef25c31ae9235699348e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"Cron::after (cognitive 21): Cron::after has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/cron_agent/schedule.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"874718e0cf3a148fe1158f2e01d0c437cc721c7910d47c7f137e4ab285753af4"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_base::debate::step (cognitive 21): corpus_base::debate::step has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 1 (2 pts), match/switch 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/debate.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"e060db01d918891fb92540cc32cf550977be7d0099b113a9958f09fb24e25c00"}},{"ruleId":"D2","level":"warning","message":{"text":"Repo::push (cognitive 21): Repo::push has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ct/src/git_guardrails/rules.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0534c0afd604a9b970fd340f5b3971c59f1b2aec5fd92d57607bf9290e55479"}},{"ruleId":"D2","level":"warning","message":{"text":"Index::update (cognitive 21): Index::update has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (5 pts), match/switch 2 (5 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":"corpus/ho/src/session_recall.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb80f4aacb886a23713f5feccdcb077f22a837047d0bdbaea2344811bbc6de9"}},{"ruleId":"D2","level":"warning","message":{"text":"Markdown::start (cognitive 21): Markdown::start has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/web_fetch/markdown.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2ea324d0ec3f42a3a3c8fe3bcc32d6babfdf3dca2135f50ed3c58eec66f86d"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::tool_stats::work (cognitive 21): corpus_sn::tool_stats::work has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 3 (9 pts), loops 3 (7 pts), if/else 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":"corpus/sn/src/tool_stats.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"89255d36eb3fd5c1fc473065a34a68db402fa95ce197d487798cff11681277de"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::vim_input::editor::parse (cognitive 21): corpus_sn::vim_input::editor::parse has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 7 (14 pts), if/else 6 (7 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":"corpus/sn/src/vim_input/editor.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfc51ef34d92a24e6118b51a747b7c4dbb1583653d9159ecbc43f421c827462"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cli::project::manifest (cognitive 21): rig_cli::project::manifest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cli/src/project.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef2f6e43c85c0102e0ca0cffe0be76e5ecebdff778a55b854fe1e7405b506ca"}},{"ruleId":"D2","level":"warning","message":{"text":"Caching::send (cognitive 21): Caching::send has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, match/switch 3, 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/rig-core/src/client/gemini_caching.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91a26f5ba94296224cae488862a676af18b1ba30643935024e6864335c2c922"}},{"ruleId":"D2","level":"warning","message":{"text":"CacheBook::plan (cognitive 21): CacheBook::plan has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 9, 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/rig-core/src/providers/gemini/caching.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"39780ff5dbb0e6e2af322e84ad90e52911c1afb790beb3e0f9bcfd302dc8949e"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_claude_cloak::transport::first_user_text (cognitive 21): rig_claude_cloak::transport::first_user_text has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-claude-cloak/src/transport.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae598eda0e33370659fe55599eb1863329fa8477a18f2ca19369969b8db787c9"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_mcp_client::unreached (cognitive 21): rig_mcp_client::unreached has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-mcp-client/src/lib.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2aa7d6a69555594a70a7a65964479a01d03b187b6119868e59b273daa6f869a"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tui::render::light_line (cognitive 21): rig_tui::render::light_line has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 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":"plugins/rig-tui/src/render.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"68685c5ac12a2ff7a65d0aa2088d6c9bbdbff59371610ea31e1fa294c27a5774"}},{"ruleId":"D2","level":"warning","message":{"text":"Repo::commit (cognitive 20): Repo::commit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 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":"corpus/ct/src/git_guardrails/rules.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26de92a005c3d24c95f8b066d5b510de88efb47c0dd6ff6d897d2633dba6d1e"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ct::conversation_chapters::fold_in_requests (cognitive 20): corpus_ct::conversation_chapters::fold_in_requests has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ct/src/conversation_chapters.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78054ec45be5b23c540c5c18fdc08a2230a5a0d6daaa7be70b70b728163742f"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_fh::import_sessions::parse::codex (cognitive 20): corpus_fh::import_sessions::parse::codex has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 2 (6 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":"corpus/fh/src/import_sessions/parse.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ee048f5c4ab88c040ecca8696a308e9c189b49e64907bb9b41ce6fdcf0132d"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_fh::rich_tool_rendering::highlight::spans (cognitive 20): corpus_fh::rich_tool_rendering::highlight::spans has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, match/switch 2 (5 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/rich_tool_rendering/highlight.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab25d862759202cf1fa6a8f155d422d5a2aa0381179e531b94f76e30a2f71326"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_fh::step_mode::answered (cognitive 20): corpus_fh::step_mode::answered has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 3 (9 pts), 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":"corpus/fh/src/step_mode.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae3b1c053bad9fdffccb409074bf79b1d872e726396eae87462ce93d75d52bd"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ho::hunk_review::review (cognitive 20): corpus_ho::hunk_review::review has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4 (8 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ho/src/hunk_review.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e85c2a67005c3dc255a493143ce3cfb98fc5f998dbb05c551d31a11b570fdc3"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_library::session_compare_library::excerpt (cognitive 20): corpus_library::session_compare_library::excerpt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (8 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/library/src/session_compare_library.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e24470ff720c834682311bc55d9d5919b55c38b9a7570b608633f6002be395"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::dataset_cli::dataset::session_lines (cognitive 20): corpus_oc::dataset_cli::dataset::session_lines 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":"corpus/oc/src/dataset_cli/dataset.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd343afd3ac0e1859dee0c3ce63091e326ab1db5b84ecce12c524b80c4f31200"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::model_params::put (cognitive 20): corpus_sn::model_params::put has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (7 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":"corpus/sn/src/model_params.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d637e4db15e87495ada9f1777984a44ee1b2ba762182af90e80b1c70f4fbda"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::race_models::drop_out (cognitive 20): corpus_sn::race_models::drop_out has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 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":"corpus/sn/src/race_models.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd05e4960c1c4e4804d54028b9aab551d240062dfb7f1085e614ae82208439fc"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sp::structured_config_edit::yaml::key_of (cognitive 20): corpus_sp::structured_config_edit::yaml::key_of has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 5, loops 2 (4 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":"corpus/sp/src/structured_config_edit/yaml.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ce2a1d763fc13b07cf885165eee47c0394c2595a030d7bae45c9781541f445"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::encode (cognitive 20): Writer::encode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 5 (7 pts), loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/effect_log/jsonl.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"796fd8eacf7e2eca35a4b328501b864aa4adc14515dc8b10f6f3d04fa1fc39f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Scrubber::learn_body_parts (cognitive 20): Scrubber::learn_body_parts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 pts), match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/scrub.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9da9ddf83c90bd455921512cdf40c128f9e1e416aab7757debaf8e0c5928a16"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cassette::http::proxy::drained (cognitive 20): rig_cassette::http::proxy::drained has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/http/proxy.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a6873a99cd043af29ab3da1de3b19d56d19b8290d11ad571ef9d30b8eafd79"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cassette::scrub::mask_form_value (cognitive 20): rig_cassette::scrub::mask_form_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/scrub.rs"},"region":{"startLine":2421}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f4f53fc235291599b12f1619c56093ffcb9dd6676d09ca0564d3420d30d952"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractionsDecoder::decode (cognitive 20): InteractionsDecoder::decode has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 4 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/interactions_api/streaming.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5ff897ceec2df0c7d8b131b709325fc671b6f8682a721eebc8d26b7e7b6824"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponsesDecoder::done (cognitive 20): ResponsesDecoder::done has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, 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/rig-core/src/providers/openai/responses_api/streaming.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22b92515d17ed64f65391838543ca4eb55c25f2dddb34376558413a0f40ed55"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::json_utils::parse_partial_object (cognitive 20): rig_core::json_utils::parse_partial_object has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 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/rig-core/src/json_utils.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b76c03e20706b59579b9dff780c349b96990f8d5275b1f4ce85d144bf2bc017"}},{"ruleId":"D2","level":"warning","message":{"text":"QdrantFilter::interpret::to_condition (cognitive 20): QdrantFilter::interpret::to_condition has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-qdrant/src/filter.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0d9dd10d40bce1567df6d12f3f623b5477208a79a05bee49c899a90177015c"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_basics::reload::rebuild::drain_reload (cognitive 20): rig_basics::reload::rebuild::drain_reload has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 5 (8 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/reload/rebuild.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5521dae69fe3ed8d0d1629e070301c27313053b3f9f5287d63cbeb3b6fc7b18c"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_basics::telemetry::usage::usage (cognitive 20): rig_basics::telemetry::usage::usage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 4, 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":"plugins/rig-basics/src/telemetry/usage.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"b634535d814a398b6894b805a3492f188db3bec078d28fe4a94272876cb83e69"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_claude_cloak::schema::normalize_tools (cognitive 20): rig_claude_cloak::schema::normalize_tools has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-claude-cloak/src/schema.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0c739ebd24e7eb633c5abe6586847acdf141816753c6085af2ad9333c926e2"}},{"ruleId":"D2","level":"warning","message":{"text":"Transcript::update (cognitive 20): Transcript::update has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, loops 2 (3 pts), match/switch 2 (3 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":"plugins/rig-tui/src/transcript.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e9c44660fa15e4891905a5e396994c93d26fe1d1d0147c5deeab1dc2fe02a3"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tui::input::run_keys (cognitive 20): rig_tui::input::run_keys has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 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":"plugins/rig-tui/src/input.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcffa8a7fefaa7c59aeda4fd19fdbfca6080a72709f149902baf2c4bc922821"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tui::pick::queue_choices (cognitive 20): rig_tui::pick::queue_choices has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/pick.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84333f7155b4437e9a302c282b7442265713776f1713c97a749afdfa53bb6b2"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::cassette::scan::key_shape (cognitive 20): xtask::cassette::scan::key_shape has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, if/else 9. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/cassette/scan.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"29294a7d9663075ba62649aa1a4f18fffe154d2fb28ea5eea04e0d922067d1a2"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::cassette::shapes::walk_facts (cognitive 20): xtask::cassette::shapes::walk_facts has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), match/switch 3 (7 pts), if/else 1 (3 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/cassette/shapes.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1a9ccc4f2e9980d7dc6a4655a1798c137e2b47f04299dfae3f2705af5d1158"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::catalog::guard::changes (cognitive 20): xtask::catalog::guard::changes has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 6 (8 pts), loops 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/catalog/guard.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"661c046b51553512b8bb1b549948e7e9ebd9e268b1c9b2b3471fe827be0de858"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_base::long_term_memory::recall (cognitive 19): corpus_base::long_term_memory::recall has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/long_term_memory.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"859ce66a2e8f6818f0e13a94f2a4f52014a15b95ea315ceecf8f180ff7b07af5"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_base::summarize_tool_output::summarize (cognitive 19): corpus_base::summarize_tool_output::summarize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/summarize_tool_output.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba3bb8bd927f25099392ee95cf5d69573704d9b8d47a7446d5647d1356e75b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Registry::render (cognitive 19): Registry::render has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (8 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ct/src/metrics_endpoint/registry.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58c2e1530bb0d7a8ce46a2d0b6c564e6f52f7ca4260ea91bba69af92752fb51"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ct::reply_review_comments::comment (cognitive 19): corpus_ct::reply_review_comments::comment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 4, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ct/src/reply_review_comments.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbbb6efde035fb81628c38a67ca6a37f061001c590181221d18974a12cd4622"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_fh::lsp_tools::client::read_message (cognitive 19): corpus_fh::lsp_tools::client::read_message has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 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":"corpus/fh/src/lsp_tools/client.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"950d7c9b318eb70c881b552659ac9b8cbd370a9634e865b055e2446d2393a7d1"}},{"ruleId":"D2","level":"warning","message":{"text":"Pty::wait (cognitive 19): Pty::wait has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/terminal_sessions/pty.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f202928cf3ca48af8ee5774798f0e413603c56d9ce4cf50cd93aec92bcebfe0"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::file_annotations::annotate_reads (cognitive 19): corpus_sn::file_annotations::annotate_reads has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/file_annotations.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f96173f2bfcb0cc3b01c3fe68d5cf929fd867846be7869deba9c2b9a8c0b1cf"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::web_fetch::answered (cognitive 19): corpus_sn::web_fetch::answered 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":"corpus/sn/src/web_fetch.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fee04933a3d3ebd7b3b0715f433263830589f4c65c8929c51b9cd7aec7f87c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::value (cognitive 19): Parser::value has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (8 pts), match/switch 3 (6 pts), if/else 2 (4 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sp/src/structured_config_edit/json.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d3b948a88f6d35822dc6e341951ff553e20a15af3b512c4e009939b800f8c0"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_agent::run::prepare::prepare_request (cognitive 19): rig_agent::run::prepare::prepare_request has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, match/switch 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/run/prepare.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"886cf1670fbd47ffa2f9709904fb9409f0f08041f2b9d5ed411a5b4434d84053"}},{"ruleId":"D2","level":"warning","message":{"text":"Scrubber::learn_header (cognitive 19): Scrubber::learn_header has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/scrub.rs"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5173cecca933c15d8cf75a060ce3ac1024d41c51a56f7cff234ee41c9e8e2579"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cassette::scrub::scrub_query_params_in_text (cognitive 19): rig_cassette::scrub::scrub_query_params_in_text has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, 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/rig-cassette/src/scrub.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9c7ac032e74a8d8c9300424ec92217c51a956054b40559601e1b915b0853c3"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cli::plugin::listing (cognitive 19): rig_cli::plugin::listing has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cli/src/plugin.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"21855746bce614d7ed5837ca3a29ebfd0e11e0a9f9283d01e83579d52601398a"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractionsDecoder::stop (cognitive 19): InteractionsDecoder::stop has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/interactions_api/streaming.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08b0f989e4d8de7bba5999eef1b3d3801ac94d5eae554750ccc296a52391326"}},{"ruleId":"D2","level":"warning","message":{"text":"Validator::check (cognitive 19): Validator::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, match/switch 3 (4 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/tool/validate.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"086d0f0a171e95214570be36ce7629249c991fc316ec0565f8cfd76199cfced6"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::completion::options::merge::apply (cognitive 19): rig_core::completion::options::merge::apply has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 1 (2 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/rig-core/src/completion/options/merge.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb63ce35eada4e01780547f11344bb9952ae0e597b46c81ef4f6a0a90d5bee20"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::openai::wire::chat::document::merge_call (cognitive 19): rig_core::providers::openai::wire::chat::document::merge_call has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, match/switch 3 (5 pts), 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/rig-core/src/providers/openai/wire/chat/document.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e203e59871d550e028780e5712117699e9d1b1a65b22d8727fa5b983b49b84a1"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_memory::rewrite::map_state (cognitive 19): rig_memory::rewrite::map_state has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-memory/src/rewrite.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"de62fdd5949cd41655a5a0fd91c4d34d9b77e429da527699588e45710d533094"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tools::attach::attachments (cognitive 19): rig_tools::attach::attachments has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-tools/src/attach.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"19af75a189a7a872e5da573fea73559713d9f67f0b0fe713599dea7442e41dec"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_typesafeai::questions::validate_definition (cognitive 19): rig_typesafeai::questions::validate_definition has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-typesafeai/src/questions.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da4e519a37d73649f69079367225915f443ec88eaf09e5d8b17036cc99c4345"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_vertexai::types::completion_response::rest_chunk (cognitive 19): rig_vertexai::types::completion_response::rest_chunk has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (8 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/rig-vertexai/src/types/completion_response.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26c1b77a28fa142155ebb3744f2271dfc31ccdfb228c35ef3375a629ce3f426"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_basics::redact::redact_parts (cognitive 19): rig_basics::redact::redact_parts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 3 (9 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/redact.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9563718e09d10066641bb70ad1cdb948738cd74f11c68daf9fe80c6b1f014cf"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tui::terminal::run_in_terminal (cognitive 19): rig_tui::terminal::run_in_terminal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/terminal.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"238c057bce6c0a13a2c3d031ef0f555cd2df76817b2072df19fff1ea74ea5e93"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::record_one (cognitive 19): Session::record_one has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 3 (4 pts), boolean chains 1, 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":"xtask/src/cassette/record.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5cfac609c9d3905f3357b80cf0f0f49603f417ca89308b65264d5dc79155c4"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::cassette::spend::spend (cognitive 19): xtask::cassette::spend::spend has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 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":"xtask/src/cassette/spend.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"473d0fd7dd550d5286aa7b3ad9855d42eec7d6284bbf46f34fc1890194961f07"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ho::dry_run::dry_run (cognitive 18): corpus_ho::dry_run::dry_run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ho/src/dry_run.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c2828eee0284565e2e8cae16463fb73b600b44ac5a6fcb3844a8a183534110"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ho::stale_read_elision::stubs (cognitive 18): corpus_ho::stale_read_elision::stubs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (7 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":"corpus/ho/src/stale_read_elision.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"587685047401f46e6ee71b7ac169b77d1503e51f172d713b77c3cbbc96cafb2e"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::architect_editor::report (cognitive 18): corpus_oc::architect_editor::report has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (7 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/oc/src/architect_editor.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3be512232f54a75d94386de3cadd4da8edb5f05014056f81d9bc5513df7795"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::reviewable_compaction::uncompact (cognitive 18): corpus_oc::reviewable_compaction::uncompact has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 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":"corpus/oc/src/reviewable_compaction.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4ba6598f2764725a6a3edcc136f571ab36b48206a9ad7cde8bd8edb77fcb19"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::transcript_in_editor::finish (cognitive 18): corpus_oc::transcript_in_editor::finish has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/oc/src/transcript_in_editor.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bf662e24d8758f13d4bb448857cd827a0b40f4c3bd9acb7fd03705a991955f"}},{"ruleId":"D2","level":"warning","message":{"text":"Report::collect (cognitive 18): Report::collect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/usage_report_cli/report.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c55e10bf27e6d50e8df4ffc845d26263d8633503e2f8105d7d2b607b52a91ce"}},{"ruleId":"D2","level":"warning","message":{"text":"Markdown::end (cognitive 18): Markdown::end has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/web_fetch/markdown.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb1a9922167a6d8927ea3796576a29ad04f08c85be9a61712877ecaaffcefd6"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::plugin_profiler::frame_ended (cognitive 18): corpus_sn::plugin_profiler::frame_ended has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/plugin_profiler.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40796795dc1e71e519bf3f30cb8b5ea512338f5e42f4dd74c736205ce07e549"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cassette::scrub::url_spans (cognitive 18): rig_cassette::scrub::url_spans has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/scrub.rs"},"region":{"startLine":2516}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a52356e20f6126ca0686ddb923ea1abe92e6c5303f95ec5a886edef7ceb4f34"}},{"ruleId":"D2","level":"warning","message":{"text":"Catalog::from_models_dev (cognitive 18): Catalog::from_models_dev has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/catalog/read.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f581cdb69eb58b57fe2a2585ecfd5564df8a9dc9d690c05bf75c2348bce87467"}},{"ruleId":"D2","level":"warning","message":{"text":"MessagesDecoder::delta (cognitive 18): MessagesDecoder::delta has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/streaming.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c61d37edb59af6f20a1876ddb3f08eecb516064dbdb852ee3f17290a95f32b2"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::anthropic::completion::merge_all_of (cognitive 18): rig_core::providers::anthropic::completion::merge_all_of has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"a166a098463a94f8ada52258e3ad72535d7b9f01718b913e8b75eaad5be23901"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::turn::commit_turn_calls (cognitive 18): rig_ecs::turn::commit_turn_calls has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (7 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/rig-ecs/src/turn.rs"},"region":{"startLine":1658}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb246dbd8d07751a8a843a6bf5d227a387e4c97cc60b4c8cc981b59b24be25e"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::turn::commit_replies (cognitive 18): rig_ecs::turn::commit_replies has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/turn.rs"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"339621b072949d0b3279c28ccaab1b1a12da31f4cdaf0b171362bdb465f2ae27"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::end (cognitive 18): Writer::end has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-markdown/src/markdown.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f30bf64d4cc91092a82abe51095f81e689b29eb267832f9329fe08bc5e8afd"}},{"ruleId":"D2","level":"warning","message":{"text":"Kept::text (cognitive 18): Kept::text has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (7 pts), boolean chains 1, 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/rig-tools/src/shell.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc012086ed2346257eacb5ed10893709faaa2b0de3eaf7466d734ce6883310f"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_basics::coding_tools::attach (cognitive 18): rig_basics::coding_tools::attach has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/coding_tools.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6205052b0bcf2485ffa509b4c5f11eddf7307d1137786686e15badc0e11aae"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_basics::subagents::spawn::spawn_requested (cognitive 18): rig_basics::subagents::spawn::spawn_requested has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, match/switch 4, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/subagents/spawn.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9525c19892f46d9d5dd9be86bc9575e5c8322b761ad7f1a592a9f14daf7067a"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tui::diff::changed_words (cognitive 18): rig_tui::diff::changed_words has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), match/switch 1 (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":"plugins/rig-tui/src/diff.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cef9fc15dbf7ca5ed88766c20d59f94d82888d4adb4bf28fe323d79ebed951"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolve::feature (cognitive 18): Resolve::feature has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/verify/graph.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d05c37990edb011d4f8251f2b2e9a670d6674d32d20852f58bd8ae647c29a39"}},{"ruleId":"D2","level":"warning","message":{"text":"Guard::visit_expr_call (cognitive 18): Guard::visit_expr_call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/verify/guards.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c086dee9d3add3d0cdd900acde6911ad702f70ab12ae66a19e286331e07e6b3"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::cassette::record::run (cognitive 18): xtask::cassette::record::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/cassette/record.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"3570041b7b8045cdca10f81c6fb7d5f1b1707f5ffdb48508721cd0d675afc0ff"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::catalog::guard::provenance (cognitive 18): xtask::catalog::guard::provenance has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (10 pts), loops 4 (5 pts), if/else 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/catalog/guard.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac60f9a9279e7f6060e07a07273b9563610d71a5b3b32b412937570b0040e56"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::verify::execute::run (cognitive 18): xtask::verify::execute::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/verify/execute.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab358b96e6db470ab3f44905f783cb8bb0f52983e7ff8e6dbe9e162921e72b0d"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_base::http_api::server::read_request (cognitive 17): corpus_base::http_api::server::read_request has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/http_api/server.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4bfcf36819a6686590057423bfe25d15a50db641296d1ad330e18f741addca"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_base::share::render::render (cognitive 17): corpus_base::share::render::render has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (10 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/share/render.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6fd742819811a45dda3c4a037689e7b1ad9abf1f034371f062d46961dc1b22"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ct::process_reaper::after_turn (cognitive 17): corpus_ct::process_reaper::after_turn 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":"corpus/ct/src/process_reaper.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"542ea591ae2652e1c32d8a68131c5c61cc5ca8b59d3a095aea560809bf0801a7"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ct::shell_companion::settled (cognitive 17): corpus_ct::shell_companion::settled has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 6, loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ct/src/shell_companion.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56d05895b7372dcd329a790138e8f9507b1e8a739af1cf428f0c6bf743fc7dd"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_fh::apply_patch_tool::patch::apply (cognitive 17): corpus_fh::apply_patch_tool::patch::apply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 3 (7 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":"corpus/fh/src/apply_patch_tool/patch.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9b7ab8479baaa62684f9af28db47df45d4694671bcc6ad695242b9b3ca6b5d"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_fh::structured_compaction::structure (cognitive 17): corpus_fh::structured_compaction::structure has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 3 (8 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":"corpus/fh/src/structured_compaction.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"731cb489fc7eba983cb05e89bd6f9f1be40ba01ed735ca4e087bca07637746a1"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ho::conversation_surgery::plan_drop (cognitive 17): corpus_ho::conversation_surgery::plan_drop has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 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":"corpus/ho/src/conversation_surgery.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0742dda08e64f5d79c05502e39e2108be0a397d4e885edffe04bb2e582b544"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ho::submit_result::judge (cognitive 17): corpus_ho::submit_result::judge has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ho/src/submit_result.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"a703af1a8c095ec95e882cbf43ed4a5ae551c717824fa9f851132d8049341305"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::auto_continue::join (cognitive 17): corpus_oc::auto_continue::join has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), match/switch 3 (6 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":"corpus/oc/src/auto_continue.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf500ad01f3e1c617eaaee99a06f16dfc5ec0a2ff4a161cb3a223df6657679e2"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::dependency_guard::answered (cognitive 17): corpus_oc::dependency_guard::answered has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (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":"corpus/oc/src/dependency_guard.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f73ee3b94fae9e611160492fe11d2b4f35b1938886b5cb451d500fab5dfe0b9"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::line_provenance::provenance (cognitive 17): corpus_oc::line_provenance::provenance has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/oc/src/line_provenance.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f21759a781677efd0d4e1a5c7537738af1ac6a910b0db20a38db6a9a4285ea"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::transcript_in_editor::edit_history (cognitive 17): corpus_oc::transcript_in_editor::edit_history has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/oc/src/transcript_in_editor.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5846ee6087b4d65e2f04c73029386e8aa44749ae93dc9d1c28be99af76f425a"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::leftover_detector::snapshot (cognitive 17): corpus_sn::leftover_detector::snapshot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 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":"corpus/sn/src/leftover_detector.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7863470fe042da504f7d612c1a61dd5b9c697153a7459ffc4c6b78e452d21d4"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::model_params::check (cognitive 17): corpus_sn::model_params::check has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 3 (6 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":"corpus/sn/src/model_params.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a437b9df37adc1d4680416470a675390be15b3b5de34101d6b615c8ebacff80"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sn::race_models::list_errors (cognitive 17): corpus_sn::race_models::list_errors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/race_models.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2e20738c97cf3ffe6cd71396bc37d21029000348594f6cb7116512e9566e95"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sp::output_styles::read_styles (cognitive 17): corpus_sp::output_styles::read_styles has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 2 (7 pts), if/else 2 (6 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":"corpus/sp/src/output_styles.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d0044482c28530a8d8bf8f9d575b7a49484e08d64095c5d7d361e4abfed85e"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_candle::validation::validate_model_config (cognitive 17): rig_candle::validation::validate_model_config has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/validation.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd305ac74029bc0c7a4193e75b744fded9851e74efe54ca7214ad49f77f3516"}},{"ruleId":"D2","level":"warning","message":{"text":"Plan::of (cognitive 17): Plan::of has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 3 (8 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/rig-cassette/src/effect_log/jsonl.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a090b1e321c0772bd907fed9e209121ac0ccd33eb245285e7d0afd498a1d14"}},{"ruleId":"D2","level":"warning","message":{"text":"Scrubber::scrub_text (cognitive 17): Scrubber::scrub_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/scrub.rs"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"add122db0f640a5ad4ab4472c6155d42c8f816b6e5ba0d6259a26259ac8b5175"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cassette::http::snapshot::apply_change (cognitive 17): rig_cassette::http::snapshot::apply_change has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 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/rig-cassette/src/http/snapshot.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"98db84f9e690952a1c1f0f2fc5c3a136d5647f92aaa9da57ec622cc018d0ceb1"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cassette::scrub::parse_sse_chunks (cognitive 17): rig_cassette::scrub::parse_sse_chunks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/scrub.rs"},"region":{"startLine":2729}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef897166729ca7c152f0068a438bff2924e80fdd476cd0da1fa47c230e185f2"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cli::run::unfollowed (cognitive 17): rig_cli::run::unfollowed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cli/src/run.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9dac8e6025678275b1a54c4b0dce77690626e7800bf5c52f462ba76e307572"}},{"ruleId":"D2","level":"warning","message":{"text":"StripXmlProcessor::process (cognitive 17): StripXmlProcessor::process has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/loaders/epub/text_processors.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11a1d90c7d8e701c9f2132b2d0fe233d40d3f492afabdd00d6da53916f244ad"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplyFold::settle (cognitive 17): ReplyFold::settle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/operation/completion.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba7ba13cfe282b3249d37f35891da500d5d3cf0c39c594b376ecc0bf5623717"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatDecoder::close_calls (cognitive 17): ChatDecoder::close_calls has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, 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/rig-core/src/providers/openai/wire/chat.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"912c7f1973a366f24871ffe446840bf447d6976a57be74ac7999b402a80f8d78"}},{"ruleId":"D2","level":"warning","message":{"text":"Layer::serve (cognitive 17): Layer::serve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/serve/layer.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44846c0628019a8d82847eb300bb7eb13cf155126d3d1f11e7c450a46a5fa05"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamRecord::push (cognitive 17): StreamRecord::push has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (8 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/rig-core/src/streaming/event.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"320a7566a5b0ccab820ad97a6d0d7791b18d99881ac087e984f4232d71196d2f"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::completion::history::adapt_for (cognitive 17): rig_core::completion::history::adapt_for has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, match/switch 2 (4 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/completion/history.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baec84ac64dd15a5edc0bec78fb54517cda8d52e065eb67e091c11824b0c8b2"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::completion::history::settled (cognitive 17): rig_core::completion::history::settled has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (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/rig-core/src/completion/history.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b32fcf517305c3bfe3a681906e22becec30d7f8ee046401bffaa66112614c0"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::openai::wire::chat::rewrite_body (cognitive 17): rig_core::providers::openai::wire::chat::rewrite_body has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/wire/chat.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac645af73b4aedf14541b14c1cc5e354c7cc13f3eeb8bdbe3a87fc01d49b9995"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::turn::wait_in_order (cognitive 17): rig_ecs::turn::wait_in_order has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 1 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/turn.rs"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a29a6a53e255e4f638701a846db7b5f0d7c9854d21788de4bfe00582837b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_harness_protocol::config::changes (cognitive 17): rig_harness_protocol::config::changes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-harness-protocol/src/config.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04950eb008ddec6081f9af93b4e67f85472f54845116c3041f47b3a4bd9b0e8"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_markdown::markdown::table::records (cognitive 17): rig_markdown::markdown::table::records has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 3 (6 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-markdown/src/markdown/table.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"364be45578e8cbe3a752fae82903d79821f63db15ed19d8adbe66baff5557363"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_typesafeai::questions::validate (cognitive 17): rig_typesafeai::questions::validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-typesafeai/src/questions.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c45ee7f9ef7f401d57898737de6847246547fd49f04b2688fbc704533562ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Secrets::request_once (cognitive 17): Secrets::request_once has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (5 pts), loops 3 (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":"plugins/rig-basics/src/redact.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc7457f3785955f499e59ca8d53913be7e632f952dfe99b2a7b6516e2ccf6ba"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_basics::compaction::recover_from_overflow (cognitive 17): rig_basics::compaction::recover_from_overflow has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/compaction.rs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"485a94ec4f4b8eb4c1754a0d3aa1d5ac3a255f9f7195d8baf76d8b7cbb166296"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tui::render::draw_choice (cognitive 17): rig_tui::render::draw_choice has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 4 (5 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":"plugins/rig-tui/src/render.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"d740b54b850f425ad19ebd093ff3bfd326f4740920eba52d85c4694f98d34b07"}},{"ruleId":"D2","level":"warning","message":{"text":"Template::expand (cognitive 16): Template::expand has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/prompt_templates.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c367dbf3aa471f2d4946be178e9c9e9b5344eec7aefc03422154c493e90a59"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_base::context_inspector::report (cognitive 16): corpus_base::context_inspector::report has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (5 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":"corpus/base/src/context_inspector.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"630adaaa2952dae9ed3c4814d1bd2a3f1c83c20fe9587a68108a7a06cea939cc"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_base::supervisor::count_calls (cognitive 16): corpus_base::supervisor::count_calls has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/supervisor.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec63a2a795ae82f25f4ab6b20fbe23703d441dc3b348bec8c143fb263a2cf93a"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ct::provider_side_tools::note_provider_runs (cognitive 16): corpus_ct::provider_side_tools::note_provider_runs 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":"corpus/ct/src/provider_side_tools.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c4e6bf7d56110f906781ea59815c3b1d19d69fbf88c29e9c64293c2371ad4d"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner::steps (cognitive 16): Runner::steps has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/open_pr.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dae61219154785ccff7dadda8c604089ab54bc7cabce99f2725739a124b1c6"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_fh::early_tool_start::adopt (cognitive 16): corpus_fh::early_tool_start::adopt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/early_tool_start.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"705368d6f786d73b7dfcd9a9be0353938d94732da136bab9a7a5eafb912639a0"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_fh::prompt_cache_shaping::first_change (cognitive 16): corpus_fh::prompt_cache_shaping::first_change has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/prompt_cache_shaping.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd1f6558f7b123a380ed20dd71d465b54cb5199e98ac1cba0351fc10504f0a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Rotating::send_keyed (cognitive 16): Rotating::send_keyed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ho/src/api_key_pool.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e68e169ca80c47964a2f79d9f1ef2c10a5bd75e2cbac94b8253b8c6b0281c4"}},{"ruleId":"D2","level":"warning","message":{"text":"Index::search (cognitive 16): Index::search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ho/src/session_recall.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab25235e98fa55a367e467d297fbf1c0b6b1dabe4bb9e5a7ad01d234e9d95f55"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_ho::dry_run::preview (cognitive 16): corpus_ho::dry_run::preview has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (4 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":"corpus/ho/src/dry_run.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bc2a66d00c1bbbfbd71662e6e6471c662d4b926189be149fb912282ff685dc"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_library::session_compare_library::render (cognitive 16): corpus_library::session_compare_library::render has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (4 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/library/src/session_compare_library.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be2fe9869df5d7af97f71c489512762c84c4178414099a026c09806c6de160b"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_library::session_edit_library::save (cognitive 16): corpus_library::session_edit_library::save has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 4 (6 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":"corpus/library/src/session_edit_library.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5794cb5a97d60f45060499810e6fb27514bc5e67fdafda179d50280539290a"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_oc::auto_continue::add_partial (cognitive 16): corpus_oc::auto_continue::add_partial has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/oc/src/auto_continue.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1d54a0320f6aac134310721f0b8fa99da82cca743b8504f2d0bf4f529b4cc5"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor::operate (cognitive 16): Editor::operate has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 2 (3 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/vim_input/editor.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efb6740f3f0f9efefdea805e5571293df33a68a319beda0aefd442f001f381f"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sp::shell_env_policy::referenced (cognitive 16): corpus_sp::shell_env_policy::referenced has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (7 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":"corpus/sp/src/shell_env_policy.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e245899420bc71d3e1076816ed15f7859d4c4d0fe1c6bf28940ea2f744c0948"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_sp::subagent_result_cache::watch_effect (cognitive 16): corpus_sp::subagent_result_cache::watch_effect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sp/src/subagent_result_cache.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1669f985895cc408849638fffa166f32d104c089655edfbeabe5614901e68ba8"}},{"ruleId":"D2","level":"warning","message":{"text":"UnaryTurnSource::run_model_turn (cognitive 16): UnaryTurnSource::run_model_turn has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (13 pts), boolean chains 1, if/else 1, loops 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/agent/engine.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e33c149c5ac9bd535b73d1ba5cdd7c196d2021dd85e48d5671e5677b2e4d39"}},{"ruleId":"D2","level":"warning","message":{"text":"Known::restore (cognitive 16): Known::restore has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/effect_log/jsonl.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d93dc726c75af0473b3e8a290938329d4d896be888fe226ef3f05f058aebde"}},{"ruleId":"D2","level":"warning","message":{"text":"EffectLogReplayer::check_header (cognitive 16): EffectLogReplayer::check_header has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, loops 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/effect_log/replay.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"8799152f6dc3e149926c63e095c5b47c951e89869e90cbf5b0a455e09e4e6777"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cassette::http::ledger::clean_up (cognitive 16): rig_cassette::http::ledger::clean_up has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/http/ledger.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"df97544294e916e4d5387aa5996e2dc5ab65884d3c03242de4a9d4508c4d2c41"}},{"ruleId":"D2","level":"warning","message":{"text":"Message::message_delta (cognitive 16): Message::message_delta has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/streaming/document.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcb4d7f3e6a98f69cff52de1a28a1ae48ce89ed6a4ba0d880753ffe69b4e5a9"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerateContentDecoder::decode (cognitive 16): GenerateContentDecoder::decode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, match/switch 5, boolean chains 2, loops 1 (2 pts) (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/streaming.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b25984fdb63dc578b177ce9d033706568cb70b15f91d5f245dc9dbb2c97a94e"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponsesDecoder::finish (cognitive 16): ResponsesDecoder::finish has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (3 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/rig-core/src/providers/openai/responses_api/streaming.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a1fed4b9bb783038c940dcfb9293998aeb95c031417f50f678e51d04d05910"}},{"ruleId":"D2","level":"warning","message":{"text":"FileChange::after_text (cognitive 16): FileChange::after_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/tool/facts.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31515845dffeeab5da390a46d9b567dbcefa975dca7c1f2c12c85a9e5302404"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::completion::history::paired (cognitive 16): rig_core::completion::history::paired has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (6 pts), loops 2, match/switch 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/completion/history.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"20aa6628d7b4e0d3096f1713ca5e71aceb781d4571af284c0fd76befa1a51811"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::completion::options::merge::placed (cognitive 16): rig_core::completion::options::merge::placed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/completion/options/merge.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"c871dc0ad646b767464b31efbf6a849fece537df7b15cf1e928acabbcfa22b4e"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::completion::options::merge::request_params (cognitive 16): rig_core::completion::options::merge::request_params has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 5 (6 pts), match/switch 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/completion/options/merge.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"5988c0894c82a820e1a9c3a5051a8f25c4c629efdc631524a54941b8b476dffc"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::anthropic::completion::message_json (cognitive 16): rig_core::providers::anthropic::completion::message_json has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 2 (6 pts), boolean chains 1, 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/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b20809861fd5787ccbed7d779e4b5a98de84e3598ebe4a4ca951ae23509737"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::anthropic::completion::repoint_moved_references (cognitive 16): rig_core::providers::anthropic::completion::repoint_moved_references has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 3, loops 3, match/switch 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02672379f978571c0c1f99c979785e64e03aa01aa6361c91983e7abaeaee2e3"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::gemini::streaming::document::part_into (cognitive 16): rig_core::providers::gemini::streaming::document::part_into has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/streaming/document.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e5d3a3009e84fd46d5b0a075129e02dbdb485655c846d293a41b21c42d1411"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::turn::stop_calls (cognitive 16): rig_ecs::turn::stop_calls has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (8 pts), if/else 2 (5 pts), 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/rig-ecs/src/turn.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"a559db89e52c856fab2ac95e6a554daca70d42d78c7e28ff8a8229c1ee13e3a0"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::turn::end_turns (cognitive 16): rig_ecs::turn::end_turns has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 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/rig-ecs/src/turn.rs"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d5b395c8ec4967e2787120b085b0efb1dd64170ad0753344e9981461b15b56"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::start (cognitive 16): Writer::start has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 4 (7 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-markdown/src/markdown.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4c23e570c10cef1b31397b6b22ceda9954b7b926816e2b96dc974c5abe6e51"}},{"ruleId":"D2","level":"warning","message":{"text":"ClearToolOutputs::targets (cognitive 16): ClearToolOutputs::targets 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/rig-memory/src/compaction.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"0250e925e4449f8a30ec556778e55f4629849801eb3c15f0e724ac316d6e079d"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_reqwest::follow_redirects (cognitive 16): rig_reqwest::follow_redirects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 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/rig-reqwest/src/lib.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4923844c956191d381a5471eaaea2786b063ee955802a3dda80a114c6a909c"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tools::read::show (cognitive 16): rig_tools::read::show has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-tools/src/read.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb9313a6bdf5c45eb0b0179b60e262045ebf95f471775e511166231bc210e37"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_basics::coding_tools::release (cognitive 16): rig_basics::coding_tools::release has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 1 (3 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":"plugins/rig-basics/src/coding_tools.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ff2195e36eab4a586221fa6bb5180891d89beb2397050bedc46768faa4e019"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_basics::session_picker::preview (cognitive 16): rig_basics::session_picker::preview has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/session_picker.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dae5da5e2e9efe4d5a8ba2e2ffc86d137f1d4dc357cbef8fb38300ed6b144eb"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_basics::skills::discover (cognitive 16): rig_basics::skills::discover has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (7 pts), if/else 2 (6 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":"plugins/rig-basics/src/skills.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65d2fa06606e7eb41bc7fc3e8d2605cf43f0136beda6b91c9d3faef0a6907d9"}},{"ruleId":"D2","level":"warning","message":{"text":"LookLine::colored (cognitive 16): LookLine::colored has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 4 (6 pts), match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/renderers.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"75940b20cab0e91e182ac5f084b77e0231cc00c27ab793e2eba570cd8a661571"}},{"ruleId":"D2","level":"warning","message":{"text":"Options::parse (cognitive 16): Options::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, 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":"xtask/src/verify.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e90703f5c8ac1624e49c1fb576c11321405cea77a5c95a6180fac85a5623af"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::cassette::bank::walk (cognitive 16): xtask::cassette::bank::walk has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 4, if/else 2 (4 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/cassette/bank.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ffd90b456e451cf9e177f10efbd2c31959f7e69db3fe3e9d19a3bb5b655a23"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::catalog::guard::compare (cognitive 16): xtask::catalog::guard::compare 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":"xtask/src/catalog/guard.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"319547fcabd43bf246577851f8097ce1a5caa950b2b46c057e4c8737615caf39"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::catalog::guard::count (cognitive 16): xtask::catalog::guard::count has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (9 pts), loops 3 (4 pts), if/else 1 (3 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/catalog/guard.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec07dd067b5081e3e8b69756b76c60fc1df78f75e05c3acb71c20ff961ce265"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::verify::run (cognitive 16): xtask::verify::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (7 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/verify.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a13d052723544192627a24c5e5e8e71f7d6e25e32f70c252af7a7385b8ff37f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xtask::verify::checks::all: FunctionTooLong \u2014 xtask::verify::checks::all runs 454 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 354 over it, 4.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":"xtask/src/verify/checks.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"367ae49188032a6187cea7c58a636b44efb20b3df0fcbba5dcd15b8bb47b1e6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/scrub.rs: FileTooLong \u2014 2174 significant 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 62 free functions. The bar is 500 significant lines; this is 1674 over it, 4.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/scrub.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b034166b0295f0c2b85c97b47799c08d18a641af0b0a6bc55ab60a0fab2d406"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: http/mod.rs: FileTooLong \u2014 2160 significant 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 88 free functions. The bar is 500 significant lines; this is 1660 over it, 4.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/rig-cassette/src/http/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"153caa489c7fac4b54ceb6406110f63903b99de055c655ec5458096bf10716d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1309 significant 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 809 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/rig-sqlite/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f5ab5faaf08f09762c4ef21e48374d625d1313fac0052e4f13c6ac2f3791da"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StreamingTurnSource.run_model_turn: MethodTooLong \u2014 run_model_turn runs 257 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 157 over it, 2.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/agent/engine.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"88839eacf6c0976b5f54a24eb81efc71304827903a4cb58293957e95a00d3494"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/compaction.rs: FileTooLong \u2014 1271 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 771 over it, 2.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":"plugins/rig-basics/src/compaction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ddb5807e738700cefd3511947bb8cc0ee5ca6ad773261c4c9796237caf4c09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wire/chat.rs: FileTooLong \u2014 1216 significant 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 716 over it, 2.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/rig-core/src/providers/openai/wire/chat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a576e01dfb39bc614ff4ba1e7b25f23f03f666500be25549cebcfc224375e25"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/turn.rs: FileTooLong \u2014 1204 significant 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 704 over it, 2.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/turn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"218d379df05dcb5e035b4653044ec6c7cb0911c8118c868948cf751c73747183"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentRun: TooManyMethods \u2014 71 methods. The bar is 30 methods; this is 41 over it, 2.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/rig-agent/src/run/mod.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19119abddfd859ecee06c810f914ed47bb5fc80bff12ac256b1359ae8130ebb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/print.rs: FileTooLong \u2014 1148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 648 over it, 2.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":"plugins/rig-basics/src/print.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa52c8f33998737f76ec9f1a0bde8b5b19582c39d9f5738b165cdf8c63ea31c1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Scrubber: ClassTooLong \u2014 911 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 46 methods, 2 blocks, lines 182-1945. The bar is 400 significant lines; this is 511 over it, 2.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/rig-cassette/src/scrub.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"86591004305ad1cc595d977b6485e5d489ec13b8fd73807f184378c39efd738a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/engine.rs: FileTooLong \u2014 1113 significant 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 613 over it, 2.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/rig-agent/src/agent/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9c67e9f769270c4f31fa321b55f852458fe0ca0df34cda4245bdd245e8e406"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/transcript.rs: FileTooLong \u2014 1109 significant 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 609 over it, 2.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":"plugins/rig-tui/src/transcript.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d593d5fdd70d85d871ae428093d60e69b2964960876bd79156ee6e6144d18c05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: completion/history.rs: FileTooLong \u2014 1051 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 551 over it, 2.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/rig-core/src/completion/history.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1943734e8ec4b262a7957ba4275019f0bea953827bd199172bd4e945c85e54"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AgentRun: ClassTooLong \u2014 839 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 71 methods, 4 blocks, lines 309-1870. The bar is 400 significant lines; this is 439 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/rig-agent/src/run/mod.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"891055046c652f1f6e3044bce933b30a5de248a1757b4c3aa8f44badd3ac794e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run/mod.rs: FileTooLong \u2014 1045 significant 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: AgentRun (4 blocks, 309-1870). The bar is 500 significant lines; this is 545 over it, 2.09\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/rig-agent/src/run/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c00b75af1ac2a5cf562f8665ed7b1eafcb79e4634330fa3978d92b3a85fd43f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openai/options.rs: FileTooLong \u2014 1028 significant 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 528 over it, 2.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"252d213b1cfdce19c9893dabb2a631c584634c319c18388f9deba7f35ede577a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/render.rs: FileTooLong \u2014 1025 significant 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 525 over it, 2.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d09e79b523f43688ecf12ce489ab0e00f7731f78475bbec7bc98cf435933bb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_claude_cloak::transport::body: FunctionTooLong \u2014 rig_claude_cloak::transport::body runs 205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-claude-cloak/src/transport.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b20d61740d6338fafea1818e755ed74a79044550ff4c4c28c67bfbbd2167a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_cli::run::run_agent: FunctionTooLong \u2014 rig_cli::run::run_agent 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/rig-cli/src/run.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d3016623235526f14b27f95302e600b1e01ac3b02aa54c2973b7ed1983a1e7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Conversation: TooManyMethods \u2014 60 methods, declared across 2 files: conversation/mod.rs (57), conversation/turn.rs (3). The bar is 30 methods; this is 30 over it, 2.00\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/rig-core/src/conversation/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acff6cc10b01ee3dc5d4c64972e8122948033be757459ea0853b603cf25a2ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: operation/completion.rs: FileTooLong \u2014 999 significant 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 499 over it, 2.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/operation/completion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b74e82369bfb74e66e36ca861325935620fe0f7436f34c167622f01e99f9087"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wire/modality.rs: FileTooLong \u2014 943 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 443 over it, 1.89\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/wire/modality.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"337dcaaef88d3b70db2d5bc6ae3a46d21c332f8f0dc9db70bef40b8d722c539b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: completion/request.rs: FileTooLong \u2014 922 significant 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 422 over it, 1.84\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/rig-core/src/completion/request.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7311d54f62c36f1d8debcc9ffe985cb0bbc629dbf04e6ea5452680ab968c8c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/stage.rs: FileTooLong \u2014 920 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 420 over it, 1.84\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/rig-ecs/src/stage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"000dedeec68e6a4e5180d2a67d66ef89c0a6fd8fd6b28b80c8efb9eef60c2eca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: anthropic/completion.rs: FileTooLong \u2014 919 significant 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 419 over it, 1.84\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/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af279f5f860a47bfc025aca53172ac5256ce162ce7b731e7a1be9264a3a13c7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Editor: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/editor.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d886103664b416887292b8c0539691edb935f3851bbe3f347de9a3311a28e41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/open_pr.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). 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":"corpus/fh/src/open_pr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"326f87485f49a8169721a009a53efd03d92b4cfd65da414f3b734fc793ba2665"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/compaction.rs: FileTooLong \u2014 877 significant 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 377 over it, 1.75\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/rig-memory/src/compaction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6f2d8e82d58fa932379f98d2fe0f5e1ed8a1706ba4d9d32f899b8120085416"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: completion/message.rs: FileTooLong \u2014 872 significant 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 372 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/rig-core/src/completion/message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab5a5ef0029d86d25f9587fccc45bceec00083678c334bda6ed7eccadf2062d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 872 significant 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 372 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":"plugins/rig-mcp-client/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3381caa9476fcd56f00e12a2ee7fd9fbcffda07e41a0e9a5b190f429d2748d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/transport.rs: FileTooLong \u2014 849 significant 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 349 over it, 1.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-claude-cloak/src/transport.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"753d20ef98dd364f5e65027e8232456e5ccc112b07cba4434ff79ba0a6dbdf53"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentRun.next_step: MethodTooLong \u2014 next_step runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/run/mod.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"f228f9cb5400da62ade14746deb942c9f4bc098d1c09dd9e8d7a909f3fbd73d5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentRunner: TooManyMethods \u2014 49 methods, declared across 2 files: agent/runner.rs (45), agent/streaming.rs (4). The bar is 30 methods; this is 19 over it, 1.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/rig-agent/src/agent/runner.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"266f180acc94a0382eb9eeee7445df4470126e350320a31785784d76982b89c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 813 significant 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 313 over it, 1.63\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/rig-harness-protocol/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eff15de67b3ce6aa7f4eacd89331b919281ccb5d1e60d01394cf861234a5e3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/run.rs: FileTooLong \u2014 796 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 296 over it, 1.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/rig-cli/src/run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21552b9d66aea606050abb51bf2b97b403bbe730a056e19d96ec7b4598aef4db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_derive::tool::expand::expand_rig_tool: FunctionTooLong \u2014 rig_derive::tool::expand::expand_rig_tool runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-derive/src/tool/expand.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24a2313b84775a47d423f322acc90a90f65ef97db9445c648fd8a9d938f580d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/transcript_in_editor.rs: FileTooLong \u2014 788 significant 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 288 over it, 1.58\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":"corpus/oc/src/transcript_in_editor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc26f2f899c724ed3fe07dbafa3daeb6ae90a31abc79e85bbd0bdedf243e6593"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/best_of_n.rs: FileTooLong \u2014 785 significant 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 285 over it, 1.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ho/src/best_of_n.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ce800562064a8e961b1539fb13df714ce74667e49cd7392e1f641809bf167b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session_bundle.rs: FileTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 284 over it, 1.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/oc/src/session_bundle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea8eb51cb6a98f70440dd5b414efef6c4f85d90a9c0eb97ed848dce7a8baa15"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: conversation/mod.rs: FileTooLong \u2014 774 significant 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: Conversation (4 blocks, 88-1419). The bar is 500 significant lines; this is 274 over it, 1.55\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/conversation/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d4cd9f14974f1cc68886ac2e97e817ca15aedd0f3ffeb715da6ebb20919a56"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_basics::compaction::compact_near_the_window: FunctionTooLong \u2014 rig_basics::compaction::compact_near_the_window 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":"plugins/rig-basics/src/compaction.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"03297e544eaa98ee1fc7fb14b7fe473c6034e5fadef10f7daa5f625481f4bc8a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Scrubber: TooManyMethods \u2014 46 methods, declared across 2 files: src/scrub.rs (42), http/mod.rs (4). The bar is 30 methods; this is 16 over it, 1.53\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/rig-cassette/src/scrub.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5398f430558d5938e1d2d98b81117bcf7a7fa9c54f725056f71416d129850c4c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Quirks: TooManyFields \u2014 46 stored fields beside 4 methods. The bar is 30 stored fields; this is 16 over it, 1.53\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/wire.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"56694e244c3e0e9c083b6b21a1eab1e1c561013276f435f60207217998279563"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hook_scripts.rs: FileTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 257 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/hook_scripts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"412ca7eba7401e8673370b78df3bcae4899e8ecfec02a44a8eca9016ca4a2dd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/hook.rs: FileTooLong \u2014 752 significant 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 252 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/rig-agent/src/agent/hook.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60004880d7d8319cb4d6d492e383786989a3e315094415fcb2da1ce8f2399a9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_core::providers::openai::responses_api::input: FunctionTooLong \u2014 rig_core::providers::openai::responses_api::input runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/responses_api/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda16b6ce962891ac736e275d5dfe4dc8e85a6e0d01cc4aed4b1ee856d1981e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xtask::verify::execute::internal: FunctionTooLong \u2014 xtask::verify::execute::internal 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":"xtask/src/verify/execute.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0029f23bedb5f20a21670bc66f616fcba8c9223560a6677984c0e24455f583f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_agent::run::prepare::prepare_request: FunctionTooLong \u2014 rig_agent::run::prepare::prepare_request runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/run/prepare.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"473a5578279dd54b8ec3ade279759aeaf962f0f7e44e477821bcaf3d4723e21f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentBuilder: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.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/rig-agent/src/agent/builder.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"69172355d0b8136ab6b41af04215736c5f56cf34d2a9da757e7d86de6a887e3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/code_search_index.rs: FileTooLong \u2014 713 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 213 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/code_search_index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48b41345346e174cc384a25abda73f3d4f4e0eea0cc3b2a28709513a4b5345c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Conversation: ClassTooLong \u2014 570 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 60 methods, 4 blocks, lines 88-1419. The bar is 400 significant lines; this is 170 over it, 1.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/rig-core/src/conversation/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf06985ea4a502803787c941da08d2917c3e985950d7ad3dd9c72e83e035572"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session_replay.rs: FileTooLong \u2014 707 significant 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 207 over it, 1.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/session_replay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9500bc257b27df390124b19f2e87edef552926392d129e4a92e37195c82c4654"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lsp_tools.rs: FileTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 203 over it, 1.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/lsp_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e715a743dbbf14e198f339c316ca8fd6bfbebc61e64ac31b6e75d168ba7696"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OpenAIConfig: TooManyMethods \u2014 42 methods, declared across 4 files: openai/wire.rs (24), wire/modality.rs (10), wire/auth.rs (6), client/openai.rs (2). The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/wire.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"228c8204e1410e36c63616c0b18635ffff8855a7a16057ab24cabb436d5f172b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/router.rs: FileTooLong \u2014 699 significant 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 199 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":"plugins/rig-acp/src/router.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e19ff280800a6ad8c79d72cde3935ca19d4d330894ba68a8674f8c954df5eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gemini/extension.rs: FileTooLong \u2014 687 significant 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 187 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/extension.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50cd19632338bb4ab1f51751e981e5512ca374811959f2ba4964bf18af0e769"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/editor_front.rs: FileTooLong \u2014 685 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 185 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/editor_front.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a6c7d96fd2e96ce5be9df6f0918b8b193de09d31963c5e52d0704f84ddd50f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: effect_log/jsonl.rs: FileTooLong \u2014 685 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 185 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/effect_log/jsonl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e673edcf4e2cdc17d29223abc85254f7ff06425d1becc5f046a5c607fd064db5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/renderers.rs: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 174 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/renderers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"800d5b61aa79510ec4ca115557a3ca5bd469f4a4f53cc5f18f756ebf739e01ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: corpus_fh::editor_front::receive: FunctionTooLong \u2014 corpus_fh::editor_front::receive runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/editor_front.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70c682c92b9a9ea113e6baeffdfe1508172a21abe2bf2f3a4424775d356fef4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/catalog.rs: FileTooLong \u2014 668 significant 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 168 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":"xtask/src/catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec61d7501b9c7cbe7ad082217d3e2549fecbd2bdd63f590995bd1e07d18215a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/validation.rs: FileTooLong \u2014 665 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 165 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/validation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1821adade140ea5299cada6f66b444a437d0185395366b98e8178b9fb328981"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_claude_cloak::transport::prompt_caching: FunctionTooLong \u2014 rig_claude_cloak::transport::prompt_caching runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-claude-cloak/src/transport.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6710c7a696a4396d19721d2ce5420b9727bfb127910e2658088b15a4279b692"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReplyFold: ClassTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 3 blocks, lines 258-1326. The bar is 400 significant lines; this is 126 over it, 1.32\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/rig-core/src/operation/completion.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee656323cf382ada460b7a23ee638a3479e1b54ff605db0e8fe902c0a884c32a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gemini/caching.rs: FileTooLong \u2014 657 significant 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 157 over it, 1.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/rig-core/src/providers/gemini/caching.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f97e94a7022a7d9a0576ff097aa0f934947522b367d61d81e7950c5fbde4938"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_lancedb::utils::deserializer::valid_values: FunctionTooLong \u2014 rig_lancedb::utils::deserializer::valid_values runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-lancedb/src/utils/deserializer.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"de35c629abe2444327a6f1e5385e4d8f18101093bcc816dc96d3735dee80b5b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_tui::render::lay_out_transcript: FunctionTooLong \u2014 rig_tui::render::lay_out_transcript runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/render.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce5bfa5b3e8e47864fd4d0ade29e1a1c234214c829822cf08563b2a310489f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/remote.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/rig-tools/src/remote.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0068738e24e0cba35fb52e99e0e7cd3cce6e29101b2ff6efeb322bbb279c4b83"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CompletionRequest: TooManyMethods \u2014 39 methods, declared across 2 files: completion/request.rs (38), completion/prompt.rs (1). The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/completion/request.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b482b906ece2ec21d77c0836c5b6efabe2ba304c53dc63909fb355824c7b264"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: responses_api/streaming.rs: FileTooLong \u2014 649 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 149 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/responses_api/streaming.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4650a14a25f684a25626822cc3700a472117dafa909d4e1cff72f0d220731282"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CacheBook.plan: MethodTooLong \u2014 plan 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/rig-core/src/providers/gemini/caching.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"8baba129a11fb53aaa3dcb98cb305e40b90b63618d1d7b1ca109c55cdf1a4775"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: catalog/row.rs: FileTooLong \u2014 644 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 144 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/catalog/row.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b36f78db4b810d5926ec0e4397ff052c62742c8936584b1f4a574d9524ee99"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QdrantFilter.interpret: MethodTooLong \u2014 interpret runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-qdrant/src/filter.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73042026d39ca3a8a41d924aec1ae821e040d06553c4964effa3afb7ebcf87d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_tui::transcript::message_lines: FunctionTooLong \u2014 rig_tui::transcript::message_lines runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/transcript.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"098edbd0986a7ab8884f465db1b84bbd571c0fac495ade3390d998171f580cec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/process.rs: FileTooLong \u2014 634 significant 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 134 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-tools/src/process.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0076e90f565e9ed8aee726f509dd9ebb5a6437ac88262ae227b4a89d6df91eab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/inline_images.rs: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 131 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":"corpus/oc/src/inline_images.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba0c754441478912113a7ddcdca957ce2cb87c6ae00308ee04fbcebfd784cf5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 131 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":"plugins/rig-acp/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c5b7c66c059c1917ef1bf26f9cf96590b8eefef1ada118bbb7784a822c81af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_cassette::http::replay_request: FunctionTooLong \u2014 rig_cassette::http::replay_request 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/rig-cassette/src/http/mod.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae8cc1ee40e84d52eca1171fd66702badbea80886840ae3eca2de9dcf6280b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PrintPlugin.finish: MethodTooLong \u2014 finish 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":"plugins/rig-basics/src/print.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c4bf867b105f290dc8176004fbfc6c64e99116a501d21361a30ccf0f4d721b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_ecs::stage::build: FunctionTooLong \u2014 rig_ecs::stage::build 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/rig-ecs/src/stage.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09019de0bd3d9fecf87d98adafcbfec87a72d0a0759580e5b72518217f39b4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session_recall.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). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ho/src/session_recall.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2f084132ef11f4dab3e33a1e58676baba8bcb72fb3f829f838a788d131b4f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/edit.rs: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 115 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-tools/src/edit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"986a20c3f6db5ab536d776d01dca85442bedfab9d256aadedf3096385315cdac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Responses.base: MethodTooLong \u2014 base 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/rig-core/src/providers/openai/responses_api/mod.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba7c1f42004d4abb566ec4cc2f46ed6c4a8c1219a37bc958936435dfb8a97b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_ecs::stage::start: FunctionTooLong \u2014 rig_ecs::stage::start 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/rig-ecs/src/stage.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d65ea7e4e905dfdb6c8ea1504e19b00e5e8a5e6c8471815ee37a4d847e2794b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_basics::telemetry::usage::usage: FunctionTooLong \u2014 rig_basics::telemetry::usage::usage 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":"plugins/rig-basics/src/telemetry/usage.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"054ca79cd37ee6d1812e96524f749249cf73cff92fc21e31f3b2fa2a7e260e05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/conversation_chapters.rs: FileTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 104 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ct/src/conversation_chapters.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4cf2a5cbfcfc99843906628a8ba1b417006a9502cbfcb5b6a2de1c1ca7d8fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/registry.rs: FileTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 104 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6ca72550508ab4c9a2104f6ded0a7f1f35783c45106c5c252cc0782e9c18ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: effect/mod.rs: FileTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 103 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/effect/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ed5cf4279faf960ef2f86ce36bb8c7a9cc62bef0a4f1a25fec273512ca2e9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/input.rs: FileTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 102 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":"plugins/rig-tui/src/input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"808ced5c9d54e8d147c9a0a64d616b27de6b1af560f55ff7654026d3de537cce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/driver_adoption.rs: FileTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 95 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/driver_adoption.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba22e5ad5dc7084b3595fdc65bdcacb20cfecdf8b0b37f236552e03a2fa0d3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/checklist_runner.rs: FileTooLong \u2014 594 significant 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 94 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/checklist_runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e178d95b356b0d0d8fb7efd5a3791299fb46d37d5d49d465f7c99d874ae81f75"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/protocol.rs: FileTooLong \u2014 594 significant 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 94 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/protocol.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ca789ef762bfd329ed94048bd2936e7f414995a9c284ac38f02b7f9ad6792e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OAuthTransport.prepare: MethodTooLong \u2014 prepare 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":"plugins/rig-claude-cloak/src/transport.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f18a0318867ed2a32abb8896f13888b7bdf3bfd589a2fbb77bdceb862df899"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: catalog/guard.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":"xtask/src/catalog/guard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c38013e70f735d17f05207f434e61bd1dc72ac8762088e8ea8dc43f9fe8577"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stopper.stop: MethodTooLong \u2014 stop 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/rig-ecs/src/turn.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78eec2f12ff3deb4b435380708c7f225e66e5bdd645ceb79ead5106f0d44b9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_candle::protocol::render_qwen_message: FunctionTooLong \u2014 rig_candle::protocol::render_qwen_message runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/protocol.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a36b4adbe098f92a1020c3ab5511d45b55b95b15bcf8bce43024683a49d649d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_cassette::scrub::capture_format: FunctionTooLong \u2014 rig_cassette::scrub::capture_format runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/scrub.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd79c38a1335b6cb6447e09a919c957095e9a6ca023b9c1fc1f7b40c4a3f2af9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: verify/checks.rs: FileTooLong \u2014 579 significant 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 79 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":"xtask/src/verify/checks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c74e8996bc9193f9a915da9d330007b00cffb6771970ec9a6642118401fa56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/schema.rs: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-claude-cloak/src/schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"758b0ae97db96f23a88ef03d189871a48c819a38002b5398e511a577311fdbbc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pick.rs: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/pick.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e992638e343f21e4ba99eefd4c094c044c302706e0d33073ae525b140fe956c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: corpus_fh::import_sessions::parse::codex: FunctionTooLong \u2014 corpus_fh::import_sessions::parse::codex 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":"corpus/fh/src/import_sessions/parse.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e2862d60ea3e7a495f7d43ea640edc6ef7839fba1c3eb206391fffeaef6d24"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: corpus_fh::prompt_cache_shaping::shape: FunctionTooLong \u2014 corpus_fh::prompt_cache_shaping::shape 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":"corpus/fh/src/prompt_cache_shaping.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"293dd3a977d8e78e7498fb6b051c5f1ec800c3878a163a96e7ae1cfa19103128"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_agent::agent::engine::drive_tool_calls: FunctionTooLong \u2014 rig_agent::agent::engine::drive_tool_calls runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/agent/engine.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a1de95b9d049e0305dc176c5d816b0202ae35dabc7252fcb199774b168d672"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_acp::session::install: FunctionTooLong \u2014 rig_acp::session::install runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-acp/src/session.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"5565915289ff00e3d3e29a17b46337fcccb6fdc4fff8d2fb1eab51edbb4841b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_tui::render::draw_choice: FunctionTooLong \u2014 rig_tui::render::draw_choice 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":"plugins/rig-tui/src/render.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3790873b070b2d25f81abb1598685c1c21da1f1d6af6b2d90a3d1fd80dc1494"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pose.rs: FileTooLong \u2014 559 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 59 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/rig-candle/src/pose.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f729e69154f8f804868de705b89922ddf37b05670d8b218a685768ca10b1d8ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/coverage_gap_nudge.rs: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 58 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":"corpus/oc/src/coverage_gap_nudge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"069fc92bd4d1ce0a786a9d9795547b0d343167166e81a318afab067f710f7051"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/checkpoint_rewind.rs: FileTooLong \u2014 555 significant 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 55 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":"corpus/base/src/checkpoint_rewind.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa4c1f336bba45dc0789ccc0579b19a174c44889e60d1c4525a1a025dc28ddd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: responses_api/mod.rs: FileTooLong \u2014 552 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 52 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/responses_api/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df00d3e284e60e10955094298e5bb82d0ebb68c19320b7e9c235f2386c350d88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/batch_provider.rs: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/batch_provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9d19b778dbe79586a0769548e4476c66d2f02d48e318a06ac48fbb000cec7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: responses_api/websocket.rs: FileTooLong \u2014 547 significant 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 47 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/responses_api/websocket.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19453fc30b01eebaf0c56b1729720a4a3bb4064f9b97998190da71ab8c76151"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dependency_guard.rs: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/oc/src/dependency_guard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeac8c7d15e8c1c3a7a12cc47292d667fc81145432fb4871f8d00a68b58806be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_claude_cloak::schema::upgrade: FunctionTooLong \u2014 rig_claude_cloak::schema::upgrade 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":"plugins/rig-claude-cloak/src/schema.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecee549ae130a574ed11bda96e922b4e51a71b6cefa189f99bd8db8ef2962f87"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: options/merge.rs: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 43 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/completion/options/merge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2f963fc58c9623440b53dae68816cff7ba046d2e489ee652605683aec1b7fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: corpus_sp::dead_ends_ledger::review_shell: FunctionTooLong \u2014 corpus_sp::dead_ends_ledger::review_shell 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":"corpus/sp/src/dead_ends_ledger.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a33f1250a3ce9c2d5b99768f160b98288765e6c51efddaaeed2c7c31e58f99f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ChatDecoder: ClassTooLong \u2014 429 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 4 blocks, lines 1171-1928. The bar is 400 significant lines; this is 29 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/wire/chat.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f2bd4d1d74eebd448ec67273e1f1d0d25d42784e07df2a835b3d918e25d5d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/file_annotations.rs: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 35 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":"corpus/sn/src/file_annotations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d0d9acb6781ddfb4dcc9f1c3ae39ea44762277fbc10a9c5308edfd6b14059d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/driver.rs: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 35 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/rig-core/src/driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0cfb0ad2aba44dfbf18ba2aa487847ffd081658c303bac997b82052da36cb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_core::completion::history::adapt_for: FunctionTooLong \u2014 rig_core::completion::history::adapt_for 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/rig-core/src/completion/history.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f427c6a623ca9287a94586347d495ba3b32cacbc8d64c9e88fad7e82c866276"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_tui::input::read_input: FunctionTooLong \u2014 rig_tui::input::read_input 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":"plugins/rig-tui/src/input.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87b73e9a498c55d1611cb926f89099647a12308bb9db594936a2159b05eabf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/model_params.rs: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 34 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":"corpus/sn/src/model_params.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6aa18bcd2cdfb7a21a97894cf85083d7418bccde11182b52f44e776d31a1fa8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ToolExecutionError: TooManyMethods \u2014 32 methods, declared across 2 files: tool/result.rs (30), src/error.rs (2). The bar is 30 methods; this is 2 over it, 1.07\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/rig-core/src/tool/result.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f279b66e83b6bc9090afb9f7a538772b9ab805f1665f38e760e0a8100cac5cf6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gemini/completion.rs: FileTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 31 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/completion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e898699c400bb8acd63b28a78c0465243899a39c149412f5cb55932a76de74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: corpus_fh::import_sessions::parse::claude_code: FunctionTooLong \u2014 corpus_fh::import_sessions::parse::claude_code 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":"corpus/fh/src/import_sessions/parse.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"60dbe71d5de15d33bf262f05d4eea170f78c9263392946f7229ac88cd01b7b16"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_core::completion::history::assistant: FunctionTooLong \u2014 rig_core::completion::history::assistant 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/rig-core/src/completion/history.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b61d9f2ed354a5a081821de29994d1e14f14643bb45e75b6c2cf5e91e15426f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vim_input/editor.rs: FileTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 25 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":"corpus/sn/src/vim_input/editor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"572ffa966b33b9c131ac2180b3ba35f56a5543f881c19a7131e3ee5582085654"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: conversation/pairing.rs: FileTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 25 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/rig-core/src/conversation/pairing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"720b0d3523d4d4a9ecceb6273b94a6bf44df1439b3f1d2bf447acb43c300e2d4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqliteVectorStore.add_rows_with_txn: MethodTooLong \u2014 add_rows_with_txn runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-sqlite/src/lib.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"918c5b46cec38f74c162b8c1a1cf4afe8f3011ebd9b062f27cee5c0f7d347664"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session_edit_library.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":"corpus/library/src/session_edit_library.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc98be01cbada02acbb0417e650f6c58fe0936fb98a9187f3ed4ad86688fde58"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config.rs: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 22 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/rig-harness-protocol/src/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a7442b25fdaa6cb932de42e168ec16b69879fa136e7d6ba073f386a31f80ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: verify/guards.rs: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 15 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/verify/guards.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56143ddb51e8d409615c8f1565e3e5809044326b3c1be114b045b5eecde4a32"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_acp::router::serve: FunctionTooLong \u2014 rig_acp::router::serve runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-acp/src/router.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09cb9bfece661dde58de605a4a5756a8a2d5eaaa5901561d681e679de1aeeb2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Chat: ClassTooLong \u2014 411 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 4 blocks, lines 41-1013. The bar is 400 significant lines; this is 11 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/wire/chat.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97fd8b0358944dd3a6650ebc5f2d22c2441c0e82ba9547407fe4cb4f4453e79"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/process_reaper.rs: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ct/src/process_reaper.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b3bcc412769991b180ef54c20af2dc1f788688bf09c981b12491c463272f16"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/repo_map.rs: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ho/src/repo_map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02441aa570d34ba0722a57da2b8a496715f640b7ccab795c3b18bb1fa4d6eb89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/shell.rs: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-tools/src/shell.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d9eb264d0f3f39e6b189cf35fe89ba5109e87bf0b9b78b0bd95ff674ee772d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/theme_files.rs: FileTooLong \u2014 507 significant 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 7 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sp/src/theme_files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b7172e83d3ce6654f7799bd5cb44228689d9f26e6c6dea2eea16947446bfb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 6 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/rf-07/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"416e5eadb9f3039479ce661466c73a5d568587095067524627aee6e0f2a10c33"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Job: ClassTooLong \u2014 404 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 2 blocks, lines 392-945. The bar is 400 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/lsp_tools.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac7303c3111fee935bc324e7c98545b613e5b006806dc364860d99d841fa866"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_tui::input::act: FunctionTooLong \u2014 rig_tui::input::act 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":"plugins/rig-tui/src/input.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1c186d5b1b58be6642daa6ff2cfbda16c6665ada6e90c3e9e12efffa750a2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/command_provider.rs: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 3 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ho/src/command_provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d60dd0f4d788d0cc380bcdb79e17aa1acd2fdc7a8475a698f0e5e646372fff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): corpus/ct/src/schema_adapter/schema.rs:376-393 | corpus/ho/src/degenerate_stream_cutter.rs:425-442 | corpus/oc/src/dependency_guard.rs:70-88 | corpus/sn/src/web_fetch/policy.rs:119-139 \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":"corpus/ct/src/schema_adapter/schema.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe3bdbef02df1453e334630e7c9985258f8b60e4ebd882e1157d95ce1039fa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/rig-core/src/providers/minimax/extension.rs:158-178 | crates/rig-core/src/providers/moonshot/extension.rs:146-166 | crates/rig-core/src/providers/xiaomimimo/extension.rs:67-86 | crates/rig-core/src/providers/zai/extension.rs:170-189 \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/rig-core/src/providers/minimax/extension.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"838cfe6dd75473efcd97730c6d44f2634673c387f483b76eaafb988361647aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/rig-cassette/src/http/snapshot.rs:466-518 | xtask/src/cassette/acceptance.rs:307-347 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/http/snapshot.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c5c28f867aabaa388e9c5346a8e182e883bcc5c4a9d30390c473dd41bf3eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/rig-core/src/providers/anthropic/options.rs:306-335 | crates/rig-core/src/providers/ollama/chat.rs:403-443 \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/rig-core/src/providers/anthropic/options.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfaebd5591732af47b4e361c999f14cfb9ad75f7231a5d583f73049edab7746"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): corpus/fh/src/editor_front.rs:776-804 | corpus/ho/src/hunk_review.rs:158-192 \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":"corpus/fh/src/editor_front.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c31eb2415311b972bf5db265a82746574f7fe9eb275309df87237cc0d3c0e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): corpus/base/src/skills.rs:259-286 | corpus/sn/src/glob_rules.rs:342-372 \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":"corpus/base/src/skills.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"790bf8ad9884433351727c22a9962efc20c61bb188dd7ce4383120e824650441"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 34\u002B corresponding lines): crates/rig-core/src/providers/openai/options.rs:715-750 | crates/rig-core/src/providers/openai/options.rs:917-950 | crates/rig-core/src/providers/openai/options.rs:1039-1076 | crates/rig-core/src/providers/openai/options.rs:1206-1240 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/options.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"327e04797625f6260907039c03304382a29d83d9ccef1c539ba004e189ab5660"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/rig-core/src/completion/message.rs:1149-1172 | crates/rig-core/src/completion/message.rs:1175-1198 \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/rig-core/src/completion/message.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e93342c474c58e93792ed90285e698a245d1a69a38a6eb8aef4673235485f1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): corpus/oc/src/dataset_cli.rs:201-225 | corpus/sn/src/usage_report_cli.rs:71-99 \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":"corpus/oc/src/dataset_cli.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ec5f014089c31eb5bcbf26dde6d48d78cdbdfb59b6f02a92c415f5881fa1cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/rig-core/src/providers/openai/options.rs:1167-1194 | crates/rig-core/src/providers/openai/options.rs:1242-1269 \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/rig-core/src/providers/openai/options.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b00112a0cfbfe4cd302c9f94ee1e13d377f6da7ceb98727fdbad2dacfb5047d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): crates/rig-core/src/providers/openai/options.rs:1078-1106 | crates/rig-core/src/providers/openai/options.rs:1108-1132 | crates/rig-core/src/providers/openai/options.rs:1134-1165 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/options.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"258e432f1c54452d199e8cdb7cba078df1405e182a31ec09c7b5be0283d97140"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): corpus/base/src/check_after_turn.rs:267-302 | corpus/ho/src/background_verify.rs:257-289 \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":"corpus/base/src/check_after_turn.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"53df1114d644913384682c87e62d6a1715dbfbef70a0c09a23a686884f72bde3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): corpus/fh/src/audit_log/chain.rs:140-158 | xtask/src/catalog.rs:379-406 \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":"corpus/fh/src/audit_log/chain.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e4831440cfbed401278037361e3522598d754740ddfd3466b10fc61d3199d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): crates/rig-core/src/providers/cohere/chat.rs:163-192 | crates/rig-core/src/providers/ollama/chat.rs:174-206 | crates/rig-core/src/providers/openai/wire/chat.rs:347-380 \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/rig-core/src/providers/cohere/chat.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d39f1fd39133007e9bb8b808cd1e02d85719004d12ad65f9f89d9e1ad62fd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): corpus/ct/src/ask_session_cli.rs:256-273 | corpus/sp/src/commit_msg_hook.rs:244-261 \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":"corpus/ct/src/ask_session_cli.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d1c1bdcba0e8235cebb9f7de83efa8842c3f3dcfbaf8df4d42c1059f0c4c17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): corpus/base/src/debate.rs:318-338 | corpus/sn/src/task_queue.rs:467-493 \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":"corpus/base/src/debate.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a41d09d27bcab6c4f35a8c27266c52e28c08b7aa396c1b93f3ac9061fbc005"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): corpus/rf-04/src/lib.rs:399-416 | corpus/shared/src/confirm_destructive.rs:161-182 \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":"corpus/rf-04/src/lib.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a191a0648065b4d6c08049a3d130dcf7aeb10d413b55e5c9975953bf2d71bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rig-core/src/tool/validate.rs:477-492 | test-support/rig-history-conformance/src/lib.rs:714-732 \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/rig-core/src/tool/validate.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b46cdb46d99df9223c0b58e4619c2579ddb348fa158d39c8c1dcff371bfc58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): crates/rig-core/src/providers/openai/options.rs:695-713 | crates/rig-core/src/providers/openai/options.rs:752-782 | crates/rig-core/src/providers/openai/options.rs:810-835 | crates/rig-core/src/providers/openai/options.rs:952-984 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/options.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b524c5b75f73622d5a17ace2ce875f28beb315de97e2ff4427eb9217a3930dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/rig-milvus/src/lib.rs:174-200 | crates/rig-milvus/src/lib.rs:207-241 \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/rig-milvus/src/lib.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2598b5e5fed964d03d12b6f47063c1532f6b752e885e09be75ceea825f3934c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): corpus/base/src/map_reduce.rs:454-477 | corpus/ho/src/relay_pipeline.rs:477-496 \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":"corpus/base/src/map_reduce.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04f6f050c8c0ce629225eb39211b6ca12085754bafb825a29dcfeea60c551c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/rig-tools/src/attach.rs:75-101 | crates/rig-tools/src/attach.rs:105-127 \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/rig-tools/src/attach.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f23ae46ca3094dea8ca49c499383012fe2e66468f71c143f632b61ff318e3a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): corpus/fh/src/standing_team.rs:311-336 | corpus/oc/src/architect_editor.rs:467-489 \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":"corpus/fh/src/standing_team.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e1db8ed93e80a765dd038272e5bfa7398fefc15aa8115606755b566846ca2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): corpus/base/src/skills.rs:124-147 | corpus/sn/src/glob_rules.rs:257-283 \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":"corpus/base/src/skills.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5a8ea888c06eef9b689cbaaa65f2f87c48d49381b0b26f07460926b35938c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): corpus/base/src/skills.rs:32-66 | corpus/sn/src/glob_rules.rs:54-81 \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":"corpus/base/src/skills.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72e40804eeff4696108b01455cfbea7cd8c93f0b1f975d22107bb0ead0197ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): corpus/base/src/export/render.rs:369-387 | corpus/fh/src/encrypted_sessions/reseal.rs:64-79 \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":"corpus/base/src/export/render.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b048f5261bfd4ecf97db37d5b9582c7c382e2010261c95fe94c2e4866de6ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): corpus/base/src/auto_commit.rs:488-503 | corpus/fh/src/open_pr.rs:1038-1054 \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":"corpus/base/src/auto_commit.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"2842ed827f9e3f7bed0bc104096e35a78420eb24df327737387b50d308985645"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): corpus/sn/src/stray_file_cleanup.rs:407-429 | corpus/sn/src/terminal_sessions.rs:558-580 \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":"corpus/sn/src/stray_file_cleanup.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cad5ac74d21d8a8b8289ce7fc3a62b5285bd80405f851cee8d004fa7a77c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): corpus/ho/src/socket_attach.rs:490-508 | corpus/ho/src/socket_attach.rs:518-536 \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":"corpus/ho/src/socket_attach.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a995b4929a79313c56f40c202a558c8986e353cfad14d0ed6b703b46dcb81a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): corpus/base/src/custom_provider.rs:185-206 | corpus/ho/src/command_provider.rs:199-220 \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":"corpus/base/src/custom_provider.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"45845b1a459ce70e6175def7024cd9f737e426ca881f44fa7f42a963b7728689"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): corpus/ho/src/background_verify.rs:482-498 | corpus/oc/src/coverage_gap_nudge.rs:767-785 \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":"corpus/ho/src/background_verify.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cd79d90869ae54e1f898bcd5b31a9c634381222897e51f82462c4b08013e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): corpus/base/src/agent_profiles.rs:403-426 | corpus/base/src/pinned_notes.rs:195-215 \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":"corpus/base/src/agent_profiles.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc88a90a4a62b41f2aa89fb85b945980245233471a2b8000dd0af64af690c5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rig-core/src/providers/cohere/streaming/document.rs:42-53 | crates/rig-core/src/providers/ollama/streaming/document.rs:35-54 \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/rig-core/src/providers/cohere/streaming/document.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae68ea04223f9e490612f0ffd560c478750379da8f28195a6dcde936a31fc776"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rig-memory/src/tokens.rs:116-130 | plugins/rig-tui/src/pick.rs:874-887 \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/rig-memory/src/tokens.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b05fbcd8f7f0e6c57aa83ea9a7a4014b08a703b51e8511a73401d6a95dfd27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): corpus/fh/src/import_sessions.rs:484-494 | corpus/oc/src/session_bundle.rs:538-549 \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":"corpus/fh/src/import_sessions.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b28c6ba3f4a400c816cf8a00de15dc89866e4e9f9538151372b111a1901717"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): corpus/base/src/git_status_item/item.rs:99-118 | corpus/ct/src/status_command.rs:52-74 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/git_status_item/item.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54c4bd8be92d3d8129a310639d8d14d561a26918fa7c33e24a1b667c977d282"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): corpus/base/src/long_term_memory.rs:564-573 | corpus/base/src/long_term_memory.rs:587-599 \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":"corpus/base/src/long_term_memory.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f0e17dcb5c146cc2dc02f0e1c238d99e0d16f5c21fe62f2f0c824a6b73c590"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): corpus/base/src/supervisor.rs:493-505 | corpus/fh/src/checklist_runner.rs:832-844 \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":"corpus/base/src/supervisor.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c1ceecf2822145fd627320871f71832e62b001d16e8aa1562a49a47c53ca25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): corpus/fh/src/editor_front.rs:1002-1017 | corpus/fh/src/editor_front.rs:1020-1031 \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":"corpus/fh/src/editor_front.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"7565a51fe757b1cde1110cc00a8c08de18457641a8c7520aec60b3dfc995c79a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): corpus/oc/src/architect_editor.rs:227-248 | corpus/shared/src/plan_mode.rs:91-109 \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":"corpus/oc/src/architect_editor.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"def6a248bc20930349af857e6e4f17cd3406ce81dc1a06799b7dbfdd8adc0f8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/rig-core/src/vector_store/in_memory_store.rs:413-433 | crates/rig-core/src/vector_store/in_memory_store.rs:438-455 \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/rig-core/src/vector_store/in_memory_store.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa765db9cc544e99ef397a2964db892fa7204a23abecffa2d1e2aa6d26afbe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): corpus/ho/src/raw_stream_log.rs:421-438 | corpus/ho/src/raw_stream_log.rs:456-469 \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":"corpus/ho/src/raw_stream_log.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25315d23c0e72c6b9db8784f73a26fdf4563818eaec5ef9151ba171c198a5ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): corpus/library/src/session_edit_library.rs:324-339 | corpus/oc/src/transcript_in_editor.rs:612-627 \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":"corpus/library/src/session_edit_library.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"121a1666a5a5464860b3ce9b224a21658747721d07417faa5e0b49f16feb21ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rig-tools/src/remote.rs:441-455 | crates/rig-tools/src/remote.rs:628-655 \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/rig-tools/src/remote.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f12e2ebdf6ff9f60feabf08031fd6b41e5ed2104061510b1641c49d504d836"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): corpus/base/src/auto_commit.rs:189-204 | corpus/sn/src/watch_ai_comments.rs:456-471 \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":"corpus/base/src/auto_commit.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba186b328896f9281bb7895d6eabb9e70fdc0916710da9883fcd749c3cdda6ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/rig-core/src/providers/chatgpt/auth/mod.rs:150-167 | crates/rig-core/src/providers/copilot/auth/mod.rs:133-151 \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/rig-core/src/providers/chatgpt/auth/mod.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b544e69b05cf4ddf9af77430c17fc20619a5c8abeb31b72dc0ce380468d3e5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): plugins/rig-tui/src/editor.rs:336-349 | plugins/rig-tui/src/editor.rs:352-365 \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":"plugins/rig-tui/src/editor.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1563d15754e97192a22c45c01748174bf6b7b9e8c873d7f3a69fc384b8b49fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): corpus/base/src/auto_commit.rs:522-537 | corpus/fh/src/dirty_tree_guard.rs:150-162 \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":"corpus/base/src/auto_commit.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d07ce6ed5ee5893dad01251ad4bae1d987d04db31540f5595f39cbfa0368fe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rig-core/src/providers/gemini/caching.rs:443-453 | crates/rig-core/src/providers/gemini/caching.rs:455-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/rig-core/src/providers/gemini/caching.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed066439d6b41f6fed337bcc21bff176c76d26c9179643ea7d1fbf10d1ffe49b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): corpus/base/src/http_api.rs:372-386 | corpus/ho/src/socket_attach.rs:472-487 \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":"corpus/base/src/http_api.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b29a595183b309d7ed1bd43ea824fe2251450b17eaf92b4b2299d50c2680fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): corpus/sn/src/tool_stats.rs:235-243 | plugins/rig-mcp-client/src/config.rs:480-493 \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":"corpus/sn/src/tool_stats.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"3602af84b492b6e3d5321d05e0def07a46c673d3deae005fc0022a738290a4bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): corpus/library/src/transcript_import_library.rs:208-215 | corpus/oc/src/transcript_in_editor.rs:341-349 \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":"corpus/library/src/transcript_import_library.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc24f1c3a88619aff7e7ea8f5af802dd6a5be8300861df6f30a90a7785a7dced"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): corpus/fh/src/dirty_tree_guard.rs:91-105 | corpus/sn/src/web_fetch/policy.rs:43-54 \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":"corpus/fh/src/dirty_tree_guard.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"edac8e8a0044149566999027ed1942555e4a5e86dece472d59b387316a5a1367"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rig-core/src/catalog/lookup.rs:72-85 | xtask/src/catalog.rs:815-827 \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/rig-core/src/catalog/lookup.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"771e961157d6ae2c5eb7d39381653ba2177d93b9b1530b2598db7836ae235049"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): corpus/ho/src/tool_arg_repair/repair.rs:324-336 | corpus/ho/src/tool_arg_repair/repair.rs:339-349 \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":"corpus/ho/src/tool_arg_repair/repair.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabed9d82b9671a3a669a0085df4f1bbd4678f42e7c93f0b4cd8e490308bba94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rig-core/src/loaders/epub/loader.rs:250-261 | crates/rig-core/src/loaders/pdf.rs:257-267 \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/rig-core/src/loaders/epub/loader.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f4655add29e184e973960d5d391a597e4f333cf012946ddf1b2f2a1aef1bba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): xtask/src/verify/extras.rs:89-101 | xtask/src/verify/guards.rs:172-185 \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":"xtask/src/verify/extras.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f60100baf40a5fc82f5f57d6dd5c5f478b31f2df0d80f818d271854fc6425f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): corpus/base/src/http_api.rs:355-365 | corpus/ho/src/socket_attach.rs:436-447 | corpus/ho/src/socket_attach.rs:453-465 \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":"corpus/base/src/http_api.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"d719faa955ff694c990e88b08b9279e9d65cf5f612149449f5f296e65958501b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): corpus/fh/src/safety_judge.rs:459-470 | corpus/sn/src/untrusted_quarantine.rs:532-542 \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":"corpus/fh/src/safety_judge.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"406bccf751e1dd5fd614fc7bb03d03d2c9364172c115d57b1575c79afac63725"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): corpus/ct/src/turn_navigation.rs:193-206 | corpus/oc/src/message_ratings.rs:206-217 \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":"corpus/ct/src/turn_navigation.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"4295d16871a91463e37f157a632f258899afe52d436b4fbca327b832b781718b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): corpus/fh/src/rich_tool_rendering/looks.rs:208-216 | plugins/rig-basics/src/coding_tools/looks.rs:86-93 \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":"corpus/fh/src/rich_tool_rendering/looks.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7653bf30685393c980254336cab0d8dd3d3a96bed852849c87cbda601fc32a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): corpus/base/src/share/render.rs:123-135 | crates/rig-core/src/providers/internal/auth/loopback.rs:492-505 \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":"corpus/base/src/share/render.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f093cb049a50b471a18d372238e40a63625d56699a22d42a8b6523682784ca0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rig-core/src/providers/gemini/image_generation.rs:277-287 | crates/rig-core/src/providers/gemini/transcription.rs:114-124 \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/rig-core/src/providers/gemini/image_generation.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b36a2d8a40e2211e772c09b8af5866a7bd9cacf8483e0878b603f838d9436c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rig-http/src/http_client/erased.rs:228-238 | crates/rig-http/src/http_client/erased.rs:247-259 \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/rig-http/src/http_client/erased.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"41da21c7b4844718713a8e14052b68da4f12a7f44c8b6474a662b25c7f11d3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): corpus/fh/src/editor_front.rs:730-746 | corpus/oc/src/ask_parent.rs:427-439 \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":"corpus/fh/src/editor_front.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"d194177f7b96a263b3b74dce0daac24a041c0c80bf175c9c2dd3517f0e42bfa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rig-core/src/loaders/epub/loader.rs:110-123 | crates/rig-core/src/loaders/epub/loader.rs:143-156 \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/rig-core/src/loaders/epub/loader.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a621b2080ed56001ba01cd7f9cade86c4ae7bda6215a64ee32867bbdfe667d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): plugins/rig-basics/src/session_picker.rs:155-161 | plugins/rig-basics/src/welcome.rs:109-119 \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":"plugins/rig-basics/src/session_picker.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c566b3f3d5e78bd7eeb7f9d553016a70ab9046535fce933d739dc198678d75fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): corpus/base/src/auto_commit.rs:418-433 | corpus/base/src/notify.rs:262-277 | corpus/fh/src/editor_front.rs:1098-1114 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/auto_commit.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d3a6c288a121b85250d89c090e846577d4c2b877635b60274020cf181a76ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): corpus/base/src/check_after_turn.rs:188-199 | corpus/sn/src/server_side_state.rs:238-248 | corpus/sp/src/changelog_fragments.rs:207-217 \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":"corpus/base/src/check_after_turn.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ffd20cd7b0a203318efe6419f0dad6cdf4ca72b511763b45bc2cb36c52f318"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): corpus/base/src/shell_rewrite.rs:94-100 | corpus/fh/src/safety_judge.rs:125-131 | corpus/sn/src/tool_stats.rs:209-217 \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":"corpus/base/src/shell_rewrite.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb5cca53c16a652082f5e35bc7b60630001e1384cadb6da37b6e1fa8b980d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rig-cassette/src/scrub.rs:2557-2570 | crates/rig-tools/src/edit.rs:569-579 \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/rig-cassette/src/scrub.rs"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc667bf9a418425b9d9241655db00e72339f319dd742def098af3240690e7c52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): corpus/base/src/http_api/server.rs:92-100 | corpus/ct/src/metrics_endpoint/server.rs:35-43 \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":"corpus/base/src/http_api/server.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2a93c3e6eda2c4be3c28f58a02f4a5386b8ad7bd8197026895419ac86c42e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): corpus/sn/src/task_queue.rs:343-351 | plugins/rig-basics/src/sessions/agents.rs:121-129 \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":"corpus/sn/src/task_queue.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9106e37a2c222d87bfc8a59aa2043d2fc949364dd7ee98dedc5205a340a77e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/rig-core/src/providers/chatgpt/auth/native.rs:503-523 | crates/rig-core/src/providers/chatgpt/auth/native.rs:534-558 \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/rig-core/src/providers/chatgpt/auth/native.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a395f86440d920c0aae4c7b936d4e7e5d6f4d8fef44d9d5592f8e0627159151"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): corpus/sp/src/structured_config_edit.rs:429-441 | corpus/sp/src/structured_config_edit.rs:476-486 \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":"corpus/sp/src/structured_config_edit.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e55dd27736ca5544cf2ba1561b851cb50f482df007379b3a9e752b4ffbabf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rig-core/src/effect/mod.rs:596-605 | crates/rig-core/src/effect/mod.rs:694-703 \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/rig-core/src/effect/mod.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a86246334ede4e7ec940509223f886b952c2de432db1e316f1cf39c1a9e715"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rig-memory/src/store.rs:433-442 | crates/rig-memory/src/store.rs:444-452 \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/rig-memory/src/store.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b9525ba90b3f8bad2588d74f03c743bc647a8f69cf0a4c869f9e33d094e164"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): corpus/ct/src/ask_session_cli.rs:239-248 | corpus/sp/src/commit_msg_hook.rs:148-158 \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":"corpus/ct/src/ask_session_cli.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ed649747855342dde128d92d3f026a09c1fdc58ae89b3191c65700738c407f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): corpus/library/src/session_doctor_library.rs:363-371 | corpus/library/src/session_edit_library.rs:661-669 | corpus/oc/src/session_bundle.rs:290-298 \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":"corpus/library/src/session_doctor_library.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a45430d3bbc9ec55db881e9c9269453084be0fbf918e595577f6734e72f6a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): corpus/sn/src/tool_stats/stats.rs:150-159 | crates/rig-core/src/vector_store/in_memory_store.rs:333-337 \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":"corpus/sn/src/tool_stats/stats.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6559a6ca69190e213db93da9a3debd0c636fdb6dab790c1c2c9475f5a07f4b63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rig-core/src/completion/options/merge.rs:725-734 | plugins/rig-basics/src/compaction.rs:254-265 \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/rig-core/src/completion/options/merge.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f5a93cdf4771adce6bf7cd26fd3fe1a9a1573d24deda526062a5fcf9e9d803"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): corpus/ct/src/paste_chips.rs:692-702 | plugins/rig-tui/src/view.rs:760-770 \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":"corpus/ct/src/paste_chips.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6356ddf497a72a0c0cb5dd426acb20c20d75a2a619613e1cbc46d7572e4bc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): corpus/library/src/bin/session_compare.rs:5-17 | corpus/library/src/bin/session_doctor.rs:6-18 | corpus/library/src/bin/transcript_to_session.rs:9-21 \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":"corpus/library/src/bin/session_compare.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c1e0579bf97e1f1baa27b15140ec15c956229ff6c2b11c51ceb8db8089cd42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): corpus/sp/src/changelog_fragments.rs:584-595 | corpus/sp/src/output_styles.rs:301-312 \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":"corpus/sp/src/changelog_fragments.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e1bcec01be26bec70d94c7c78020017768379c46c8bb26ed07c534c1a52c06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rig-core/src/completion/message.rs:497-510 | crates/rig-core/src/completion/message.rs:536-549 \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/rig-core/src/completion/message.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aace97f2ca8c861ac856a4785f75ef999f0492f68e58c187324fb99bf3a8345"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rig-core/src/providers/anthropic/extension.rs:315-324 | crates/rig-core/src/providers/anthropic/extension.rs:469-483 \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/rig-core/src/providers/anthropic/extension.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6ba2ed3f4a22cbd2655c2b70814d0caf34db08cc370530b5df204968c91130"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/rig-core/src/providers/anthropic/wire.rs:709-724 | crates/rig-core/src/providers/openai/responses_api/wire.rs:124-134 | crates/rig-core/src/providers/openai/wire/chat.rs:738-748 \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/rig-core/src/providers/anthropic/wire.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"61107c27aee8169124f997fe81efb6751761970e7d3433e31220d4a5e15d6f28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rig-memory/src/dir.rs:222-229 | crates/rig-memory/src/dir.rs:305-314 \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/rig-memory/src/dir.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d2ccbfba229097a0cf621e8b72738dc8aad38d248d71826e5e9dd30b926c85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rig-cli/src/locks.rs:146-153 | crates/rig-harness-protocol/src/lib.rs:1105-1113 \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/rig-cli/src/locks.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a1d64060fef36492b3f9c1a0411d45a00a720103e56e3f20f110185ebd8e6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rig-core/src/conversation/mod.rs:374-385 | crates/rig-core/src/conversation/mod.rs:390-400 \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/rig-core/src/conversation/mod.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"2916237f9c73deb38063e781e12f55f16a07c135e810b5f09dc33cd5fa59add1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rig-core/src/providers/anthropic/modality.rs:66-80 | crates/rig-core/src/providers/ollama/model_listing.rs:79-89 \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/rig-core/src/providers/anthropic/modality.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b2ba6e2fea1fdc5c288a28b423c2dc8af4aa51fc7b64427380bf37cf158af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rig-milvus/src/lib.rs:251-265 | crates/rig-milvus/src/lib.rs:271-284 \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/rig-milvus/src/lib.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df8d581a58e4c2abfacf08c146b8cb308b0be4ffa33d726703a89ab55d10822"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rig-cassette/src/http/ledger.rs:204-212 | crates/rig-cassette/src/http/ledger.rs:217-230 \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/rig-cassette/src/http/ledger.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52fc7fcec490bac83527e0572a91d6646a27f7f09ce32c92912531e1806597f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): corpus/base/src/custom_provider.rs:43-49 | corpus/ho/src/command_provider.rs:81-87 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/custom_provider.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e47a386af07f910f0dee405ee66260c27cc8f709a46c5425df9e3466ede7b77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): corpus/base/src/review_agent.rs:284-290 | plugins/rig-basics/src/preview.rs:140-146 \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":"corpus/base/src/review_agent.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"941ed7fcf779f626ced28037e27ce084474335932e4b15f72e2fe893754012ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): corpus/ct/src/paste_chips.rs:178-186 | corpus/ct/src/paste_chips.rs:189-197 \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":"corpus/ct/src/paste_chips.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa20ecc6dccc8eae45df322ee4b5afbbf9f4f9589bae695a62954a235a0a1887"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): corpus/ct/src/reply_review_comments.rs:99-105 | crates/rig-ecs/src/restore.rs:122-129 \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":"corpus/ct/src/reply_review_comments.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9e39cf6a348e00985adb822cbcb0aef020c41fb57abae765f49686e4b60174"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): corpus/base/src/code_search_index.rs:492-497 | corpus/ho/src/repo_map.rs:471-476 \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":"corpus/base/src/code_search_index.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0be651c40a810eb60964ef5caf9cffa172ea56a04247154fdac45e598428b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rig-candle/src/validation.rs:812-824 | crates/rig-candle/src/validation.rs:830-841 \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/rig-candle/src/validation.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"011264d5fc04d2727d8163c1c80829fe79aebc723f60ce1c71b06515f9561a64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): corpus/ct/src/history_versions.rs:352-360 | crates/rig-tools/src/lib.rs:336-344 \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":"corpus/ct/src/history_versions.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c64144d44a317a0bfb1e8a97313d13a6b1d3626dc7dff0d25536743783203d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rig-core/src/providers/cohere/embeddings.rs:124-135 | crates/rig-core/src/providers/ollama/embedding.rs:97-104 \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/rig-core/src/providers/cohere/embeddings.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d36fec41ae7212b4c4d94574a0d81bba9ef913b1c60ec2ad473ff934a53bdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/rig-vectorize/src/client/mod.rs:91-105 | crates/rig-vectorize/src/client/mod.rs:110-127 | crates/rig-vectorize/src/client/mod.rs:132-146 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-vectorize/src/client/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"017fb7311bc0fc85716ad1c33600cfb7811f8daf0a0e07bccc19b7e24e0eda74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rig-cassette/src/http/mod.rs:2979-2993 | xtask/src/cassette/bank.rs:511-520 \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/rig-cassette/src/http/mod.rs"},"region":{"startLine":2979}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9b4a63c0d065204a646a804849a38c657b09f1b7927a21d072a0d3f8fafe8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): plugins/rig-tui/src/input.rs:433-437 | plugins/rig-tui/src/input.rs:440-449 \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":"plugins/rig-tui/src/input.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"d113249f526079236742262a5fa3d4e39e5554cbb59b3edb7af25bdb19fdf9f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): plugins/rig-tui/src/renderers.rs:887-896 | plugins/rig-tui/src/renderers.rs:920-929 \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":"plugins/rig-tui/src/renderers.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdc806fa71de2b18278d041107acfacabed49cfd83d57471f05d5cb616540f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): corpus/base/src/http_api.rs:344-349 | corpus/ho/src/socket_attach.rs:398-408 \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":"corpus/base/src/http_api.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aab6e270fde020c3b6df5dc8ff1e96d82c86e66d791e2ef5bc3df7064c08cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): corpus/oc/src/line_provenance.rs:351-361 | corpus/oc/src/message_ratings.rs:324-334 \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":"corpus/oc/src/line_provenance.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a540e90b432f155b4fd49608ec4aa197b0ba91a04d2baaa9f7bac8d145d2b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/rig-candle/src/pose/network.rs:85-91 | crates/rig-candle/src/pose/network.rs:147-154 \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/rig-candle/src/pose/network.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"928aee1a14373eaae35761fd5d536373b8bcc82d3e6a446daafac733c06b3857"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): corpus/ho/src/tool_arg_repair/repair.rs:53-59 | corpus/sn/src/notebook_cells/notebook.rs:156-162 \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":"corpus/ho/src/tool_arg_repair/repair.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c69b0e09aaaa1cb5181027b7dd854ec446c9d62a86bec4989eb6bfbd900179b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/rig-core/src/conversation/mod.rs:1170-1176 | crates/rig-tools/src/overlay.rs:69-75 \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/rig-core/src/conversation/mod.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"428d0f12499c6f9bb988d0c4ec48af5c417e5c49b6765c072ad4b90f32f4a940"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): corpus/base/src/prompt_templates.rs:337-344 | corpus/sp/src/output_styles.rs:263-270 \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":"corpus/base/src/prompt_templates.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"4376885ffc35830be0a4076a49bd7ad912c8188944f6744e47aebe7f0815bf06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): corpus/fh/src/standing_team.rs:395-404 | corpus/ct/src/shell_companion.rs:542-551 \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":"corpus/fh/src/standing_team.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"8922a7c2a64ea57cd30f9fa518af2053043b1277c2c62248ce287f3e047f5d02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): corpus/sp/src/dead_ends_ledger.rs:213-219 | corpus/base/src/pinned_notes.rs:130-136 \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":"corpus/sp/src/dead_ends_ledger.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f051d9143b9583830d5b8e652ea6678176eef3f752593f993b3ea18f03abe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): corpus/base/src/code_search_index.rs:722-727 | corpus/sn/src/file_annotations.rs:291-296 \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":"corpus/base/src/code_search_index.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"4867b5d136ea870159383b78796652c6a62e1ecd969ae26f6ed9bb9a4ef982e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): corpus/base/src/nested_context.rs:167-176 | corpus/base/src/skills.rs:315-324 | corpus/ho/src/read_before_edit.rs:133-141 \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":"corpus/base/src/nested_context.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d32338cac69a14346dbeccc956855f308a1ebd468d72bb84f1b30247ce8281a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rig-core/src/serve/adapters.rs:139-148 | crates/rig-core/src/test_utils/relay.rs:43-52 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/serve/adapters.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a768c92ccb34a4ba8e54ceb3d0963b7c49f6f4c7a3890b9041367bd846d0d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): xtask/src/verify/extras.rs:303-313 | xtask/src/verify/guards.rs:572-586 \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":"xtask/src/verify/extras.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fc8188f0d7cb4bef1277972cee72bb7f9594a8803cb54c646af88cba0e864f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rig-core/src/providers/cohere/chat.rs:409-417 | crates/rig-core/src/providers/ollama/chat.rs:358-366 \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/rig-core/src/providers/cohere/chat.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6aebd087802a5457d1d9be0e897b2a35048fdd4a596633b0dca05a320daff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): corpus/base/src/checkpoint_rewind.rs:294-300 | corpus/base/src/checkpoint_rewind.rs:309-315 \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":"corpus/base/src/checkpoint_rewind.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be5543fb91fa144f4ef0397b9bf4d41d1cb0cfa47678fef9415d36adaa63dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): corpus/fh/src/correction_learner.rs:545-552 | corpus/sn/src/tool_stats.rs:152-160 \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":"corpus/fh/src/correction_learner.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a37c1a364bb47883c4e98d00144ef03e3be0eb76ee51ba313c6f19216faf2bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rig-core/src/providers/anthropic/streaming.rs:60-67 | crates/rig-core/src/providers/cohere/streaming.rs:77-85 \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/rig-core/src/providers/anthropic/streaming.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7318d4c1225b78b00b0f8510397732b87ed10099cfed10dd1b98fd06b9a19c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): corpus/fh/src/safety_judge.rs:207-216 | corpus/fh/src/structured_compaction.rs:220-228 \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":"corpus/fh/src/safety_judge.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89a4a303ae6aa65a129bb12b214fe43b8673ccf237af749d48eefcf579862a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): corpus/ho/src/api_key_pool.rs:523-529 | corpus/oc/src/rate_limit_status.rs:269-274 \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":"corpus/ho/src/api_key_pool.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db11431ca1da2f41f9fd2e45a6031a820df8f982968afbfba22c15345a506db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): corpus/sn/src/terminal_sessions.rs:517-523 | plugins/rig-basics/src/subagents/lifecycle.rs:450-456 \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":"corpus/sn/src/terminal_sessions.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ececcc468c5aae6b8fb1967c5f123bcd826d69ae5a0f900de6d84b84571bc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/rig-core/src/operation/completion.rs:1656-1660 | crates/rig-ecs/src/turn.rs:1488-1493 \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/rig-core/src/operation/completion.rs"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"809dabcb4a752b92e6a673316c59fcf40bdbf9236629f7c97a287b911161dd4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/rig-core/src/providers/cohere/embeddings.rs:44-55 | crates/rig-core/src/providers/ollama/embedding.rs:58-68 | crates/rig-core/src/providers/voyageai/wire.rs:71-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 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/rig-core/src/providers/cohere/embeddings.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7451548ce99e5f6a6fe7651aaa304e95aa4874087242a01c29ee64bf7011585"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): corpus/base/src/export/render.rs:413-420 | corpus/ho/src/inline_shell.rs:286-294 | corpus/library/src/session_edit_library.rs:803-811 | plugins/rig-acp/src/translate.rs:334-342 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/export/render.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"0878975ee97e3d5e175a08771b67eb243e0f715524382c7b252d25aa22fbfa27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): corpus/sn/src/watch_ai_comments.rs:423-427 | corpus/sp/src/inbox_folder.rs:486-492 \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":"corpus/sn/src/watch_ai_comments.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5a10032835cca0a9d1aca2cfc85480c32b7d9bccb38efa84d34fba3892e1c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rig-core/src/completion/message.rs:117-125 | crates/rig-core/src/completion/request.rs:549-557 \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/rig-core/src/completion/message.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2244484fb11936be6a1f2aadef7e386ddd0b815645b8da36b5da74e6154de5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rig-core/src/operation/verify.rs:71-83 | crates/rig-core/src/providers/gemini/cached_content.rs:47-62 \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/rig-core/src/operation/verify.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"112c428ada1c684b5e43afe6c9e778f064ee56828da459854901853917d35090"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): corpus/oc/src/message_ratings.rs:149-153 | corpus/sn/src/bookmarks.rs:81-85 | plugins/rig-basics/src/welcome.rs:183-187 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/oc/src/message_ratings.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d08c022eb982df9454bbe60f7f6de1a7624c8719c45e8b8ae7909b5ecd207a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/rig-qdrant/src/lib.rs:59-62 | crates/rig-scylladb/src/lib.rs:308-311 \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/rig-qdrant/src/lib.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"563fe8b9934ee6dc48c943dd0922714468f46c893f139b4ef4363716726c9935"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): corpus/base/src/output_truncate.rs:250-260 | crates/rig-core/src/providers/internal/wire_ids.rs:99-110 \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":"corpus/base/src/output_truncate.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f0e5c189a0c17408629a4de3e3e784e632739e5728381201d52f096154a815"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): corpus/ho/src/api_key_pool.rs:550-556 | corpus/oc/src/rate_limit_status.rs:294-299 \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":"corpus/ho/src/api_key_pool.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e5d5f8c493527766c7cd16251a66761eef82519360f70390ed3db61cb10df2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/rig-memory/src/dir.rs:124-130 | crates/rig-memory/src/store.rs:313-320 \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/rig-memory/src/dir.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed70864d8169671d4c62b57c476b5596b81999470739b79c2923647632e1fc34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): corpus/base/src/code_search_index.rs:744-750 | corpus/base/src/retry_with_model.rs:192-198 \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":"corpus/base/src/code_search_index.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06dd4dd16815f4597046b42b24f18cf2384cc709c0c3728a053d04690164a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): corpus/base/src/debate.rs:124-127 | plugins/rig-tui/src/render.rs:1233-1236 \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":"corpus/base/src/debate.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9c2d051d976111de46b387e47ec34cf0d0b7a2842827e81025287531752fc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/rig-memory/src/compaction.rs:361-367 | crates/rig-memory/src/tokens.rs:279-285 \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/rig-memory/src/compaction.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"8056cb4af8734d7ef9d1228b08daac6434afb3e048b12b9fcfddda0c1fbc9d7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/rig-core/src/completion/message/citation.rs:201-204 | crates/rig-core/src/completion/message/native.rs:384-387 \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/rig-core/src/completion/message/citation.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20394893d960cbe69fd83782e02fae3d7e8b77772835ff76537fc8b9b28f1e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/rig-core/src/conversation/mod.rs:703-708 | plugins/rig-tui/src/transcript.rs:1118-1123 \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/rig-core/src/conversation/mod.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb355d1ed239f6d861a429fe6be7728d0a9ea70753e3eb79843722f7ae1977c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/rig-core/src/providers/anthropic/modality.rs:144-153 | crates/rig-core/src/providers/gemini/model_listing.rs:236-242 | crates/rig-core/src/providers/ollama/model_listing.rs:69-75 \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/rig-core/src/providers/anthropic/modality.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d62dbb3e2601431c1a0bd94e39daedf034804f7a6e9dbf49ecb7f29d67fda37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): corpus/ho/src/dry_run.rs:339-345 | corpus/ho/src/spend_by_origin.rs:170-176 \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":"corpus/ho/src/dry_run.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59a34a7afdc7a9acd87ba740206bddbd9e4eb40faa4807fa134d0811014a4d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/rig-core/src/test_utils/trace_capture.rs:70-77 | crates/rig-tools/src/overlay.rs:61-66 \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/rig-core/src/test_utils/trace_capture.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"75352dfc8079a1e01d78f61c9d586bf5048c5e9608223e4dc3d533f701ceb9d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/rig-harness/src/host/launcher.rs:390-395 | crates/rig-harness/src/run.rs:301-306 \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/rig-harness/src/host/launcher.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"8511798d657247574b23ecf696cc1062917fb0f6e71da5f6989907aa1de79aca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): corpus/oc/src/dependency_guard.rs:489-492 | plugins/rig-basics/src/coding_tools/remote.rs:135-148 \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":"corpus/oc/src/dependency_guard.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"4117df2d0c9b7e81bb5fd5a88b5eb0ce49b34c0d75f880a6472a42142db77faf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): corpus/oc/src/message_ratings.rs:70-73 | crates/rig-memory/src/compaction.rs:637-640 \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":"corpus/oc/src/message_ratings.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bc6b4604a93494a0a86615f54b19b1a3550f93c48a134f4263f827617e34a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rig-core/src/providers/anthropic/completion.rs:1141-1150 | crates/rig-core/src/providers/openai/mod.rs:58-67 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c123d255691e026aa674d60bc7cd989bebefb44384ea7c2cb24daf3275a64df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/rig-ecs/src/stage.rs:951-955 | test-support/rig-harness-test-support/src/lib.rs:326-330 \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/rig-ecs/src/stage.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"90162610d5a749eb9515a6cbf8ccd6ba83abfcdcec25534d8d3088d111413170"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): test-support/rig-test-support/src/bank.rs:74-80 | xtask/src/cassette/shapes.rs:118-123 \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":"test-support/rig-test-support/src/bank.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b6cf3f60964e9f64162f4bbe4585f53dd89d3725e6b680daa1423c62e8cc9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): corpus/oc/src/issue_references.rs:399-404 | corpus/sn/src/terminal_sessions.rs:218-223 \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":"corpus/oc/src/issue_references.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"69563d54da6827cdddcdc79eead9333ba0d16157340c78c9e9efe723f47217ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): corpus/base/src/code_search_index.rs:1074-1080 | corpus/ho/src/background_verify.rs:576-582 | corpus/sn/src/scope_fence.rs:269-275 \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":"corpus/base/src/code_search_index.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"34eadf02bfce965795e5a6d38a922e45c2ea0494f0c12d71fd66acbf712f38f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): corpus/ct/src/conversation_chapters.rs:159-163 | corpus/sn/src/bookmarks.rs:49-53 \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":"corpus/ct/src/conversation_chapters.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2aa4afc0dfaac53cc50c2bd0cf3a734afd835514e91b953e10823cec4d5ec03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): corpus/rf-06/src/main.rs:22-27 | corpus/rf-07/src/bin/rerun.rs:11-16 \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":"corpus/rf-06/src/main.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3115feb9dbcbf7e9e6533e6802e2b1a20fd03162e143832dccd0614db40104"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/rig-core/src/providers/gemini/completion.rs:280-283 | crates/rig-gemini-grpc/src/completion.rs:109-112 | crates/rig-vertexai/src/completion.rs:178-181 \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/rig-core/src/providers/gemini/completion.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3740d0f5b168b0f752f0fb72eccddc14cc1fa038902107f3e62930f39934cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/rig-core/src/providers/gemini/embedding.rs:75-80 | crates/rig-gemini-grpc/src/embedding.rs:59-63 \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/rig-core/src/providers/gemini/embedding.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9c157ec9cff0caad85de42797925682c99da710e721256ca91fe4599871900"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): corpus/base/src/code_search_index.rs:1044-1048 | corpus/ct/src/shell_companion.rs:280-284 \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":"corpus/base/src/code_search_index.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5228d62cd602e27a5567c34b7520ccac20b88464649313313e11e2dc2c9f6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): corpus/base/src/map_reduce.rs:575-580 | corpus/sn/src/sessions_prune_cli.rs:630-634 \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":"corpus/base/src/map_reduce.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4569f4cda46006ec5462e82a70633f9b1109fb01f41c411ebfc2c082b24c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): corpus/fh/src/next_step_suggestions.rs:218-222 | corpus/oc/src/coverage_gap_nudge.rs:794-798 \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":"corpus/fh/src/next_step_suggestions.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab86d31de2816e2333e7449e49c374fd3a2124c1ecb7ec915f3da114ed7a0046"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): corpus/ho/src/blackboard.rs:405-409 | crates/rig-harness/src/host/launcher.rs:420-423 \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":"corpus/ho/src/blackboard.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6ef5cd296221fbf8314e56505529649524a01a1fc33a1a65393347acf3f057"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/rig-core/src/driver.rs:381-384 | crates/rig-core/src/driver/dyn_model.rs:164-167 \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/rig-core/src/driver.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c6927ccc968a027697c01edf0def0470c78a5ed20a7252c2fda3aeadeb4985"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/rig-core/src/serve/handler.rs:635-639 | crates/rig-core/src/tool/context.rs:302-306 \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/rig-core/src/serve/handler.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de032139ce9c8797dc5da0b43cd23f300fafd946eeec9e5c38d4ee51b8c045d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/rig-cassette/src/effect_log/jsonl.rs:987-992 | crates/rig-memory/src/dir.rs:143-148 \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/rig-cassette/src/effect_log/jsonl.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e751c4dc679485ec180187493ad349cfc2ceab1e70ac9345e99bee3d8f0ad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): corpus/ho/src/background_verify.rs:425-429 | corpus/oc/src/coverage_gap_nudge.rs:276-280 \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":"corpus/ho/src/background_verify.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"738dc6eed04c381d760b018a15ca7c3567a37dbda1cb33b8ae08d363e11bbdef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): corpus/oc/src/dataset_cli.rs:48-55 | corpus/sn/src/usage_report_cli.rs:31-39 \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":"corpus/oc/src/dataset_cli.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3907479416a821f74d02ed7ef6aace0f5bf18f8e016bd59654e34ec093ebbeae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): corpus/sn/src/vim_input/editor.rs:710-714 | plugins/rig-tui/src/editor.rs:378-383 \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":"corpus/sn/src/vim_input/editor.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c813bed1ea402908368562cdbc7700999a38660fee5b670070a412eaa98caa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): corpus/sp/src/churn_monitor.rs:220-226 | crates/rig-cassette/src/http/mod.rs:2148-2154 \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":"corpus/sp/src/churn_monitor.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"739d9f71ba7479ca7615c81ba48b924189f0d693b6a716c902d2b746e5f8b0ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): corpus/sn/src/tool_stats.rs:128-133 | plugins/rig-tui/src/input.rs:226-231 \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":"corpus/sn/src/tool_stats.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cfe4284a2282c0019c66cf0a990dd6eca627c290a5bc6849a509c9cfdecb9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): corpus/base/src/context_inspector.rs:359-362 | corpus/ho/src/spend_by_origin.rs:124-127 \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":"corpus/base/src/context_inspector.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3f457b1e7c09088e7f61ccc4a17e622d8850a356b1753101362d4575dcbe30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): corpus/base/src/todo_tracker.rs:151-154 | corpus/rf-03/src/todo.rs:144-147 \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":"corpus/base/src/todo_tracker.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70da530a08dbe3344bc13b2fca0bd30c83c0c4a4f2eaf14554dd51fe53f60bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rig-core/src/providers/cohere/chat.rs:83-91 | crates/rig-core/src/providers/ollama/chat.rs:85-96 \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/rig-core/src/providers/cohere/chat.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"568f54a98958e8d1fea74b87f2a62bdf5cc356f16657d318318e90e4e701c7e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 1\u002B corresponding lines): crates/rig-core/src/providers/minimax.rs:87-87 | crates/rig-core/src/providers/moonshot.rs:58-58 | crates/rig-core/src/providers/opencode.rs:54-54 | crates/rig-core/src/providers/xiaomimimo.rs:49-49 | crates/rig-core/src/providers/zai.rs:59-59 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 1 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/rig-core/src/providers/minimax.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f78b5baaaf01f62276187b0e5789d9bb5156b7916fd43d501aaf54c80f3a2b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/rig-harness/src/host/launcher.rs:311-316 | crates/rig-harness/src/host/signals.rs:172-177 | plugins/rig-basics/src/print.rs:1026-1031 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-harness/src/host/launcher.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"4099da5369289d64ddd80a33158cd68c048a8626d7c0895262ef8a38a03c6181"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): xtask/src/verify/extras.rs:111-117 | xtask/src/verify/guards.rs:303-307 \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":"xtask/src/verify/extras.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0c628bf2d2c01539532467465b085d248fd49ebad5fa06c78826a35175a77f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): corpus/fh/src/early_tool_start.rs:350-354 | corpus/ho/src/throughput_item.rs:166-170 \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":"corpus/fh/src/early_tool_start.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39dfff166b7e796c5a64d1a72a95320a10a730bbef786d03e73f0e507c19d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): corpus/sn/src/server_side_state.rs:274-278 | crates/rig-core/src/serve/layer.rs:120-124 | crates/rig-core/src/serve/map.rs:38-42 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/server_side_state.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b604060425b49617e7a0567bc36d2299b788680f9dd839652e38cdd23cfd6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): corpus/ct/src/ask_session_cli.rs:258-273 | corpus/sp/src/commit_msg_hook.rs:246-261 \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 \u0060corpus/ct/src/ask_session_cli.rs:258\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":"corpus/ct/src/ask_session_cli.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed6dba71244bfc7f245cf36adb4f2d9a9ab9b8c7f9ad431dcb5f4da87bc941b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): corpus/fh/src/editor_front.rs:785-799 | corpus/ho/src/hunk_review.rs:172-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060corpus/fh/src/editor_front.rs:785\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/editor_front.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c672f33bb69ab58c3a908ca06da45bfed2ddf54b9427402abc955a0137545cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): corpus/sn/src/model_params.rs:460-473 | xtask/src/catalog.rs:947-960 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"corpus/sn/src/model_params.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c22c5e208f32a2c43b2d4a44d3d8697fdf31885e4366dacee4d09a6a2740b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/rig-core/src/providers/anthropic/streaming.rs:363-375 | crates/rig-core/src/providers/cohere/streaming.rs:218-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-core/src/providers/anthropic/streaming.rs:363\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/streaming.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"6248fed2de3dd3f1efd77f2e6c89f276d624ca7d3d4b9a71cb5fc28e4dbe2634"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): corpus/oc/src/dataset_cli.rs:202-214 | corpus/sn/src/usage_report_cli.rs:72-84 \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":"corpus/oc/src/dataset_cli.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecda49c411b26d6020b051bad6bae4a9dadeb903a2fb4993bd2a10aabc3bade1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): corpus/sn/src/terminal_sessions.rs:380-392 | corpus/sn/src/terminal_sessions.rs:451-463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060corpus/sn/src/terminal_sessions.rs:380\u0060 it begins part-way through the construct above it, so those exact 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":"corpus/sn/src/terminal_sessions.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b36ba052ae780b46096ba4eccd4206c30282a51e633d8099c901056c0cf39f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): corpus/ct/src/schema_adapter/schema.rs:380-391 | corpus/sn/src/web_fetch/policy.rs:126-137 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060corpus/ct/src/schema_adapter/schema.rs:380\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":"corpus/ct/src/schema_adapter/schema.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc830332c23cb991fbc8a6391c683680bd3b603668d70a67eb438bfe32ae31a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): corpus/fh/src/next_step_suggestions.rs:321-332 | plugins/rig-tui/src/keys.rs:675-686 \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 \u0060corpus/fh/src/next_step_suggestions.rs:321\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":"corpus/fh/src/next_step_suggestions.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae555b9c7ec25b5b1c7aa14db2086f0a2c4cb98c90b540abf5a91c2d7bdbdc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): corpus/ho/src/conversation_surgery.rs:50-61 | corpus/library/src/session_edit_library.rs:463-474 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"corpus/ho/src/conversation_surgery.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8ae1ba528feccad7462cedef85535585e3b78bba3173043670c16dcc993c1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/rig-candle/src/model.rs:705-716 | crates/rig-candle/src/pose.rs:705-715 \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/rig-candle/src/model.rs:705\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/rig-candle/src/model.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"40379d7531887ac6e05854b24ddf35f4472b4efd06098e36f9f2c31e7d813788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/rig-core/src/providers/cohere/chat.rs:237-247 | crates/rig-core/src/providers/ollama/chat.rs:331-340 \u2014 \u0060crates/rig-core/src/providers/cohere/chat.rs\u0060 and \u0060crates/rig-core/src/providers/ollama/chat.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 30 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-core/src/providers/cohere/chat.rs:237\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/cohere/chat.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"df031f9d7027505578d03d8692bbf73641e865e6099eff7ae4b9ba88802530e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rig-ecs/src/turn.rs:1406-1416 | crates/rig-ecs/src/turn.rs:1467-1477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-ecs/src/turn.rs:1406\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/turn.rs"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"46df64b30d7881401ee83ee9ba44679f5fe5184300374566cac7bacdfb49beb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rig-postgres/src/memory.rs:110-120 | crates/rig-sqlite/src/memory.rs:88-98 \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/rig-postgres/src/memory.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"31862b072eb18380dadd3f75dd800527410b3d3a32efbffb486b0e0d3e5a0f45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): xtask/src/verify/extras.rs:51-61 | xtask/src/verify/guards.rs:96-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 \u0060xtask/src/verify/extras.rs:51\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"xtask/src/verify/extras.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d01db0d5e25880d29348b0c40e9387db1296726671f28defa278a91f66147c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): corpus/base/src/check_after_turn.rs:269-278 | corpus/ho/src/background_verify.rs:259-268 \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 \u0060corpus/base/src/check_after_turn.rs:269\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":"corpus/base/src/check_after_turn.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5659614c44d7d5087391cc47c17d0e4bf12a10650660568b48215aea90d6ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): corpus/base/src/custom_provider.rs:186-195 | corpus/ho/src/command_provider.rs:200-209 \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":"corpus/base/src/custom_provider.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2471c72a47f5ed2867a4d17a56555bb8bc5942f99650946a0e3230f2deaa08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): corpus/ct/src/ask_session_cli/session.rs:210-219 | crates/rig-memory/src/compaction.rs:1206-1215 \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 \u0060corpus/ct/src/ask_session_cli/session.rs:210\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ct/src/ask_session_cli/session.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a9dc4a4e62a48ad612f11b3ecd470d554854eab323c5581678c591dc6cd0d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): corpus/ct/src/process_reaper.rs:736-745 | corpus/ct/src/process_reaper.rs:771-780 \u2014 both copies are in the same file, so extract the block 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":"corpus/ct/src/process_reaper.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde49d4b320fe4cc034f6c993c5d8c0dc550be0f306469736c7a0e338202b64e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rig-core/src/operation/completion.rs:873-882 | crates/rig-core/src/operation/completion.rs:929-938 \u2014 both copies are in the same file, so extract the block 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/rig-core/src/operation/completion.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"8487a39022287fdd098ba5242547e51ece7ea5dd2eef0ad2dddbf997cd88e4d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/rig-core/src/providers/anthropic/streaming.rs:454-462 | crates/rig-core/src/providers/cohere/streaming.rs:280-289 \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/rig-core/src/providers/anthropic/streaming.rs:454\u0060 it does not close everything it opens, so those exact 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/rig-core/src/providers/anthropic/streaming.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e13e91c6e43a04b26e8c1cea8734081e917b0309d72408488d59a71f795ae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rig-milvus/src/lib.rs:188-197 | crates/rig-milvus/src/lib.rs:229-238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/rig-milvus/src/lib.rs:227\u0060 calls \u0060create_insert_request\u0060 and \u0060crates/rig-milvus/src/lib.rs:186\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/rig-milvus/src/lib.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1818228e8e2b707b89c66c3b22c5a6b50d74a1211a1a2abc865710b6bb2db34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): corpus/sn/src/terminal_sessions.rs:378-387 | corpus/sn/src/terminal_sessions.rs:449-458 | corpus/sn/src/terminal_sessions.rs:481-490 \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":"corpus/sn/src/terminal_sessions.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff02f3a032ec037c7a3886108e98f2c090d837e081efaf97d07a543284a6bd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): corpus/base/src/output_truncate.rs:237-246 | corpus/base/src/summarize_tool_output.rs:324-333 \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":"corpus/base/src/output_truncate.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fa692c77b5c1d1b6d7442fc41fa47befb466b28a8ef5f82c2b2f6385af2bd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): corpus/ct/src/timed_grants.rs:502-510 | plugins/rig-steel/src/harness.rs:336-344 \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 \u0060corpus/ct/src/timed_grants.rs:502\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":"corpus/ct/src/timed_grants.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3b95551cdc16ba0bde1cea289a5ebcbe0a9ddd9260f2d76ce2b3e3e05c313b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rig-bedrock/src/options.rs:36-44 | crates/rig-core/src/providers/anthropic/options.rs:33-41 \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/rig-bedrock/src/options.rs:36\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rig-bedrock/src/options.rs:45\u0060 calls \u0060Some\u0060, \u0060Omit\u0060 and \u0060crates/rig-core/src/providers/anthropic/options.rs:42\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/rig-bedrock/src/options.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d05f399033883f7ca92e868295d3612ac024c9f5c443c273f43e914b939761"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rig-core/src/operation/completion.rs:1257-1265 | test-support/rig-test-support/src/citations.rs:86-94 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-core/src/operation/completion.rs:1257\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/rig-core/src/operation/completion.rs:1254\u0060 calls \u0060Some\u0060, \u0060String\u0060, \u0060push_str\u0060 and \u0060test-support/rig-test-support/src/citations.rs:85\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/operation/completion.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f683232caa42c2f5c26a38a3fbf4527fcf61e5b05ce1ed31dbd0e39e50c425b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rig-core/src/providers/chatgpt/extension.rs:119-127 | crates/rig-core/src/providers/openai/extension/mod.rs:301-309 \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/rig-core/src/providers/chatgpt/extension.rs:119\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rig-core/src/providers/openai/extension/mod.rs:310\u0060 calls \u0060reply_field\u0060, \u0060default\u0060 and \u0060crates/rig-core/src/providers/chatgpt/extension.rs:128\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/rig-core/src/providers/chatgpt/extension.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e94beadc8eb737bd84062df3794dda10f26cebe14c603a15d921ba3db810853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rig-core/src/providers/gemini/image_generation.rs:279-287 | crates/rig-core/src/providers/gemini/transcription.rs:116-124 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-core/src/providers/gemini/image_generation.rs:279\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 \u0060request\u0060 to \u0060ImageGenerationRequest\u0060 in one and \u0060transcription::TranscriptionRequest\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/rig-core/src/providers/gemini/image_generation.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e99690eaf992da3a3ea52a45ec7ce3f19e594a5267cee7424aab638df09244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/rig-memory/src/tokens.rs:119-127 | plugins/rig-tui/src/pick.rs:877-884 \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/rig-memory/src/tokens.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee482cbf9f7bb433d590e9b84a95c09afb5aa36b5942d9dad2f61d345e098298"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rig-rmcp/src/native.rs:184-192 | crates/rig-sqlite/src/lib.rs:1278-1286 \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/rig-rmcp/src/native.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed42810171b4a5149ba2c62dc77859be1c5fff625caa8bd16da8fa88b125bacc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rig-tools/src/process.rs:335-344 | crates/rig-tools/src/process.rs:413-422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-tools/src/process.rs:335\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-tools/src/process.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b6ee1d3679c86733f1d7ba7fd0ec631cd8be39d1c4bacb05fcfd438fdf7527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): plugins/rig-basics/src/compaction.rs:1313-1321 | plugins/rig-basics/src/compaction.rs:1435-1443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/compaction.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed071c784ecb73d8c06e7966823e002276d377a72ec2a70fd374481aa8c7641b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): corpus/ct/src/schema_adapter/schema.rs:379-386 | corpus/ho/src/degenerate_stream_cutter.rs:428-435 | corpus/oc/src/dependency_guard.rs:74-81 | corpus/sn/src/web_fetch/policy.rs:125-132 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060corpus/ct/src/schema_adapter/schema.rs:379\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ct/src/schema_adapter/schema.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2529f7e9d1114c9183f229d6f96b8ef099b38050a70356747307b86d3540a51e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): corpus/oc/src/dataset_cli.rs:218-225 | corpus/oc/src/line_provenance.rs:630-637 | corpus/sn/src/usage_report_cli.rs:92-99 \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 \u0060corpus/oc/src/dataset_cli.rs:218\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":"corpus/oc/src/dataset_cli.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46e67f4e5a3d075eede584d4d4e7539ff848dbad6881f9ecba9d7a1aebf48e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): corpus/base/src/auto_commit.rs:235-242 | corpus/base/src/auto_commit.rs:335-342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060corpus/base/src/auto_commit.rs:235\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/auto_commit.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7486c26048c7e6715c8a0c6f68fa6af1896907b2d55c22c3e1c427492649cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): corpus/base/src/handoff.rs:154-161 | corpus/ct/src/conversation_chapters.rs:757-764 \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 \u0060corpus/base/src/handoff.rs:154\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":"corpus/base/src/handoff.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde24241e9401404394d1d2226ad1ed9174af419045ef1ed7cd13e3322555c37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): corpus/base/src/http_api/server.rs:93-100 | corpus/ct/src/metrics_endpoint/server.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. 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":"corpus/base/src/http_api/server.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d386ad4823ae778da7731da9b07b9c521ada8391a8e9e1f0fa416afa90a3a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): corpus/fh/src/lsp_tools.rs:714-721 | corpus/fh/src/lsp_tools.rs:761-768 \u2014 both copies are in the same file, so extract the block 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":"corpus/fh/src/lsp_tools.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76b5e62b25ed2d8c444116a18b37381d85b04b00eae47c81d45745fb3c5e71b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): corpus/sn/src/sessions_prune_cli.rs:121-128 | corpus/sn/src/usage_report_cli/options.rs:146-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 \u0060corpus/sn/src/sessions_prune_cli.rs:121\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/sessions_prune_cli.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd183930628080702a441c829dceb6b2d5d38a84b779279b7d8e878341c7e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rig-bedrock/src/options.rs:79-86 | crates/rig-core/src/providers/anthropic/options.rs:78-85 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-bedrock/src/options.rs:79\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/rig-bedrock/src/options.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a826cb099187393295e3ddb3881e14c515cc669b384bcf462e9cd3f755c6557a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rig-core/src/providers/anthropic/options.rs:317-325 | crates/rig-core/src/providers/openai/options.rs:1114-1122 \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/rig-core/src/providers/anthropic/options.rs:317\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/rig-core/src/providers/anthropic/options.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"76841031ddbd8d9f8637e764e29a990deb1b276152dc47597f0ee56f52df236a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rig-core/src/providers/cohere/chat.rs:164-171 | crates/rig-core/src/providers/ollama/chat.rs:175-182 \u2014 \u0060crates/rig-core/src/providers/cohere/chat.rs\u0060 and \u0060crates/rig-core/src/providers/ollama/chat.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 30 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-core/src/providers/cohere/chat.rs:164\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/cohere/chat.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d2fde36257e0c2828b60f58fb1cb2c5396e7d4de7eea6aa62fc09a812185c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rig-core/src/providers/ollama/chat.rs:323-330 | crates/rig-core/src/providers/openai/wire/chat.rs:568-575 \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/rig-core/src/providers/ollama/chat.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"3645b8cb230f139e716543f2696a9bbbc81ddc92c52d6e1b24e892279bf148bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): corpus/base/src/custom_provider.rs:174-182 | corpus/ho/src/command_provider.rs:188-196 | corpus/sn/src/race_models.rs:59-67 \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. 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":"corpus/base/src/custom_provider.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1cc9a95e13988b5a033d495cb0d870c34a6bfa5935ea230bb949082c86f07f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): corpus/base/src/share/render.rs:124-130 | crates/rig-core/src/providers/internal/auth/loopback.rs:493-499 \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 \u0060corpus/base/src/share/render.rs:124\u0060 it does not close everything it opens, so those exact 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/rig-core/src/providers/internal/auth/loopback.rs:500\u0060 calls \u0060push_str\u0060 and \u0060corpus/base/src/share/render.rs:131\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":"corpus/base/src/share/render.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"086f2cd5abd0fe27c524a1ca811bec04392e4fb8c6fb45c882c6881c0a279436"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): corpus/base/src/summarize_tool_output.rs:253-258 | corpus/fh/src/mentions_and_images.rs:619-625 \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 \u0060corpus/base/src/summarize_tool_output.rs:253\u0060 it does not close everything it opens, so those exact 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":"corpus/base/src/summarize_tool_output.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"36477306ca0a2bb82ee2c3f06a4758fced528228ae17ccb7ef8131b22171f55e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): corpus/library/src/session_doctor_library.rs:364-371 | corpus/library/src/session_edit_library.rs:662-669 \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":"corpus/library/src/session_doctor_library.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"192c3120d7e461dbe9fd231f3109c7378dc32254e3d8c94774f263dfb90c20f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): corpus/sn/src/task_queue.rs:344-351 | plugins/rig-basics/src/sessions/agents.rs:122-129 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"corpus/sn/src/task_queue.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"8188a35a6a5355a39c22518c22c5432eb65df262ef2cb0ef74bb0d757296d8e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-candle/src/generation.rs:586-592 | crates/rig-candle/src/generation.rs:643-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/generation.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53d20a3dab5570792d16b7087930483e4577ed955bc08a1f25e5d1e9ce1ae12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-candle/src/loader.rs:121-127 | crates/rig-candle/src/loader.rs:163-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-candle/src/loader.rs:121\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/rig-candle/src/loader.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a27a04e9a7d6b1832dd696f27521fb544c79a19f589aa010dfbbe883880b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rig-candle/src/model.rs:650-657 | crates/rig-candle/src/model.rs:687-694 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-candle/src/model.rs:650\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/model.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d13397830b8be1897a4d6dee7f9b566e7d80482a7417735107039340fd219f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-core/src/providers/gemini/audio_generation.rs:352-358 | crates/rig-core/src/providers/gemini/image_generation.rs:214-220 \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/rig-core/src/providers/gemini/audio_generation.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab13bf5a6120f87720a545e2ad29ae33c02085ce0b366cb88d6b59b64a3e5ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-core/src/tool/validate.rs:486-492 | test-support/rig-history-conformance/src/lib.rs:725-732 \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/rig-core/src/tool/validate.rs:486\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/rig-core/src/tool/validate.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda7d38d63d6f88f0d6991a392eb70f7d4225a8116edf5c11aeb61f604457f70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): plugins/rig-tui/src/input.rs:503-509 | plugins/rig-tui/src/input.rs:544-550 \u2014 both copies are in the same file, so extract the block 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":"plugins/rig-tui/src/input.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dee282e6b4a5f85ebb6d5d56e643586161b7669d1a05c72709359db38535d1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): corpus/base/src/skills.rs:260-266 | corpus/ho/src/script_tools.rs:172-178 | corpus/sn/src/glob_rules.rs:343-349 \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. 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":"corpus/base/src/skills.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dda84d27ce65047eeb2c381347e5c387e0ae5d423241f881f9eb769c1ed13c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): corpus/ct/src/ask_session_cli/session.rs:211-216 | crates/rig-core/src/completion/history.rs:1753-1758 | crates/rig-memory/src/compaction.rs:1207-1212 \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 \u0060corpus/ct/src/ask_session_cli/session.rs:211\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ct/src/ask_session_cli/session.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c29548f66737a9cb2c96f1a2585920f27daed6caf690194e12a5ce669653fa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): corpus/base/src/pinned_notes.rs:86-91 | plugins/rig-basics/src/subagents/tools.rs:119-124 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060corpus/base/src/pinned_notes.rs:86\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/pinned_notes.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3178dcf030517268595c74e16e73ad654d25c21f64c8e7adb910a21640ce4e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): corpus/base/src/todo_tracker.rs:198-203 | corpus/rf-03/src/todo.rs:201-206 \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 \u0060corpus/base/src/todo_tracker.rs:198\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/todo_tracker.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"255b384ee8d701fe96c0d854ff638b8d6ca1173c7cb3792f69d383be51b8d55e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): corpus/ho/src/spend_by_origin.rs:240-245 | corpus/sn/src/usage_report_cli/report.rs:198-203 \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":"corpus/ho/src/spend_by_origin.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b13b35f1ae0df3fecc15a3740c128c3004aad65f0f817cde19bbd1255e7139"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): corpus/oc/src/dataset_cli/dataset.rs:160-171 | corpus/sn/src/usage_report_cli/report.rs:284-295 \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":"corpus/oc/src/dataset_cli/dataset.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f1a65b49c881869455dc6a8d0e0555da661cf2d075d706d70fdc7ca0491a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): corpus/sn/src/terminal_sessions/pty.rs:137-142 | crates/rig-tools/src/process.rs:323-328 \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 \u0060corpus/sn/src/terminal_sessions/pty.rs:137\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/terminal_sessions/pty.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"da57db3f79c7b9ec166b0d56d40ebc75eebb1d3c57bb0f2f1836ea76ae31277a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rig-cassette/src/scrub.rs:1817-1822 | crates/rig-cassette/src/scrub.rs:1893-1901 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-cassette/src/scrub.rs:1817\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/scrub.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"da09703bc9ebc70188b57caa9a42ba824099173d57e234045138251379d175ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-core/src/loaders/epub/loader.rs:252-258 | crates/rig-core/src/loaders/pdf.rs:259-265 \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/rig-core/src/loaders/epub/loader.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f9bb56ac134cb715b22c31e8f8a220502af46cd8587fbed551b6628b42d47a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rig-core/src/providers/openai/options.rs:1015-1020 | crates/rig-core/src/providers/openai/options.rs:1476-1481 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-core/src/providers/openai/options.rs:1015\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/rig-core/src/providers/openai/options.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c0cdf1f10b79ebca431d1d2bb8a85bb5f57606a60e6ad6e1894a12ed6345c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rig-reqwest/src/lib.rs:470-475 | crates/rig-reqwest/src/middleware.rs:56-61 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-reqwest/src/lib.rs:470\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-reqwest/src/lib.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccb3d8c066912aebb7ab4493372e69136aef55258059d6ca825e9468ec2d068"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): plugins/rig-acp/src/router.rs:645-657 | plugins/rig-acp/src/router.rs:659-671 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/rig-acp/src/router.rs:645\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":"plugins/rig-acp/src/router.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"963f5db8c34d76f0802fe66edc4706866388d358fc6246644169adcaaaa15ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): plugins/rig-claude-cloak/src/transport.rs:484-491 | plugins/rig-claude-cloak/src/transport.rs:608-615 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060plugins/rig-claude-cloak/src/transport.rs:484\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-claude-cloak/src/transport.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0776631edc0853262dab247a53e0ae770687184a2bac1c2f2adf4c846317be2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/rig-core/src/providers/openai/options.rs:704-708 | crates/rig-core/src/providers/openai/options.rs:773-777 | crates/rig-core/src/providers/openai/options.rs:826-830 | crates/rig-core/src/providers/openai/options.rs:975-979 | crates/rig-core/src/providers/openai/options.rs:1097-1101 \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/rig-core/src/providers/openai/options.rs:704\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/options.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cfd4cdc5af657d0db2504f1dfb86fd496c6c1dce6b4fe137d4fa8afbb1d3d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/rig-core/src/providers/openai/options.rs:945-950 | crates/rig-core/src/providers/openai/options.rs:1101-1106 | crates/rig-core/src/providers/openai/options.rs:1127-1132 | crates/rig-core/src/providers/openai/options.rs:1160-1165 \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/rig-core/src/providers/openai/options.rs:945\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/rig-core/src/providers/openai/options.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"1840399e00fcb2788c8d9f7ba9833156cfd7b05ecd40187a872eb445f9d4f52d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): corpus/ct/src/conversation_chapters.rs:812-816 | corpus/ho/src/auto_session_name.rs:140-144 | corpus/oc/src/away_recap.rs:331-335 \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 \u0060corpus/ct/src/conversation_chapters.rs:812\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":"corpus/ct/src/conversation_chapters.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41c11ac630737c9a4140289e32a1fa47059cb488d4631d52b0311ca083e3e20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/rig-core/src/providers/cohere/chat.rs:240-245 | crates/rig-core/src/providers/ollama/chat.rs:334-338 | crates/rig-core/src/providers/openai/wire/chat.rs:601-605 \u2014 \u0060crates/rig-core/src/providers/cohere/chat.rs\u0060 and \u0060crates/rig-core/src/providers/ollama/chat.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 30 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-core/src/providers/cohere/chat.rs:240\u0060 it begins part-way through the construct above it, so those exact 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/rig-core/src/providers/cohere/chat.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9adaf8776db1429ff658d2d889891ec6adf7fb5366d682b420d1fa9df7763e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): corpus/base/src/format_on_write.rs:291-295 | crates/rig-tools/src/edit.rs:830-834 \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":"corpus/base/src/format_on_write.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"4469d02ba399d9d7e1e220967c5df4bf5b75199f47a909a50a9d65955a2833fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): corpus/base/src/handoff.rs:209-214 | corpus/oc/src/away_recap.rs:334-339 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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, \u0060corpus/base/src/handoff.rs:207\u0060 calls \u0060trigger\u0060, \u0060plugin_alone\u0060 and \u0060corpus/oc/src/away_recap.rs:332\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":"corpus/base/src/handoff.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a967d8be4bcb614a4ae5ee386699e0cf2375adf54841af9de1fbbca8b8f530"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): corpus/base/src/skills.rs:183-188 | corpus/sn/src/glob_rules.rs:196-201 \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":"corpus/base/src/skills.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a22a884e25ecafafc0e8a342c5eca0d2d7cfafba718d5962c7fc4f547a7f030"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): corpus/ct/src/history_versions.rs:344-349 | plugins/rig-basics/src/skills.rs:360-365 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060corpus/ct/src/history_versions.rs:344\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":"corpus/ct/src/history_versions.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9b8008b6e5f317b1a418e43095eedda49de74cd13a18c6ee1d1bbce24b9a3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): corpus/fh/src/encrypted_sessions/reseal.rs:187-192 | corpus/oc/src/session_bundle.rs:291-296 \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":"corpus/fh/src/encrypted_sessions/reseal.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"bceea531fad238cd649833778ccab008a1536cf9bbc67cd72b300ae8eea1f9a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): corpus/library/src/session_compare_library.rs:289-293 | crates/rig-memory/src/meta.rs:124-128 \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 \u0060corpus/library/src/session_compare_library.rs:289\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/library/src/session_compare_library.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bb7658eb9b4723287fc0a032ef27b2f51a794f37983bc0039a813847c1a0a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): corpus/oc/src/architect_editor.rs:260-265 | corpus/shared/src/plan_mode.rs:127-132 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060corpus/oc/src/architect_editor.rs:260\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/oc/src/architect_editor.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8f2ecf8cc4078973d69067895dd2f21021792e60fdb84215fd1a043fc46216"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rig-cassette/src/scrub.rs:2065-2070 | crates/rig-cassette/src/scrub.rs:2520-2525 \u2014 both copies are in the same file, so extract the block 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/rig-cassette/src/scrub.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fc7e6bf636025d3da639f3cc96ecba0b31b8b5504bbbfc5119150ff1a562e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-cassette/src/scrub.rs:2288-2294 | crates/rig-cassette/src/scrub.rs:2321-2327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-cassette/src/scrub.rs:2288\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/scrub.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"a695ea0fae2562c017c347c1056c4cf4371217dbdc9e30895f96ea1f2e5461a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rig-core/src/effect/mod.rs:110-115 | crates/rig-core/src/effect/mod.rs:129-134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/effect/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49a00281659e66b550e67586be6349e644ce5f1e1009bdcdf960e5fc0e18e08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rig-core/src/providers/cohere/chat.rs:486-490 | crates/rig-core/src/providers/ollama/chat.rs:428-432 \u2014 \u0060crates/rig-core/src/providers/cohere/chat.rs\u0060 and \u0060crates/rig-core/src/providers/ollama/chat.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 30 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-core/src/providers/cohere/chat.rs:486\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/cohere/chat.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5414cb23a60e3e27bc7a17cee5a48a589a177d6b42e1c419a42df48109eb45b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 3): crates/rig-core/src/providers/openai/options.rs:709-713 | crates/rig-core/src/providers/openai/options.rs:831-835 | crates/rig-core/src/providers/openai/options.rs:980-981 \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/rig-core/src/providers/openai/options.rs:709\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/options.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9019d6c8007eb3001a5c8a9a3543109301556ca2a36f4d354177f8d85369a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): plugins/rig-tui/src/render.rs:795-800 | plugins/rig-tui/src/transcript.rs:1666-1671 \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 \u0060plugins/rig-tui/src/render.rs:795\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/render.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"3701d055787e571e2cf9f727d00d141be702a1e7e8b352e3a098c83e2b0a91ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): corpus/base/src/code_search_index.rs:734-738 | corpus/fh/src/thinking_keywords.rs:240-244 \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 \u0060corpus/base/src/code_search_index.rs:734\u0060 it begins part-way through the construct above it, so those exact 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 \u0060messages\u0060 to \u0060Query\u003C(\u0026TurnContext, \u0026DeliveredIn)\u003E\u0060 in one and \u0060Query\u003C(\u0026ThinkKeyword, \u0026DeliveredIn)\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":"corpus/base/src/code_search_index.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15d232f05c3b21ecb767539e514be0fb9ec3084ed7758c08e1ba662839dc244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): corpus/base/src/export/render.rs:510-515 | plugins/rig-basics/src/skills.rs:351-356 \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":"corpus/base/src/export/render.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea24d146592e76f307f7cc87233dcb65244de03ec4c3c05178673700ae46724a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): corpus/base/src/files_panel.rs:133-137 | corpus/ho/src/hunk_review.rs:214-218 | corpus/ho/src/working_set_carryover.rs:317-321 \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":"corpus/base/src/files_panel.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f6227f68e006ed27f50131e6c6167480e8bce2569b229a49a1317b103d15f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): corpus/base/src/tool_search.rs:242-246 | corpus/ho/src/session_recall.rs:569-573 \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":"corpus/base/src/tool_search.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"243007fcd1934cb4215e13ce87386e524efc5806f41cda4c50547bfc1cf3fc19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): corpus/ct/src/shell_companion/socket.rs:37-42 | corpus/ho/src/socket_attach/server.rs:47-52 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060corpus/ho/src/socket_attach/server.rs:43\u0060 calls \u0060pub\u0060 and \u0060corpus/ct/src/shell_companion/socket.rs:33\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":"corpus/ct/src/shell_companion/socket.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"41576a6c03aa500598b62b4f7e8246b23a251c671b1e5e0e3e474497b5053d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): corpus/ct/src/test_runner_tool.rs:502-506 | corpus/ho/src/cancellable_run.rs:360-364 \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":"corpus/ct/src/test_runner_tool.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"2453db0a0093590a1c1f2820a3844658d9ba566894176d87f0ab63b117c9f399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): corpus/fh/src/thinking_keywords.rs:157-162 | corpus/shared/src/few_shot_examples.rs:210-215 \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":"corpus/fh/src/thinking_keywords.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ef80c9b3bfc6e29b74bd28a37e0c5b0d8846daa9ef3b024393a9cb9ddb079c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): corpus/ho/src/raw_stream_log.rs:281-285 | corpus/sn/src/model_params.rs:691-695 \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 \u0060gone\u0060 to \u0060On\u003CRemove\u003CRawFile\u003E\u003E\u0060 in one and \u0060On\u003CRemove\u003CHeaded\u003E\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ho/src/raw_stream_log.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"05aced6ff033eb6b2b0a09e6f36d91ccf72e637af094cbe31494e26549c6a414"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): corpus/sp/src/theme_files.rs:286-290 | crates/rig-tools/src/edit.rs:680-684 \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":"corpus/sp/src/theme_files.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead65e0edb90ec317b9c9646ee092b653f964369d1794cf6886c01f4644f0a25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-agent/src/run/response.rs:326-332 | crates/rig-core/src/completion/options.rs:400-406 \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/rig-agent/src/run/response.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca514b97e5cac17083d3a40d85adf27abe3a4a20dff8d007eb239576833a47b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/rig-agent/src/run/transcript.rs:41-49 | test-support/rig-test-support/src/history_survival/adversarial.rs:57-65 | test-support/rig-test-support/src/model_session.rs:1058-1066 | test-support/rig-test-support/src/support.rs:930-938 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/run/transcript.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9ec7d366a5a02aff7e983e72b435f5cd6e23808f6368dd077abaf97a03a3d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rig-bedrock/src/completion.rs:218-223 | crates/rig-vertexai/src/completion.rs:69-74 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-bedrock/src/completion.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d233b89c07b9adc1a5360da207f0fdf52f000fc9256bdcb5f4c374639b5ac6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rig-bedrock/src/extension.rs:260-265 | crates/rig-core/src/providers/cohere/extension.rs:240-245 \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/rig-bedrock/src/extension.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2039d4c33ec23a144b2333458df8e5858ac98275b5d23d7626ef9f8a01f3b649"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/rig-core/src/audio_generation.rs:50-60 | crates/rig-core/src/embeddings/embedding.rs:76-86 | crates/rig-core/src/image_generation.rs:54-64 \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/rig-core/src/audio_generation.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e6f1e64e671b5a8071930d0578460954131f24e8a3b6929f7de16644ca2a2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rig-core/src/audio_generation.rs:96-100 | crates/rig-core/src/image_generation.rs:117-121 \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/rig-core/src/audio_generation.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"691fdbe60738b498ceeb316ddaafbec57179a0eea3aceb27a6b31cbe78c2419b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-core/src/catalog/row.rs:700-706 | plugins/rig-basics/src/compaction.rs:210-216 \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/rig-core/src/catalog/row.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"89970f47ddf4e108ce734a605cb07b26763ac403b71ac6ea84371c9147b61767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rig-core/src/completion/request.rs:537-545 | crates/rig-core/src/test_utils/streaming_conformance.rs:501-509 \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/rig-core/src/completion/request.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86c6925aed13f60a6686d1d0703f881696dacb5dcf454f94d3fe3253fda0ba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rig-core/src/providers/cohere/embeddings.rs:68-75 | crates/rig-core/src/providers/voyageai/wire.rs:98-105 \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/rig-core/src/providers/cohere/embeddings.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a3adf63c0142789612504debeb625c1d4d185c7cfb3da7eb181e7f8aacdb0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/rig-core/src/providers/cohere/embeddings.rs:118-122 | crates/rig-core/src/providers/ollama/embedding.rs:91-95 | crates/rig-core/src/providers/voyageai/wire.rs:166-170 \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/rig-core/src/providers/cohere/embeddings.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b6f9a2a60ef16a07da229a5df6e76bd404fb83397405cc6ad64e3b1474697d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-core/src/providers/gemini/completion.rs:169-175 | crates/rig-gemini-grpc/src/completion.rs:75-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/rig-core/src/providers/gemini/completion.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68024d429c89940549567ae2a8aab493d9fe629f9ed6757d6bb6bcac2f407e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rig-core/src/providers/gemini/extension.rs:110-114 | crates/rig-vertexai/src/extension.rs:114-118 \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/rig-core/src/providers/gemini/extension.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/rig-core/src/providers/gemini/extension.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32d0e1f04bc69192518537718e141ab798707a2e91fbc80187fb3eb4602683e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rig-core/src/providers/minimax/voice_clone.rs:326-331 | crates/rig-core/src/providers/openai/wire/modality.rs:1148-1154 \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/rig-core/src/providers/minimax/voice_clone.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec031910239d4457229ae632c43da439c51534e82f74cdae870dd1dca5e50d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rig-postgres/src/lib.rs:254-261 | crates/rig-surrealdb/src/lib.rs:264-271 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-postgres/src/lib.rs:254\u0060 it begins part-way through the construct above it, so those exact 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/rig-surrealdb/src/lib.rs:273\u0060 calls \u0060inner_client\u0060 and \u0060crates/rig-postgres/src/lib.rs:263\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/rig-postgres/src/lib.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03b1fa82f39feb03d4456572e99921c40f8d9037bb737b2e2a7345226e9f952"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rig-tools/src/list.rs:121-125 | crates/rig-tools/src/search.rs:213-217 \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 \u0060args\u0060 to \u0060\u0026ListArgs\u0060 in one and \u0060\u0026SearchArgs\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/rig-tools/src/list.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"09540131d2b04f9d6027530722d8ddca01445fbbe73c628a6267a081d058a368"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): test-support/rig-test-support/src/comparison_guard.rs:61-67 | xtask/src/cassette/owner.rs:182-188 \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":"test-support/rig-test-support/src/comparison_guard.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4a8274e7e074f2ce24c520a1f8c19375883cf8ae89c38f7ab90d743425fc5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): corpus/base/src/check_after_turn.rs:405-411 | corpus/fh/src/batch_provider.rs:609-615 \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 \u0060corpus/fh/src/batch_provider.rs:609\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/check_after_turn.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8448e6e0ebd436d0e451eacf351950261509646595612e2d00b77f73dbc2a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): corpus/ho/src/api_key_pool.rs:393-400 | corpus/oc/src/rate_limit_status.rs:215-222 \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":"corpus/ho/src/api_key_pool.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d0eb52b5bee7bf8702e2ab41bb64e315cee4dbb321fb22b2b633c2269411ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rig-core/src/completion/message.rs:109-114 | crates/rig-core/src/completion/request.rs:604-609 \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/rig-core/src/completion/message.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e740dbdf73971da9899c88e63100fd685653d1d9b03b002f3f4a75f19f66054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/rig-core/src/providers/minimax/extension.rs:160-172 | crates/rig-core/src/providers/moonshot/extension.rs:148-160 | crates/rig-core/src/providers/xiaomimimo/extension.rs:69-81 | crates/rig-core/src/providers/zai/extension.rs:172-184 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-core/src/providers/minimax/extension.rs:160\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/rig-core/src/providers/minimax/extension.rs:175\u0060 calls \u0060reply_field\u0060 and \u0060crates/rig-core/src/providers/xiaomimimo/extension.rs:84\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/rig-core/src/providers/minimax/extension.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cf31994205a129e41781028e672711233c707bcb76f5f1750733496120fefb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rig-core/src/providers/openai/wire/modality.rs:640-647 | crates/rig-core/src/providers/openai/wire/modality.rs:1540-1548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-core/src/providers/openai/wire/modality.rs:1540\u0060 it begins part-way through the construct above it, so those exact 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 \u0060request\u0060 to \u0060Vec\u003CString\u003E\u0060 in one and \u0060crate::operation::RerankRequest\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/rig-core/src/providers/openai/wire/modality.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ab364897e643e9a6701ad4805bb41ad5378f54b8f8df4395a31ed1d5bfa2f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rig-cassette/src/http/snapshot.rs:488-495 | xtask/src/cassette/acceptance.rs:324-331 \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/rig-cassette/src/http/snapshot.rs:488\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/rig-cassette/src/http/snapshot.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"02224308d3262c40f7bdf91bc16eb0586bdaf770607ae6eb09dff46406ab558d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rig-core/src/providers/openai/options.rs:573-580 | crates/rig-core/src/providers/openai/options.rs:1331-1338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-core/src/providers/openai/options.rs:573\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/options.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6462c835280602d76372de094fff5b1774a128cac063dd10d2fbb61762b396a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): corpus/ho/src/throughput_item.rs:292-299 | corpus/ho/src/tool_arg_repair.rs:184-191 \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 \u0060corpus/ho/src/throughput_item.rs:292\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ho/src/throughput_item.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"46db533720608ad60b62543df171414bad49942b6795e8b4b6772299c6bbb410"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): corpus/base/src/http_api/server.rs:112-123 | corpus/ct/src/metrics_endpoint/server.rs:55-67 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/http_api/server.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3bc1e2a1e84d74bbee216fb7303d96f55dcfc763a20f68204c71200e679962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-qdrant/src/filter.rs:292-298 | crates/rig-qdrant/src/filter.rs:303-309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-qdrant/src/filter.rs:292\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-qdrant/src/filter.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7adfd2a154fe920a6e4e9b8008cb3c4255fb2d2b4787a712a523dd362ad5f8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-core/src/providers/openai/options.rs:1188-1194 | crates/rig-core/src/providers/openai/options.rs:1234-1240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-core/src/providers/openai/options.rs:1188\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/rig-core/src/providers/openai/options.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4851930b2b60bac32d86837f30e208fb6d398b9aa7ca90df134d55d8b5ae042e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-core/src/providers/anthropic/options.rs:203-209 | crates/rig-core/src/providers/anthropic/options.rs:282-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/rig-core/src/providers/anthropic/options.rs:203\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/options.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a67a448399c38ea6a182e3ce28ddc794fdf264f91353eeb8914a71cc92fd29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/rig-qdrant/src/filter.rs:281-287 | crates/rig-qdrant/src/filter.rs:292-298 | crates/rig-qdrant/src/filter.rs:303-309 \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/rig-qdrant/src/filter.rs:281\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-qdrant/src/filter.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74a43dc8d64b1960e787402850adf788d207a8228aef121bff128df4912f7bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/rig-core/src/providers/openai/options.rs:772-777 | crates/rig-core/src/providers/openai/options.rs:825-830 | crates/rig-core/src/providers/openai/options.rs:902-907 | crates/rig-core/src/providers/openai/options.rs:974-979 | crates/rig-core/src/providers/openai/options.rs:1096-1101 \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/rig-core/src/providers/openai/options.rs:772\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/rig-core/src/providers/openai/options.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"b282cc179618679a0136729776fde147a5cdf25b12475c8674964f11999929f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): corpus/base/src/skills.rs:369-374 | corpus/ho/src/blackboard.rs:360-365 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060corpus/base/src/skills.rs:369\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":"corpus/base/src/skills.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca2f41e803cc2b758cb380c7b80cb8a30f57fe58e978e02edabbab9b61773eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rig-memory/src/rewrite.rs:564-569 | crates/rig-memory/src/rewrite.rs:573-578 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-memory/src/rewrite.rs:564\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-memory/src/rewrite.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d464bd6493960ca125f981f6d8da598aa9526b8ad441429490d38777b75f592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): corpus/base/src/auto_commit.rs:528-533 | corpus/fh/src/dirty_tree_guard.rs:153-158 \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 \u0060corpus/base/src/auto_commit.rs:528\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/auto_commit.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae902d286f3071d9c3eb72c6769285fdcbfde5936780642bb5798eeba15a3bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): corpus/base/src/review_agent.rs:628-632 | plugins/rig-basics/src/reload/plugins.rs:218-222 \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 \u0060corpus/base/src/review_agent.rs:628\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":"corpus/base/src/review_agent.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2cf5121db0084389d058c4d5b67c64b06ebcf4c591ca3211f0628f029ba1b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): corpus/ct/src/conversation_chapters.rs:812-816 | corpus/ho/src/auto_session_name.rs:140-144 | corpus/oc/src/away_recap.rs:331-335 | corpus/sp/src/changelog_fragments.rs:348-352 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060corpus/ct/src/conversation_chapters.rs:812\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":"corpus/ct/src/conversation_chapters.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c446c13a1684850d684f8853f0caba2d75c0925ce67e4d74082165ac8dd4c11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/rig-core/src/providers/anthropic/options.rs:320-327 | crates/rig-core/src/providers/openai/options.rs:1117-1124 | crates/rig-core/src/providers/openai/options.rs:1249-1256 \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/rig-core/src/providers/anthropic/options.rs:320\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/options.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bdfa67545947b4a3a40954d28770b680f5a6f99d3312cd1abe5a7b53dd9fc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rig-core/src/tool/validate.rs:173-177 | crates/rig-core/src/tool/validate.rs:182-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/rig-core/src/tool/validate.rs:173\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/tool/validate.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8f6d595b13073e8264113431ebc64c3baf65180851d56412246b5ea9b32efa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): corpus/base/src/skills.rs:277-281 | corpus/sn/src/glob_rules.rs:363-367 \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 \u0060corpus/base/src/skills.rs:277\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":"corpus/base/src/skills.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"830539f758047200b7e131c9ec2d3a6f8b48aea580a7fec83259c315b73808ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): corpus/ct/src/session_finder.rs:553-557 | corpus/ct/src/session_finder.rs:645-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 \u0060corpus/ct/src/session_finder.rs:645\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":"corpus/ct/src/session_finder.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d05f450272ac74804e02f15504c4e80ae42549acd71b1a512717ded872698d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): corpus/fh/src/correction_learner.rs:319-324 | corpus/ho/src/auto_session_name.rs:112-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060corpus/fh/src/correction_learner.rs:319\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/correction_learner.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a89224a0acb0ba479d408c72602e089b96a2545afdad7862442ff117055091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): corpus/fh/src/import_sessions/parse.rs:304-308 | corpus/fh/src/import_sessions/parse.rs:446-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060corpus/fh/src/import_sessions/parse.rs:304\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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, \u0060corpus/fh/src/import_sessions/parse.rs:451\u0060 calls \u0060millis\u0060, \u0060get\u0060, \u0060cloned\u0060 and \u0060corpus/fh/src/import_sessions/parse.rs:309\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":"corpus/fh/src/import_sessions/parse.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"2525dbaf9f230f7bf68db921b07b0327977f75cdbe93ac9d016630df32587cc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rig-candle/src/model.rs:695-699 | crates/rig-candle/src/pose.rs:690-694 \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/rig-candle/src/model.rs:695\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/model.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d032a0ad4a61ba9638ef347240921d7c4bd2eeae17374cd4384244c969bab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): xtask/src/stage_order.rs:34-39 | xtask/src/test_layout.rs:34-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060xtask/src/stage_order.rs:34\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/stage_order.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c520d06bdc3f07d73d1f6afda6f0596e569b2bde814fdb434a0308860a601b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): test-support/rig-test-support/src/cache_conformance.rs:378-402 | test-support/rig-test-support/src/cache_conformance.rs:429-468 \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":"test-support/rig-test-support/src/cache_conformance.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3db7c64d452c1d4140af0685f683c347df4b4e2572b73f9297496b1db1d846"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): test-support/rig-test-support/src/raw_capture/chat.rs:56-89 | test-support/rig-test-support/src/raw_capture/responses.rs:91-128 \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":"test-support/rig-test-support/src/raw_capture/chat.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c950dae399b9a5f5a80d389f8ed7174ef473de9d23d79183520e6785c252198"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): test-support/rig-test-support/src/comparison_guard.rs:70-87 | test-support/rig-test-support/src/comparison_guard.rs:91-107 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/comparison_guard.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8b28439db63dbb273309af4d86d31e628a30b5bff23eda91e007f944f88233"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): crates/rig-agent/src/test_utils/model_conformance.rs:1751-1778 | crates/rig-agent/src/test_utils/model_conformance.rs:1789-1820 | crates/rig-agent/src/test_utils/model_conformance.rs:1920-1946 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 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/rig-agent/src/test_utils/model_conformance.rs"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9ffe16af4950af7cd635c91b513e390380a6a129de0a6e9976942f6c04da72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): test-support/rig-test-support/src/comparison_guard.rs:152-173 | test-support/rig-test-support/src/comparison_guard.rs:178-195 \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":"test-support/rig-test-support/src/comparison_guard.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be4bd448216a101085c63935803b60b8138602f8cbb67425e352a4c8b19d4a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/rig-agent/src/test_utils/model_conformance.rs:77-114 | crates/rig-agent/src/test_utils/model_conformance.rs:122-153 \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/rig-agent/src/test_utils/model_conformance.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0237b3378af90b142ec34eff3ded265d404c7b2b7ed6ab1b11476369fb6c4dc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): crates/rig-core/src/test_utils/streaming_conformance.rs:858-891 | crates/rig-core/src/test_utils/streaming_conformance.rs:947-977 | crates/rig-core/src/test_utils/streaming_conformance.rs:1014-1043 \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/rig-core/src/test_utils/streaming_conformance.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"7452a37bcc11923d20479c5712542e45b5fa84ff2da1073e0e4d42d965f617e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/rig-core/src/test_utils/streaming_conformance.rs:983-1009 | crates/rig-core/src/test_utils/streaming_conformance.rs:1080-1105 \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/rig-core/src/test_utils/streaming_conformance.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17dac1e691dde2a79f32c44895b36a96b52b985f0b6740ca400f2982b9a08c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): test-support/rig-test-support/src/cache_conformance.rs:574-600 | test-support/rig-test-support/src/cache_conformance.rs:621-646 \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":"test-support/rig-test-support/src/cache_conformance.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d45b05665223fd3e345168afb62b68ac27e4169a47b7ee4b82cefa1f15a8872"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rig-core/src/test_utils/streaming_conformance.rs:2075-2089 | crates/rig-core/src/test_utils/streaming_conformance.rs:2094-2108 \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/rig-core/src/test_utils/streaming_conformance.rs"},"region":{"startLine":2075}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6482812e20aa24517ed76eeb0860c1aa15826fed1c9132d7f1cd8852129ce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rig-core/src/test_utils/streaming_conformance.rs:1736-1753 | crates/rig-core/src/test_utils/streaming_conformance.rs:2125-2138 \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/rig-core/src/test_utils/streaming_conformance.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"a257e418e7169d3087097ff77542d4d6d2c928311102a1c7e4b05683a096150f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): test-support/rig-test-support/src/history_survival/adversarial.rs:31-42 | test-support/rig-test-support/src/history_survival/sessions.rs:36-48 \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":"test-support/rig-test-support/src/history_survival/adversarial.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb53e5dec1a14d60b40c621afb99519227f437f3b568b9a0d585446284655146"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): test-support/rig-test-support/src/matrix/agent_tool_sessions.rs:205-217 | test-support/rig-test-support/src/matrix/agent_tool_sessions.rs:220-232 \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":"test-support/rig-test-support/src/matrix/agent_tool_sessions.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa61d921ef7fd697f0ff1c4bf4dee91da5beda518b01b915d5fa0a5bcf652ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): test-support/rig-test-support/src/comparison_guard.rs:382-388 | test-support/rig-test-support/src/comparison_guard.rs:390-396 \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":"test-support/rig-test-support/src/comparison_guard.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfada6963c0c3006ea109d8837b0782242e00a986b41643d55ad7caf1011446"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/rig-http/src/test_utils.rs:253-259 | crates/rig-http/src/test_utils.rs:267-274 \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/rig-http/src/test_utils.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba99b4e13d778e1513d1c8961de0544052ded0a6a2529941522d65168c09d4cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): test-support/rig-test-support/src/goldens.rs:905-913 | test-support/rig-test-support/src/goldens.rs:1595-1603 | test-support/rig-test-support/src/goldens.rs:1647-1655 | test-support/rig-test-support/src/goldens.rs:2082-2090 \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":"test-support/rig-test-support/src/goldens.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"199e38ef9cb81eb6d419b7a169166a8960762c6e1fc748736c0ee670a46d45e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): test-support/rig-test-support/src/history_survival/sessions.rs:154-167 | test-support/rig-test-support/src/support.rs:341-356 \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":"test-support/rig-test-support/src/history_survival/sessions.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f280e0cf41f7235a46ecd21cecc37d5f30203dae6b0d883da39fae5c2882dcd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rig-agent/src/test_utils/model_conformance.rs:429-438 | crates/rig-agent/src/test_utils/tools.rs:45-60 \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/rig-agent/src/test_utils/model_conformance.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ebef53881406724c6af6cdede3252e336be35195318dedbe8cc51503326fca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rig-agent/src/test_utils/model_conformance.rs:490-499 | crates/rig-agent/src/test_utils/tools.rs:145-160 \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/rig-agent/src/test_utils/model_conformance.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"d205c7b94fd01dd985d1d31c71bf37a352342c3978743a87e21981ad4f56041d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): test-support/rig-test-support/src/history_survival.rs:77-81 | test-support/rig-test-support/src/reasoning.rs:272-276 \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":"test-support/rig-test-support/src/history_survival.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d305e775eef2b1f36b1aea7a5fb9e37f6d79c4881a67a8dc847b704b622df5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): test-support/rig-test-support/src/reasoning.rs:331-346 | test-support/rig-test-support/src/reasoning.rs:404-421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060test-support/rig-test-support/src/reasoning.rs:404\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/reasoning.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f397ad4036a028a13276e13e611f0f62c8edc0713adbabb5f9ff17ac53b548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): test-support/rig-test-support/src/raw_capture/chat.rs:68-81 | test-support/rig-test-support/src/raw_capture/chat.rs:154-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060test-support/rig-test-support/src/raw_capture/chat.rs:68\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/raw_capture/chat.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"640998cf237632034bb7d30c7abd0aa27634e0db2f913a889896bfe3ccff0c40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): test-support/rig-test-support/src/raw_capture/chat.rs:57-64 | test-support/rig-test-support/src/raw_capture/chat.rs:144-155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060test-support/rig-test-support/src/raw_capture/chat.rs:57\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/raw_capture/chat.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea82985feb3d5cb07d0dbdaef32a3b0542e8d582bc11d96d52cc410c7e62e42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 3): crates/rig-core/src/test_utils/streaming_conformance.rs:862-869 | crates/rig-core/src/test_utils/streaming_conformance.rs:901-911 | crates/rig-core/src/test_utils/streaming_conformance.rs:955-963 \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/rig-core/src/test_utils/streaming_conformance.rs:862\u0060 it begins part-way through the construct above it, so those exact 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/rig-core/src/test_utils/streaming_conformance.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"739f9bf489cf518c485bd2beac5d1800435e3bd91c9e5233c67cdc34b40c2a34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rig-agent/src/test_utils/model_conformance.rs:1921-1931 | crates/rig-agent/src/test_utils/model_conformance.rs:2070-2080 \u2014 both copies are in the same file, so extract the block 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/rig-agent/src/test_utils/model_conformance.rs"},"region":{"startLine":1921}}}],"partialFingerprints":{"codehealthFindingId/v1":"469468587f396ef55adc284aa853a870467e898509318f7cbd2af7f3e2e47b2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rig-core/src/test_utils/streaming.rs:356-366 | crates/rig-core/src/test_utils/streaming.rs:368-378 \u2014 both copies are in the same file, so extract the block 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/rig-core/src/test_utils/streaming.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d836072dde5c5a54663609b72726503de25144d3a883f6482bdc74d5b7ff488"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): test-support/rig-test-support/src/reasoning.rs:291-299 | test-support/rig-test-support/src/reasoning.rs:377-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/reasoning.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb795da24746397c464a9dccbcffa0dd218d1991133b4a56a6d58526627e370"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-agent/src/test_utils/model_conformance.rs:98-104 | crates/rig-agent/src/test_utils/model_conformance.rs:767-773 \u2014 both copies are in the same file, so extract the block 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/rig-agent/src/test_utils/model_conformance.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"047610516b05f9860156c2d89d6c2bc82c9c10772ace8b7a185b2ae5ecdabc5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): test-support/rig-test-support/src/reasoning.rs:303-308 | test-support/rig-test-support/src/reasoning.rs:349-354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060test-support/rig-test-support/src/reasoning.rs:303\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/reasoning.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a090d0880fec3e79675f493bcb05ad97428839442174e929899e640e37dff9fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): test-support/rig-test-support/src/cache_conformance.rs:585-600 | test-support/rig-test-support/src/cache_conformance.rs:629-646 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060test-support/rig-test-support/src/cache_conformance.rs:585\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/cache_conformance.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1ce3ede477bb3896da61d75312f4d6b4bb60f52f6f8c3c51304302feccae07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rig-agent/src/test_utils/model_conformance.rs:1472-1480 | crates/rig-agent/src/test_utils/model_conformance.rs:1486-1495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rig-agent/src/test_utils/model_conformance.rs:1472\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/rig-agent/src/test_utils/model_conformance.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f62245a9111e9ab8f281a846735eeffd315abe1d3fe4dbe52c6958e3c6f742e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): test-support/rig-test-support/src/reasoning.rs:679-688 | test-support/rig-test-support/src/reasoning.rs:725-734 \u2014 both copies are in the same file, so extract the block 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":"test-support/rig-test-support/src/reasoning.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dedc52073c6e0deb0046cea70b94b8b46ea38ecb8caef3a25da73cfebc2a50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): test-support/rig-test-support/src/history_survival/adversarial.rs:34-42 | test-support/rig-test-support/src/history_survival/sessions.rs:39-48 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060test-support/rig-test-support/src/history_survival/adversarial.rs:34\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":"test-support/rig-test-support/src/history_survival/adversarial.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6112a488407a4962560f8668595e5f79563ec80ea005f989edd9adef20674596"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): test-support/rig-test-support/src/model_session.rs:1423-1432 | test-support/rig-test-support/src/model_session.rs:1523-1532 \u2014 both copies are in the same file, so extract the block 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":"test-support/rig-test-support/src/model_session.rs"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57f1c8f7fe6eed586307d66cfe6c6699bd2aa7dd564bf50c7f08b89c78fec97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rig-core/src/test_utils/streaming_conformance.rs:906-914 | crates/rig-core/src/test_utils/streaming_conformance.rs:995-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/rig-core/src/test_utils/streaming_conformance.rs:906\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/rig-core/src/test_utils/streaming_conformance.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f602392a3a53a614ed4402ec6a93f8edf182a592bb1af1f2002a26084799fe"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rig-harness-protocol: rig-harness-protocol: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2bbdf42c9c21aed7e8f8045b3510c968e0a35238a089bebadaee85bfe42a8ee8"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rig-tools: rig-tools: abstractness 0.01, instability 0.10, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aee6e603155f1535fce9aee338deeb406fbb730679e310369ab7802c82e51d2c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rig-markdown: rig-markdown: abstractness 0.14, instability 0.00, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e6e8f7e2dae424fb16037a34a16ddcecc7eaccc11a689b1bc69bc9030bac3731"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rig-core: rig-core: abstractness 0.06, instability 0.09, distance 0.85 \u2014 zone of pain \u2014 concrete and depended on by 42 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a1d75c57173652205276ee65079a2a5929e8ec285c39e606b59c89453b7188c9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rig-memory: rig-memory: abstractness 0.10, instability 0.06, distance 0.84 \u2014 zone of pain \u2014 concrete and depended on by 16 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3c9511beb538b9005902cd9ec71ced5bf31eb5bc2287b92f6e7805858b95aac1"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rig-http: rig-http: 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":"94a25bacffffd3d1ed7fc3a9b73a59fa339f1895afd3c2afe32e750ff8c20567"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rig-reqwest: rig-reqwest: abstractness 0.17, instability 0.09, distance 0.74 \u2014 zone of pain \u2014 concrete and depended on by 10 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"451faad026057b5387a598ac92748e9cdc1962cb3e39edb8cb17d5381f10527b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rig-ecs: rig-ecs: abstractness 0.01, instability 0.25, distance 0.74 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"33aa4a19c049c62fbe35811819f58ceeaaaa9e66a1e13fe77f8056f3128a0f70"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ModelSpec (LCOM4 7): ModelSpec\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/catalog/spec.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"864c760132ebb6f28810996174f94caf3de8285de67491b8aa0138442d1de05a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Messages (LCOM4 7): Messages\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/wire.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa1a9e27a113f406fbd53dae769074972cbb8997fad921d219e366e4cf28cfd"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompletionRequest (LCOM4 6): CompletionRequest\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/completion/request.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b8765bbb5357ded17cb3451d60ac1d4a307b0c50f5931a9079ed715cee2bf1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NewCachedContent (LCOM4 5): NewCachedContent\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/rig-core/src/providers/gemini/cached_content.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"944ac04ddfb9741dc5214d63a48fb37b7fbdd73d8d1b1a4c71e80e6619361115"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BedrockRuntime (LCOM4 4): BedrockRuntime\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/rig-bedrock/src/client.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b419aa54bc7bc4142e73f829fe753fdea2acaf726400944a3f163be840c2279"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Responses (LCOM4 4): Responses\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/rig-core/src/providers/openai/responses_api/wire.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"69084d1c9c1340bc3060ce16e21636380feea9aa90e6ccc64ba8c0470b47a640"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Descriptor (LCOM4 4): Descriptor\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/rig-core/src/wire.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca22ca6154599a9bc8480e58fcf4e4a9c76a8f0505f393ff3be65f92b6ca37c7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ReqwestClient (LCOM4 4): ReqwestClient\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/rig-reqwest/src/lib.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0982a8648e0340f8318161f0f6b2721011fae721c97e8b69b0e3991396c363d"}},{"ruleId":"D13","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":"b4368738308e96a5c7c62ecae2a6c325ce6bf49c23215cc92230b51de6236c1f"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D14","level":"error","message":{"text":"Banned license: epub: \u0060epub\u0060 2.1.6 is published on crates.io under \u0060GPL-3.0-or-later\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"97ebedc05f1adaad3eba9cb89a7f17ba478e63dba1cc3706377ddb60256fe029"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-agent/src/agent/engine.rs: crates/rig-agent/src/agent/engine.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in StreamingTurnSource::run_model_turn at line 865. 12 of those changes were fix/bug commits, and the other 32 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-agent/src/agent/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/rig-agent/src/agent/engine.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cc423891518f8914cbfc433e8309c5061733f779ebc4c8eccee2d2a25b0a8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/openai/responses_api/mod.rs: crates/rig-core/src/providers/openai/responses_api/mod.rs changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in rig_core::providers::openai::responses_api::input at line 142. 7 of those changes were fix/bug commits, and the other 39 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/openai/responses_api/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/rig-core/src/providers/openai/responses_api/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e19808f47d59d485ff7f235894abe5c3e8cf15305ba021b987d8949a142f86b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/anthropic/completion.rs: crates/rig-core/src/providers/anthropic/completion.rs changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in rig_core::providers::anthropic::completion::strict_schema at line 1356. 8 of those changes were fix/bug commits, and the other 37 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/anthropic/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/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1f45c192ea788b950945c375c1486d3363cdf6666c684a44201bd43b61203d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-cli/src/run.rs: crates/rig-cli/src/run.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in rig_cli::run::run_agent at line 281. 13 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-cli/src/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/rig-cli/src/run.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"477be6ace447343dd75fe4bc80bcf9612961dc3d3b1c6e39286aa487ba63178f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-agent/src/run/mod.rs: crates/rig-agent/src/run/mod.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in AgentRun::next_step at line 879. 10 of those changes were fix/bug commits, and the other 31 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-agent/src/run/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/rig-agent/src/run/mod.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1748691b827103860aaa8b609f406c3357b2d0376d3b5689265ce2fb228b3b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/openai/wire/chat.rs: crates/rig-core/src/providers/openai/wire/chat.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Chat::assistant at line 388. 11 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/openai/wire/chat.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/providers/openai/wire/chat.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"043300b996e50998e4ec54b90502806ae89f5165834c211b377d860e0162c801"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/rig-basics/src/print.rs: plugins/rig-basics/src/print.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in rig_basics::print::drive at line 709. 18 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-basics/src/print.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/print.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2389c70fcad1b2bde5c91aacb876055557a6d7281f1d94cf7de7992e28c053"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-ecs/src/turn.rs: crates/rig-ecs/src/turn.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Stopper::stop at line 674. 14 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-ecs/src/turn.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-ecs/src/turn.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de1918062aaee684fff00a0f1851c30a344405fba8d6dd3c7b3754f208b6fbc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/gemini/streaming.rs: crates/rig-core/src/providers/gemini/streaming.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in GenerateContentDecoder::decode at line 93. 5 of those changes were fix/bug commits, and the other 25 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/gemini/streaming.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/providers/gemini/streaming.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0533f06e43284ca7dabcb312da9f9e73b20b29d678715707c03e5f7c611d8102"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/rig-basics/src/compaction.rs: plugins/rig-basics/src/compaction.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in rig_basics::compaction::compact_near_the_window at line 1234. 9 of those changes were fix/bug commits, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-basics/src/compaction.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/compaction.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9cdec27461dcaf46e1d7d2a97bd04b00cf92eaf624e8effd67f3203492afb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/openai/responses_api/streaming.rs: crates/rig-core/src/providers/openai/responses_api/streaming.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ResponsesDecoder::done at line 607. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/openai/responses_api/streaming.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/providers/openai/responses_api/streaming.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5cc5a46d4167ebae73a8c04501a07340a68a45a992ccc62eb06268f307f7ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/gemini/interactions_api/streaming.rs: crates/rig-core/src/providers/gemini/interactions_api/streaming.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in InteractionsDecoder::delta 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/gemini/interactions_api/streaming.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/providers/gemini/interactions_api/streaming.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedfbd660a70d7c2ae006eeb58ceb4935fef8bcea11add48337cb2783acae0b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/operation/completion.rs: crates/rig-core/src/operation/completion.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ReplyFold::settle at line 750. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/operation/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/rig-core/src/operation/completion.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d6238c4e40f0d5ed8ecaba47a28f53741314680a662bd830baaf05ad6cb561"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/deepseek.rs: crates/rig-core/src/providers/deepseek.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in rig_core::providers::deepseek::strict_node at line 213. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/deepseek.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/providers/deepseek.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1c31426b6b93afadc8a55be979e219c809632192f3e3342ecee4df63887abd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/rig-tui/src/transcript.rs: plugins/rig-tui/src/transcript.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in rig_tui::transcript::message_lines at line 1519. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-tui/src/transcript.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/transcript.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"8849286cd73b91b9feb40e5709168f65e370353fdaff1626b8c53e19c8443ecd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: xtask/src/verify/execute.rs: xtask/src/verify/execute.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in xtask::verify::execute::internal at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- xtask/src/verify/execute.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/verify/execute.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38e909a51b2bcfecc4edd33342c52d7a301730b3424a4e05fd81e965f9a6bbe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/completion/history.rs: crates/rig-core/src/completion/history.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in rig_core::completion::history::user at line 1553. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/completion/history.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/completion/history.rs"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"84150bb6efa04fee0b861478e6dda769213d10559932f029df285326abc714a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-bedrock/src/streaming.rs: crates/rig-bedrock/src/streaming.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in StreamState::delta at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-bedrock/src/streaming.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-bedrock/src/streaming.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b6a008b70060512f4f75cfa691318fd9d157a28013865caf5241dda82ffea3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/rig-tui/src/render.rs: plugins/rig-tui/src/render.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in rig_tui::render::lay_out_transcript at line 653. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-tui/src/render.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/render.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb7422704bfced93b9d1b01c06521c4056af914b98f0bd177361ef9e1ca148c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/rig-tui/src/input.rs: plugins/rig-tui/src/input.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in rig_tui::input::act at line 708. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-tui/src/input.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/input.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1488dcc9fe07db3b8ab31ecc3b9a88acdd82e4f7209cf4ebd5bce152c3b58e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/serve/handler.rs: crates/rig-core/src/serve/handler.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Reply::observed at line 516. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/serve/handler.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/serve/handler.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"4859eca515f1ea16f07b03b9318cf8cb215dc01fc37de3f2d24510c3237200bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-agent/src/test_utils/model_conformance.rs: crates/rig-agent/src/test_utils/model_conformance.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rig_agent::test_utils::model_conformance::invalid_tool_recovery_with_choice at line 1380. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-agent/src/test_utils/model_conformance.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-agent/src/test_utils/model_conformance.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65de7463cfd6109a74458e2f211373d02a19140c84ef5c8349071d0c13c2ff6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-candle/src/protocol.rs: crates/rig-candle/src/protocol.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in rig_candle::protocol::render_qwen_message at line 518. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-candle/src/protocol.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-candle/src/protocol.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"175d1e3904126af7f1840110186ced0a3a7e9e5b492bfa8cd335c71ddf48193e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-agent/src/run/prepare.rs: crates/rig-agent/src/run/prepare.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in rig_agent::run::prepare::prepare_request at line 126. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-agent/src/run/prepare.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-agent/src/run/prepare.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcbc68ef9f021242a8668520f2d51cea49de4e0e0e9e935ec3da2a4355e877d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-ecs/src/stage.rs: crates/rig-ecs/src/stage.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rig_ecs::stage::start at line 1186. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-ecs/src/stage.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-ecs/src/stage.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"421db9c16a0b972302c665a459f1d95fe41cb5539a5c46c0fd76425e33a3be1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-tools/src/shell.rs: crates/rig-tools/src/shell.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Kept::line at line 624. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-tools/src/shell.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-tools/src/shell.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba21aa2b181038518fff684a04beb8d506a920283d05a79cd88f8a0770e8305c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-memory/src/compaction.rs: crates/rig-memory/src/compaction.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Summarizer::serialize at line 1194. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-memory/src/compaction.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-memory/src/compaction.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d521d44cd216dae0daa13369a347d27b2e4e87999b568ec6f434ca12c8396169"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/test_utils/streaming.rs: crates/rig-core/src/test_utils/streaming.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in MockDecoder::event at line 291. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/test_utils/streaming.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/test_utils/streaming.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d7d590ccbacea7c3aa96fcd21be890b84ea883299e83598a51685f8fa121a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-cassette/src/http/mod.rs: crates/rig-cassette/src/http/mod.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rig_cassette::http::replay_request at line 1559. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-cassette/src/http/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/rig-cassette/src/http/mod.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9272507db40f7bab78aafd19ea726c4dfce6f6000444b98a0019b139153bd4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: test-support/rig-test-support/src/reasoning.rs: test-support/rig-test-support/src/reasoning.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rig_test_support::reasoning::assert_chat_history_preserves_reasoning_tool_roundtrip at line 738. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- test-support/rig-test-support/src/reasoning.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/reasoning.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"675c80725f84a6ac71bce9cf5fc8c71912aeaf7a75b8119ccd9d1704b88639c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/rig-basics/src/telemetry/usage.rs: plugins/rig-basics/src/telemetry/usage.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rig_basics::telemetry::usage::usage at line 439. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-basics/src/telemetry/usage.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/telemetry/usage.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05358d756391781884eb9094e9407e0dfc0b89c18150708d73591b33e0985b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/rig-claude-cloak/src/transport.rs: plugins/rig-claude-cloak/src/transport.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in rig_claude_cloak::transport::body at line 625. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-claude-cloak/src/transport.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-claude-cloak/src/transport.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff28d6343cabb02ba462a8c4e4b0870a78692174fdd7c7cd4a7e4eeb487b4186"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/gemini/caching.rs: crates/rig-core/src/providers/gemini/caching.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in CacheBook::plan at line 769. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/gemini/caching.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/providers/gemini/caching.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7182f775416984144b87fda6c5ba63f048a24473fb7928940b292707aecc51d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: xtask/src/catalog.rs: xtask/src/catalog.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in xtask::catalog::pin at line 481. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- xtask/src/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":"xtask/src/catalog.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1870f6163483f1b5a7ef4a904f3900b9ac481faee3f9ff310a4ec605ac7ff8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/gemini/options.rs: crates/rig-core/src/providers/gemini/options.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in rig_core::providers::gemini::options::generate_content_options at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/gemini/options.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/providers/gemini/options.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb2dc47449497f97763466ad54b6d32be957398f6cc9c9c9690f80395f03cc9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-tools/src/process.rs: crates/rig-tools/src/process.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rig_tools::process::forward_both at line 356. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-tools/src/process.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-tools/src/process.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d9a074d645a8f79e9959301e438629662c010f0f5783c7f0216e5c0428b93c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/rig-acp/src/session.rs: plugins/rig-acp/src/session.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rig_acp::session::open at line 757. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-acp/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":"plugins/rig-acp/src/session.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"81aafaf686c50f98e8559900490830b70e8e1b507a456bd57052f18b5c016530"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-tools/src/watch.rs: crates/rig-tools/src/watch.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rig_tools::watch::send_batches at line 690. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-tools/src/watch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-tools/src/watch.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a761b9b81a0b4dfb00bb718718a6bafaacac726a9d79e1fa4fed38269df3b9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/completion/options/merge.rs: crates/rig-core/src/completion/options/merge.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rig_core::completion::options::merge::apply at line 875. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/completion/options/merge.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/completion/options/merge.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bbad62015e488b4448ca1462d671a8b385cfab9206903585fc4aaf66cc8e96"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: test-support/rig-test-support/src/history_survival.rs: test-support/rig-test-support/src/history_survival.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rig_test_support::history_survival::collect_slots at line 487. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- test-support/rig-test-support/src/history_survival.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/history_survival.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"d696b7d162a21f63f0a69b714db54f4e5c1f781abd45898a1fa80e66167e0858"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/rig-basics/src/subagents/spawn.rs: plugins/rig-basics/src/subagents/spawn.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rig_basics::subagents::spawn::spawn_requested at line 217. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-basics/src/subagents/spawn.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/subagents/spawn.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b96ee9508108bf39a3f83ae78ef22f3338291dd6792a9ba03a94708a7158641"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/streaming/event.rs: crates/rig-core/src/streaming/event.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in StreamRecord::push at line 299. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/streaming/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/rig-core/src/streaming/event.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc748cb8a715f0b0e50487f8f10352718d411a0aa5b282eecc337efe88d3a069"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/rig-basics/src/reload/rebuild.rs: plugins/rig-basics/src/reload/rebuild.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rig_basics::reload::rebuild::drain_reload at line 194. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-basics/src/reload/rebuild.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/reload/rebuild.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4684ddd45c9e99855483f13944843e583866ea92a412ccc9b5a03fa457896b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-derive/src/tool/expand.rs: crates/rig-derive/src/tool/expand.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rig_derive::tool::expand::expand_rig_tool at line 108. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-derive/src/tool/expand.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-derive/src/tool/expand.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef482fe0f19d0d1a0bb9e8a546a03743e0eaca0790f97a5853f1d18b47c26f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-qdrant/src/filter.rs: crates/rig-qdrant/src/filter.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in QdrantFilter::interpret at line 137. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-qdrant/src/filter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-qdrant/src/filter.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b509f027388a0d158166591d7ab687e3b21741bddd5bf4992105b435af4ac8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-ecs/src/restore.rs: crates/rig-ecs/src/restore.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rig_ecs::restore::restore_session at line 356. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-ecs/src/restore.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-ecs/src/restore.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d274a5d6a790a1eff0c98849c89e9584ccb61e3df4a5b2060776261e2d9b91"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/conversation/pairing.rs: crates/rig-core/src/conversation/pairing.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rig_core::conversation::pairing::walk at line 461. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/conversation/pairing.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/conversation/pairing.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f103bb9e95ab744b41a7503161d9b01339c3f061ef432d7609d63fccf805c3fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/rig-tui/src/pane.rs: plugins/rig-tui/src/pane.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rig_tui::pane::lay_out_panes at line 210. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-tui/src/pane.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/pane.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88e0a39d845a96ad4a703a81ddd3ad92dea91ab43a9740cac0b794df2fe5240"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-tools/src/search.rs: crates/rig-tools/src/search.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rig_tools::search::find at line 322. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-tools/src/search.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-tools/src/search.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3554606d1f05f6edb957b5d8e957a222fd56ae0d273dc7d523303ca502443c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-memory/src/rewrite.rs: crates/rig-memory/src/rewrite.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rig_memory::rewrite::rewrite at line 628. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-memory/src/rewrite.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-memory/src/rewrite.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e874e182c8670bc42735227910cfcb5459942083d9187ed40e40bfbdccaba4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-bedrock/src/request.rs: crates/rig-bedrock/src/request.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in rig_bedrock::request::base at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-bedrock/src/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/rig-bedrock/src/request.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"401448ecd5a3c1d8da081f0af42b328254ae55d5c2fbce6af176db70aef8bfc2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/cohere/chat.rs: crates/rig-core/src/providers/cohere/chat.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in NativeChat::assistant at line 199. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/cohere/chat.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/providers/cohere/chat.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e01cfb7f53e1400802e9838f6204ba958d1928a018e354e192c67dcf1853967"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: corpus/sp/src/dead_ends_ledger.rs: corpus/sp/src/dead_ends_ledger.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in corpus_sp::dead_ends_ledger::review_shell at line 367. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- corpus/sp/src/dead_ends_ledger.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sp/src/dead_ends_ledger.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b75fdd0e126935388fa0145dba4baba084f4021a13f53009e181f07ea6f59fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-cassette/src/effect_log/jsonl.rs: crates/rig-cassette/src/effect_log/jsonl.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Writer::encode at line 187. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-cassette/src/effect_log/jsonl.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-cassette/src/effect_log/jsonl.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a358ef25a350755bcf1f42936c996f8f85c43a8b993c83c143d3c5e1bcc5d6ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins/rig-acp/src/translate.rs: plugins/rig-acp/src/translate.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in rig_acp::translate::replay at line 192. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-acp/src/translate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-acp/src/translate.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"00403d79b1e1a0cc8fb22aed996fb127ed2da1c5750bcfb811bc6a52b20ac2ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: corpus/sn/src/crash_resume.rs: corpus/sn/src/crash_resume.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in corpus_sn::crash_resume::recover at line 207. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- corpus/sn/src/crash_resume.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/crash_resume.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d69e9ec92af7498d7087d6033cfc3f9a7837d255e7992ed48f5243e67d7e392"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: corpus/fh/src/prompt_cache_shaping.rs: corpus/fh/src/prompt_cache_shaping.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in corpus_fh::prompt_cache_shaping::shape at line 143. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- corpus/fh/src/prompt_cache_shaping.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/fh/src/prompt_cache_shaping.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3726be00b03582ffd798c62378eb3dbae1d292f967be6e810006ceb38f204d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/client/gemini_caching.rs: crates/rig-core/src/client/gemini_caching.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Caching::send at line 362. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/client/gemini_caching.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/client/gemini_caching.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a007b954ea904a4f4c267acc5fb2c97fc276467825b7ce73cd8f62d8f8fd79"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/catalog/read.rs: crates/rig-core/src/catalog/read.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Catalog::from_overrides at line 157. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/catalog/read.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/catalog/read.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfbd846997c61bf3f47d2f6616b6332118eabd7e158e5d6115e38d6232bac7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/anthropic/streaming/document.rs: crates/rig-core/src/providers/anthropic/streaming/document.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Message::absorb at line 156. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/anthropic/streaming/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/rig-core/src/providers/anthropic/streaming/document.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d475ddaa6768c2bf78e898aaff4e156a8ce38c20febb3782e992dff33f744b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-markdown/src/wrap.rs: crates/rig-markdown/src/wrap.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rig_markdown::wrap::wrap_hanging at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-markdown/src/wrap.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-markdown/src/wrap.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9009637fd87dd10e414db98e41f8fcdd3f5f7c27477d6acfecf121d184fe344"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: xtask/src/verify.rs: xtask/src/verify.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Options::parse at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- xtask/src/verify.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/verify.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e1fd1c91a1503e51eb5fe1f472fc9f2316e06182fa490276e7c1e14a11edfd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/cohere/streaming/document.rs: crates/rig-core/src/providers/cohere/streaming/document.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ChatResponse::absorb at line 63. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/cohere/streaming/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/rig-core/src/providers/cohere/streaming/document.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1310b177e3d0ce2c49e3e2bbd86e4206781bc8a813020c8f1da518d38c3e28"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-ecs/src/lib.rs: crates/rig-ecs/src/lib.rs changed 25 times in last 90 days and 15 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 AgentPlugin::build at line 178), 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(print): rig --json writes ready before answering a request already waiting (#3216)\u201D; \u201Cfix(usage,budget)!: model calls ended by a stop count toward spend and the budget (#3003)\u201D; \u201Cfix!: every limit on asked work is a settings.toml key with a sensible default, and rig says what it changes (#2995)\u201D; \u201Cfix(redact): a notice is redacted between the stages, before any front reads it (#2993)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-ecs/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/rig-ecs/src/lib.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd202ec7c4c2ca261b89cb237d3d433f4c0e049e82a3aeb3ea4969d7dc5f4491"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-tui/src/lib.rs: plugins/rig-tui/src/lib.rs changed 21 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 2 (its worst body is TuiViewPlugin::finish 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(tui): the wheel scrolls the transcript and a drag copies the text under it (#3104)\u201D; \u201Cfix(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D; \u201Cfix(harness)!: one run contract for every front; unknown input is refused out loud (#2972)\u201D; \u201Cfix(harness)!: one current agent per session; a fork says what it copies (#2967)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-tui/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":"plugins/rig-tui/src/lib.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf4ad30e03a7d8c393f58e6175f3b63a0e18bcb49140b4c2b062041ea67dddd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-tools/src/workspace.rs: crates/rig-tools/src/workspace.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 7 (its worst body is rig_tools::workspace::read_file at line 512), 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(tools): a move between hard links is refused, and git checkpoints keep raw bytes per root (#3043)\u201D; \u201Cfix(tools,memory)!: a confined write never leaves its base, and a stale session save is refused (#2999)\u201D; \u201Cfix(tools)!: an @ reference attaches exactly the file that was picked (#2962)\u201D; \u201Cfix(tools)!: tool results show what they found (#2965)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-tools/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/rig-tools/src/workspace.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"056a922a2a819250eb44ac1ec78e4691771223c0d315753c26ce528e856d94e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-tools/src/remote.rs: crates/rig-tools/src/remote.rs changed 15 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 12 (its worst body is Remote::read_files at line 513), 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(tools): remote writes refuse links, say a later mismatch proves nothing, and git listings hold only files there (#3041)\u201D; \u201Cfix(tools)!: every child process has one owner, enforced by a lint (#2970)\u201D; \u201Cfix(tools)!: an @ reference attaches exactly the file that was picked (#2962)\u201D; \u201Cfix(tools)!: tool results show what they found (#2965)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-tools/src/remote.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-tools/src/remote.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"3245830b571a5daad96a79e9b6d85fbbab38c1f35b017352eba6b7de8ad85907"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-ecs/src/agent.rs: crates/rig-ecs/src/agent.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 8 (its worst body is Partial::follow at line 570), 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(ecs)!: one spawn path for agents, with no depth limit, and requests owned by what made them (#2991)\u201D; \u201Cfix(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D; \u201Cfix(tools)!: --tools limits only the run it is given to (#2984)\u201D; \u201Cfix(harness)!: one run contract for every front; unknown input is refused out loud (#2972)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-ecs/src/agent.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-ecs/src/agent.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a37c372d30453bcae86ca91e36bdd5719c5663617c4cec1dca3d52ad96ee96"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-ecs/src/tools.rs: crates/rig-ecs/src/tools.rs changed 15 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 13 (its worst body is rig_ecs::tools::keep_within_parents at line 481), 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!: every limit on asked work is a settings.toml key with a sensible default, and rig says what it changes (#2995)\u201D; \u201Cfix(ecs)!: one spawn path for agents, with no depth limit, and requests owned by what made them (#2991)\u201D; \u201Cfix(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D; \u201Cfix(tools)!: --tools limits only the run it is given to (#2984)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-ecs/src/tools.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-ecs/src/tools.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffff1711efa2ba3129015756905bd753944fd214833e3f05760f5fa5b10914bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-harness/src/host/launcher.rs: crates/rig-harness/src/host/launcher.rs changed 14 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 rig_harness::host::launcher::launcher_notice at line 427), 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(rig-harness): move a process-group list a reload cannot read aside instead of writing over it (#3263)\u201D; \u201Cfix(rig-harness): keep each launcher warning whole when it holds a line break (#3258)\u201D; \u201Cfix(rig-cli): \u0060rig plugin check --build\u0060 refuses settings a start would refuse (#3253)\u201D; \u201Cfix!: every limit on asked work is a settings.toml key with a sensible default, and rig says what it changes (#2995)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-harness/src/host/launcher.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-harness/src/host/launcher.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23d40e38c9e0b8b6e22df980911a874ec492977cd4f1c6c60ed90ca95c2d2c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-tools/src/read.rs: crates/rig-tools/src/read.rs changed 13 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 13 (its worst body is rig_tools::read::show at line 352), 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!: every limit on asked work is a settings.toml key with a sensible default, and rig says what it changes (#2995)\u201D; \u201Cfix(tools)!: tool results show what they found (#2965)\u201D; \u201Cfix(tools)!: read returns images, long lines can be read on, a clearer timeout hint (#2913)\u201D; \u201Cfix(rig-tools)!: triobench round 8: a read of part of a small remote file gets it whole so an edit after it is one call, an edit\u0027s reply shows the changed lines and a few around them (#2860)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-tools/src/read.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-tools/src/read.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"0147bedd0f45eec4217a2e7ccbef043dfb19b94a7ba044b5610d58e9da4d4be5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-mcp-client/src/lib.rs: plugins/rig-mcp-client/src/lib.rs changed 12 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 15 (its worst body is rig_mcp_client::register at line 1056), 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(rig-rmcp): a server that declares no tools is not asked for them (#3296)\u201D; \u201Cfix(rig-rmcp): client_config offers the released MCP protocol; examples and docs use it (#3289)\u201D; \u201Cfix(rig-mcp-client): attribute MCP tools to the plugin that added McpCorePlugin (#3272)\u201D; \u201Cfix(mcp-client): a server that wants an OAuth sign-in says so in plain words (#3229)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-mcp-client/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":"plugins/rig-mcp-client/src/lib.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9eb723f50ba30a162c9b0bd4bbc820e12bf5dada42ea0811a89b3d5c74d232"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-basics/src/helpers.rs: plugins/rig-basics/src/helpers.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 13 (its worst body is Runner::run at line 494), 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(basics): settle a helper\u0027s count with try_update, which Rust 1.99 does not deprecate (#3215)\u201D; \u201Cfix(basics): a helper timeout too long for a deadline is refused (#3141)\u201D; \u201Cfix!: every limit on asked work is a settings.toml key with a sensible default, and rig says what it changes (#2995)\u201D; \u201Cfix(tools)!: --tools limits only the run it is given to (#2984)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-basics/src/helpers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/helpers.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"590a538eed1a8bd1e086a3f332bd956c902347115ee954543eac302efa2693a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-memory/src/session.rs: crates/rig-memory/src/session.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 12 (its worst body is Session::save at line 564), 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(memory)!: undo restores only what a compaction replaced in this conversation, and read_conversation returns failed blob reads (#3095)\u201D; \u201Cfix(memory): compaction cuts, concurrent DirFiles writes, masked blob errors and Session::save retries (#3046)\u201D; \u201Cfix(tools,memory)!: a confined write never leaves its base, and a stale session save is refused (#2999)\u201D; \u201Cfix(agent)!: Esc keeps the partial reply, /compact keeps history, accurate summaries, ctx ? after compaction (#2918)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-memory/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/rig-memory/src/session.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"21db451325eb2bb1dba653ca6ef290fdeccf1f8334da1002c1a4affd56b57f4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-tools/src/lib.rs: crates/rig-tools/src/lib.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 5 (its worst body is Excerpt::mark at line 243), 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(tui): wrap the input at spaces, end a cut key-hint row in \u2026, hang read and /help rows under their text (#3231)\u201D; \u201Cfix(tools)!: tool results show what they found (#2965)\u201D; \u201Cfix(rig-tools)!: a tool path starting with ~ is in the home directory (#2940)\u201D; \u201Cfix(tools)!: read returns images, long lines can be read on, a clearer timeout hint (#2913)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-tools/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/rig-tools/src/lib.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a642e4d343f9a618c06d121682b272aa02b3f510b07e8af2a3422109510cf685"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-basics/src/models.rs: plugins/rig-basics/src/models.rs changed 8 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 8 (its worst body is rig_basics::models::choose_invoked_model at line 174), 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(rig-core, rig-ecs, rig-basics)!: one reader and printer for a reasoning setting as text, so [model] effort = \u0022high\u0022 works on budget-only models (#3291)\u201D; \u201Cfix(basics): a first pick names a saved key file it cannot read (#3168)\u201D; \u201Cfix(models)!: /model lists only models you can use now; a model that doesn\u0027t connect is refused and the current one stays (#2983)\u201D; \u201Cfix(models)!: only an explicit choice becomes the default; /model offers only models that answer (#2973)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-basics/src/models.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/models.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e55389dd028d72975c7d4565e16f6bb4e5ceede17d97d1492dfb00d9434535"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: corpus/base/src/handoff.rs: corpus/base/src/handoff.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 12 (its worst body is corpus_base::handoff::handoff at line 125), 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(ecs)!: one spawn path for agents, with no depth limit, and requests owned by what made them (#2991)\u201D; \u201Cfix(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D; \u201Cfix(compaction)!: rewrite the summary, and never clear an output without notes or a same-bytes re-read (#2975)\u201D; \u201Cfix(harness)!: one current agent per session; a fork says what it copies (#2967)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- corpus/base/src/handoff.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/handoff.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9b075a72a511be293b75656f54ffc41fb1fda9ae72de7f718d139911409f76"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-tools/src/edit.rs: crates/rig-tools/src/edit.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 15 (its worst body is rig_tools::edit::apply_to at line 459), 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(tools)!: tool results show what they found (#2965)\u201D; \u201Cfix(rig-tools)!: triobench round 8: a read of part of a small remote file gets it whole so an edit after it is one call, an edit\u0027s reply shows the changed lines and a few around them (#2860)\u201D; \u201Cfix(rig-tools): triobench round 6: shell output drops terminal escape codes, a cut keeps the first and last errors, a remote write cut off mid-way says whether it happened, an edit after a write is one call (#2858)\u201D; \u201Cfix(rig-tools): triobench round 4: edits apply in order, an edit of a file seen whole is one transport call, a stopped command says how it was stopped (#2857)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-tools/src/edit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-tools/src/edit.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"793fe07f4fe9f013f41180562530e9ce7b269ad5081d457aff263601727599f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-tools/src/fs.rs: crates/rig-tools/src/fs.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 rig_tools::fs::write_atomic at line 82), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(harness): an existing private file\u0027s staged copy is never readable by others (#3166)\u201D; \u201Cfix(tools,memory)!: a confined write never leaves its base, and a stale session save is refused (#2999)\u201D; \u201Cfix(tools)!: tool results show what they found (#2965)\u201D; \u201Cfix(rig-tools)!: a tool path starting with ~ is in the home directory (#2940)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-tools/src/fs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-tools/src/fs.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7806f5c355b53b275349e57210431ed5c8e98315ccf2e90f3f316b50cc8f2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-cli/src/update.rs: crates/rig-cli/src/update.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 5 (its worst body is rig_cli::update::install_and_build at line 106), 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(rig-cli): install rig from crates.io with --locked (#3267)\u201D; \u201Cfix(rig-cli): keep exported secrets out of rig update\u0027s cargo install and rebuild (#3265)\u201D; \u201Cfix(rig-cli): run rig update\u0027s cargo install away from the directory rig started in (#3260)\u201D; \u201Cfix(rig-harness-protocol): say the command line that runs a launcher word given after options (#3259)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-cli/src/update.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-cli/src/update.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"101ada8ae815addf50ca2ae49f215136ac42e1ced2975203b7a49e2c80788f03"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-basics/src/subagents/lifecycle.rs: plugins/rig-basics/src/subagents/lifecycle.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 9 (its worst body is rig_basics::subagents::lifecycle::report_after_restore at line 462), 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(ecs)!: one spawn path for agents, with no depth limit, and requests owned by what made them (#2991)\u201D; \u201Cfix(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D; \u201Cfix(harness)!: one run contract for every front; unknown input is refused out loud (#2972)\u201D; \u201Cfix(agent)!: quitting mid-turn is a stop, and a restart carries nothing on by itself (#2943)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-basics/src/subagents/lifecycle.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/subagents/lifecycle.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"575ef5018b100f353c3e4f6f5f9578ce45906d35a08a6382bdd8d8af7b3cb53c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-tools/src/attach.rs: crates/rig-tools/src/attach.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 rig_tools::attach::attachments at line 235), 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(tools)!: an @ reference attaches exactly the file that was picked (#2962)\u201D; \u201Cfix(rig-tools)!: a tool path starting with ~ is in the home directory (#2940)\u201D; \u201Cfix(tools)!: read returns images, long lines can be read on, a clearer timeout hint (#2913)\u201D; \u201Cfix(tui)!: prompt history per project, the shown conversation\u0027s prompts first (#2916)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-tools/src/attach.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-tools/src/attach.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"25878c05b76eec4030f6aa7679f1ea8c523aa64b6d0595cb972d884880427550"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-ecs/src/model.rs: crates/rig-ecs/src/model.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 9 (its worst body is rig_ecs::model::on_set_model at line 197), 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(rig-core, rig-ecs, rig-basics)!: one reader and printer for a reasoning setting as text, so [model] effort = \u0022high\u0022 works on budget-only models (#3291)\u201D; \u201Cfix(rig-ecs, rig-basics): a reasoning effort the model can\u0027t take is reset out loud, budgets included (#3277)\u201D; \u201Cfix(models)!: /model lists only models you can use now; a model that doesn\u0027t connect is refused and the current one stays (#2983)\u201D; \u201Cfix(models)!: only an explicit choice becomes the default; /model offers only models that answer (#2973)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-ecs/src/model.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-ecs/src/model.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc5bdbe565b29d688297f9904f320522cde4ec51a71a491c0d7977b548c76d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-ecs/src/session_log.rs: crates/rig-ecs/src/session_log.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 8 (its worst body is rig_ecs::session_log::log_changed at line 147), 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(print): rig --json writes ready before answering a request already waiting (#3216)\u201D; \u201Cfix(ecs)!: one spawn path for agents, with no depth limit, and requests owned by what made them (#2991)\u201D; \u201Cfix(harness)!: one current agent per session; a fork says what it copies (#2967)\u201D; \u201Cfix(tui, harness): one Ctrl\u002BD quits; a session with no messages isn\u0027t saved (#2909)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-ecs/src/session_log.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-ecs/src/session_log.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae099772b4c51dafe3c0f5d7f125eab15e4e7f36253f6c1d1e033e48d11b8d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-tui/src/editor.rs: plugins/rig-tui/src/editor.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 13 (its worst body is rig_tui::editor::draw_editors at line 746), 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(tui): wrap the input at spaces, end a cut key-hint row in \u2026, hang read and /help rows under their text (#3231)\u201D; \u201Cfix(tui,tools): the status line stays while typing, a failed pipe read is told, and a checkpoint warns of files it cannot read (#2998)\u201D; \u201Cfix(tui)!: Up never loses what you typed, and a recalled command opens no list (#2947)\u201D; \u201Cfix(tui)!: prompt history per project, the shown conversation\u0027s prompts first (#2916)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-tui/src/editor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/editor.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ab21244eb9bcc2e1eb48ffff0d16c38be062816fa11b4b97fb062532de21a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-acp/src/session/questions.rs: plugins/rig-acp/src/session/questions.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 7 (its worst body is Asking::ask at line 62), 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(rig-harness,rig-basics,rig-acp): one answer rule for every front, and the JSON front refuses a lost answer (#3140)\u201D; \u201Cfix(ecs)!: one spawn path for agents, with no depth limit, and requests owned by what made them (#2991)\u201D; \u201Cfix(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D; \u201Cfix(io)!: input and output are bounded; a stop is never blocked by output (#2974)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-acp/src/session/questions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-acp/src/session/questions.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"90475583b83fd3778412325d2cb392451f14c5e6216f36fd99970d5059fca6e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: corpus/sp/src/subagent_result_cache.rs: corpus/sp/src/subagent_result_cache.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 corpus_sp::subagent_result_cache::watch_effect at line 334), 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(rig-core, rig-ecs, rig-basics)!: one reader and printer for a reasoning setting as text, so [model] effort = \u0022high\u0022 works on budget-only models (#3291)\u201D; \u201Cfix(ecs)!: one spawn path for agents, with no depth limit, and requests owned by what made them (#2991)\u201D; \u201Cfix(tools)!: --tools limits only the run it is given to (#2984)\u201D; \u201Cfix(tools)!: tool results show what they found (#2965)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- corpus/sp/src/subagent_result_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":"corpus/sp/src/subagent_result_cache.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"6346658a66d79c9881f37498570b928b9e5c149fc616a722cab004d14a38b6a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-basics/src/subagents/tools.rs: plugins/rig-basics/src/subagents/tools.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 11 (its worst body is Agents::reachable at line 308), 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(ecs)!: one spawn path for agents, with no depth limit, and requests owned by what made them (#2991)\u201D; \u201Cfix(harness)!: one run contract for every front; unknown input is refused out loud (#2972)\u201D; \u201Cfix(rig)!: triobench round 1: subagent messages and reports, remote HOST:PATH paths, shell streams and cuts, search paths, OSC 133 turn marks (#2849)\u201D; \u201Cfix!: everything the pre-0.45 API review found (#2848)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-basics/src/subagents/tools.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/subagents/tools.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e043ea6390e879fd4bb4ec9f36c131a75b73feb6be488fadde468ef8d6a40c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-core/src/conversation/mod.rs: crates/rig-core/src/conversation/mod.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 12 (its worst body is Conversation::replace at line 858), 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(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D; \u201Cfix(session)!: resume draws what live drew; an empty session is not kept (#2964)\u201D; \u201Cfix(agent)!: Esc keeps the partial reply, /compact keeps history, accurate summaries, ctx ? after compaction (#2918)\u201D; \u201Cfix(agent)!: a failed message goes back into the input (#2895)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/conversation/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/rig-core/src/conversation/mod.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e66fb51cf00c40b85ee3e4ed886a827bc6db7bf37dd80972dd9da4efad88649"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-acp/src/session/output.rs: plugins/rig-acp/src/session/output.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 9 (its worst body is Out::stream at line 31), 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(rig-acp): show the editor a reply a plugin answers without streaming (#3138)\u201D; \u201Cfix(ecs)!: one spawn path for agents, with no depth limit, and requests owned by what made them (#2991)\u201D; \u201Cfix(print,acp)!: --json names a call by its place (protocol v 2); ACP shows a result the same live and loaded (#2988)\u201D; \u201Cfix(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-acp/src/session/output.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-acp/src/session/output.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"223b2fe6608673c20282694f31f552fc03f56e687a0574f8d068d94004370682"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-harness/src/pick.rs: crates/rig-harness/src/pick.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is rig_harness::pick::pick at line 352), 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(rig-harness,rig-basics,rig-acp): one answer rule for every front, and the JSON front refuses a lost answer (#3140)\u201D; \u201Cfix(harness)!: one run contract for every front; unknown input is refused out loud (#2972)\u201D; \u201Cfix(harness)!: one current agent per session; a fork says what it copies (#2967)\u201D; \u201Cfix(tui)!: fix picker layout, status text, edit diffs and paging (#2917)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-harness/src/pick.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-harness/src/pick.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca546684e6dd6cf808d7a356a38c43ff51f96f2aa7ba5ffd2a16dc3fae2c80d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-basics/src/login/keys.rs: plugins/rig-basics/src/login/keys.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 7 (its worst body is rig_basics::login::keys::say_key_passed_over at line 179), 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(rig-core, rig-basics): FileTokenStore refuses a credential file behind a symlink and narrows one readable by others (#3284)\u201D; \u201Cfix(basics): a first pick names a saved key file it cannot read (#3168)\u201D; \u201Cfix(basics): a saved /login key that can\u0027t be read refuses the connect (#3136)\u201D; \u201Cfix(tui)!: fix picker layout, status text, edit diffs and paging (#2917)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-basics/src/login/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":"plugins/rig-basics/src/login/keys.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"189a5429d77f2646f519d8c8d685a51e107663c3b4b2650f685ff1861d00e673"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-basics/src/sessions/agents.rs: plugins/rig-basics/src/sessions/agents.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 5 (its worst body is Agents::items at line 230), 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(ecs)!: one spawn path for agents, with no depth limit, and requests owned by what made them (#2991)\u201D; \u201Cfix(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D; \u201Cfix(harness)!: one current agent per session; a fork says what it copies (#2967)\u201D; \u201Cfix(tui)!: fix picker layout, status text, edit diffs and paging (#2917)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-basics/src/sessions/agents.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/sessions/agents.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf8d5cb4fd50aa95ad9874ddd165638187b2b94a18b712dc51f48d36f5bc15c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: corpus/sn/src/task_queue.rs: corpus/sn/src/task_queue.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 11 (its worst body is corpus_sn::task_queue::parse at line 213), 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(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D; \u201Cfix(harness)!: one current agent per session; a fork says what it copies (#2967)\u201D; \u201Cfix(agent)!: quitting mid-turn is a stop, and a restart carries nothing on by itself (#2943)\u201D; \u201Cfix!: everything the pre-0.45 API review found (#2848)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- corpus/sn/src/task_queue.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sn/src/task_queue.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ab8c669b1c10ac707636941670ee314f380af0ef7d00a2d504191636feecfa"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-tools/src/overlay.rs: crates/rig-tools/src/overlay.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 5 (its worst body is Overlay::stat at line 133), 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(tools)!: an @ reference attaches exactly the file that was picked (#2962)\u201D; \u201Cfix(tools)!: tool results show what they found (#2965)\u201D; \u201Cfix(rig-tools): triobench round 3: one transport call per remote write, remote reads sent only their lines, killed commands name the signal (#2855)\u201D; \u201Cfix(rig)!: triobench round 1: subagent messages and reports, remote HOST:PATH paths, shell streams and cuts, search paths, OSC 133 turn marks (#2849)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-tools/src/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/rig-tools/src/overlay.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5b610aaae007f070619fadf108f6e39322841a0372f6c0e454c9877ee235eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-acp/src/session/options.rs: plugins/rig-acp/src/session/options.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 15 (its worst body is rig_acp::session::options::changed at line 170), 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(rig-core, rig-ecs, rig-basics)!: one reader and printer for a reasoning setting as text, so [model] effort = \u0022high\u0022 works on budget-only models (#3291)\u201D; \u201Cfix(models)!: /model lists only models you can use now; a model that doesn\u0027t connect is refused and the current one stays (#2983)\u201D; \u201Cfix(models)!: only an explicit choice becomes the default; /model offers only models that answer (#2973)\u201D; \u201Cfix(harness)!: one current agent per session; a fork says what it copies (#2967)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-acp/src/session/options.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-acp/src/session/options.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9faf0b98f7ad3f0cfb5cbd5fbdca5b97725b3ea60136ff8c093d5855ba17a4e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-basics/src/models/tui.rs: plugins/rig-basics/src/models/tui.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 8 (its worst body is rig_basics::models::tui::complete_models at line 31), 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(rig-core, rig-ecs, rig-basics)!: one reader and printer for a reasoning setting as text, so [model] effort = \u0022high\u0022 works on budget-only models (#3291)\u201D; \u201Cfix(models)!: /model lists only models you can use now; a model that doesn\u0027t connect is refused and the current one stays (#2983)\u201D; \u201Cfix(harness)!: one run contract for every front; unknown input is refused out loud (#2972)\u201D; \u201Cfix(tui)!: fix picker layout, status text, edit diffs and paging (#2917)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-basics/src/models/tui.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/models/tui.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"056aab2c04174c63b06002724ffe68b798beb3a9f0fea3e83580a2e861eb56f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-ecs/src/fork.rs: crates/rig-ecs/src/fork.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 11 (its worst body is rig_ecs::fork::fork_now at line 208), 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(ecs)!: one spawn path for agents, with no depth limit, and requests owned by what made them (#2991)\u201D; \u201Cfix(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D; \u201Cfix(harness)!: one current agent per session; a fork says what it copies (#2967)\u201D; \u201Cfix!: everything the pre-0.45 API review found (#2848)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-ecs/src/fork.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-ecs/src/fork.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a016e278636ea9b4b79568dcb240edf7b762d53c210ef807cf00a0565d96abf3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-core/src/providers/internal/auth/store.rs: crates/rig-core/src/providers/internal/auth/store.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 rig_core::providers::internal::auth::store::read_private at line 304), 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(rig-core, rig-basics): FileTokenStore refuses a credential file behind a symlink and narrows one readable by others (#3284)\u201D; \u201Cfix!: everything the pre-0.45 API review found (#2848)\u201D; \u201Cfix!: API review follow-up: defects, async storage, restored capabilities (#2845)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/internal/auth/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/rig-core/src/providers/internal/auth/store.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c10698af442f8c66bc8ec8be0348afd9d2462d6d77d97eb052960bc7463f2d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-harness/src/host/exit.rs: crates/rig-harness/src/host/exit.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 ExitReason::end at line 61), 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(tools)!: every child process has one owner, enforced by a lint (#2970)\u201D; \u201Cfix(ecs)!: a stopped turn keeps what streamed, and a stop is never an error (#2966)\u201D; \u201Cfix(agent)!: quitting mid-turn is a stop, and a restart carries nothing on by itself (#2943)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-harness/src/host/exit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-harness/src/host/exit.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f315a1f9e5f1443cf8222bafa2093eb1aec0dcf082da8287df54c4e8bdf80cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: corpus/sp/src/output_styles.rs: corpus/sp/src/output_styles.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 corpus_sp::output_styles::sync at line 318), 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(ecs)!: one spawn path for agents, with no depth limit, and requests owned by what made them (#2991)\u201D; \u201Cfix(tools)!: tool results show what they found (#2965)\u201D; \u201Cfix(tui)!: fix picker layout, status text, edit diffs and paging (#2917)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- corpus/sp/src/output_styles.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/sp/src/output_styles.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa791a409b84bc5809bf3edd6a6e53385c2dc018aed5a32e28307867ae3d174"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-basics/src/telemetry/resume.rs: plugins/rig-basics/src/telemetry/resume.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is rig_basics::telemetry::resume::label_usage 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(harness)!: one current agent per session; a fork says what it copies (#2967)\u201D; \u201Cfix(tui)!: fix picker layout, status text, edit diffs and paging (#2917)\u201D; \u201Cfix!: everything the pre-0.45 API review found (#2848)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-basics/src/telemetry/resume.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/telemetry/resume.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb55e64d25fba8ccfa72d916914b5e863b5960eb7bfd9eb4f9de8728a514e799"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: corpus/base/src/chat_bridge.rs: corpus/base/src/chat_bridge.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 corpus_base::chat_bridge::receive at line 225), 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(ecs)!: one spawn path for agents, with no depth limit, and requests owned by what made them (#2991)\u201D; \u201Cfix(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D; \u201Cfix(agent)!: a failed message goes back into the input (#2895)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- corpus/base/src/chat_bridge.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/chat_bridge.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"826a8d7c5afc87dcb029a73a954f9452260d68d4f1da1c084c2e7fc22ab772ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: corpus/base/src/http_api.rs: corpus/base/src/http_api.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 corpus_base::http_api::answer at line 218), 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(ecs)!: one spawn path for agents, with no depth limit, and requests owned by what made them (#2991)\u201D; \u201Cfix(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D; \u201Cfix(harness)!: one run contract for every front; unknown input is refused out loud (#2972)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- corpus/base/src/http_api.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/http_api.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4857d87a423837b63b89b52bf274454ffac5cf3adf89257acca7c193e7636b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: corpus/ct/src/metrics_endpoint.rs: corpus/ct/src/metrics_endpoint.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 corpus_ct::metrics_endpoint::gauges at line 292), 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(agent)!: Esc keeps the partial reply, /compact keeps history, accurate summaries, ctx ? after compaction (#2918)\u201D; \u201Cfix(catalog, compaction): fit models\u0027 input limits with simpler overflow recovery (#2880)\u201D; \u201Cfix!: everything the pre-0.45 API review found (#2848)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- corpus/ct/src/metrics_endpoint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ct/src/metrics_endpoint.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b013352cab847b92bdb4b03fa733f9df53847a2acc97a58933c04db8ca9a310"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: corpus/shared/src/protected_paths.rs: corpus/shared/src/protected_paths.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is corpus_shared::protected_paths::filter_searches at line 348), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix!: every limit on asked work is a settings.toml key with a sensible default, and rig says what it changes (#2995)\u201D; \u201Cfix(tools)!: tool results show what they found (#2965)\u201D; \u201Cfix(rig-tools)!: a tool path starting with ~ is in the home directory (#2940)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- corpus/shared/src/protected_paths.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/shared/src/protected_paths.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"551455db9309786d9dea13d4115fc4c0781781a155e69cf8c464cbc239a264c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-tui/src/history.rs: plugins/rig-tui/src/history.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 rig_tui::history::record at line 176), 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!: every limit on asked work is a settings.toml key with a sensible default, and rig says what it changes (#2995)\u201D; \u201Cfix(tui)!: Up never loses what you typed, and a recalled command opens no list (#2947)\u201D; \u201Cfix(tui)!: prompt history per project, the shown conversation\u0027s prompts first (#2916)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-tui/src/history.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-tui/src/history.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b753d4c65eb89e7f2529a0b47a5ef6b8bd06f6c72fa76cea6ff0914eb55ae4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: corpus/base/src/map_reduce.rs: corpus/base/src/map_reduce.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 corpus_base::map_reduce::on_spawned at line 395), 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(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D; \u201Cfix(tools)!: --tools limits only the run it is given to (#2984)\u201D; \u201Cfix(harness)!: one current agent per session; a fork says what it copies (#2967)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- corpus/base/src/map_reduce.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/map_reduce.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"91420e2026fe640496c3ec3f7138957f1312ee72e786470610bec79e59751e06"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-basics/src/coding_tools/remote.rs: plugins/rig-basics/src/coding_tools/remote.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 9 (its worst body is RemoteHostsPlugin::finish at line 73), 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(tools)!: every child process has one owner, enforced by a lint (#2970)\u201D; \u201Cfix(harness)!: one run contract for every front; unknown input is refused out loud (#2972)\u201D; \u201Cfix(rig-tools): triobench round 4: edits apply in order, an edit of a file seen whole is one transport call, a stopped command says how it was stopped (#2857)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-basics/src/coding_tools/remote.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-basics/src/coding_tools/remote.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e3c256cdbb8b953d03f11fde1ed8925151a29aeadf8bee00b91122f00f2577"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: corpus/ho/src/relay_pipeline.rs: corpus/ho/src/relay_pipeline.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 corpus_ho::relay_pipeline::pipe at line 340), 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(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D; \u201Cfix(harness)!: one current agent per session; a fork says what it copies (#2967)\u201D; \u201Cfix(agent)!: quitting mid-turn is a stop, and a restart carries nothing on by itself (#2943)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- corpus/ho/src/relay_pipeline.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/ho/src/relay_pipeline.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e708881f7f051c10306f487e43936a6ff506380c0f008bac2457512e3dc842"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: corpus/base/src/window_gui.rs: corpus/base/src/window_gui.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 corpus_base::window_gui::blocks_of at line 409), 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(harness)!: one run contract for every front; unknown input is refused out loud (#2972)\u201D; \u201Cfix(harness)!: one current agent per session; a fork says what it copies (#2967)\u201D; \u201Cfix(agent)!: Esc keeps the partial reply, /compact keeps history, accurate summaries, ctx ? after compaction (#2918)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- corpus/base/src/window_gui.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/window_gui.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb1f4af54fb6af67eac16633e2a7b9d8828ade3f5d69d4fe727791794972fed"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-steel/src/program.rs: plugins/rig-steel/src/program.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 12 (its worst body is rig_steel::program::to_json at line 165), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix!: every limit on asked work is a settings.toml key with a sensible default, and rig says what it changes (#2995)\u201D; \u201Cfix(ecs)!: one spawn path for agents, with no depth limit, and requests owned by what made them (#2991)\u201D; \u201Cfix(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-steel/src/program.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-steel/src/program.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a212dab71d64bf6d562fe6e007d7641a7c91371bd584ef0de0222e12015146"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-core/src/conversation/turn.rs: crates/rig-core/src/conversation/turn.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 3 (its worst body is Conversation::end_turn at line 133), 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(ecs)!: a call is known by its reply and place; every stop goes through one owner (#2985)\u201D; \u201Cfix(ecs)!: a stopped turn keeps what streamed, and a stop is never an error (#2966)\u201D; \u201Cfix(agent)!: Esc keeps the partial reply, /compact keeps history, accurate summaries, ctx ? after compaction (#2918)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/conversation/turn.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/conversation/turn.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adf169e01b215082df2aa9edeef14ad232be260eaadf1691e37c5f268f39137"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-core/src/catalog/connector.rs: crates/rig-core/src/catalog/connector.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 8 (its worst body is Connector::status at line 376), 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(models)!: /model lists only models you can use now; a model that doesn\u0027t connect is refused and the current one stays (#2983)\u201D; \u201Cfix(models)!: only an explicit choice becomes the default; /model offers only models that answer (#2973)\u201D; \u201Cfix!: API review follow-up: defects, async storage, restored capabilities (#2845)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/catalog/connector.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/catalog/connector.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4ad134d092b17e8f740d546e8acf90ed3fb598cb187f6c5fb0600a038438ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rig-core/src/client/signed_in.rs: crates/rig-core/src/client/signed_in.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 7 (its worst body is SignedInModel::model 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(models)!: /model lists only models you can use now; a model that doesn\u0027t connect is refused and the current one stays (#2983)\u201D; \u201Cfix(models)!: only an explicit choice becomes the default; /model offers only models that answer (#2973)\u201D; \u201Cfix(http)!: an error keeps its retry class from where it was made (#2969)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/client/signed_in.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/rig-core/src/client/signed_in.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"036a35d2315b4d277f65b4f5556ed220255cc2b17933d62531bb5f2598bc80bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/rig-basics/src/telemetry/usage/status.rs: plugins/rig-basics/src/telemetry/usage/status.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 7 (its worst body is rig_basics::telemetry::usage::status::show_meter at line 33), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(harness)!: one current agent per session; a fork says what it copies (#2967)\u201D; \u201Cfix(agent)!: Esc keeps the partial reply, /compact keeps history, accurate summaries, ctx ? after compaction (#2918)\u201D; \u201Cfix(catalog, compaction): fit models\u0027 input limits with simpler overflow recovery (#2880)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:28 \u002B00:00\u0027 --until=\u00272026-11-13 23:19:28 \u002B00:00\u0027 --full-history --no-merges -- plugins/rig-basics/src/telemetry/usage/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":"plugins/rig-basics/src/telemetry/usage/status.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bf295101217effa77a91c5746e129f9eefc0e6d0bb576b495d3651a207ca2e"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 672 significant file(s) lose their only recent owner: crates/rig-agent/src/agent/engine/tests.rs, plugins/rig-basics/src/compaction/tests.rs, crates/rig-agent/src/agent/streaming/tests.rs, crates/rig-cassette/src/http/mod.rs, plugins/rig-basics/src/print/tests.rs, crates/rig-core/src/providers/anthropic/completion/tests.rs, crates/rig-sqlite/src/tests.rs, crates/rig-agent/src/run/tests.rs (\u002B664 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1a9476366df5063c1145db58832ed0e4b3fefd9c6f498a8c92273f8cbdcfcefa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! Todo tracker. The \u0060todo\u0060 tool keeps a todo list per agent ([\u0060Todos\u0060], saved with the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"corpus/base/src/todo_tracker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8a02c1a8845b0088f147726deff8d2733619677bd8d0704adf84429884fc36"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060crates/rig-cli/Cargo.toml\u0060 makes this repository a deployable product (line 16)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cli/Cargo.toml"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"353fc6c59ff99ef559974ab16616764f071cfff2a838993f613fdc1e49dc3d5c"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 11 of 61 project(s) overshoot their size bounds, lowering Project Cohesion to 6.4/10. The most over is \u0060crates/rig-core\u0060 (128127 LoC, 1004 module-visible types across 63 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08ad21fade7b0959853923c6c0a887bdcb4b7efe0ffe4199b89ae3d784bfea99"},"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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06bef7e90c26815861069854b1ab3ab17586991a0c13ab3b6344667ca77d29d5"},"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":"a6f110cfe61c2800353b79fd066a0233db556775b93f23b673a45a1ada9e0774"},"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":"f4d2a025dec9a8c179b31151c8348949f91aeb99b27b8cbdaf5c54d03702738a"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31cc3b9ea1a79d74ea230a4858dda9ff1246694654488bba4fa04b6d28166896"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"388c0085be4a7912bf8a48efe0a9cb1062a0e7e0331689b28f49cc03c5b6d0da"},"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":"b17e0186840c523ef6479fe056ba20ad4754f8324113926b9ee8d05a559eb9c1"},"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":"74959de1bc0e711b820adf0c1521867ff3d1328957a66dc2a0bfc7c33a463be5"},"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":"cd50f9beea6ba16777cd0caeac385424a769408463021112b9731bc343db84fb"},"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":"aa271cc7409afc41c02afd94e9e3b63da21c5a12be54c6d13656a7c317418d24"},"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":"e0f6ae36bfe929abcd42c004c54b3ff4a68664195a5a7a3b482bf0f2c6b8e99a"},"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":"cf260da2b989c3ee0454d6894eb06edb1197405becf60780de0f0c4a0a7dd417"},"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":"5db347a295c1cf615ab05b6fbbaaaf2239a6f47abb074a4add3d5438083f0bb6"},"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":"3143b3d476268879c3bd0662ae7241b48ee33665fce74ce9921e13a5a38605c4"},"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":"9a097c76dd92d92e58273db56cbb86f4ec61c030129f9653a7ef05cd08ebe862"},"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":"6e8c44c17bcb512fa3aa8707131542b968ce5ef6c93272e4fbfe921ff0b67944"},"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":"f5fab71e0976adc7f8af7e387c84d756a34eee7436feea8abf092eaecd969e65"},"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":"8b5b942625b2d7f466c0272e14506bf5fb128c5320a60aa1e60dd8b042a88549"},"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":"ff4b8d8f5924a15e67541371da3ca9c7dd904fc88372cdd52f2e063fa799ae74"},"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":"8c971cb215b8bb4f7c247845b9ceea732dd2d3cb729b02c143a185c66712d741"},"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":"caa21a7a45c2b053436203371a21a64afb4e7e2303e4fa6970f546d2d8abdfdc"},"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":"c9f74296c2c99b83ecf2ebf525a9b3329beda611ff9c0075a876cdcbafb08366"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-88","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":"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":"a46575fad58d0f2aa41e14e371878126eafbe0a62b2ad30d6657d748b9b90187"},"taxa":[{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"c7fd2e563a222d57ac101570c769816b9ec0eebf50f5e440d9ebd7d85bfe4384"},"properties":{"dependency":{"package":"ammonia","version":"4.1.4","advisory":"RUSTSEC-2021-0157","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2021-0158","RUSTSEC-2026-0373","RUSTSEC-2026-0533"],"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":"0faca7f2fd4d452df7cdd2521c4aa80642aa6ece744473b88a14cf842ced8452"},"properties":{"dependency":{"package":"astral-tokio-tar","version":"0.6.4","advisory":"RUSTSEC-2026-0440","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":"9d7e2f5e4e133844171b9412d83e460349b527553e21e4eb5d4f1e038ed6831f"},"properties":{"dependency":{"package":"atomic-polyfill","version":"1.0.3","advisory":"RUSTSEC-2023-0089","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":"797ec891dfd99b7619050a86882892acbf3f86688cb157c579039ad688d6ad76"},"properties":{"dependency":{"package":"backoff","version":"0.4.0","advisory":"RUSTSEC-2025-0012","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":"a45dbc2a20945fcde39dd5ab4dd4ab6aebf90400a095cd59335a923b7fae1a64"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","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":"3dedbe6b3d0cb46f3064a3500f4fd94c1310f73321c075e802c8ca0f2c136a6c"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","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":"904cd12f65d71ca63d739c739b4c100bf718e7d129ce5630aa4dba7fa6968b6e"},"properties":{"dependency":{"package":"bitmaps","version":"2.1.0","advisory":"RUSTSEC-2026-0247","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]","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":"cc4db900d7247116e90ac1f55322889d7c04a2f09430308fea72e799e9229468"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.5.5","advisory":"RUSTSEC-2026-0387","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","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":"80b5c22beae306eb623d7a60ec13361ab89285e1cc30fcf5b8daa2e87ffb5c69"},"properties":{"dependency":{"package":"h2","version":"0.4.15","advisory":"RUSTSEC-2026-0258","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a460069b86f1a2735babc8688e0411f97ac3343bf61746d845872d161c95683b"},"properties":{"dependency":{"package":"im-rc","version":"15.1.0","advisory":"RUSTSEC-2026-0250","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":"f48cf8c9f415048128045caa118a1e03769d0b4fe18d7f036c2f3766e3e8d8fb"},"properties":{"dependency":{"package":"instant","version":"0.1.13","advisory":"RUSTSEC-2024-0384","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.30.1","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"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":"705e8761c5e609601c0419d94a8bad1aeb6aee434f48ec4660c92e8bf534c9de"},"properties":{"dependency":{"package":"number_prefix","version":"0.4.0","advisory":"RUSTSEC-2025-0119","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46f49615124997a47ae03424c2b2e05e8f53b2ec644cd091de0dc203d46f11ac"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","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":"64363d74ce1f052fae524dc374bd082dc62972fb05982f1a96c21eb7c322e135"},"properties":{"dependency":{"package":"pulldown-cmark","version":"0.13.3","advisory":"RUSTSEC-2026-0414","aliases":["RUSTSEC-2026-0433"],"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.4","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"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":"ffba3a9076a73cf66b6daacb5914c478fbdc74d1383d8d2e4003b6bf3aa7b43d"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.16","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0341","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"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]"],"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":"f33134b914692cd6c5f119efdf542f3d6c34c918da971c9cc600e5d39c46efde"},"properties":{"dependency":{"package":"rkyv","version":"0.7.46","advisory":"RUSTSEC-2026-0235","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":"ac07f6d7edfd49261e66a0ecf670dc83aeb27f637d0eaec58b89ac41744f7835"},"properties":{"dependency":{"package":"rsa","version":"0.9.10","advisory":"RUSTSEC-2023-0071","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5524f25221308ec94b7206b58afaa59996104c20abaa242285d451f5344e44b"},"properties":{"dependency":{"package":"rustls-pemfile","version":"2.2.0","advisory":"RUSTSEC-2025-0134","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":"0d5eb3c9e63b1f4e713840f0a870cb4fc4b0eadec98bf720c40fb49b919ccd26"},"properties":{"dependency":{"package":"sized-chunks","version":"0.6.5","advisory":"RUSTSEC-2026-0251","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":"eb0001f1efbeb6758c9328ffac016bb7f7f69b0b96734f2fe260dcc9f13686c9"},"properties":{"dependency":{"package":"sized-chunks","version":"0.6.5","advisory":"RUSTSEC-2026-0255","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":"33f8956084465ecc5abb4ff929ac7b27ff49981833eef84e218962c0f58cdb0f"},"properties":{"dependency":{"package":"surrealdb-core","version":"3.3.5","advisory":"RUSTSEC-2026-0454","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e2e883ca754f334865470ceee513da1036b1d20dbcc1d943da2b82cea91929c7"},"properties":{"dependency":{"package":"term_size","version":"0.3.2","advisory":"RUSTSEC-2020-0163","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.3","advisory":"RUSTSEC-2026-0386","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":"c356dafc2d2f879539349393edf47ceccc3e0771bf15e4dae816abd8594fd25c"},"properties":{"dependency":{"package":"ttf-parser","version":"0.25.1","advisory":"RUSTSEC-2026-0192","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":"2b5cc6a78fe02a95b2f6755616011982ae866dcba8c2aeaae7b037f36ce19be5"},"properties":{"dependency":{"package":"unsafe-libyaml","version":"0.2.11","advisory":"RUSTSEC-2024-0449","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"],"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":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.13.3","advisory":"RUSTSEC-2026-0391","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":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0395","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":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0396","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":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0397","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":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0399","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":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0400","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":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0401","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":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0402","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":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0404","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":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0405","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":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0406","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":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"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":"84f9b61ffb7d87f7a0ea344424bcbd7389e2ed41eb01432b04fba9f732cd312c"},"properties":{"dependency":{"package":"zstd-sys","version":"2.0.16\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 1383 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 1383 of the 1592 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: crates/rig-vectorize/src/client/types.rs. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-vectorize/src/client/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33842cdd6430d2538a822b098d46eabda1be7ff11b4320d7b773f6ba5aef444d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 lib.rs: \u0060crates/rig-postgres/src/lib.rs\u0060 and \u0060crates/rig-scylladb/src/lib.rs\u0060 change together 69% of the time (9 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 9 shared commits counted here, the most recent 3 are \u0060bdd1d756\u0060 refactor(vector_store)!: tighten the VectorSearchRequest surface (#2683); \u0060f42a7665\u0060 refactor(vector-stores)!: drop forwarding layers in vector-store crat\u2026; \u006010ecfd80\u0060 fix: honour the WASM bounds in every vector store (#2545) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-postgres/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8186a22938419db208e215d49a820147e1772da97d720853353517888b16902a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 lib.rs: \u0060crates/rig-scylladb/src/lib.rs\u0060 and \u0060crates/rig-surrealdb/src/lib.rs\u0060 change together 69% of the time (9 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 9 shared commits counted here, the most recent 3 are \u0060bdd1d756\u0060 refactor(vector_store)!: tighten the VectorSearchRequest surface (#2683); \u0060f42a7665\u0060 refactor(vector-stores)!: drop forwarding layers in vector-store crat\u2026; \u006010ecfd80\u0060 fix: honour the WASM bounds in every vector store (#2545) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-scylladb/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19946d2973ef139746184ed73f3d50ca8b3f16d3e0c2fded27dd2e52f68ba929"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: lib.rs \u2192 lib.rs, lib.rs, lib.rs: \u0060crates/rig-mongodb/src/lib.rs\u0060 changes together with 3 other files \u2014 \u0060crates/rig-postgres/src/lib.rs\u0060, \u0060crates/rig-scylladb/src/lib.rs\u0060, \u0060crates/rig-surrealdb/src/lib.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/rig-mongodb/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b7995a263ab2344bab28a541dd9f7be1a3ef3e191196135b5120e128004073"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 streaming.rs: \u0060crates/rig-core/src/providers/copilot/mod.rs\u0060 and \u0060crates/rig-core/src/providers/openai/responses_api/streaming.rs\u0060 change together 50% of the time (9 of the 18 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 9 shared commits counted here, the most recent 3 are \u0060f885c206\u0060 refactor(telemetry): centralize completion span lifecycle (#2115); \u006073a39fcb\u0060 feat(openai): expose complete Responses reasoning metadata (#2112); \u006002b81bd8\u0060 feat(openai): support GPT-5.6 models and reasoning controls (#2106) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/copilot/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47503b5293d5f911b5180091330bc61244b86739a9489a7f8ea0f2d61c2d6c70"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 lib.rs: \u0060crates/rig-lancedb/src/lib.rs\u0060 and \u0060crates/rig-surrealdb/src/lib.rs\u0060 change together 50% of the time (7 of the 14 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 7 shared commits counted here, the most recent 3 are \u006010ecfd80\u0060 fix: honour the WASM bounds in every vector store (#2545); \u0060235e3838\u0060 refactor: ownership sweep round 4 \u2014 avoidable clones, dead public ite\u2026; \u00609b903e18\u0060 feat: improve vector store documentation and filter ergonomics (break\u2026 (at that commit the files were still \u0060rig-integrations/rig-lancedb/src/lib.rs\u0060 and \u0060rig-integrations/rig-surrealdb/src/lib.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-lancedb/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19a3d1409c963a4bed5370c2ef16590127714934250dbb49d803f14e8e028b7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 ollama.rs: \u0060crates/rig-core/src/providers/gemini/interactions_api/mod.rs\u0060 and \u0060crates/rig-core/src/providers/ollama.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 \u00607d30a176\u0060 refactor: share the tool-id spelling loop across request builders (#2\u2026; \u0060897e6275\u0060 refactor: consolidate provider schema/normalization and agent plumbin\u2026; \u00602c22e181\u0060 cleanup: post-Vec-migration precision and the pre-Vec serde accommoda\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/interactions_api/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef132a58d1d1b8065283a9828870870a972290dfbb9d761231fe6841bfc45a1"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Rust 1.97: rust-toolchain.toml declares Rust 1.97 as this project\u0027s toolchain file, and Rust 1.97, superseded by 1.98 on 2026-08-20 (the Rust project patches only the current stable). An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2026-08-20 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust-toolchain.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf7e9d4c69a9ce8ce9aef71946a22fd4bc9a108d597e8635468e94e0aa93368"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: content-security-policy: The live app\u0027s responses did not include content-security-policy (restricts the sources a page may load \u2014 mitigates XSS/injection). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b142e47096a32517bde0bb9b78f7e564119c7f87e22fba4dccc0d1e3645d74c5"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-embedder-policy: The live app\u0027s responses did not include cross-origin-embedder-policy (recommended by the OWASP Secure Headers Project (value: require-corp)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"153214bb9c80f7d66cba8eb6a7715e9609e84c3979c9b641cd6bedaa8be6930b"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-opener-policy: The live app\u0027s responses did not include cross-origin-opener-policy (recommended by the OWASP Secure Headers Project (value: same-origin)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8cdbe5cdec6a55c732bf9a9975c0e40f81ddfa4ad583a4a50bfb0895531607f7"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-resource-policy: The live app\u0027s responses did not include cross-origin-resource-policy (recommended by the OWASP Secure Headers Project (value: same-origin)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ba35c34991db9965777a53477c2d497c4c6606f78d133bbaa3bc99c71648c2a"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: permissions-policy: The live app\u0027s responses did not include permissions-policy (restricts powerful browser features (camera, geolocation, \u2026)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac8a111f0bb913829dc090833718dca5ab8e5fba7350f9dcf68f1971010745"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: referrer-policy: The live app\u0027s responses did not include referrer-policy (limits referrer leakage to third parties). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"364ee3f006b552b8fee33710a1fbfb0c4fac59e927af9c4396e51940d9069f01"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: strict-transport-security: The live app\u0027s responses did not include strict-transport-security (forces HTTPS on subsequent requests \u2014 mitigates downgrade/MITM). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"567d3eeb50a5678c0139a1d316c614c44cd4c4fb5db6fffa7795bc73d035966f"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-dns-prefetch-control: The live app\u0027s responses did not include x-dns-prefetch-control (recommended by the OWASP Secure Headers Project (value: off)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"50e54b8511264dd930857e4620bda8ba4053661b439218ed047812bcab0e3a44"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-frame-options: The live app\u0027s responses did not include x-frame-options (blocks clickjacking via framing (or use CSP frame-ancestors)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0e84499d19780ca121fad65e0f3bd2fc17b1268ce3079a5f40495749c54dc87e"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-permitted-cross-domain-policies: The live app\u0027s responses did not include x-permitted-cross-domain-policies (recommended by the OWASP Secure Headers Project (value: none)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"55366a3d9fb1c5952ebc54aab272eb775bf2c1b056d6d399652365c26cc2375b"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 2.4.2 reproducibly failed in a rendered surface: axe-core rule(s) document-title failed on: html. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a152f745c16f064aeb9932e5d52584f548c37c248ac45bacf96a1a6ffc2e49e7"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 3.1.1 reproducibly failed in a rendered surface: axe-core rule(s) html-has-lang failed on: html. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e2d0e1d2bf07ce04d82230fe7847e003479b78cd188efe60cc79686fb8ba8420"}},{"ruleId":"AXS1","level":"warning","message":{"text":"Runtime opened a port the repository does not declare: wd-runtime-app 32768-\u003E4317/tcp on 0.0.0.0: The booted stack published container port 4317/tcp of service \u0027wd-runtime-app\u0027 as host port 32768, but no ports:/expose:/EXPOSE entry in this repository names it \u2014 so it is most likely inherited from a base image. Observed after booting the stack in our sandbox, not read from a manifest. Advisory evidence for CRA Annex I (2)(j) (limit attack surfaces, including external interfaces); we do not assess whether the network it is published onto makes this a risk."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"de3da9ee463bfcfc2a8818d009135ec3a65163d0f22f81be8a7f801536355d1e"}},{"ruleId":"AXS1","level":"warning","message":{"text":"Runtime opened a port the repository does not declare: wd-runtime-app 32769-\u003E4318/tcp on 0.0.0.0: The booted stack published container port 4318/tcp of service \u0027wd-runtime-app\u0027 as host port 32769, but no ports:/expose:/EXPOSE entry in this repository names it \u2014 so it is most likely inherited from a base image. Observed after booting the stack in our sandbox, not read from a manifest. Advisory evidence for CRA Annex I (2)(j) (limit attack surfaces, including external interfaces); we do not assess whether the network it is published onto makes this a risk."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3f872c163fa18388b6935c0a4e3b25c5d06990232de8a5fc7abf89a820f4c80c"}},{"ruleId":"AXS1","level":"warning","message":{"text":"Runtime opened a port the repository does not declare: wd-runtime-app 32770-\u003E55679/tcp on 0.0.0.0: The booted stack published container port 55679/tcp of service \u0027wd-runtime-app\u0027 as host port 32770, but no ports:/expose:/EXPOSE entry in this repository names it \u2014 so it is most likely inherited from a base image. Observed after booting the stack in our sandbox, not read from a manifest. Advisory evidence for CRA Annex I (2)(j) (limit attack surfaces, including external interfaces); we do not assess whether the network it is published onto makes this a risk."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9681bbf80101907c341bd9673bc4c95dfb564e0db63f76dd7d051d0513c4a189"}},{"ruleId":"DM4","level":"error","message":{"text":"Anemic domain model: DeviceCodePrompt: \u0060DeviceCodePrompt\u0060 is a data-only domain entity with \u0060pub\u0060 mutable state and no invariant-enforcing behaviour of its own, while the repo holds the logic in a foreign service/manager/use-case \u2014 the anemic domain model. Move the behaviour onto the entity so it enforces its own invariants (or make it an immutable value object with private fields) rather than being driven from outside."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/internal/auth.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d59347d24e4d009e25bf5cf591bdaee095d6ab63c3d86a4f38a3b6063627642"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 2 public types in \u0060rig_agent.integrations.cli_chatbot\u0060 are marked as implementation by their own namespace, folder or name: \u0060ChatImpl\u0060 (crates/rig-agent/src/integrations/cli_chatbot.rs:52, name ends in \u0060Impl\u0060), \u0060AgentImpl\u0060 (crates/rig-agent/src/integrations/cli_chatbot.rs:57, name ends in \u0060Impl\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/integrations/cli_chatbot.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a58cc05a1519306d1b62a03fc36ad8191cfe712a454966c23e466a83d155fe"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 4 public types in \u0060rig_core.providers.internal.auth\u0060 are marked as implementation by their own namespace, folder or name: \u0060DeviceCodePrompt\u0060 (crates/rig-core/src/providers/internal/auth.rs:17, \u0060internal\u0060), \u0060DeviceCodeHandler\u0060 (crates/rig-core/src/providers/internal/auth.rs:33, \u0060internal\u0060), \u0060AuthError\u0060 (crates/rig-core/src/providers/internal/auth.rs:68, \u0060internal\u0060), \u0060AuthContext\u0060 (crates/rig-core/src/providers/internal/auth.rs:98, \u0060internal\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/internal/auth.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65eb0a113aef3c3ba28f904dee90e2c6bba73077bfe197e1fcaa9aac54536bf"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 5 public types in \u0060rig_core.providers.internal.auth.loopback\u0060 are marked as implementation by their own namespace, folder or name: \u0060LoopbackHost\u0060 (crates/rig-core/src/providers/internal/auth/loopback.rs:41, \u0060internal\u0060), \u0060LoopbackError\u0060 (crates/rig-core/src/providers/internal/auth/loopback.rs:51, \u0060internal\u0060), \u0060Loopback\u0060 (crates/rig-core/src/providers/internal/auth/loopback.rs:74, \u0060internal\u0060), \u0060Listener\u0060 (crates/rig-core/src/providers/internal/auth/loopback.rs:200, \u0060internal\u0060), \u0060Received\u0060 (crates/rig-core/src/providers/internal/auth/loopback.rs:228, \u0060internal\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/internal/auth/loopback.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fb760c0d276ff4fe538697e765a3cb558fc306583664c78a03d7e9aa34a1d6"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060rig_core.providers.internal\u0060 is marked as implementation by its own namespace, folder or name: \u0060LogTarget\u0060 (crates/rig-core/src/providers/internal/mod.rs:97, \u0060internal\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/rig-core/src/providers/internal/mod.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5494c103c58a9521a1ec3a93c97574ca22d188e27417466647c5e07a83ba471c"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060rig_core.providers.internal.wire_ids\u0060 is marked as implementation by its own namespace, folder or name: \u0060WireIds\u0060 (crates/rig-core/src/providers/internal/wire_ids.rs:16, \u0060internal\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/rig-core/src/providers/internal/wire_ids.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ab28b3d81aecd33db00b8fdb7cdd881abc030cfd478fa4dc138e46b70530f5"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 23/34 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060corpus/ct\u0060, \u0060corpus/library\u0060, \u0060corpus/rf-01\u0060, \u0060corpus/rf-06\u0060, \u0060corpus/rf-07\u0060 and 6 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch github-actions: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060github-actions\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed3d0d7c28467261d003a8cf6abc881841cc635e9d2324ab34b8ff58916f1fd"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060AgentBuilder::new(\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":"corpus/rf-01/src/main.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d28b20897cd90a8f00e3129953638812739fff747bdeafb41ed54240020467e"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060AgentBuilder::new(\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":"corpus/rf-06/src/lib.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e55c62ca511e4ade4409b73fbe671cc23f0503f44d5787f87e8f638066c1bc"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060AgentBuilder::new(\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/rig-agent/src/extractor.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9d519e5f81d6d9a4d25e25adebe5b18741e859c4b930074fad75daa7abffa5"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::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/rig-cassette/src/http/ledger.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b33ad505f380b50253e1505cb604309437831e13030a1139eb1e434cd8c88b4"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::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/rig-cassette/src/http/paths.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"94080ef3883a28334a818c89626c503939ee911b6bcf9d195b9fd48667e8370c"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::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/rig-cassette/src/http/proxy.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5b469f7c929b63b28e0d7a68ebac71e6d46d9ef74ed1681b96ab03c189bf72"}},{"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/rig-helixdb/src/lib.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79ea939e8a9d31771a413a0652077dc2e482c1c50487bf9152de8e43c48ce53"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\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/rig-milvus/src/lib.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"82941b0296c1c30a82583abbb888e7b731cba6fd479b2a85f6b6bf8204509573"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::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/rig-reqwest/src/lib.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1011e9522cece34cdbb7340c00da49c38089200769f0cdbcc88fe648465d9f5e"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::new()\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/rig-vectorize/src/client/mod.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21c1efd43f7e51a38a6578922eeb99825f6632bc4464bd8f4c92eeb3fc74c8e"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::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":"plugins/rig-claude-cloak/src/transport/live.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1ddef796e011ca9b2695a5610c9c7375cda23fcda908b04bd1317555a61b50"}},{"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/rig-cassette/src/http/mod.rs:1252)."},"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/rig-cassette/src/http/mod.rs:1252)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd19c680309417e132c0be93c2002123f0664b42afe6172b1319da65a6a57ba7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!state.trim().is_empty() \u0026\u0026 !state.trim_start().starts_with(\u0027Z\u0027)\u0060 appears character-identically in 2 files \u2014 crates/rig-cli/src/run/tests.rs, crates/rig-harness-protocol/src/tests.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/rig-cli/src/run/tests.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf24ff9cf42f916654649f7a1085f4861f96047efcbf2a962c0a7e04597bbb2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!text.is_empty() \u0026\u0026 !text.ends_with(\u0027\\n\u0027)\u0060 appears character-identically in 3 files \u2014 corpus/sn/src/notebook_cells/notebook.rs, corpus/sn/src/stray_file_cleanup.rs, crates/rig-harness/src/progress.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":"corpus/sn/src/notebook_cells/notebook.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7598a1bbd3295f63fc0a67a2bf76b94c75d8bbf68f9ef90f93c6151d0c0fdd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!world.resource::\u003CEnded\u003E().0.is_empty() \u0026\u0026 world.get::\u003CActiveTurn\u003E(agent).is_none()\u0060 appears character-identically in 2 files \u2014 corpus/base/src/todo_tracker/tests.rs, corpus/rf-03/src/todo/tests.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":"corpus/base/src/todo_tracker/tests.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"757b314b2d9c1d33666f244492d533fe44d00a08620defb004227eff4270d701"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060alive() \u0026\u0026 std::time::Instant::now() \u003C deadline\u0060 appears character-identically in 2 files \u2014 crates/rig-harness-protocol/src/tests.rs, crates/rig-harness/src/host/exit/tests.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/rig-harness-protocol/src/tests.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee533c2e20fd361d774b459b06f6b6b35f7b4499274ab3715e74fd049fc1fb8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060app.world().get::\u003COutcome\u003E(call).is_none() \u0026\u0026 started.elapsed() \u003C Duration::from_secs(5)\u0060 appears character-identically in 2 files \u2014 crates/rig-harness/src/per_call/tests.rs, plugins/rig-basics/src/preview/tests.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/rig-harness/src/per_call/tests.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a215759e07ebc72ba0ddb0fab3c929e9fed65e247140eb88b0f08f250e0ac62"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060before.is_empty() || before.ends_with(char::is_whitespace)\u0060 appears character-identically in 2 files \u2014 corpus/fh/src/mentions_and_images.rs, plugins/rig-tui/src/clipboard.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":"corpus/fh/src/mentions_and_images.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"6854078bd115a2d86eba146e4e5dcb90317609396516f23f5198e3803f6228f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.is_ascii_alphanumeric() || c == \u0027_\u0027 || c == \u0027-\u0027\u0060 appears character-identically in 2 files \u2014 crates/rig-core/src/providers/internal/wire_ids.rs, plugins/rig-mcp-client/src/config.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/rig-core/src/providers/internal/wire_ids.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a29c7bfa8feb6b4ff8b994fe8fc6e169fd0f29f4f9b8f3d18aaefd231f8c302"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003E 0 \u0026\u0026 (digits.len() - i).is_multiple_of(3)\u0060 appears character-identically in 2 files \u2014 corpus/base/src/output_truncate.rs, corpus/base/src/summarize_tool_output.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":"corpus/base/src/output_truncate.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32e42b78d232d221d5988d21a4a254a2d17b9d6242298ce67e8adaa390e041b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.split_once(\u0027:\u0027) \u0026\u0026 name.eq_ignore_ascii_case(\u0022content-length\u0022)\u0060 appears character-identically in 4 files \u2014 corpus/base/src/custom_provider/tests.rs, corpus/base/src/local_models/tests.rs, corpus/oc/src/opaque_reasoning/tests.rs, corpus/oc/src/rate_limit_status/tests.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":"corpus/base/src/custom_provider/tests.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ae3e88debc4c9110e1f5db38834b987c9e892e1e390e1600b4a7616b04ad3a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message.author.kind != AuthorKind::User || message.command().is_some()\u0060 appears character-identically in 3 files \u2014 corpus/base/src/check_after_turn.rs, corpus/base/src/review_agent.rs, corpus/sn/src/stray_file_cleanup.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":"corpus/base/src/check_after_turn.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"29198c06caa2b7a9487e955f46af2995ca83a8e2bde8239f61350c63a6db7340"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message.author.kind == AuthorKind::User \u0026\u0026 message.command().is_none()\u0060 appears character-identically in 3 files \u2014 corpus/ct/src/resume_subagent.rs, corpus/oc/src/away_recap.rs, corpus/oc/src/steer_and_queue.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":"corpus/ct/src/resume_subagent.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0ffb87fbe723611045b812fd121c1afe294fbd1bc4c1bd2399a5ae9032a011"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060model.request_count() == 4 \u0026\u0026 !world.entity(agent).contains::\u003CActiveTurn\u003E()\u0060 appears character-identically in 3 files \u2014 corpus/fh/src/lsp_tools/tests.rs, corpus/shared/src/plan_mode/tests.rs, plugins/rig-mcp-client/src/tests.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":"corpus/fh/src/lsp_tools/tests.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08eda9ab8344d603c5e1c8044c49e0b7dd3ba4e372637aa558695f2bc6e9493"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.is_empty() || name.contains(char::is_whitespace)\u0060 appears character-identically in 4 files \u2014 corpus/base/src/prompt_templates.rs, corpus/base/src/skills.rs, plugins/rig-basics/src/skills.rs, plugins/rig-mcp-client/src/approval.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":"corpus/base/src/prompt_templates.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d3da9a07764c14f92a5decbb841e3a00cd42fc004639a1b714c140765b0df7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060order.iter().all(Option::is_some) \u0026\u0026 order.is_sorted()\u0060 appears character-identically in 3 files \u2014 crates/rig-cli/src/plugin/tests.rs, crates/rig-ecs/src/restore/tests.rs, plugins/rig-basics/src/print/tests.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/rig-cli/src/plugin/tests.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b213759be253fad722efd6b8e2f6bbcafaaca9e23a572206ad212ff941917e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output.status.success() \u0026\u0026 stdout.contains(\u00221 passed\u0022)\u0060 appears character-identically in 2 files \u2014 crates/rig-tools/src/workspace/tests.rs, plugins/rig-claude-cloak/src/auth/tests.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/rig-tools/src/workspace/tests.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"394dc4397baa46f18e2f972709a158b2d0e6bbd1ada6149e6f2477fa2d17d6d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reasoning.redacted || reasoning.text.trim().is_empty()\u0060 appears character-identically in 5 files \u2014 crates/rig-bedrock/src/request.rs, crates/rig-core/src/completion/history.rs, crates/rig-core/src/providers/anthropic/completion.rs, crates/rig-core/src/providers/gemini/completion.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/rig-bedrock/src/request.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"d844f5e0513bec60d62687de1bc6b2664ccb33ac020717d1111ae5a5187598b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relative.ends_with(\u0022tests.rs\u0022) || relative.contains(\u0022/tests/\u0022)\u0060 appears character-identically in 2 files \u2014 xtask/src/verify/guards.rs, xtask/src/wires.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":"xtask/src/verify/guards.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b309316a19b68a2d739ecdbcf503d1bf362dd626205429c9a161f336ef5cf8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rest.is_empty() || rest.starts_with(char::is_whitespace)\u0060 appears character-identically in 2 files \u2014 corpus/base/src/handoff.rs, corpus/fh/src/side_question.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":"corpus/base/src/handoff.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a06ea62c379279a6b884ccdbb57df6e467de852575e0df6717265bfe32f395"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.message_started \u0026\u0026 event.fields.get(\u0022message\u0022).is_some_and(Value::is_object)\u0060 appears character-identically in 2 files \u2014 crates/rig-core/src/providers/anthropic/streaming.rs, crates/rig-core/src/providers/anthropic/streaming/document.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/rig-core/src/providers/anthropic/streaming.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b831c58aca8ab8914c1008686bdf141d4e133f8c1f9b00c30483d6f239747f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typed.author.kind != AuthorKind::User || typed.command().is_some()\u0060 appears character-identically in 2 files \u2014 corpus/fh/src/mentions_and_images.rs, corpus/oc/src/issue_references.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":"corpus/fh/src/mentions_and_images.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db30522b80134d83f3a100e2905566dd6ccf91fb6ba5bac457e04999bb9e002"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060watches.contains(change.watch) \u0026\u0026 change.event.names_files()\u0060 appears character-identically in 2 files \u2014 corpus/base/src/prompt_templates.rs, corpus/sp/src/output_styles.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":"corpus/base/src/prompt_templates.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"b007e5c0046c89f42ee5c1fb8c14770f4167f33f22938bb9802d0a989c1185b9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 266 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-vertexai/src/completion.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"580e9e4c0ea8104d4e88185c3eb33aff4d6969a8ccbbe23cb4ba8025d381402b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 174 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-vectorize/src/lib.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a9552846577cd6dae120e270495777e1e16b18eef1d6d24fa3796d79fd1e13"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\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: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-vectorize/src/client/mod.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"85937b8413bd460333adfc935a6ef8e9e9860f02643930387cb7481f9f1b89b7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 113 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-vectorize/src/client/mod.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fe97d7ae7d7f37bae6cf85d4b0c64b10e0482cf7b68327c37431448d3838f8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 583 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be 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/rig-sqlite/src/lib.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"10286cc83edab5ce57b70ea8191b5529ca2012896beb4fb31da79a2dfdb9471f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 637 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-sqlite/src/lib.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"e059d1119c256e3971ea1930462ae0239454589df4ea37f73c646c9986ad4866"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 687 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-sqlite/src/lib.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d0ea0373d608027617bde9cf67cc5a227ce7c57865c6459bf8e4db20e66f8c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2028 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-sqlite/src/lib.rs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d899cfde581b2e77334a444af6c5bd90f9011c6f26050eb92d8ed2c9e2217ec"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2063 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-sqlite/src/lib.rs"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"e998ecb71d7bb30040a54121592432ecd240c9c415a898d87a2af70bd341d9f8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2075 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-sqlite/src/lib.rs"},"region":{"startLine":2075}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc607e2fc81f30e4664aeabc24eaaaba812489103f18fce42b02a0c246e0f9a4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2081 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-sqlite/src/lib.rs"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e46f28470f51b4fedec1b998b515d9f79f301cb38aef6086e4370518c68df03"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2089 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-sqlite/src/lib.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8707705200a5023ddda2c954133ee6414316915b35c364de655c12c04cc3cd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2106 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-sqlite/src/lib.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9963a0f9f366a7726dfd953aad48ba3f448ba7fdf25dcdde269dadf93d01de"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 258 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \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/rig-rmcp/src/handler.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a0f803c3939e34f5ca77e457930075286a837c9e3ea6b8727883d099880f6d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\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: \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/rig-reqwest/src/lib.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1ae019ac77bc586f4c5978835032cc0d6b9be62ff870e337c620e71c0de3ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\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: \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/rig-neo4j/src/lib.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"14da76afa6576a286aaf1712386246ecb7d13d056c3f3b88a7b082212274c61a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 333 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \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/rig-neo4j/src/lib.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ff35df16998d1616f5a882389f6d0f6e6a5d501e6d94bc38e70cf12b08ad3e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\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: \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/rig-neo4j/src/lib.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a1fde6581452b7556d650f13799fb418ae57ed344b3d18e62249295dd27366"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 428 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be 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/rig-neo4j/src/lib.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"51300d5266c9fea10d689a9455c1a746a51357b00422198431f6b95315169c96"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 434 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-neo4j/src/lib.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e560ed52c817d8c4401599380d62fd1d79e29b32739d02ed6c06cd38f9c408"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 171 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-neo4j/src/vector_index.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a3f4f67bf25b7dc12c2533c199a4ba4f09f5ddbd909d4dab9907f4d9cd5533"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 237 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-mongodb/src/lib.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"673791ef652a8dccea746ec265cfe1380d07862d5efc5b79e3a8a7a40501e453"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 207 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be 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/rig-core/src/vector_store/in_memory_store.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"562eebaf86758345afbead61820462f23e487700d3873bf4899026809e925603"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 270 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be 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/rig-core/src/providers/openai/wire/chat.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b781407bcd3e8569ab917550526d63c8998350c7702ae86a20e52eb212152f3a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 111 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \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/rig-core/src/providers/internal/mod.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6150e19e991a1f0c22c6ed3a8070cb1274ac3feccdaaba4909ffcf4afcbb31c3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 100 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be 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/rig-core/src/providers/gemini/embedding.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdae9934364520bbb1efef45afd378aa881599620ffc7e946d5878544839c5ef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 68 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \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/rig-core/src/providers/gemini/transcription.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f3f225fdfa8a205cd54e346b2b3cd02ceb4535093604fa3aeb7860f50975ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 551 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be 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/rig-core/src/completion/options/merge.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"da95c8d9c24257c863469702d783375bee5493c1f86a951addfc1c00b93da059"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 716 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be 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/rig-core/src/completion/options/merge.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3db66f71963a1934b432c2c8b4efc853ca23c82b9f926532b908606014e4fd1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 604 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be 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/rig-cassette/src/traffic.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"718449acd1c8900ac338b44de38dbe4d94f77eddcd7bb6e17fa1bd6d21381ba3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 631 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be 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/rig-agent/src/tool/server.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed878a8950c650e74c9cba8ce4a5857e42b99a81dca65709194c61c9e4dabda"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\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: \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/rig-agent/src/integrations/cli_chatbot.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fb3d4321c48bb2944b3281aadb1aa8d3c34c7dc7f3784f9bb7ec11ea3ae10f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\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: \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/rig-agent/src/agent/engine.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ef3da062619315576d28f1e229f5c4c68b915b5b7164d6e5439c5bbf131720"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 166 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/agent/typed.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7da7744f518e59130a6353bcd419ba3c6e54bd1f19f8ec79b2caf7d3d5982f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 192 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be 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/rig-agent/src/agent/typed.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ef0ad2b2c2173904ce3ae57d404730213aa6b2a90ecca6b7aaaaa6b12f055f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060read_matches\u0060 returns \u0060False\u0060 when \u0060(ValueError, OSError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/rig-claude-cloak/tests/acceptance/audit.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6b27dd0c41cb041d6e9c37806a988be0d99ab10284511a134a3efcf632692e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060nested_files\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":"corpus/base/src/nested_context.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27256187926c6f8b01aa71e4dfafb40b5f1c3e36bdfa821dba9096738a60763"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060scan\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":"corpus/ct/src/process_reaper/procfs.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d989757e6142d61b429ffb64d1eed3085d481fb9d4c61bb0ed67ddf0b5e7c85"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060removed_replies\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":"corpus/ct/src/reply_review_comments.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc5a57daf5fb4ae1b9f251fd2a129835fda58814fc3cc3d83e9cc422f1a1ee4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read\u0060 turns every \u0060Err\u0060 into \u0060Ok(Self::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":"corpus/fh/src/encrypted_sessions.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8043cbe9891185bb07414df5df30bbde825419d0bf22912c476a376a47f1090e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sessions\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":"corpus/fh/src/encrypted_sessions/reseal.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d1d511425450430f76ee0a4461d867ef750a0a44ee7d263def147eef81543b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060session_files\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":"corpus/fh/src/import_sessions.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"db78043751e6939089102d387750ce970319649603da0fc438ffeabfdf85a744"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060changes\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":"corpus/oc/src/git_delta_context.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"c863e94e3792bfda0547fa3e3247cc992e594257da58c4ae8f0af0019aeb25ec"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060csi\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":"corpus/sn/src/terminal_sessions/screen.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84aa16c10646f85e1fe5d6a9d2440baafee0329eb4d39281a87c4456a44ea56"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060bytes_under\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":"corpus/sn/src/sessions_prune_cli.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb788ab2889d46e5e1e2d200c87469663e5855c6af2f76a8748efe7550b06070"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060in_session\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":"corpus/sn/src/terminal_sessions/pty.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f21722db41ec6aa1371c06d478d9ae0996d5fb2322ec5f59426455b10d4239"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060outstanding\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/rig-cassette/src/http/ledger.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"147bfe9e09803de79801fa257878293f8a94b48afdcc3adfb0cb0ec38ac2b4ea"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060legacy_warnings\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/rig-cli/src/run.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a51b5bce7181ed9ff8ddfba1b0c89c637365b255f51a61a3d476d167aff003"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060render\u0060 turns every \u0060Err\u0060 into \u0060\u0022\u003Cstructured tool output\u003E\u0022.to_string()\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/rig-core/src/tool/output.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23a570d4ecb6305733bf659f6baf5cc9b7df6945f9cf8726a511690d6d2ab21"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read\u0060 turns every \u0060Err\u0060 into \u0060Some(Self::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/rig-tools/src/fs.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed166cf69d460486fc9461448b7fb5b85a9e489603c282971aebcfb56d88eec9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060update\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/rig-tools/src/watch.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12ef63e229a598f60a4817fcc6b2f3e8203e9b02ec7a9b0dc45e0743d64c3eb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060of\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":"plugins/rig-acp/src/session/options.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"256f05c2863fbf71f5521836d123eabca5a25f4ab24a19f9c71ae61e1d4b8fb7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060serve\u0060 turns every \u0060Err\u0060 into \u0060Ok(acp::CloseSessionResponse::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":"plugins/rig-acp/src/router.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"436722d865a674037dbe21b6435944487be31d8f7fa7d0ba76afd3f1198c38a8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060open\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":"plugins/rig-basics/src/subagents/lifecycle.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"baee777b7cfaa256b1572b387cb8ca56b2a3995ad50c2239015b712402ff4489"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060askers\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":"plugins/rig-basics/src/subagents/lifecycle.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a347759432977b28d0e988699f3c8b00b4b2f6bbf1ac374eb30fde62ec5e89"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060text\u0060 turns every \u0060Err\u0060 into \u0060String::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":"plugins/rig-steel/src/program.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc37174b831408b03aeff38b63a0d59e354ded1f84af2c57dd9bc09cf0037ffe"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060of_terminal\u0060 turns every \u0060Err\u0060 into \u0060Self::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":"plugins/rig-tui/src/theme.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f8fdca0cb560952730b1e31e1b1cd6bb778c926cc529359eb1b2d32648b608"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run\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":"xtask/src/verify/preflight.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdef7d05504e61327ffb98c15a487c26700b34558abbbc6cd6a5014377b6a5e"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-88","guid":"32dec161-013d-ac58-8599-1309e12e67f5","name":"Improper Neutralization of Argument Delimiters in a Command (\u0027Argument Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Argument Delimiters in a Command (\u0027Argument Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/88.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-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"}]}],"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":71,"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."]}]}