{"$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":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"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"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"id":"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"]}],"properties":{"cwe":["CWE-506"]}},{"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"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":"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":"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":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"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":"StreamingTurnSource::run_model_turn (cyclomatic 42): StreamingTurnSource::run_model_turn has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/agent/engine.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"3146dd3c4eac496843d9890824f79b5bb21fb3e7fe2605acadbba26b41d582f8"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::verify::selection::plan (cyclomatic 41): xtask::verify::selection::plan 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":"xtask/src/verify/selection.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f359b3ff3535e7968df9ee9bae6f1763855b1ed2d36e9284a94dde9ec8ec778a"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_cassette::ecs::delivery::collect_replayed (cyclomatic 37): rig_cassette::ecs::delivery::collect_replayed has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/ecs/delivery.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40fd3b855bf30b9181b1510791afb2f59eedd4dbeede200bd4982e5449a83f1"}},{"ruleId":"D1","level":"warning","message":{"text":"ReplayDelivery::new (cyclomatic 35): ReplayDelivery::new has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/ecs/delivery.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c6dfdb18ab21ee68bb6412d20e7f66c15c0b7696a3c6d8ba0e782d7c4422ed"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::providers::anthropic::completion::transform_strict_tool_schema (cyclomatic 31): rig_core::providers::anthropic::completion::transform_strict_tool_schema has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9703e6b9fdc6fde9a895499eb1689fc0ab833af04859a1f12d10f2e63e93b1"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_ecs::bus::collect::collect_streams (cyclomatic 30): rig_ecs::bus::collect::collect_streams 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-ecs/src/bus/collect.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"546b8b2046272d8a28dcd62f763921a389d3429ee93e1a1c5f500a627b418047"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_agent::agent::engine::drive_agent (cyclomatic 29): rig_agent::agent::engine::drive_agent 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/agent/engine.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bd417caa57bf4cec84caae54f93cdd31163a0c18ee22ce9d737dcee186379a"}},{"ruleId":"D1","level":"warning","message":{"text":"MessagesDecoder::interpret_content (cyclomatic 29): MessagesDecoder::interpret_content 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/providers/anthropic/streaming.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52560e0d24e68c8de0bb90a475b5f4da92243476e4922da8589cfeb02c788ab"}},{"ruleId":"D1","level":"warning","message":{"text":"UserContent::try_from (cyclomatic 29): UserContent::try_from has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/completion/mod.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c30f29e3f298c3a0a2680e974b8b4b1b0bc717c22075695bf2ce08aaa9417b0"}},{"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":"BusDriver::serve (cyclomatic 28): BusDriver::serve 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-agent/src/bus/driver.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f51165dba3b028260ad6830fa7f14f3e348076aff8fd2e71400fe9ef6e2d9c"}},{"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_candle::protocol::render_qwen_message (cyclomatic 27): rig_candle::protocol::render_qwen_message has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/protocol.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc00d82b859c21c00a39ac36b43657a11c0c659a8986635f58c3b8c307bdfce"}},{"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":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"453f38b3dce43cfe3f620dc6ce6750d7dccf6a887b355b5f7636517fde7ee33d"}},{"ruleId":"D1","level":"warning","message":{"text":"File::compare (cyclomatic 25): File::compare 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":"xtask/src/cassette/audit.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"0106a31c866f3ad5cd9b2008abfd9ad1d35a0aefdfa9202c6978662b436ba4e0"}},{"ruleId":"D1","level":"warning","message":{"text":"Content::try_from (cyclomatic 24): Content::try_from has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-vertexai/src/types/message.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02275da1310e975a1735fe1476704aa840d8630de349cdc416ebcf2ed17c406"}},{"ruleId":"D1","level":"warning","message":{"text":"Part::try_from (cyclomatic 24): Part::try_from has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/completion.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be566d79c64685d820e59a277d8c8cba1484fd73a448cba44de612d52f1e428"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::providers::openai::responses_api::input_items (cyclomatic 24): rig_core::providers::openai::responses_api::input_items has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/responses_api/mod.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4d924eaad7975dda97b833bd18b145d29edb45b32ea8848728818736350a71"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_ecs::checkpoint::validate (cyclomatic 24): rig_ecs::checkpoint::validate 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/checkpoint.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd80ea78803295598efe94021dcbf10836b9c122c893f6429cfdde16c1f7439"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_cassette::ecs::delivery::deliver_stream (cyclomatic 23): rig_cassette::ecs::delivery::deliver_stream 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-cassette/src/ecs/delivery.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"630b1a1c8298e0903ac139f204d2491cf18f23e2def8542a493be1f6efcb7a88"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionRequest::try_from (cyclomatic 23): CompletionRequest::try_from 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/openai/completion/mod.rs"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"f037dc86d2e858f229de6e1eda863f79ba06952fcf0945e83b817e57ec7fb535"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::driver::read (cyclomatic 23): rig_core::driver::read has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/driver.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"0211c972a30d93df0064a2fb0a6c75a8bdf5f3f2ad2664b6f6a1926acbfdb30f"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_agent::agent::engine::drive_tool_calls (cyclomatic 22): rig_agent::agent::engine::drive_tool_calls 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-agent/src/agent/engine.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d52a83b8b595835e9e9f9c88983f685d872937042109b487b3dfb59cd8fc63"}},{"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":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef5f4a3642eaaee0d004145fffd50ca88ac24ac737e35bb166fa2dc6f061468"}},{"ruleId":"D1","level":"warning","message":{"text":"Message::from_message (cyclomatic 22): Message::from_message 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-core/src/providers/anthropic/completion.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8fddfea13ed5e85f514bc7cf13b9b868d0234aa439427e003de0c36d56a2f8"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_derive::tool::expand::expand_rig_tool (cyclomatic 22): rig_derive::tool::expand::expand_rig_tool 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-derive/src/tool/expand.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"54feee0b857f4d3697a2df9925ffae355f1c18278c57a556c815fb82052d8af0"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_ecs::bus::dispatch::dispatch (cyclomatic 22): rig_ecs::bus::dispatch::dispatch 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-ecs/src/bus/dispatch.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61c6bee08613b1525e08351082bd24c41f8a6f172f06b956b307254d0f990fc"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::verify::preflight::run (cyclomatic 22): xtask::verify::preflight::run has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/verify/preflight.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2306774caeaad01114784362d10f943ebb0e0915c6be9980795ab6f020062ec9"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentRun::next_step (cyclomatic 21): AgentRun::next_step 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-agent/src/run/mod.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"79232272ecf4b61b534755c6b0a1c38046e28e07461cb7a5ca75ef56aa56584b"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamState::process_event (cyclomatic 21): StreamState::process_event 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-bedrock/src/streaming.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b084ea14f6fabbd42b0ad07c946623a08dd54c16d8b51a6a15e82f20e4fce5e"}},{"ruleId":"D1","level":"warning","message":{"text":"InteractionsDecoder::decode (cyclomatic 21): InteractionsDecoder::decode 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/gemini/interactions_api/streaming.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f5896df6faa81812663de07d40ce5f7c6dca168c0f1e1486fc6f330059f904"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionRequest::try_from (cyclomatic 21): CompletionRequest::try_from has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/responses_api/mod.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cb0901ff80b0f91e59eaf7ddbabc64ccdd348f59f42db2e575c1ae8962d831"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_vertexai::types::completion_request::vertex_generation_config (cyclomatic 21): rig_vertexai::types::completion_request::vertex_generation_config has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-vertexai/src/types/completion_request.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"149b8aff143f534980f5177930b038b5fb1e07cfa3ea6716bf80267a7b38c5fe"}},{"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":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbc355738e7d69720631cadf71c688a22fd9f82d57f5154bcfcc5d441ed0df5"}},{"ruleId":"D1","level":"warning","message":{"text":"Reply::observed (cyclomatic 20): Reply::observed 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/serve/handler.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1751bb403a2db43dfedecf895046bb26f63d1509481583f17159e6d5e0f8dce"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_ecs::systems::land_batch (cyclomatic 20): rig_ecs::systems::land_batch 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-ecs/src/systems/mod.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c9db81bb6e2b3f87cb4292f296dac2cf8a422886925e8aac968b1f0ce085cd"}},{"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":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"539334f33eb1c68f80c28d0f8513c677d39d96ff748ab0b0ab3f3a652e5f40b8"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_cassette::ecs::identity::required_row (cyclomatic 19): rig_cassette::ecs::identity::required_row 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-cassette/src/ecs/identity.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83d038cd96fdb74cda626c3c8fb9619be54a43a78e3ee863fe343dcb3366bca"}},{"ruleId":"D1","level":"warning","message":{"text":"Caching::send (cyclomatic 19): Caching::send has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/client/gemini_caching.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff63e55997397592b04b8bab55bf1e3cccea2207458a32cceea4e78672d8828"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::providers::gemini::completion::create_request_body (cyclomatic 19): rig_core::providers::gemini::completion::create_request_body has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/completion.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d233b4e878be198ef71082cce60232f1059add174dad4182f04a03bf9279a6"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_tungstenite::connection::run_actor (cyclomatic 19): rig_tungstenite::connection::run_actor 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-tungstenite/src/connection.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b185228d280d2ebf102fe36b34b76b149481c8b02c9f8ff1a62e3094735f3b5e"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::verify::execute::internal (cyclomatic 19): xtask::verify::execute::internal 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":"xtask/src/verify/execute.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0aad30237eba626a92ab9aff250b180d5b06f10f32b481adc38735de81f48ef"}},{"ruleId":"D1","level":"warning","message":{"text":"RigAssistantContent::into_content_block (cyclomatic 18): RigAssistantContent::into_content_block has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-bedrock/src/types/assistant_content.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8ac177da97ffa8aa3bd2b50362314ad6f564f63ffae86bbb1e5917c3737262"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerateContentDecoder::decode (cyclomatic 18): GenerateContentDecoder::decode 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/providers/gemini/streaming.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59595b817ff48a1ed8622eab98b71ed270b3050d37c5a30d0a7c6cac7d7ca5a"}},{"ruleId":"D1","level":"warning","message":{"text":"EffectStream::poll_next (cyclomatic 17): EffectStream::poll_next 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-agent/src/bus/dispatcher.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5cc7e1b66a403542236fd3387a888827e7776f632b0ea3fb6aa5a1faa5eff9"}},{"ruleId":"D1","level":"warning","message":{"text":"Buffered::poll (cyclomatic 17): Buffered::poll 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-cassette/src/ecs/delivery.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b662a77275b94e8f27b70923c2c6253bb00d90666067c2a531a78bd02ee109f"}},{"ruleId":"D1","level":"warning","message":{"text":"HttpExchange::streaming (cyclomatic 17): HttpExchange::streaming 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/driver/http_transport.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"27119269b8c42894f93b9566e88de6e132e73853da44e3089bbb91aa49ba5d40"}},{"ruleId":"D1","level":"warning","message":{"text":"Step::split (cyclomatic 17): Step::split 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/gemini/interactions_api/mod.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"df01615ed1a24785e99838ca62e9ca76cb2891d20c1dcb69f9164d674c71c16a"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_ecs::systems::stream_invalid::discover_streamed_invalid_calls (cyclomatic 17): rig_ecs::systems::stream_invalid::discover_streamed_invalid_calls has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/systems/stream_invalid.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb3415131d3ba0ef326d386e93b8f73338cc345818b5bcfbee23384f4f6d90e"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_ecs::systems::attach_retrieved (cyclomatic 17): rig_ecs::systems::attach_retrieved 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-ecs/src/systems/mod.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4c9de4f28d4b6c20303ec496cc32a9fe846c1f7816a14ef71ec74d8f0dff13"}},{"ruleId":"D1","level":"warning","message":{"text":"File::header (cyclomatic 17): File::header 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":"xtask/src/cassette/audit.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ccae1e74746a36a7265ea28f19ad56028549acdef301aae96f89026bc9207d"}},{"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":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e3b1e32a40a72b80b8cd9a5926041cc04907d7b9c0bdc7aaff73079b0f99dc"}},{"ruleId":"D1","level":"warning","message":{"text":"UnaryTurnSource::run_model_turn (cyclomatic 16): UnaryTurnSource::run_model_turn 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-agent/src/agent/engine.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a221a4b92d22f4c347f185c69ca6eb1fe19fd02f19ef18bdc2e875f2a383de1"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_candle::protocol::validate_protocol_inputs (cyclomatic 16): rig_candle::protocol::validate_protocol_inputs has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/protocol.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d22eeabc0ba7de9300e7209951b032a17ef059d5a5089b96bc5a3e65cd64f3"}},{"ruleId":"D1","level":"warning","message":{"text":"Content::try_from (cyclomatic 16): Content::try_from 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/gemini/interactions_api/mod.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"4933d8b388d1c07526a91cd42915ae79ac332819058850de952a2ffb7c767e4c"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerateContentDecoder::interpret_part (cyclomatic 16): GenerateContentDecoder::interpret_part 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/gemini/streaming.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"797b2bd6e1ed97ee58e952a882b7b5dbbc3c2c180144b3ab61fe1529b418d962"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_core::providers::openai::completion::sanitize_plain_text_history (cyclomatic 16): rig_core::providers::openai::completion::sanitize_plain_text_history 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/completion/mod.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9609650d3de6db3078e3a3b056c118390fdd5f7f3150ac465439215e35c185"}},{"ruleId":"D1","level":"warning","message":{"text":"rig_ecs::agent::checkpoint::validate (cyclomatic 16): rig_ecs::agent::checkpoint::validate has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/agent/checkpoint.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"43687a09f684d06887bbf3d75e5baea1af5b81552cab7ba04bc714ba209ba231"}},{"ruleId":"D1","level":"warning","message":{"text":"xtask::cassette::goldens::inserted_per_batch (cyclomatic 16): xtask::cassette::goldens::inserted_per_batch 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/cassette/goldens.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6c28f80c29a89964ddfb45ae470b74dfb079704b39df78f0b3da3b3f6e7f8b"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamingTurnSource::run_model_turn (cognitive 106): StreamingTurnSource::run_model_turn has cognitive complexity 106 (threshold 15). Drivers by points: match/switch 15 (49 pts), if/else 14 (47 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 71). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f326868871af950486bc7efb3385b861417f75dcc50fd83e3c2283bbe547536"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::bus::collect::collect_streams (cognitive 87): rig_ecs::bus::collect::collect_streams has cognitive complexity 87 (threshold 15). Drivers by points: if/else 18 (61 pts), match/switch 5 (21 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/bus/collect.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e7606bcfc994c503a7a5b130ac733b36119d96b398e17133eeddf948213ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::verify::selection::plan (cognitive 75): xtask::verify::selection::plan has cognitive complexity 75 (threshold 15). Drivers by points: if/else 26 (56 pts), boolean chains 11, loops 4 (8 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/verify/selection.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d783aaad9cc91b72128bd19620094b8d5bd355b2a8f1ebc2a60cd703212975"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_candle::protocol::render_qwen_message (cognitive 65): rig_candle::protocol::render_qwen_message has cognitive complexity 65 (threshold 15). Drivers by points: if/else 12 (41 pts), match/switch 4 (12 pts), loops 3 (8 pts), boolean chains 4 (nesting depth added 42). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/protocol.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"62511a782be19529eb42438084e2c5294658d98b98eef6e0bb863b6d9b775cbc"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cassette::ecs::delivery::collect_replayed (cognitive 65): rig_cassette::ecs::delivery::collect_replayed has cognitive complexity 65 (threshold 15). Drivers by points: if/else 23 (51 pts), match/switch 4 (9 pts), loops 4, boolean chains 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/ecs/delivery.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb152bea00a1b04d60f2d9215d20f9f0434cade037a73395c25eff470dd6b66"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplayDelivery::new (cognitive 57): ReplayDelivery::new has cognitive complexity 57 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 15, match/switch 2 (6 pts), loops 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/ecs/delivery.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88509d997d67482f24fbe99a88aa82028b9c4953cabe92862fdc164712af9f8"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_agent::agent::engine::drive_agent (cognitive 56): rig_agent::agent::engine::drive_agent has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (30 pts), match/switch 9 (22 pts), loops 3, boolean chains 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/agent/engine.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"7649cd63e66cce85263f7e92528871a15a7f6a27c7b9de0276661831de29e4e5"}},{"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":"Content::try_from (cognitive 53): Content::try_from has cognitive complexity 53 (threshold 15). Drivers by points: if/else 6 (22 pts), match/switch 9 (20 pts), loops 3 (11 pts) (nesting depth added 35). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-vertexai/src/types/message.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9d085c284276b6210f3047c6fa493d4e20e8d1c9c0295e14282b2e155795f7"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::bus::dispatch::dispatch (cognitive 52): rig_ecs::bus::dispatch::dispatch has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (47 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/bus/dispatch.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e999c5bf06a303c030db16ed39c441aea694606dd4275bbc704082c604944df"}},{"ruleId":"D2","level":"warning","message":{"text":"MessagesDecoder::interpret_content (cognitive 47): MessagesDecoder::interpret_content has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (42 pts), match/switch 3 (5 pts) (nesting depth added 27). 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.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15e8d209df752d36a313fe510b6e73b8dd99a14b271f7472831bbe1a11ba661"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::verify::preflight::run (cognitive 45): xtask::verify::preflight::run has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (33 pts), match/switch 3 (7 pts), loops 3 (4 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":"xtask/src/verify/preflight.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba47393843a7cfa29db77b52ad30cef1ff08ee83c25d1c566568330535c25fe"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cassette::ecs::delivery::deliver_stream (cognitive 44): rig_cassette::ecs::delivery::deliver_stream has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (32 pts), match/switch 2 (7 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/ecs/delivery.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9761b149e0ba298007e44e443731622d07f8d3f181595c43b2e5e036d755da2"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionRequest::try_from (cognitive 43): CompletionRequest::try_from has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 5, 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":"crates/rig-core/src/providers/openai/completion/mod.rs"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa26416ecd44587f7dc649bd4171f8d8c96dbcd331dd0316129e86a268d46d94"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::anthropic::completion::transform_strict_tool_schema (cognitive 43): rig_core::providers::anthropic::completion::transform_strict_tool_schema has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (28 pts), match/switch 5 (10 pts), boolean chains 3, loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"971c69374cb8fbf1d030e895ec8cd3c74c91bd4c9c9242e7ecfe5aca1ef00822"}},{"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":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"de869eb52132b67774e2b778b223927b15d8c4f29cca48d0dc436f63db66e13c"}},{"ruleId":"D2","level":"warning","message":{"text":"BusDriver::serve (cognitive 42): BusDriver::serve has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (31 pts), match/switch 4 (6 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/bus/driver.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c2d878b5944d6863edb4d81de2ae9e16eb5e4f89c2794ac9ed70f204031c09"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::openai::responses_api::input_items (cognitive 42): rig_core::providers::openai::responses_api::input_items has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 7 (20 pts), if/else 4 (18 pts), loops 2 (4 pts) (nesting depth added 29). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/responses_api/mod.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0e6781b6373023feab8afc83d6730f0f2b95d5d9c4bfbea90e69a482f9f4ce"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::systems::stream_invalid::discover_streamed_invalid_calls (cognitive 41): rig_ecs::systems::stream_invalid::discover_streamed_invalid_calls has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 4 (11 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/systems/stream_invalid.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"983163f5ae0548a9a8c57698b64ba0c252babd9614e69ed4a440aa89b42aa598"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::systems::land_batch (cognitive 39): rig_ecs::systems::land_batch has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 4 (9 pts), loops 3 (6 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":"crates/rig-ecs/src/systems/mod.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"06994e45ef9b24bda5a947e7ffa17dde7cf96c8e412f1bb4197df5fe20019ece"}},{"ruleId":"D2","level":"warning","message":{"text":"MacroArgs::parse (cognitive 38): MacroArgs::parse has cognitive complexity 38 (threshold 15). Drivers by points: if/else 5 (21 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":"rig_ecs::checkpoint::validate (cognitive 38): rig_ecs::checkpoint::validate has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 9, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/checkpoint.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a16e0378f26c125bafeed06e9c12f13338d383331911cd67ebde0091530efe4"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_tungstenite::connection::run_actor (cognitive 37): rig_tungstenite::connection::run_actor has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 6 (18 pts), if/else 6 (16 pts), boolean chains 2, loops 1 (nesting depth added 22). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-tungstenite/src/connection.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f346dfcbbac56c3ed18a8f847a690021e324eea86209cf2025b322a49dcf77e0"}},{"ruleId":"D2","level":"warning","message":{"text":"File::compare (cognitive 37): File::compare has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 9, loops 2 (4 pts), match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/cassette/audit.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"f105affb4a24d3e2ec360a3fd028f852080843e8b6fb206d7bf34eac030b1b13"}},{"ruleId":"D2","level":"warning","message":{"text":"EffectLogReplayer::serve (cognitive 36): EffectLogReplayer::serve has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (22 pts), match/switch 4 (8 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 23). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/effect_log/replay.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee62beb2a44c3183845ec2b8de65e2c3e20dc99e9eb8b6466ca924c1b636bfe"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_agent::agent::engine::drive_tool_calls (cognitive 35): rig_agent::agent::engine::drive_tool_calls has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 4 (8 pts), loops 4, boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/agent/engine.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9970bc834d4d146b8188fe70b97510ff4bdbc72d191421d8703f3735e71759"}},{"ruleId":"D2","level":"warning","message":{"text":"Reply::observed (cognitive 35): Reply::observed has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 2, match/switch 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/serve/handler.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"14be4e7471dd3b002d7e856b882c453f30844ed7a1f597e25cc2dc5a8493d2ea"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::gemini::interactions_api::interactions_api_types::pair_exchanges (cognitive 35): rig_core::providers::gemini::interactions_api::interactions_api_types::pair_exchanges has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (27 pts), match/switch 2 (7 pts), loops 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/interactions_api/mod.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"7413cffdf7a3798ce164ef58176f562102d2bf5749224d0db02237b256539c94"}},{"ruleId":"D2","level":"warning","message":{"text":"RigAssistantContent::into_content_block (cognitive 34): RigAssistantContent::into_content_block has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-bedrock/src/types/assistant_content.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"1766f0d2f174c2d6d9ee32f3ec9fb0180a94f08b59047ea2605b021344769dda"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::driver::read (cognitive 34): rig_core::driver::read has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 8 (14 pts), boolean chains 4, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/driver.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ce9a269bce52d54f4f603d390b1d515b56616a4d803bbc18ac7efb07a0c287"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_derive::tool::expand::expand_rig_tool (cognitive 34): rig_derive::tool::expand::expand_rig_tool has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 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":"AgentRun::next_step (cognitive 33): AgentRun::next_step has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 4 (8 pts), boolean chains 4 (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-agent/src/run/mod.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"deab037e097d4fc92de03dff48090aaf30468948993b6a6340b04c4384c17cf6"}},{"ruleId":"D2","level":"warning","message":{"text":"Part::try_from (cognitive 33): Part::try_from has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 5 (13 pts), loops 1 (2 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/completion.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"4101d24953c8fc2d6494542d1a5cc848bce19288d7e339b2bcc255455ad676be"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractionsDecoder::decode (cognitive 33): InteractionsDecoder::decode has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 3 (7 pts), match/switch 3 (4 pts), boolean chains 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":"crates/rig-core/src/providers/gemini/interactions_api/streaming.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5ff897ceec2df0c7d8b131b709325fc671b6f8682a721eebc8d26b7e7b6824"}},{"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":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bfa1ad9b3fb03400600046717618401a8d64fa5b8bceaa4128d7b70a792865"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cassette::http::relay::advance_body (cognitive 31): rig_cassette::http::relay::advance_body has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (25 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/http/relay.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f215db2badd6043fb3285bccc85e59a31d1b274293b11f95fe6c35f1606b557"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::openai::wire::chat::finalize_deepseek (cognitive 31): rig_core::providers::openai::wire::chat::finalize_deepseek has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/wire/chat.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37e0a4b89e1764bb4366c09475ee9af025438e573cd38a625221013499f1c5c"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::systems::attach_retrieved (cognitive 31): rig_ecs::systems::attach_retrieved has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 6 (11 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/systems/mod.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b95a6ea1e41df52420c794575a7bccdde0196750b1eee50aa5a6a689270d93"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_candle::protocol::validate_protocol_inputs (cognitive 30): rig_candle::protocol::validate_protocol_inputs has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 4 (16 pts), loops 6 (14 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":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da1dd21af7b2ea68718a7c69cf71e0464c8d99d6350c6363493e5510f88a42d"}},{"ruleId":"D2","level":"warning","message":{"text":"Message::from_message (cognitive 30): Message::from_message has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 7 (19 pts), if/else 3 (11 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-core/src/providers/anthropic/completion.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ea64b81ce99763d4058489c74c0970f244904d26fbb99114a1ea4d2320c214"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::systems::gather_turn (cognitive 30): rig_ecs::systems::gather_turn has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (6 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its 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/systems/mod.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"de40a76c894fce65a957728c6e9a59049bcf43fe2ed40cc7374151643d436e5e"}},{"ruleId":"D2","level":"warning","message":{"text":"HttpExchange::streaming (cognitive 29): HttpExchange::streaming has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 4 (6 pts), loops 3 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/driver/http_transport.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"449f268ada07cdb27f6effa0218d10ee0aa41e7f828da42cc08d25d26ff7ba7e"}},{"ruleId":"D2","level":"warning","message":{"text":"EffectStream::poll_next (cognitive 28): EffectStream::poll_next has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/bus/dispatcher.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbde1ed47d778d64380974a876ef24ca4f33bbe248030b0baa88b6bcbddea2d"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::transcript::validate_canonical (cognitive 28): rig_core::transcript::validate_canonical has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (19 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/transcript.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fe5af58fc2b5f9c9f001e46a1724b4313f6cc0e67c1772d15ddacf858a30aa"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::gemini::completion::create_request_body (cognitive 27): rig_core::providers::gemini::completion::create_request_body has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (20 pts), loops 3, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/completion.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"6283fea4eebc71cca6333bf9ee461aaa392f945e31310cc1228bb6a33cbfb140"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamState::process_event (cognitive 26): StreamState::process_event has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (8 pts), loops 2 (6 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-bedrock/src/streaming.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba42075f0d6a18aae20ce369f0aa0e14dd583268b80d5b587c6d62a3b4a0f25"}},{"ruleId":"D2","level":"warning","message":{"text":"Buffered::poll (cognitive 26): Buffered::poll has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 4 (9 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/ecs/delivery.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9f838bf6c8198f30b541449bf395c60a311c4fc5be23c7e5696fad9c48cd4b"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionRequest::try_from (cognitive 26): CompletionRequest::try_from has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 4 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/responses_api/mod.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5baf3a9a15abef7e1951fb6cd6b688b10f01807a08f5e2d36f8667bc8d8dc12"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::completion::message::keys_lost_in_round_trip::walk (cognitive 26): rig_core::completion::message::keys_lost_in_round_trip::walk has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 3 (7 pts), loops 2 (4 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/completion/message.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ed3fbfa33a84b7fa0f013798cd9510230bda0366016664ef3cbd673f6b8821"}},{"ruleId":"D2","level":"warning","message":{"text":"check-dependency-floors.guard_source_paths (cognitive 26): check-dependency-floors.guard_source_paths has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 5 (7 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-dependency-floors.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d087989271b4e75e2c44479599062498651f1af499aef9a52628ee802230bd"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cassette::ecs::identity::required_row (cognitive 25): rig_cassette::ecs::identity::required_row has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 7, loops 4 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/ecs/identity.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ec318b272e516371b25bbe79fdcd688175463ff3607a23f3acc04c1474eb8a"}},{"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":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed5aadf79cdb4fcf3bc548f91a4c28e1dea384e1e956df16afc0ee53c3f7e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"BusDriver::poll (cognitive 23): BusDriver::poll has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), match/switch 1 (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":"crates/rig-agent/src/bus/driver.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c92265edf198a4fd615da12d20b71dafee48bad183490c2af6126fa1b482e03"}},{"ruleId":"D2","level":"warning","message":{"text":"Caching::send (cognitive 23): Caching::send has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 4 (5 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":"crates/rig-core/src/client/gemini_caching.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91a26f5ba94296224cae488862a676af18b1ba30643935024e6864335c2c922"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::cassette::goldens::inserted_per_batch (cognitive 23): xtask::cassette::goldens::inserted_per_batch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/cassette/goldens.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7574399e286f190f92b0e3d07bc08fbd742fbc360fc2b21bfbc28e83b894fa"}},{"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":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b250c3f188cb2d15bc6f83097b82c4f27e028740ec675c3ec59ef8b3d5a4b19"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerateContentDecoder::decode (cognitive 22): GenerateContentDecoder::decode has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/streaming.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b25984fdb63dc578b177ce9d033706568cb70b15f91d5f245dc9dbb2c97a94e"}},{"ruleId":"D2","level":"warning","message":{"text":"OllamaCompletionRequest::try_from (cognitive 22): OllamaCompletionRequest::try_from has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (9 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/ollama.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"009f9b2bd94534a45bb3d2a5fa85743cc968b9ff9ddb89f59b5894cc04f0970f"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::anthropic::completion::merge_root_all_of (cognitive 22): rig_core::providers::anthropic::completion::merge_root_all_of has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (6 pts), loops 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"1259479040b996176658a002e5fb568a2475a22323ff7c2232e92bd3f7c94216"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::checkpoint::restore::load_world (cognitive 22): rig_ecs::checkpoint::restore::load_world has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/checkpoint/restore.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c685f5602a530df4d3f98b2a3d43ba2ff38ee0e3bc36383b4f345e2cf5c23673"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::verify::execute::internal (cognitive 22): xtask::verify::execute::internal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 7, loops 2 (5 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/verify/execute.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccf614c32932c7c94303c02cd69a1dcba3a570db192155bc140db0041efeb8f"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatDecoder::interpret_chunk (cognitive 21): ChatDecoder::interpret_chunk has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/wire/chat.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"2840fed0045663a0c4024263b46687d1b84cbdb94d77039394e0ef27876506d3"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::openai::completion::sanitize_plain_text_history (cognitive 21): rig_core::providers::openai::completion::sanitize_plain_text_history has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, loops 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/completion/mod.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cfffde3aaa75c6dabb312996dcc8b1a725b2fc428ac394a07b9d752436bd79"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::systems::advance (cognitive 21): rig_ecs::systems::advance has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (7 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/systems/mod.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"769a9fc40cb945a26f1d93ea39f75393e181fe7c8663ac1070d8015700ae3366"}},{"ruleId":"D2","level":"warning","message":{"text":"File::header (cognitive 21): File::header has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 3 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/cassette/audit.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"c003dafc2d082fcae131d0ab1b9d4a2c40b309e2464ff6571549ec42d6cd3d9b"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::bevy::check (cognitive 21): xtask::bevy::check has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/bevy.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f21d5f9ee87ae665649a295f82680013a975cf10cba49442987c5d8c1b20ec"}},{"ruleId":"D2","level":"warning","message":{"text":"UnaryTurnSource::run_model_turn (cognitive 20): UnaryTurnSource::run_model_turn has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/agent/engine.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e33c149c5ac9bd535b73d1ba5cdd7c196d2021dd85e48d5671e5677b2e4d39"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_agent::run::prepare::prepare_request (cognitive 20): rig_agent::run::prepare::prepare_request has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4, 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":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"886cf1670fbd47ffa2f9709904fb9409f0f08041f2b9d5ed411a5b4434d84053"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::systems::read_turn (cognitive 20): rig_ecs::systems::read_turn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/systems/mod.rs"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8248d78cb9388a5275b03d7aab62cdf5cb6a1d5e550322a5024be6b0879597d"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::systems::run_cancelled (cognitive 20): rig_ecs::systems::run_cancelled has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (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/systems/mod.rs"},"region":{"startLine":2831}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b21e9b92179541123b46f4459b169344ac89d3f37acd7824ce022e9373e3f9"}},{"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_vertexai::types::completion_request::vertex_generation_config (cognitive 20): rig_vertexai::types::completion_request::vertex_generation_config has cognitive complexity 20 (threshold 15). Drivers by points: if/else 17, boolean chains 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-vertexai/src/types/completion_request.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a37ab19569d309918b9c6d6110353904b1920475d7ecbec2a395e3193a76c4"}},{"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":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"29294a7d9663075ba62649aa1a4f18fffe154d2fb28ea5eea04e0d922067d1a2"}},{"ruleId":"D2","level":"warning","message":{"text":"EffectLogReplayer::check_header (cognitive 19): EffectLogReplayer::check_header has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 5 (6 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/effect_log/replay.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"8799152f6dc3e149926c63e095c5b47c951e89869e90cbf5b0a455e09e4e6777"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerateContentDecoder::interpret_part (cognitive 19): GenerateContentDecoder::interpret_part has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/streaming.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b8022601b1e8e0fb835e4a1c8ca938410e106058e9f26868d06e6e81b01cd4"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::openai::completion::assistant_content_to_messages (cognitive 19): rig_core::providers::openai::completion::assistant_content_to_messages has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (5 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/openai/completion/mod.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"b468f23f401b8e9d4ca073819edd3b35c5b7ec0caba0e52f415b6c855879aa37"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::systems::fold (cognitive 19): rig_ecs::systems::fold has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 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":"crates/rig-ecs/src/systems/mod.rs"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a97c20068fc672d5869ed53304416deeabdb4d6dee5f3db63a574671368776"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::systems::release_batch (cognitive 19): rig_ecs::systems::release_batch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/systems/mod.rs"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58848b46ae5337e1a7ca9ef8877893ff79b88cf7972c716df306134d45df1aa"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::systems::judge_invalid_calls (cognitive 19): rig_ecs::systems::judge_invalid_calls has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/systems/mod.rs"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e83df432b33a1d9a75ee9bdd01bf8ed8284eef42e3f9439e12ae8e471d7c78"}},{"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":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da4e519a37d73649f69079367225915f443ec88eaf09e5d8b17036cc99c4345"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_vertexai::types::completion_response::assistant_content (cognitive 19): rig_vertexai::types::completion_response::assistant_content has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 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":"crates/rig-vertexai/src/types/completion_response.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d960503895b9ab96e18a21444a6be7f1827b2adc936c8e46f1413571587f043"}},{"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":298}}}],"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":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"473d0fd7dd550d5286aa7b3ad9855d42eec7d6284bbf46f34fc1890194961f07"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::cassette::record::run (cognitive 19): xtask::cassette::record::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/cassette/record.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"3570041b7b8045cdca10f81c6fb7d5f1b1707f5ffdb48508721cd0d675afc0ff"}},{"ruleId":"D2","level":"warning","message":{"text":"check-dependency-floors.workspace_direct_deps (cognitive 19): check-dependency-floors.workspace_direct_deps has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (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":"scripts/check-dependency-floors.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"85da641c13682a374bc75b16b41055b56690983169d1566ec5beb453d602c4e3"}},{"ruleId":"D2","level":"warning","message":{"text":"check-dependency-floors.check_floors (cognitive 19): check-dependency-floors.check_floors has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 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":"scripts/check-dependency-floors.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea53d8cc9eb94629041cd3446a96daf00673d19516888f3498615be4e91732aa"}},{"ruleId":"D2","level":"warning","message":{"text":"CassetteScrubber::scrub_json_value (cognitive 18): CassetteScrubber::scrub_json_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/http/mod.rs"},"region":{"startLine":2762}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c09b6b1d4436c12844673fd61e49548ae5d16b3e17892b675bb9f28e24bcea"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::gemini::interactions_api::create_request_body (cognitive 18): rig_core::providers::gemini::interactions_api::create_request_body has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, match/switch 1 (2 pts), boolean chains 1, 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":"crates/rig-core/src/providers/gemini/interactions_api/mod.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d170ff815701eb53d259b6be548305757244c9f0f778e9f35bd5357adb0d9f"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::checkpoint::spawn_into (cognitive 18): rig_ecs::checkpoint::spawn_into has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (5 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":"crates/rig-ecs/src/checkpoint.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"1829c0d88fd0fd5a8a9b77ece206669be2da0912824a0ceb897a39d70221dd86"}},{"ruleId":"D2","level":"warning","message":{"text":"GrpcAdapter::interpret_part (cognitive 18): GrpcAdapter::interpret_part has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, 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-gemini-grpc/src/streaming.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0c25aac51ddddefa26ce739d0ddbbb3331fc5ef14a5e7e36ae75b3e08412ac"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::cassette::audit::run (cognitive 18): xtask::cassette::audit::run has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 4 (5 pts), loops 5, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/cassette/audit.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"951448265d1d0e8e0e22734b6c4d82a3228b2c440f30b4e07abf16e376a303ae"}},{"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":"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":"ChatDecoder::interpret_stream (cognitive 17): ChatDecoder::interpret_stream has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (3 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/cohere/streaming.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6959840f75f04d62bbe7da9760b89a47875eee58bbe6a94f96c023669bbd4e2f"}},{"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":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44846c0628019a8d82847eb300bb7eb13cf155126d3d1f11e7c450a46a5fa05"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryAssets::resolve (cognitive 17): BinaryAssets::resolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 3 (7 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-ecs/src/agent/content/binary.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"38463966a0e95dc441ed38b8d73b41fab16f8a7fbc28af48668cd517d599e4b4"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::agent::checkpoint::validate (cognitive 17): rig_ecs::agent::checkpoint::validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/agent/checkpoint.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"71eb893aed2c3ffd7c1c3fbb4b87ad15243b0dcdea8bd69762bf312c38a7f9af"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_ecs::bus::collect::settle (cognitive 17): rig_ecs::bus::collect::settle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/bus/collect.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d16b6ac60b70ff9eb33a2c8109230d6030b5223a639e30eb5971930708b3575"}},{"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":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c45ee7f9ef7f401d57898737de6847246547fd49f04b2688fbc704533562ae"}},{"ruleId":"D2","level":"warning","message":{"text":"File::stream (cognitive 17): File::stream has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, match/switch 1 (2 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":"xtask/src/cassette/audit.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdc67e404cadb51a53064a1e96eaafacd8a8fbdbc341a69078e614ccd38a588"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::cassette::audit::block_parts (cognitive 17): xtask::cassette::audit::block_parts has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 3 (6 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":"xtask/src/cassette/audit.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8504c2b546b282776e5572746d4dd5a200522838420ae309c4b8e6797d245cb"}},{"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":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"df97544294e916e4d5387aa5996e2dc5ab65884d3c03242de4a9d4508c4d2c41"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_cassette::ecs::identity::builder_spec_json (cognitive 16): rig_cassette::ecs::identity::builder_spec_json has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (7 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/ecs/identity.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba264858d675058d58f0056c52aca132842eed7b1dd18fa66a3db8296fadae57"}},{"ruleId":"D2","level":"warning","message":{"text":"Content::try_from (cognitive 16): Content::try_from has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 3 (5 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/interactions_api/mod.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b070964dfa1ddf7e80fb91afae4a75af3950baf371454b134495ddcd1dbd2cb"}},{"ruleId":"D2","level":"warning","message":{"text":"OllamaDecoder::interpret_record (cognitive 16): OllamaDecoder::interpret_record has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (2 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/ollama.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e2b11135d28fa5a58b424b699282b2cf2ebde59fb536b81dd3e41bb5971908"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::openai::wire::chat::refuse_file_ids (cognitive 16): rig_core::providers::openai::wire::chat::refuse_file_ids has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (3 pts), match/switch 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-core/src/providers/openai/wire/chat.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0aebfb6565f77464b8b4ee62ea10d5fe0a39888a0126e37c7f0e3bca3f04934"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::anthropic::completion::inline_local_root_reference (cognitive 16): rig_core::providers::anthropic::completion::inline_local_root_reference has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"a514be9ebb3eb8aeef2324aaab5e05e7b52a8f6f6dae9131709f636113b825b4"}},{"ruleId":"D2","level":"warning","message":{"text":"rig_core::providers::internal::wire::scan_discriminators (cognitive 16): rig_core::providers::internal::wire::scan_discriminators has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (7 pts), match/switch 2 (5 pts), loops 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/internal/wire.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51631348cba655263f69cb7131083c13bcbe64d654f3ce1b47df20daeb19a19"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::verify::execute::run (cognitive 16): xtask::verify::execute::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/verify/execute.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab358b96e6db470ab3f44905f783cb8bb0f52983e7ff8e6dbe9e162921e72b0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: http/mod.rs: FileTooLong \u2014 2168 significant 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 103 free functions. The bar is 500 significant lines; this is 1668 over it, 4.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/http/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"153caa489c7fac4b54ceb6406110f63903b99de055c655ec5458096bf10716d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: systems/mod.rs: FileTooLong \u2014 1945 significant 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 51 free functions. The bar is 500 significant lines; this is 1445 over it, 3.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-ecs/src/systems/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab12f8db3f450d7656cdf4bcfb02d3a2c6b23838b6721d1b7487dbddcb0984b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xtask::verify::checks::all: FunctionTooLong \u2014 xtask::verify::checks::all runs 333 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 233 over it, 3.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":"xtask/src/verify/checks.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"367ae49188032a6187cea7c58a636b44efb20b3df0fcbba5dcd15b8bb47b1e6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: responses_api/mod.rs: FileTooLong \u2014 1441 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 941 over it, 2.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/responses_api/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df00d3e284e60e10955094298e5bb82d0ebb68c19320b7e9c235f2386c350d88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interactions_api/mod.rs: FileTooLong \u2014 1411 significant 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 911 over it, 2.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file 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/interactions_api/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5679cfc803fd7f285d56b81aee4ce58970d3fdac7d494cad9a746b78229abe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gemini/completion.rs: FileTooLong \u2014 1407 significant 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 907 over it, 2.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file 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":"FileTooLong: anthropic/completion.rs: FileTooLong \u2014 1350 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 47 free functions. The bar is 500 significant lines; this is 850 over it, 2.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af279f5f860a47bfc025aca53172ac5256ce162ce7b731e7a1be9264a3a13c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/engine.rs: FileTooLong \u2014 1349 significant 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 849 over it, 2.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/agent/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9c67e9f769270c4f31fa321b55f852458fe0ca0df34cda4245bdd245e8e406"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StreamingTurnSource.run_model_turn: MethodTooLong \u2014 run_model_turn runs 256 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 156 over it, 2.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/agent/engine.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"88839eacf6c0976b5f54a24eb81efc71304827903a4cb58293957e95a00d3494"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1244 significant 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 744 over it, 2.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-sqlite/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f5ab5faaf08f09762c4ef21e48374d625d1313fac0052e4f13c6ac2f3791da"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xtask::verify::selection::plan: FunctionTooLong \u2014 xtask::verify::selection::plan runs 220 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 120 over it, 2.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/verify/selection.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b832585a85db5e41f79220f3fbfdce89ac528ce337f0043e318d0b6c50e785f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: completion/mod.rs: FileTooLong \u2014 1073 significant 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 573 over it, 2.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/completion/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5500615163d74d92a836d055e3a380d6495114f05fb5356ecac5c72480027f4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentRun: TooManyMethods \u2014 61 methods. The bar is 30 methods; this is 31 over it, 2.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/run/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19119abddfd859ecee06c810f914ed47bb5fc80bff12ac256b1359ae8130ebb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run/mod.rs: FileTooLong \u2014 987 significant 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 77% of them inside a single declaration: AgentRun (4 blocks, 367-1743). The bar is 500 significant lines; this is 487 over it, 1.97\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/run/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c00b75af1ac2a5cf562f8665ed7b1eafcb79e4634330fa3978d92b3a85fd43f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AgentRun: ClassTooLong \u2014 756 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 61 methods, 4 blocks, lines 367-1743. The bar is 400 significant lines; this is 356 over it, 1.89\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":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"891055046c652f1f6e3044bce933b30a5de248a1757b4c3aa8f44badd3ac794e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wire/chat.rs: FileTooLong \u2014 898 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 398 over it, 1.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/wire/chat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a576e01dfb39bc614ff4ba1e7b25f23f03f666500be25549cebcfc224375e25"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/hook.rs: FileTooLong \u2014 833 significant 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 333 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/agent/hook.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60004880d7d8319cb4d6d492e383786989a3e315094415fcb2da1ce8f2399a9c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Part.try_from: MethodTooLong \u2014 try_from runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/gemini/completion.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"db78ea263ddffc8160713ca1cffde27fa49a1dc9d370c1d6d47888a0972df5b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_derive::tool::expand::expand_rig_tool: FunctionTooLong \u2014 rig_derive::tool::expand::expand_rig_tool runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-derive/src/tool/expand.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24a2313b84775a47d423f322acc90a90f65ef97db9445c648fd8a9d938f580d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: operation/completion.rs: FileTooLong \u2014 821 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 321 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/operation/completion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b74e82369bfb74e66e36ca861325935620fe0f7436f34c167622f01e99f9087"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_ecs::bus::dispatch::dispatch: FunctionTooLong \u2014 rig_ecs::bus::dispatch::dispatch runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/bus/dispatch.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"613968553e0d9e62861b56f202e45f68857aa310f20f0dde4dc9cd28e3a2d0b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: completion/message.rs: FileTooLong \u2014 782 significant 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 282 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/completion/message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab5a5ef0029d86d25f9587fccc45bceec00083678c334bda6ed7eccadf2062d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: wire/modality.rs: FileTooLong \u2014 764 significant 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 264 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file 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: bus/dispatcher.rs: FileTooLong \u2014 755 significant 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 255 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":"crates/rig-agent/src/bus/dispatcher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"577a2c3f83ef47c534049017b2c67fa4fa644de9ec1bc3155a50270f6703faec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_lancedb::utils::deserializer::type_matcher: FunctionTooLong \u2014 rig_lancedb::utils::deserializer::type_matcher runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-lancedb/src/utils/deserializer.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"42db267edea76fe053c58d33a6a3d36474eeac1a150e114f70fdceab41dd4d4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_agent::run::prepare::prepare_request: FunctionTooLong \u2014 rig_agent::run::prepare::prepare_request 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-agent/src/run/prepare.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"473a5578279dd54b8ec3ade279759aeaf962f0f7e44e477821bcaf3d4723e21f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_cassette::ecs::delivery::collect_replayed: FunctionTooLong \u2014 rig_cassette::ecs::delivery::collect_replayed 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-cassette/src/ecs/delivery.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"c647665cdd4e9662458477c752727edf6b934923d46d4b3d2ffb9eec675a5899"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReplayDelivery.new: MethodTooLong \u2014 new runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/ecs/delivery.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76f58e3fb379f9179d112511ea779bae4fbfd143ef9137171cac3b049e275b6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OpenAIConfig: TooManyMethods \u2014 42 methods, declared across 2 files: openai/wire.rs (40), 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":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"228c8204e1410e36c63616c0b18635ffff8855a7a16057ab24cabb436d5f172b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MessagesDecoder.interpret_content: MethodTooLong \u2014 interpret_content runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/streaming.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ed787f9bd45f15e8663e8497b8c0dc2ccf9e4f4755094d96789f6ffb0c7b99"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_core::providers::openai::responses_api::input_items: FunctionTooLong \u2014 rig_core::providers::openai::responses_api::input_items runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/responses_api/mod.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f93ad5a5f52ad1dc89a27bf1490cd97a35d82054a43141151e49b01ce01bd74"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentBuilder: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/agent/builder.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"69172355d0b8136ab6b41af04215736c5f56cf34d2a9da757e7d86de6a887e3a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AgentRunner: TooManyMethods \u2014 41 methods, declared across 2 files: agent/runner.rs (37), agent/streaming.rs (4). The bar is 30 methods; this is 11 over it, 1.37\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":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"266f180acc94a0382eb9eeee7445df4470126e350320a31785784d76982b89c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_ecs::bus::collect::collect_streams: FunctionTooLong \u2014 rig_ecs::bus::collect::collect_streams runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/bus/collect.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ee1abd48f5cd5e959a8d357f9ff5f26558b16ee2de264a66f10fdb3e3464d3"}},{"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":"MethodTooLong: CompletionRequest.try_from: MethodTooLong \u2014 try_from runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/completion/mod.rs"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff386d402159da4145d243777a0b68bbf7230da068e5287e951e91a82dd54ea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Message.from_message: MethodTooLong \u2014 from_message 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-core/src/providers/anthropic/completion.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc60f35b067528d397dd212f63dc95745f58e68bb1888062317abc02a33b4682"}},{"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":"FileTooLong: openai/wire.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":"crates/rig-core/src/providers/openai/wire.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50140cebcc4149dba94442f06de17220e1e3cb3edb3a425f8928b660f4eda84d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_ecs::systems::gather_turn: FunctionTooLong \u2014 rig_ecs::systems::gather_turn runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/systems/mod.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b01988fce2145e3a0ebf47e78985925473dd02525e9000700c57d166409b33"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Quirks: TooManyFields \u2014 37 stored fields beside 3 methods. The bar is 30 stored fields; this is 7 over it, 1.23\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":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"56694e244c3e0e9c083b6b21a1eab1e1c561013276f435f60207217998279563"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/protocol.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-candle/src/protocol.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ca789ef762bfd329ed94048bd2936e7f414995a9c284ac38f02b7f9ad6792e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CacheBook.plan: MethodTooLong \u2014 plan 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/gemini/caching.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"8baba129a11fb53aaa3dcb98cb305e40b90b63618d1d7b1ca109c55cdf1a4775"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: responses_api/streaming.rs: FileTooLong \u2014 613 significant 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 113 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-core/src/providers/openai/responses_api/streaming.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4650a14a25f684a25626822cc3700a472117dafa909d4e1cff72f0d220731282"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 611 significant 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 111 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-memory/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0defd1ae95654654b9c1cfecfa2c683d84a24ac8518e66953194fc1c788360bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Content.try_from: MethodTooLong \u2014 try_from runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-vertexai/src/types/message.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d33146e2d94302c92bc7dcd18bb61e7e943f2bc5ad4e541bd870e29ae93e900"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: effect/mod.rs: FileTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 109 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/effect/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ed5cf4279faf960ef2f86ce36bb8c7a9cc62bef0a4f1a25fec273512ca2e9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cassette/audit.rs: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 107 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":"xtask/src/cassette/audit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5476024eead8684b2faa4c142de9d36da89af0c413f6d25f562d25e7db0b5af9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/converse_output.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":"crates/rig-bedrock/src/types/converse_output.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da71b65ae72b165ff18515c31559709103b4321db683c53ba80f396d45fab01e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_agent::agent::engine::drive_tool_calls: FunctionTooLong \u2014 rig_agent::agent::engine::drive_tool_calls 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-agent/src/agent/engine.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a1de95b9d049e0305dc176c5d816b0202ae35dabc7252fcb199774b168d672"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_agent::agent::engine::dispatch_tool_call: FunctionTooLong \u2014 rig_agent::agent::engine::dispatch_tool_call 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-agent/src/agent/engine.rs"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a1d6cf11ee81837f9112165c1e95efbc297f0a25b4189519c426af47f72282"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentRun.next_step: MethodTooLong \u2014 next_step 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-agent/src/run/mod.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"f228f9cb5400da62ade14746deb942c9f4bc098d1c09dd9e8d7a909f3fbd73d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/mod.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":"crates/rig-ecs/src/agent/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1480413137162eb518dcc4e5b7f9510525ab192610a54c6710b47a536f6ae93d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Out: TooManyMethods \u2014 34 methods, declared across 2 files: operation/completion.rs (28), src/wire.rs (6). The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/wire.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65e9f44a5f0c8529447e57740219d0bce32d2d90112c513ef08a60f026f2400"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UserContent.try_from: MethodTooLong \u2014 try_from runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/completion/mod.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8dfefec11787fd047920c58e4eba43fe74ef683bf834e15708d5871376bc3a"}},{"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: gemini/caching.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":"crates/rig-core/src/providers/gemini/caching.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f97e94a7022a7d9a0576ff097aa0f934947522b367d61d81e7950c5fbde4938"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ecs/delivery.rs: FileTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 41 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/ecs/delivery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b49e5c9e6167c7d85e84a707d5eb724d38dfffed4c9d15f9bde6245473f6e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_candle::protocol::render_qwen_message: FunctionTooLong \u2014 rig_candle::protocol::render_qwen_message runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/protocol.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a36b4adbe098f92a1020c3ab5511d45b55b95b15bcf8bce43024683a49d649d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_core::providers::anthropic::completion::transform_strict_tool_schema: FunctionTooLong \u2014 rig_core::providers::anthropic::completion::transform_strict_tool_schema runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/anthropic/completion.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbf245d08558e3eb42eda772a86479431ece11455816c9efd298c1244837a25"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompletionRequest.try_from: MethodTooLong \u2014 try_from runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/responses_api/mod.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cbe8153934af11c9bef33195b7e3b0e9d9d1413c4bcc594e09fed7d5c4559e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_cassette::ecs::identity::spec_json: FunctionTooLong \u2014 rig_cassette::ecs::identity::spec_json 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-cassette/src/ecs/identity.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d894adfc569d2bc999d0736d6d92908c391ac2b84bb3536cdbd4178ef7d1b4d2"}},{"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":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f279b66e83b6bc9090afb9f7a538772b9ab805f1665f38e760e0a8100cac5cf6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StreamState.process_event: MethodTooLong \u2014 process_event 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-bedrock/src/streaming.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"29621c0895a0a7dec287e4ec7475bf77e72092dc01a78ee63d2170c4fa73a005"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InteractionsDecoder.decode: MethodTooLong \u2014 decode 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/providers/gemini/interactions_api/streaming.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8560ccf4399f6c4081a667f9c140ab98281dc5a291c757a20af43027cf8b7d4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RigAssistantContent.into_content_block: MethodTooLong \u2014 into_content_block 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-bedrock/src/types/assistant_content.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"769837e36940a9f16c439bd4270da672f037ab40f2974862c7c95c94a8e46e93"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig_core::providers::gemini::completion::create_request_body: FunctionTooLong \u2014 rig_core::providers::gemini::completion::create_request_body 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-core/src/providers/gemini/completion.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbb729c5ae2902485766c85b6b03f89abe8545303858b9161c500ec27787749"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Content.try_from: MethodTooLong \u2014 try_from 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-core/src/providers/gemini/interactions_api/mod.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10a9ee60897d9d8d21d8a87f49b3b97e16f65b848d1270adbcbb91a57e5ce41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: responses_api/websocket.rs: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 16 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":"crates/rig-core/src/providers/openai/responses_api/websocket.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19453fc30b01eebaf0c56b1729720a4a3bb4064f9b97998190da71ab8c76151"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BusDriver.serve: MethodTooLong \u2014 serve runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/bus/driver.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e323a69137e9b7743de39f111403a186bc232705764247ccf319911b775a25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/rig-core/src/providers/voyageai/wire.rs:215-231 | crates/rig-core/src/providers/voyageai/wire.rs:379-393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/voyageai/wire.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8676c4adfa02b2ccc94d79c02b9679591b6b075631b6dfc887a8ada85ec0ca89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/rig-core/src/serve/adapters.rs:292-304 | crates/rig-core/src/serve/adapters.rs:388-401 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/serve/adapters.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"206d1a2b89609934ea164d4099dbbad94cdfea863958e93b8239c48bf6579d5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): xtask/src/cassette/goldens.rs:33-44 | xtask/src/cassette/scan.rs:242-254 \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":"xtask/src/cassette/goldens.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"708fc11f797ca7461228b7f12735037b1bfd676d517386cbd0cc3a27357b4c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/rig-candle/src/model.rs:494-505 | 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/model.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"40379d7531887ac6e05854b24ddf35f4472b4efd06098e36f9f2c31e7d813788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rig-cassette/src/ecs/delivery.rs:723-733 | crates/rig-ecs/src/bus/collect.rs:151-161 \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-cassette/src/ecs/delivery.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa7c6070ae3c4178031c1716e8a242dcefa0c986c4f2e64bcd1803404326553"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rig-core/src/vector_store/in_memory_store.rs:422-432 | crates/rig-core/src/vector_store/in_memory_store.rs:450-460 \u2014 both copies are in the same file, so extract the block 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/vector_store/in_memory_store.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4394c79a0ed51a9fb2d7fcd1cc79a972dcfed513d35e472ee23d91d9a5a0ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rig-milvus/src/lib.rs:187-196 | crates/rig-milvus/src/lib.rs:228-237 \u2014 both copies are in the same file, so extract the block 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-milvus/src/lib.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b00220c3a56463bd7b4382f0f86bde27c3b2e04125dbe2c14eadf571a50ed20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/rig-ecs/src/bus/dispatch.rs:113-120 | crates/rig-ecs/src/bus/dispatch.rs:132-140 | crates/rig-ecs/src/bus/dispatch.rs:156-163 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/bus/dispatch.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1871d8ed91bacfec05a1af456d8b97d0ea8a8c7008622b7e6076109f2d659f18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/rig-qdrant/src/filter.rs:282-290 | crates/rig-qdrant/src/filter.rs:293-301 | crates/rig-qdrant/src/filter.rs:304-312 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-qdrant/src/filter.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1626d9e54c8a5b194166a03e5b5debeeef6f302f273af25fc63186f555579b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rig-core/src/providers/cohere/wire.rs:292-300 | crates/rig-core/src/providers/voyageai/wire.rs:376-384 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/cohere/wire.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad26beee34d1146953bcdd50171b27d2ab72dc29bc97971518c098a05d13cd98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rig-rmcp/src/native.rs:150-158 | crates/rig-sqlite/src/lib.rs:1211-1219 \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-rmcp/src/native.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed42810171b4a5149ba2c62dc77859be1c5fff625caa8bd16da8fa88b125bacc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rig-core/src/providers/openai/wire/chat.rs:347-354 | crates/rig-core/src/providers/openai/wire/chat.rs:438-449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/openai/wire/chat.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c770d8f7b442d156e6be81719d528921b8a94cfa94967e4fc1894284137b22b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/rig-ecs/src/systems/mod.rs:2242-2248 | crates/rig-ecs/src/systems/mod.rs:2381-2387 | crates/rig-ecs/src/systems/mod.rs:2696-2702 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/systems/mod.rs"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"8255022ca8e941cb073ffcbecd76ebc071d4ae95739fbd7900c4a3b6b65630cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-candle/src/loader.rs:117-123 | crates/rig-candle/src/loader.rs:158-164 \u2014 both copies are in the same file, so extract the block 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/loader.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a27a04e9a7d6b1832dd696f27521fb544c79a19f589aa010dfbbe883880b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-candle/src/model.rs:439-445 | crates/rig-candle/src/model.rs:476-482 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/model.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d13397830b8be1897a4d6dee7f9b566e7d80482a7417735107039340fd219f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-core/src/providers/copilot/auth/native.rs:255-261 | crates/rig-core/src/providers/copilot/auth/wasm.rs:51-57 \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/copilot/auth/native.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"72044bc9623e3b59684bc95dc57b50ffbdfb8cbbd440cbf476289def553ffda8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-core/src/serve/layer.rs:158-164 | crates/rig-core/src/serve/layer.rs:175-181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/serve/layer.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d40274b0c46e9aaee338e7729ee1292389dfd147f58f4c8102fb08c033159cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rig-core/src/loaders/epub/loader.rs:253-258 | crates/rig-core/src/loaders/pdf.rs:260-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":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f9bb56ac134cb715b22c31e8f8a220502af46cd8587fbed551b6628b42d47a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rig-agent/src/bus/driver.rs:448-452 | crates/rig-agent/src/bus/driver.rs:476-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/bus/driver.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8b8d61cb09d4b12fea68fd14eb2f31230a7409ef1e8bbcabef74d3b5ed0c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rig-agent/src/run/patch.rs:152-156 | crates/rig-ecs/src/agent/mod.rs:898-902 \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/patch.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f69db6c3827a9cdebd2a9c38696a97f632df6955d273079e7d539bfd6835b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rig-core/src/effect/mod.rs:111-115 | crates/rig-core/src/effect/mod.rs:130-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":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49a00281659e66b550e67586be6349e644ce5f1e1009bdcdf960e5fc0e18e08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rig-agent/src/run/response.rs:74-80 | crates/rig-core/src/completion/request.rs:261-267 \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":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cc560adf3780e7dc3f717697c8015e894a4fa47b01ac2187a11ef18e7e3209"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/rig-agent/src/run/transcript.rs:105-113 | test-support/rig-test-support/src/history_survival/adversarial.rs:62-70 | test-support/rig-test-support/src/support.rs:1030-1038 \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-agent/src/run/transcript.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94a3764987e425b9c26f61dc06c61508c3126da148cb32c904f525d18147548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/rig-core/src/audio_generation.rs:49-59 | crates/rig-core/src/embeddings/embedding.rs:75-85 | crates/rig-core/src/embeddings/embedding.rs:130-140 | crates/rig-core/src/image_generation.rs:53-63 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/audio_generation.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d4f0ba41b2571596ad77c522d2e1a5d727f6d6b0335783205667e454e94e3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rig-core/src/audio_generation.rs:108-112 | crates/rig-core/src/image_generation.rs:126-130 \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":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"691fdbe60738b498ceeb316ddaafbec57179a0eea3aceb27a6b31cbe78c2419b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rig-core/src/completion/request.rs:276-284 | crates/rig-core/src/test_utils/streaming_conformance.rs:562-570 \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":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"714e09f800ddb8e63c148d760b382e6539bde4ec147cb83f18805e719be022db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rig-core/src/providers/chatgpt/auth/mod.rs:54-59 | crates/rig-core/src/providers/copilot/auth/mod.rs:51-56 \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/chatgpt/auth/mod.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7228996ff31b14fec22cc3c5544003c671d355ac307c59999fa659c7d488890"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rig-core/src/providers/cohere/wire.rs:105-112 | crates/rig-core/src/providers/voyageai/wire.rs:100-107 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/providers/cohere/wire.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4502fd37398dbc02048c5c0edb755427ec7bf46243598f65cc87e99f6b63dc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/rig-core/src/providers/cohere/wire.rs:249-253 | crates/rig-core/src/providers/ollama/wire.rs:202-206 | 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/wire.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"106991a152c42f748b70638e809dc4aab7f4d847f5957728b7b69244a8873ab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rig-postgres/src/lib.rs:230-237 | crates/rig-surrealdb/src/lib.rs:268-275 \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-postgres/src/lib.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03b1fa82f39feb03d4456572e99921c40f8d9037bb737b2e2a7345226e9f952"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): test-support/rig-test-support/src/comparison_guard.rs:53-59 | xtask/src/cassette/owner.rs:197-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":"test-support/rig-test-support/src/comparison_guard.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4a8274e7e074f2ce24c520a1f8c19375883cf8ae89c38f7ab90d743425fc5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rig-cassette/src/ecs/identity.rs:337-349 | crates/rig-cassette/src/ecs/identity.rs:376-388 \u2014 both copies are in the same file, so extract the block 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/ecs/identity.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbc8d7b6a7c4d17fcad952a2824de26ba02de15345dcaf42c4933ebfd229c91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rig-cassette/src/http/mod.rs:2942-2953 | crates/rig-cassette/src/http/mod.rs:2993-3004 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-cassette/src/http/mod.rs"},"region":{"startLine":2942}}}],"partialFingerprints":{"codehealthFindingId/v1":"3834f2c636e679b130e5f810c708e80638db308caa6cfdecba7b95b210c3a80d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rig-cassette/src/http/mod.rs:2172-2182 | crates/rig-cassette/src/http/mod.rs:2190-2200 \u2014 both copies are in the same file, so extract the block 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/http/mod.rs"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbdf0a9ded8aedb1f7e33c7f4bb2d6b82b3bf3abcc5695a28e9aab7956308d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rig-core/src/providers/anthropic/streaming.rs:115-123 | crates/rig-core/src/providers/openai/responses_api/streaming.rs:939-947 \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/anthropic/streaming.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af076d18448fa52dfc70f6b5f3044451dccb9adb7cc1eba89b25d4ceb43497f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rig-core/src/providers/openai/wire/modality.rs:325-332 | crates/rig-core/src/providers/openai/wire/modality.rs:1194-1202 \u2014 both copies are in the same file, so extract the block 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/providers/openai/wire/modality.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"712e35f0f2e6c873dba070dc0c26822f1c3c384986240d1aa29ddf6c3d410292"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): xtask/src/cassette/audit.rs:821-828 | xtask/src/packaging.rs:331-336 \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":"xtask/src/cassette/audit.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"d507b172e923a86ac7ccaa13c750d788e11f0867e2658eb0c1ee646233342af9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rig-candle/src/model.rs:484-488 | 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-candle/src/model.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d032a0ad4a61ba9638ef347240921d7c4bd2eeae17374cd4384244c969bab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rig-cassette/src/ecs/delivery.rs:321-325 | crates/rig-ecs/src/bus/collect.rs:141-145 \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-cassette/src/ecs/delivery.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"423c45d60a8d25d35c28007c976945986e2f7eefed89a917a49c531e3c6dc7bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 3): test-support/rig-test-support/src/scenario_registry.rs:149-177 | test-support/rig-test-support/src/scenario_registry.rs:181-209 | test-support/rig-test-support/src/scenario_registry.rs:213-241 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/scenario_registry.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6679ff82433a4e6d806d928c4f5a60c62f02778f86ac1b415dd842a65123ef91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): test-support/rig-test-support/src/reasoning.rs:367-387 | test-support/rig-test-support/src/reasoning.rs:460-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/reasoning.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4a05cdc418ba2c2a1c304ba3092b8de088973a9ed94a03193be433460157e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): test-support/rig-test-support/src/reasoning.rs:274-292 | test-support/rig-test-support/src/reasoning.rs:418-436 \u2014 both copies are in the same file, so extract the block 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":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d2d366456d5ca1f75b4ec34293a4cc4b8d5384b3492f03519bbd00bbaaab74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/rig-http/src/test_utils.rs:238-254 | crates/rig-http/src/test_utils.rs:421-437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-http/src/test_utils.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61bd4ed65ed3d80abc8b9b69c0c84bd4b29676f2ccac579c6f4b5a159c52ca5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201316 lines \u00D7 2): test-support/rig-test-support/src/reasoning.rs:426-436 | test-support/rig-test-support/src/reasoning.rs:470-485 \u2014 both copies are in the same file, so extract the block 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":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e1d571e03186f408ba6196125555b5e060c67cec8974ea9a4d4aadd9660b47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): test-support/rig-test-support/src/raw_capture/chat.rs:79-92 | test-support/rig-test-support/src/raw_capture/chat.rs:171-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/raw_capture/chat.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"640998cf237632034bb7d30c7abd0aa27634e0db2f913a889896bfe3ccff0c40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): test-support/rig-test-support/src/matrix_registry.rs:148-159 | test-support/rig-test-support/src/matrix_registry.rs:201-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/matrix_registry.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe1d6cff2ae3b3303532a67faa4e59ddcd04e06e3bcd2a7b7f69fa2d0e3e995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): test-support/rig-test-support/src/raw_capture/chat.rs:64-75 | test-support/rig-test-support/src/raw_capture/chat.rs:161-172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/raw_capture/chat.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e546d4208a74aff878ac0acd36697b5acbab063d871574d78f7dad696e0169"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 3): crates/rig-core/src/test_utils/streaming_conformance.rs:955-962 | crates/rig-core/src/test_utils/streaming_conformance.rs:998-1008 | crates/rig-core/src/test_utils/streaming_conformance.rs:1056-1064 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/test_utils/streaming_conformance.rs"},"region":{"startLine":955}}}],"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:1906-1916 | crates/rig-agent/src/test_utils/model_conformance.rs:2045-2055 \u2014 both copies are in the same file, so extract the block 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":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"469468587f396ef55adc284aa853a870467e898509318f7cbd2af7f3e2e47b2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rig-core/src/test_utils/streaming.rs:340-350 | crates/rig-core/src/test_utils/streaming.rs:352-362 \u2014 both copies are in the same file, so extract the block 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/test_utils/streaming.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe858a7bd47d4f0778f424b203e657e70bdf0072b48f86124bfa368f0307824"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): test-support/rig-test-support/src/reasoning.rs:282-292 | test-support/rig-test-support/src/reasoning.rs:377-387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/reasoning.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd4325f7f8688353c73ba2ee2375ba0325ff3f8696efb4dfabb719b4ebec649"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): test-support/rig-test-support/src/matrix_registry.rs:99-110 | test-support/rig-test-support/src/matrix_registry.rs:148-157 | test-support/rig-test-support/src/matrix_registry.rs:199-210 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/matrix_registry.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f82b74ed7f46c1cbef3684e037a216119cfa9dcd3c30bb1060955217a38a28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rig-core/src/test_utils/streaming_conformance.rs:242-250 | crates/rig-core/src/test_utils/streaming_conformance.rs:280-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/test_utils/streaming_conformance.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cb08fb97f5a0e228997bff65e28820f88aab4d632fe4f84e0cfdab04d519a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): test-support/rig-test-support/src/matrix_registry.rs:134-142 | test-support/rig-test-support/src/matrix_registry.rs:183-191 \u2014 both copies are in the same file, so extract the block 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/matrix_registry.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"79acc5abc6e0af5a35b7cb733210d9b03d5137e472e1d7251b9ec13136e0cb01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): test-support/rig-test-support/src/matrix_registry.rs:83-90 | test-support/rig-test-support/src/matrix_registry.rs:132-139 | test-support/rig-test-support/src/matrix_registry.rs:181-188 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/matrix_registry.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a7abcbf75a70bab6b221f3e74f6bc029c9d74c75b8efa84dde7a039bc5f61b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): test-support/rig-test-support/src/reasoning.rs:296-301 | test-support/rig-test-support/src/reasoning.rs:390-395 \u2014 both copies are in the same file, so extract the block 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":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a090d0880fec3e79675f493bcb05ad97428839442174e929899e640e37dff9fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): test-support/rig-test-support/src/matrix_registry.rs:76-80 | test-support/rig-test-support/src/matrix_registry.rs:127-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-support/rig-test-support/src/matrix_registry.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9f8f3fb4fa44538a4494590399010d1d1d157205410df33eef5f15073e21c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): test-support/rig-test-support/src/cache_conformance.rs:645-660 | test-support/rig-test-support/src/cache_conformance.rs:689-706 \u2014 both copies are in the same file, so extract the block 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/cache_conformance.rs"},"region":{"startLine":645}}}],"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:1467-1475 | crates/rig-agent/src/test_utils/model_conformance.rs:1481-1490 \u2014 both copies are in the same file, so extract the block 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":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f62245a9111e9ab8f281a846735eeffd315abe1d3fe4dbe52c6958e3c6f742e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): test-support/rig-test-support/src/reasoning.rs:809-818 | test-support/rig-test-support/src/reasoning.rs:855-864 \u2014 both copies are in the same file, so extract the block 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":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dedc52073c6e0deb0046cea70b94b8b46ea38ecb8caef3a25da73cfebc2a50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rig-core/src/test_utils/streaming_conformance.rs:1003-1011 | crates/rig-core/src/test_utils/streaming_conformance.rs:1100-1108 \u2014 both copies are in the same file, so extract the block 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/test_utils/streaming_conformance.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f602392a3a53a614ed4402ec6a93f8edf182a592bb1af1f2002a26084799fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): test-support/rig-test-support/src/history_survival/adversarial.rs:119-126 | test-support/rig-test-support/src/history_survival/adversarial.rs:204-211 \u2014 both copies are in the same file, so extract the block 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/history_survival/adversarial.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a9936649f849885d79ffdde21c62f792f3ce90f103698b4f7a934d26335b07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): test-support/rig-test-support/src/matrix_registry.rs:143-147 | test-support/rig-test-support/src/matrix_registry.rs:194-200 \u2014 both copies are in the same file, so extract the block 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/matrix_registry.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2478399b5491f1971a42bed7c869a78c855d4d6d7cec8b80ad679c933b0b1517"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): test-support/rig-test-support/src/reasoning.rs:732-738 | test-support/rig-test-support/src/support.rs:917-923 \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":"test-support/rig-test-support/src/reasoning.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7f36bae0fd3a2578030cfbfb4b0e4d309d223d7336a7c86c6bda38d9590f57"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rig-core: rig-core: abstractness 0.07, instability 0.14, distance 0.79 \u2014 zone of pain \u2014 concrete and depended on by 24 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a1d75c57173652205276ee65079a2a5929e8ec285c39e606b59c89453b7188c9"}},{"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":92}}}],"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":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b419aa54bc7bc4142e73f829fe753fdea2acaf726400944a3f163be840c2279"}},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d31e75f4b3540be97c167c0cf55fb9a13b63be74c7be1d2f4495b533c8cfbd6"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6fa0afeb0f8e394ca23d6eb839c5ab6f7de5ad868e1638719bb8e4548937d49c"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D14","level":"error","message":{"text":"Banned license: epub: \u0060epub\u0060 2.1.5 is published on crates.io under \u0060GPL-3.0\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-core/src/providers/openai/completion/mod.rs: crates/rig-core/src/providers/openai/completion/mod.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in UserContent::try_from at line 653. 7 of those changes were fix/bug commits, and the other 44 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/openai/completion/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/completion/mod.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd3dae666119866dd9c473c21270870f51fe53d4e0aed62cf37b673e23d72b5"}},{"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 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rig_core::providers::openai::responses_api::input_items at line 394. 15 of those changes were fix/bug commits, and the other 44 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e19808f47d59d485ff7f235894abe5c3e8cf15305ba021b987d8949a142f86b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/gemini/completion.rs: crates/rig-core/src/providers/gemini/completion.rs changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Part::try_from at line 887. 8 of those changes were fix/bug commits, and the other 42 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/gemini/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/gemini/completion.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d056eb375a5f95214ee1b855c32c54258c1cb9f78b7005eb6acce9d95f2be39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/anthropic/streaming.rs: crates/rig-core/src/providers/anthropic/streaming.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in MessagesDecoder::interpret_content at line 257. 5 of those changes were fix/bug commits, and the other 34 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/anthropic/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/anthropic/streaming.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"0937d7af766788f5418707221e5d9d87654c2e6d4b79c6020d324fc4d8ff5d92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/anthropic/completion.rs: crates/rig-core/src/providers/anthropic/completion.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Message::from_message at line 859. 6 of those changes were fix/bug commits, and the other 38 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1f45c192ea788b950945c375c1486d3363cdf6666c684a44201bd43b61203d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-agent/src/run/mod.rs: crates/rig-agent/src/run/mod.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in AgentRun::next_step at line 881. 3 of those changes were fix/bug commits, and the other 41 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1748691b827103860aaa8b609f406c3357b2d0376d3b5689265ce2fb228b3b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-agent/src/agent/engine.rs: crates/rig-agent/src/agent/engine.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in StreamingTurnSource::run_model_turn at line 788. 2 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cc423891518f8914cbfc433e8309c5061733f779ebc4c8eccee2d2a25b0a8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/gemini/interactions_api/mod.rs: crates/rig-core/src/providers/gemini/interactions_api/mod.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Content::try_from at line 1496. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/gemini/interactions_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/gemini/interactions_api/mod.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b093b46fd8df7bb490cc8376fcb93592b2e525c46e750ee327e9d3a53df43c"}},{"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 21 in InteractionsDecoder::decode at line 179. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedfbd660a70d7c2ae006eeb58ceb4935fef8bcea11add48337cb2783acae0b9"}},{"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 21 in StreamState::process_event at line 103. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b6a008b70060512f4f75cfa691318fd9d157a28013865caf5241dda82ffea3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/providers/gemini/streaming.rs: crates/rig-core/src/providers/gemini/streaming.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in GenerateContentDecoder::decode 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"0533f06e43284ca7dabcb312da9f9e73b20b29d678715707c03e5f7c611d8102"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-bedrock/src/types/assistant_content.rs: crates/rig-bedrock/src/types/assistant_content.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in RigAssistantContent::into_content_block at line 112. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-bedrock/src/types/assistant_content.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \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/types/assistant_content.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b64a87648679320284fe3512cd30882b6e67082a0c0aec99e1d0848ea5dd731"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-lancedb/src/utils/deserializer.rs: crates/rig-lancedb/src/utils/deserializer.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in rig_lancedb::utils::deserializer::type_matcher 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-lancedb/src/utils/deserializer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \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-lancedb/src/utils/deserializer.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a27cbf7d1bfeee7de9c43081ec88df2ffaf1ca6b8ba36fedc43dcc1c90ebd5"}},{"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 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in rig_agent::test_utils::model_conformance::invalid_tool_recovery 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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-core/src/providers/cohere/streaming.rs: crates/rig-core/src/providers/cohere/streaming.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in ChatDecoder::interpret_stream 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/providers/cohere/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/cohere/streaming.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e551fd7ef035983a5f64054b4ef8ab8e5aa86f1aaa27594865b8b3fa4e0e18aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-ecs/src/systems/mod.rs: crates/rig-ecs/src/systems/mod.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in rig_ecs::systems::land_batch at line 1897. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-ecs/src/systems/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-ecs/src/systems/mod.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a42862f8be04f499d3cbe876d78cd90b30e12487dd50cb3a548b2955acdd905"}},{"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 27 in rig_candle::protocol::render_qwen_message at line 554. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"175d1e3904126af7f1840110186ced0a3a7e9e5b492bfa8cd335c71ddf48193e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-gemini-grpc/src/streaming.rs: crates/rig-gemini-grpc/src/streaming.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in GrpcAdapter::interpret_part at line 136. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-gemini-grpc/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-gemini-grpc/src/streaming.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e3d331243ebe9a0a78b4ecb044415fac15b438a18adbea51926e0cfcbb360c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-vertexai/src/types/completion_request.rs: crates/rig-vertexai/src/types/completion_request.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rig_vertexai::types::completion_request::vertex_generation_config at line 152. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-vertexai/src/types/completion_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-vertexai/src/types/completion_request.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b54c6f93478ce11783166bc94021ce4666fef36cadc397ea303ccba70cb9cec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-vertexai/src/types/message.rs: crates/rig-vertexai/src/types/message.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Content::try_from at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-vertexai/src/types/message.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \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-vertexai/src/types/message.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e970ceff3c9ca75d3cc107da69ab0fed0ab4d041b0fe67ca3e9afbf7900b938"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: test-support/rig-test-support/src/reasoning.rs: test-support/rig-test-support/src/reasoning.rs changed 17 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 868. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"675c80725f84a6ac71bce9cf5fc8c71912aeaf7a75b8119ccd9d1704b88639c5"}},{"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 20 in MockDecoder::event at line 273. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d7d590ccbacea7c3aa96fcd21be890b84ea883299e83598a51685f8fa121a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-cassette/src/ecs/delivery.rs: crates/rig-cassette/src/ecs/delivery.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in rig_cassette::ecs::delivery::collect_replayed at line 378. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-cassette/src/ecs/delivery.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \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/ecs/delivery.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"78807ddc46e5d35730276bcce4a255d42163930b0f4ca7a7d6e5d0ed77567e33"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-agent/src/run/prepare.rs: crates/rig-agent/src/run/prepare.rs changed 9 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 113. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcbc68ef9f021242a8668520f2d51cea49de4e0e0e9e935ec3da2a4355e877d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-core/src/driver.rs: crates/rig-core/src/driver.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in rig_core::driver::read at line 312. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-core/src/driver.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-core/src/driver.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58301cbb97225eaede9ac32fb1cf076986ae7c013e43e14c49230447dcd5813"}},{"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 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in ChatDecoder::interpret_chunk at line 924. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"043300b996e50998e4ec54b90502806ae89f5165834c211b377d860e0162c801"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-ecs/src/bus/collect.rs: crates/rig-ecs/src/bus/collect.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in rig_ecs::bus::collect::collect_streams at line 104. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-ecs/src/bus/collect.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/bus/collect.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4df504908621e8a95d08c19026f3fbb765517a9d3e4eb6bcb8c7d9e4a99273a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: xtask/src/verify/selection.rs: xtask/src/verify/selection.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in xtask::verify::selection::plan at line 197. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- xtask/src/verify/selection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/selection.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"953f74a14a3681d89561fcb72984da0bb1b99638b076675101917cf1f0d64389"}},{"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 22 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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-agent/src/bus/driver.rs: crates/rig-agent/src/bus/driver.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in BusDriver::serve 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-agent/src/bus/driver.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-agent/src/bus/driver.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b1b19b5518ff39a8df5b339da9cd418896e00b8957353d023af796b5abd82f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-ecs/src/systems/stream_invalid.rs: crates/rig-ecs/src/systems/stream_invalid.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rig_ecs::systems::stream_invalid::discover_streamed_invalid_calls 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-ecs/src/systems/stream_invalid.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \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/systems/stream_invalid.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fed0f054c364aac9d990b5ddbdc03e0ddd2e58741dcd70173ae7cd65e36b66"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-ecs/src/checkpoint.rs: crates/rig-ecs/src/checkpoint.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rig_ecs::checkpoint::validate at line 431. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-ecs/src/checkpoint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \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/checkpoint.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"662e4791b4f81b9f73c786a043e00613dd5d36c3ded8f6ef6d37ffebe49ca591"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-ecs/src/bus/dispatch.rs: crates/rig-ecs/src/bus/dispatch.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in rig_ecs::bus::dispatch::dispatch 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-ecs/src/bus/dispatch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-ecs/src/bus/dispatch.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4814edfb5e5551289476cd9824ad4506cc5567dd87474b1f1952e47d3787447"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: xtask/src/verify/execute.rs: xtask/src/verify/execute.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in xtask::verify::execute::internal at line 41. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38e909a51b2bcfecc4edd33342c52d7a301730b3424a4e05fd81e965f9a6bbe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-agent/src/bus/dispatcher.rs: crates/rig-agent/src/bus/dispatcher.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in EffectStream::poll_next at line 1220. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-agent/src/bus/dispatcher.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \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/bus/dispatcher.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"0749d03e72b2bd9a81411456913e1f3395714344c1619eea50556702d26d4bd0"}},{"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 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in rig_test_support::history_survival::collect_slots at line 431. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \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":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"d696b7d162a21f63f0a69b714db54f4e5c1f781abd45898a1fa80e66167e0858"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rig-derive/src/tool/args.rs: crates/rig-derive/src/tool/args.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in MacroArgs::parse at line 99. 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-07-01..2026-09-29, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-01 07:44:24 \u002B00:00\u0027 --until=\u00272026-09-29 07:44:24 \u002B00:00\u0027 --full-history --no-merges -- crates/rig-derive/src/tool/args.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-derive/src/tool/args.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaa0592f2784237c0a226d6d5939e8c0d3d06a2d60c0b8fe4e0d96b8a56932f"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 66 significant file(s) lose their only recent owner: test-support/rig-test-support/src/support.rs, crates/rig-agent/src/run/mod.rs, crates/rig-agent/src/test_utils/model_conformance.rs, crates/rig-candle/src/model/tests.rs, test-support/rig-test-support/src/cache_conformance.rs, crates/rig-agent/src/agent/hook.rs, test-support/rig-test-support/src/reasoning.rs, crates/rig-candle/src/protocol.rs (\u002B58 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1a9476366df5063c1145db58832ed0e4b3fefd9c6f498a8c92273f8cbdcfcefa"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no project overview: The root README is a single banner linking to docs.rs, crates.io, Discord, and a warning but does not describe what Rig is or what it does. Write an overview paragraph explaining the project\u0027s purpose (LLM-powered applications with ergonomics/modularity) and its main features."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dbf18d06aa983c06246108610908ba99aae6784280b3aacd1a6655733d71be"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no project overview: The first paragraph is a dependency line (\u0027This crate allows you to use [fastembed-rs] with Rig\u0027) rather than an overview of what the project does or its scope. Replace the first sentence with a one-paragraph description stating what this crate provides and why it matters for Rig integration."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-fastembed/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ac2c039c8c06499899f255c330cfed0f6c5557d23c5208c40d00e91e42d3e6"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no installation or build instructions: The installation section is present but only describes adding the dependency; there are no build or setup instructions. Add a short \u0027How to build and run\u0027 block under the README, covering any necessary Cargo features or commands."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-fastembed/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f378751a39becb11ebde11e15babf0110300fe40e103ed3f17da56349c79cc"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no usage examples: The Usage section is present but only shows dependency lines; there are no runnable examples. Add a short usage example (e.g. the vector_search_fastembed.rs path) that runs and outputs something concrete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-fastembed/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1525c768e59ad5c69f0427409805f91ef2b81b1c88c874f9a5a46c679f57fe0"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no architecture or design documentation: The document set contains no architecture or design documentation, despite the presence of a single architecture/design doc in the summary. Add an architecture section describing how each integration (fastembed, gemini-grpc, helixdb) connects to Rig."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-fastembed/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"719fd7cb8437a5a328a7bb27cc8278fbbf596adaedad990eb92ad3b0b40fb28e"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no installation or build instructions: There are no installation, build, or setup instructions in the README. Add a short install section covering Cargo.toml dependencies and how to build/run the crate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-scylladb/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d566267aba904ab0cf2bd7a867f0ac8e279b7b8d5b9e114238aa207715151a10"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no usage examples: The code example is long but there are no standalone usage examples or a \u0027how to run it\u0027 instruction. Add one or two short runnable snippets showing the minimal invocation of the crate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-scylladb/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"643b08733e0de7c706f3b91dad2c15a632e20b84a92c0c7642a9b6b3083bb701"}},{"ruleId":"D26","level":"note","message":{"text":"Split crates/rig-core: The core provider bundle is huge and sprawls across 43 namespaces under providers/*, a classic grab-bag. Suggested: split providers into cohesive GPT/Anthropic/Cohere integration libraries"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ec9f9211823248c812bffd7965e3d7b3960160b95998f3e627880fe1381c0e0b"}},{"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"}}]},{"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"}}]},{"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":"f0f86999145e471049baf24f77fb2d8ec16a4d1cd2b28e3cd0c3694eb1f7c698"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb3240217c8ad900f03669bc6b2aa43134bbbd4adf51dae1bbd30fac0277e785"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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":"8d6eab37a8a4d9a4d97d2903db4c714cfaf71ca8acd8a974ca666f8e2c742215"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e4878d27aaa95c06af3f937edf4b8e466b863fc5324b3d9f96111dcd0c6d11d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee5706bf81af4c4faf80e038a3093c8debe0d746189d9c4dd823fce469a47552"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43db6868a1703c599704b08e8146eed6fff47cc5123bfa7d017d769fc9695078"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f265ea696c064c758c2ff732f0ad04d8dbcea09885534f9a2e61e065d046be4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8a5af0018150a3d8aa4753a9ebb58d800f6c0c7639fe1232a54f03d73a75591"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0d086c0f837c73869372f806ddff8d9e8ea6ece1e050ace261997e77682b002"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4e708dc5c1978f65fc221d001f3b9d5c9c3401fda005d546d60f787c68ebcad"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3b77b0f0ad6cfd42b1ae50ef97a8bded18fe82795f948ada58bc2bef76ece91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a16526d73ca62e1b45421d128cb8fe651ac640914df989a26a7a455c3d2e3485"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d49e2c096aff238dc2fde1550c2c4f417db75c03072b4897466eeac51ba1b9ef"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f28d1fe8fbdebb4cb412ff95cf8a513da53f6d4ebd8dbd94fd638f8d0ed5cea1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3023293e20d9333acec9c4ba12a70fd25c25ae46bbfcb546c2f1a7cd1d0630f0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9dcd37b83788c889964ebdf3ea4745ccabb149b1807cdc30dd62899cc4f8022a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6816a80fd56508782e42871a00afd58343d5b2e637599e9516505eb87efb4fc3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e63130a39810a099d6405ee2c58316eff265de7234feaf201ede5373a6df481"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffd46f99c0c24e2f9e5ce30c7933861f94e35be49eab8a4bf3542b903f69d32e"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8e9795d776a4539c873551dc3f7bfcee2aebc9bf0440a9f06503dbfb3a59c98"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f35d4ca7b0063aaa35b13c019a579a34e6e9a9029bc24b9563f193c9f8212d4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"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":"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":"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":"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":"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":"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":"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":"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":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"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":"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":"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":"3035e85b1a9c0c33df37dc333f490439b3fa52aefda24a401e2e75a177cdf778"},"properties":{"dependency":{"package":"rustls","version":"0.23.39","advisory":"RUSTSEC-2026-0285","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 476 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 and example/demo trees and test files identified by path convention, largest first; 476 of the 623 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-core/src/embeddings/embed.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":"D35","level":"warning","message":{"text":"Change-coupling hub: lib.rs \u2192 lib.rs, lib.rs, lib.rs, lib.rs, lib.rs: \u0060crates/rig-scylladb/src/lib.rs\u0060 changes together with 5 other files \u2014 \u0060crates/rig-lancedb/src/lib.rs\u0060, \u0060crates/rig-mongodb/src/lib.rs\u0060, \u0060crates/rig-postgres/src/lib.rs\u0060, \u0060crates/rig-sqlite/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 5 separate couplings, not 5 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 5."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-scylladb/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce8a3516fa049d4f5d234a1b284089f657ecd8563e93ee6e88e894861838768"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: streaming.rs \u2194 streaming.rs: \u0060crates/rig-bedrock/src/streaming.rs\u0060 and \u0060crates/rig-core/src/providers/cohere/streaming.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060f885c206\u0060 refactor(telemetry): centralize completion span lifecycle (#2115); \u00601d411185\u0060 refactor(rig-core): replace nanoid with fastrand for internal IDs (#1\u2026; \u0060ac5ac622\u0060 feat(tools): adds internal tool call id (breaking) (#1311) (at that commit the files were still \u0060rig-integrations/rig-bedrock/src/streaming.rs\u0060 and \u0060rig/rig-core/src/providers/cohere/streaming.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-bedrock/src/streaming.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa1cd39e8bb0d5707892ecedcd0e3bf164625b64ceec69f28d9f77a1b439b30"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: lib.rs \u2192 lib.rs, lib.rs, lib.rs: \u0060crates/rig-surrealdb/src/lib.rs\u0060 changes together with 3 other files \u2014 \u0060crates/rig-lancedb/src/lib.rs\u0060, \u0060crates/rig-mongodb/src/lib.rs\u0060, \u0060crates/rig-sqlite/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-surrealdb/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bdfcaddabec5c514f27a3fd0b34814a4edf81d8d35499de52dad5ae86f628c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: lib.rs \u2192 lib.rs, lib.rs, lib.rs: \u0060crates/rig-postgres/src/lib.rs\u0060 changes together with 3 other files \u2014 \u0060crates/rig-lancedb/src/lib.rs\u0060, \u0060crates/rig-mongodb/src/lib.rs\u0060, \u0060crates/rig-sqlite/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-postgres/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8526333d6cdc697417e0efaf7f0e6d6dffc9afbbe353226b50d0043cb32024ae"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: streaming.rs \u2194 streaming.rs: \u0060crates/rig-bedrock/src/streaming.rs\u0060 and \u0060crates/rig-core/src/providers/anthropic/streaming.rs\u0060 change together 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060f885c206\u0060 refactor(telemetry): centralize completion span lifecycle (#2115); \u00601d411185\u0060 refactor(rig-core): replace nanoid with fastrand for internal IDs (#1\u2026; \u0060019b551f\u0060 refactor: typed reasoning content model (#1395) (at that commit the files were still \u0060rig-integrations/rig-bedrock/src/streaming.rs\u0060 and \u0060rig/rig-core/src/providers/anthropic/streaming.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rig-bedrock/src/streaming.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"355248568167b9f073540bf92d98e32932a4a5a9f97bc2e0a177eb9c654e2dfa"}},{"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 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \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":"D44","level":"warning","message":{"text":"End-of-life runtime: Rust 1.95: rust-toolchain.toml declares Rust 1.95 as this project\u0027s toolchain file, and Rust 1.95, superseded by 1.96 on 2026-05-28 (the Rust project patches only the current stable). An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2026-05-28 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":[],"partialFingerprints":{"codehealthFindingId/v1":"dde701f9c40b0b8cb202babf3f8d8da48dda44162595030f1b0a8f7d57710684"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 12/13 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060xtask\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"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. 8 of the 8 files that make outbound calls are unbounded; the first 8 are listed."},"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":328}}}],"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":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"94080ef3883a28334a818c89626c503939ee911b6bcf9d195b9fd48667e8370c"}},{"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-helixdb/src/lib.rs"},"region":{"startLine":30}}}],"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":104}}}],"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":64}}}],"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: \u0060urllib.request.urlopen(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-dependency-floors.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9209a6a480eec4c28c30b501a2a081a395a4d0c84df47ed5f27269098ab35c3d"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"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":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":41,"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."]}]}